# Minimum Pearson Distance Detection for Multilevel Channels With Gain and/or Offset Mismatch

@article{SchouhamerImmink2014MinimumPD, title={Minimum Pearson Distance Detection for Multilevel Channels With Gain and/or Offset Mismatch}, author={Kees A. Schouhamer Immink and Jos H. Weber}, journal={IEEE Transactions on Information Theory}, year={2014}, volume={60}, pages={5966-5974} }

The performance of certain transmission and storage channels, such as optical data storage and nonvolatile memory (flash), is seriously hampered by the phenomena of unknown offset (drift) or gain. [...] Key Method MPD detection is used in conjunction with T-constrained codes that consist of q-ary codewords, where in each codeword T reference symbols appear at least once. Expand

## 52 Citations

Dynamic Threshold Detection Based on Pearson Distance Detection

- Computer ScienceIEEE Transactions on Communications
- 2018

We consider the transmission and storage of encoded strings of symbols over a noisy channel, where dynamic threshold detection is proposed for achieving resilience against unknown scaling and offset…

Minimum pearson distance detection in the presence of unknown slowly varying offset

- Mathematics, Computer Science2016 IEEE International Symposium on Information Theory (ISIT)
- 2016

The properties of the codewords of S are studied, the size of S is computed, and its redundancy for asymptotically large values of thecodeword length n is derived.

Hybrid Minimum Pearson and Euclidean Distance Detection

- Mathematics, Computer ScienceIEEE Transactions on Communications
- 2015

A novel hybrid detection method is presented, where the outputs of the minimum Euclidean distance and Pearson distance detectors are combined so that one may trade detection robustness versus noise margin at nominal channel conditions.

Minimum Pearson Distance Detection Using Mass-Centered Codewords in the Presence of Unknown Varying Offset

- Mathematics, Computer ScienceIEEE Journal on Selected Areas in Communications
- 2016

We consider the transmission and storage of data that use coded binary symbols over a channel, where a Pearson distance-based detector is used for achieving resilience against additive noise, unknown…

Maximum Likelihood Decoding for Channels with Uniform Noise and Offset

- Mathematics
- 2018

In storage and communication systems, noise is not the only disturbance during data transmission. Sometimes the error performance can also be seriously degraded by offset and/or gain mismatch. This…

Binary Block Codes for Noisy Channels With Unknown Offset

- Computer ScienceIEEE Transactions on Communications
- 2020

Adapted versions of classical binary block codes, such as cosets of linear codes, (unions of) constant weight codes, and unordered codes are proposed and it is shown that considerable performance improvements can be achieved, particularly when the offset is large compared to the noise.

Maximum Likelihood Decoding for Multi-Level Cell Memories with Scaling and Offset Mismatch

- Computer ScienceICC 2019 - 2019 IEEE International Conference on Communications (ICC)
- 2019

This work considers a multi-level cell channel model such that the retrieved data is not only corrupted by Gaussian noise, but hampered by scaling and offset mismatch as well, and derives maximum likelihood decoding methods for such channels.

Dynamic Threshold Detection Based on Pearson Distance Detection

- 2018

We consider the transmission and storage of encoded strings of symbols over a noisy channel, where dynamic threshold detection is proposed for achieving resilience against unknown scaling and offset…

Detection in the presence of additive noise and unknown offset

- Computer Science2015 IEEE International Conference on Communications (ICC)
- 2015

A hybrid detection method is presented, where the distance measure is a weighted sum of the Euclidean and Pearson distance, so that the system designer may trade noise margin versus amount of immunity to unknown offset.

Maximum Likelihood Decoding for Channels With Gaussian Noise and Signal Dependent Offset

- Computer Science, MathematicsIEEE Transactions on Communications
- 2021

A brief performance analysis is provided, confirming the superiority of the newly developed ML decoder over classical decoders based on the Euclidean or Pearson distances.

## References

SHOWING 1-10 OF 21 REFERENCES

Coding schemes for multi-level Flash memories that are intrinsically resistant against unknown gain and/or offset using reference symbols

- Computer Science
- 2014

The results of the computer simulations show the performance of the new coding and detection methods in the presence of additive noise.

Coding schemes for multi-level channels with unknown gain and/or offset

- Computer Science2013 IEEE International Symposium on Information Theory
- 2013

It will be shown that a codebook of length-n q-ary codeword, S, where all codewords in S have equal balance and energy show an intrinsic resistance against unknown gain and/or offset.

Permutation modulation

- Mathematics
- 1965

A class of codes and decoders is described for transmitting digital information by means of bandlimited signals in the presence of additive white Gaussiau noise. The system, called permutation…

High-Rate Maximum Runlength Constrained Coding Schemes Using Nibble Replacement

- Computer ScienceIEEE Transactions on Information Theory
- 2012

This paper presents simple and systematic constructions of high-rate binary maximum runlength constrained codes for the character-constrained channel, and compares the error propagation performance of codes based on the new construction with that of prior art codes.

Invited paper Principles of digital line coding

- Computer Science
- 1983

The nature and role of various constraints on code words and word sequences, including those commonly used on metallic lines, optical fibres, carrier channels and radio links are discussed, and some examples from each of these applications are given.

Dynamic Threshold Schemes for Multi-Level Non-Volatile Memories

- Computer ScienceIEEE Transactions on Communications
- 2013

This paper provides a general scheme to compute and apply dynamic thresholds and derive performance bounds and develops limited-magnitude error-correcting codes tailored to take advantage of dynamic thresholds.

Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference

- Mathematics, Computer ScienceIEEE Trans. Inf. Theory
- 1972

A maximum-likelihood sequence estimator for a digital pulse-amplitude-modulated sequence in the presence of finite intersymbol interference and white Gaussian noise is developed and performance is shown that performance is effectively as good as could be attained by any receiver structure.

Error-correcting schemes with dynamic thresholds in nonvolatile memories

- Computer Science2011 IEEE International Symposium on Information Theory Proceedings
- 2011

Analysis based on Gaussian noise models reveals that bit error probabilities can be significantly reduced by using dynamic thresholds instead of fixed thresholds, hence leading to a higher information rate.

Rank modulation for flash memories

- Computer Science2008 IEEE International Symposium on Information Theory
- 2008

We explore a novel data representation scheme for multi-level flash memory cells, in which a set of n cells stores information in the permutation induced by the different charge levels of the…

On constant composition codes

- Computer Science, MathematicsDiscret. Appl. Math.
- 2006

Direct and recursive methods are developed for the construction of constant composition codes over a k-ary alphabet, which arise in powerline communication and balanced scheduling.