Dynamic Threshold Detection Based on Pearson Distance Detection

Dynamic Threshold Detection Based on Pearson Distance Detection

Schouhamer Immink, Kees A. (Turing Machines Inc.)
Cai, Kui (Singapore University of Technology and Design)
Weber, J.H. (TU Delft Discrete Mathematics and Optimization)

2018-07

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 of the received signal. We derive simple rules for dynamically estimating the unknown scale (gain) and offset. The estimates of the actual gain and offset so obtained are used to adjust the threshold levels or to re-scale the received signal within its regular range. Then, the re-scaled signal, brought into its standard range, can be forwarded to the final detection/decoding system, where optimum use can be made of the distance properties of the code by applying, for example, the Chase algorithm. A worked example of a spin-torque transfer magnetic random access memory (STT-MRAM) with an application to an extended (72, 64) Hamming code is described, where the retrieved signal is perturbed by additive Gaussian noise and unknown gain or offset.

channel mismatch
Constrained coding
Detectors
Encoding
Euclidean distance
Logic gates
nonvolatile memories
Nonvolatile memory
Pearson code
Pearson distance
Reliability
Resistance
storage systems

http://resolver.tudelft.nl/uuid:e68ef36c-e985-4972-89b6-7825c094d934

https://doi.org/10.1109/TCOMM.2018.2814618

0090-6778

IEEE Transactions on Communications, 66 (7), 2958 - 2965

Accepted Author Manuscript

Institutional Repository

journal article

© 2018 Kees A. Schouhamer Immink, Kui Cai, J.H. Weber