Generalized Belief Propagation Based Deliberate Bit Flipping Modulation Coding

Bahrami, Mohsen; Vasić, Bane

doi:10.1109/glocom.2016.7841858

Cited by 2 publications

(3 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Nevertheless, all the methods (including the DBF method with the BCH code) are designed to have the same overall coding rate. As another comparison, we used a column-weight 4 quasi cyclic LDPC code over two-dimensional magnetic recording channels for removing harmful patterns in our earlier work [1], where an order of magnitude gain in the frame-error-rate was obtained for Voronoi based 2-D magnetic recording channels with low magnetic grain densities.…”

Section: Comparison Results On Bscmentioning

confidence: 99%

“…We assume that the color of each bit contained in a harmful configuration is inverted with the probability 0 < λ ≤ 1. For every bit 1] over the bits…”

Section: A Probabilistic Graphical Formultion For Minimzing Bit Flipsmentioning

confidence: 99%

“…This work is supported by the National Science Foundation under grants ECCS-1500170 and SaTC-1813401. Parts of this paper were presented in IEEE GLOBECOM conference 2016 [1] and 8th International Conference on Algebraic Informatics (CAI 2019) [2].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

Bahrami

Vasić

2020

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

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. Index Terms-Data dependent channels, constrained coding, probabilistic inference, graphical models, and generalized belief propagation (GBP).

show abstract

Section: Comparison Results On Bscmentioning

confidence: 99%

“…We assume that the color of each bit contained in a harmful configuration is inverted with the probability 0 < λ ≤ 1. For every bit 1] over the bits…”

Section: A Probabilistic Graphical Formultion For Minimzing Bit Flipsmentioning

confidence: 99%