Constraint Satisfaction Through GBP-Guided Deliberate Bit Flipping

Bahrami, Mohsen; Vasić, Bane

doi:10.1007/978-3-030-21363-3_3

Algebraic Informatics

2019

DOI: 10.1007/978-3-030-21363-3_3

|View full text |Cite

Constraint Satisfaction Through GBP-Guided Deliberate Bit Flipping

Mohsen Bahrami

Bane Vasić

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

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

Bahrami

Vasić

2020

IEEE Trans. Commun.

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

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

Bahrami

Vasić

2020

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Constraint Satisfaction Through GBP-Guided Deliberate Bit Flipping

Cited by 1 publication

References 20 publications

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

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

Contact Info

Product

Resources

About