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

doi:10.1109/TCOMM.2019.2957086

2020-02-01

Bane Vasić

DOI：10.1109/TCOMM.2019.2957086

原文链接

查看原文

摘要

En 中文

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.

Keyword:

Error correction codes

Channel coding

Decoding

Two dimensional displays

Belief propagation

Magnetic recording

Data dependent channels

constrained coding

probabilistic inference

graphical models

generalized belief propagation (GBP)