Dynamic Threshold Detection Based on Pearson Distance Detection

Kees A. Schouhamer Immink, Kui Cai, Jos H. Weber

Research output: Contribution to journalArticleScientificpeer-review

10 Citations (Scopus)
41 Downloads (Pure)

Abstract

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.

Original languageEnglish
Pages (from-to)2958 - 2965
Number of pages8
JournalIEEE Transactions on Communications
Volume66
Issue number7
DOIs
Publication statusPublished - Jul 2018

Bibliographical note

Accepted Author Manuscript

Keywords

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

Fingerprint

Dive into the research topics of 'Dynamic Threshold Detection Based on Pearson Distance Detection'. Together they form a unique fingerprint.

Cite this