A Deliberate Bit Flipping Coding Scheme for Data-Dependent Two-Dimensional Channels

Mohsen Bahrami, Bane Vasic

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, we present a deliberate bit flipping (DBF) coding scheme for binary two-dimensional (2-D) channels, where specific patterns in channel inputs are the significant cause of errors. The idea is to eliminate a constrained encoder and, instead, embed a constraint into an error correction codeword that is arranged into a 2-D array by deliberately flipping the bits that violate the constraint. The DBF method relies on the error correction capability of the code being used so that it should be able to correct both deliberate errors and channel errors. Therefore, it is crucial to flip minimum number of bits in order not to overburden the error correction decoder. We devise a constrained combinatorial formulation for minimizing the number of flipped bits for a given set of harmful patterns. The generalized belief propagation algorithm is used to find an approximate solution for the problem. We evaluate the performance gain of our proposed approach on a data-dependent 2-D channel, where 2-D isolated-bits patterns are the harmful patterns for the channel. Furthermore, the performance of the DBF method is compared with classical 2-D constrained coding schemes for the 2-D no isolated-bits constraint on a memoryless binary symmetric channel.

Original languageEnglish (US)
Article number8918414
Pages (from-to)752-764
Number of pages13
JournalIEEE Transactions on Communications
Volume68
Issue number2
DOIs
StatePublished - Feb 2020

Keywords

  • Data dependent channels
  • constrained coding
  • generalized belief propagation (GBP)
  • graphical models
  • probabilistic inference

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A Deliberate Bit Flipping Coding Scheme for Data-Dependent Two-Dimensional Channels'. Together they form a unique fingerprint.

Cite this