A new detection method for noisy channels with time-varying offset

Journal article (2022)

Authors

Kees A. Schouhamer Immink Turing Machines Inc.
J.H. Weber Discrete Mathematics and Optimization - EEMCS
Research Group
Discrete Mathematics and Optimization (EEMCS) (TU Delft)
Copyright: © 2022 Kees A. Schouhamer Immink, J.H. Weber
DOI: https://doi.org/10.1109/TIT.2022.3140613
Redundancy Codes Minimization Pearson distance Pearson code Noise measurement Channel mismatch Nonvolatile memory Constrained code Error analysis Signal to noise ratio Slew rate Varying offset
More Info
expand_more

Published Date

2022

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Delft Institute of Applied Mathematics

Research Group

Discrete Mathematics and Optimization

Abstract

We consider noisy communications and storage systems that are hampered by varying offset of unknown magnitude such as low-frequency signals of unknown amplitude added to the sent signal. We study and analyze a new detection method whose error performance is independent of both unknown base offset and offset's slew rate. The new method requires, for a codeword length n ≥ 12, less than 1.5 dB more noise margin than Euclidean distance detection. The relationship with constrained codes based on mass-centered codewords and the new detection method is discussed.