Work

Low-Complexity Detection for Balanced Codes in AWGN Channels With Offset

Year: 2026

Type: article

Abstract: Low-complexity detection schemes are studied for additive white Gaussian noise channels with an unknown and unbounded offset constant over each memory read. Detectors based on the Pearson distance are analyzed, and a new lower bound on the word error rate of Modified Pearson (MP) detection is derived. Three novel detectors are proposed: the Simplified Pearson (SP), the Ultra-Simplified Pearson (USP), and the Adjusted-Threshold (AT) detectors. The USP and AT detectors are designed to be robust against destructive readings. The proposed schemes are particularly suited for memory systems employing ramp-reading architectures. The analysis demonstrates that the proposed detectors achieve competitive error-rate performance with significantly reduced complexity compared to MP detection.

Source: IEEE Transactions on Communications

DOI: 10.1109/tcomm.2026.3658386

Authors: Antonino Favano, Luca Barletta, Marco Sforzin, Paolo Amato, Marco Ferrari

Institutions: Politecnico di Milano, Micron (Italy), National Research Council

Language: English

Topic: Error Correcting Code Techniques

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,645

OpenAlex ID: W7125982767

FWCI:

Cites:

Cited by:

Related to: