Binary Block Codes for Noisy Channels with Unknown Offset

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

Research output: Contribution to journalArticleScientificpeer-review

3 Downloads (Pure)

Abstract

Decoders minimizing the Euclidean distance between the received word and the candidate codewords are known to be optimal for channels suffering from Gaussian noise. However, when the stored or transmitted signals are also corrupted by an unknown offset, other decoders may perform better. In particular, applying the Euclidean distance on normalized words makes the decoding result independent of the offset. The use of this distance measure calls for alternative code design criteria in order to get good performance in the presence of both noise and offset. In this context, various adapted versions of classical binary block codes are proposed, such as (i) cosets of linear codes, (ii) (unions of) constant weight codes, and (iii) unordered codes. It is shown that considerable performance improvements can be achieved, particularly when the offset is large compared to the noise.

Original languageEnglish
Article number9058711
Pages (from-to)3975-3983
Number of pages9
JournalIEEE Transactions on Communications
Volume68
Issue number7
DOIs
Publication statusPublished - Jul 2020

Keywords

  • Binary block codes
  • decoding criteria
  • noise
  • offset
  • performance evaluation

Fingerprint Dive into the research topics of 'Binary Block Codes for Noisy Channels with Unknown Offset'. Together they form a unique fingerprint.

  • Cite this