A Deliberate Bit Flipping Coding Scheme for Data-Dependent Two-Dimensional Channels
Name:
FINAL VERSION TCOM Mohsen.pdf
Size:
646.1Kb
Format:
PDF
Description:
Final Accepted Manuscript
Affiliation
Univ Arizona, Dept Elect & Comp EngnIssue Date
2020-02Keywords
Error correction codesChannel coding
Decoding
Two dimensional displays
Belief propagation
Magnetic recording
Data dependent channels
constrained coding
probabilistic inference
graphical models
generalized belief propagation (GBP)
Metadata
Show full item recordCitation
Bahrami, M., & Vasić, B. (2019). A deliberate bit flipping coding scheme for data-dependent two-dimensional channels. IEEE Transactions on Communications.Rights
© 2019 IEEE.Collection Information
This item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at repository@u.library.arizona.edu.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.ISSN
0090-6778EISSN
1558-0857Version
Final accepted manuscriptSponsors
National Science Foundation of Sri Lankaae974a485f413a2113503eed53cd6c53
10.1109/tcomm.2019.2957086