TY - GEN
T1 - Constraint satisfaction through GBP-guided deliberate bit flipping
AU - Bahrami, Mohsen
AU - Vasić, Bane
N1 - Funding Information:
This work is funded by the NSF under grants ECCS-1500170 and SaTC-1813401. A comprehensive version of this paper has been submitted to IEEE Transactions on Communications [26].
Funding Information:
Acknowledgment. This work is funded by the NSF under grants ECCS-1500170 and SaTC-1813401. A comprehensive version of this paper has been submitted to IEEE Transactions on Communications [26].
Publisher Copyright:
© Springer Nature Switzerland AG 2019.
PY - 2019
Y1 - 2019
N2 - In this paper, we consider the problem of transmitting binary messages over data-dependent two-dimensional channels. We propose a deliberate bit flipping coding scheme that removes channel harmful configurations prior to transmission. In this method, user messages are encoded with an error correction code, and therefore the number of bit flips should be kept small not to overburden the decoder. We formulate the problem of minimizing the number of bit flips as a binary constraint satisfaction problem, and devise a generalized belief propagation guided method to find approximate solutions. Applied to a data-dependent binary channel with the set of 2-D isolated bit configurations as its harmful configurations, we evaluated the performance of our proposed method in terms of uncorrectable bit-error rate.
AB - In this paper, we consider the problem of transmitting binary messages over data-dependent two-dimensional channels. We propose a deliberate bit flipping coding scheme that removes channel harmful configurations prior to transmission. In this method, user messages are encoded with an error correction code, and therefore the number of bit flips should be kept small not to overburden the decoder. We formulate the problem of minimizing the number of bit flips as a binary constraint satisfaction problem, and devise a generalized belief propagation guided method to find approximate solutions. Applied to a data-dependent binary channel with the set of 2-D isolated bit configurations as its harmful configurations, we evaluated the performance of our proposed method in terms of uncorrectable bit-error rate.
KW - Generalized belief propagation
KW - Graphical models
KW - Probabilistic inference
UR - http://www.scopus.com/inward/record.url?scp=85068227670&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85068227670&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-21363-3_3
DO - 10.1007/978-3-030-21363-3_3
M3 - Conference contribution
AN - SCOPUS:85068227670
SN - 9783030213626
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 26
EP - 37
BT - Algebraic Informatics - 8th International Conference, CAI 2019, Proceedings
A2 - Ćirić, Miroslav
A2 - Droste, Manfred
A2 - Pin, Jean-Éric
PB - Springer-Verlag
T2 - 8th International Conference on Algebraic Informatics, CAI 2019
Y2 - 30 June 2019 through 4 July 2019
ER -