Generalized belief propagation based deliberate bit flipping modulation coding

Mohsen Bahrami, Bane Vasic

Research output: ResearchConference contribution

Abstract

We propose a novel approach to modulation coding using the Generalized Belief Propagation (GBP) algorithm. The idea is to completely eliminate a constrained encoder and, instead, embed a constraint into an error correction codeword by deliberately flipping the bits that violate the constraint. The GBP algorithm is used to keep the number of flipped bits small in order not to overburden the decoder. We incorporate our method to impose the two-dimensional (2D) no isolated bit constraint on a low-density parity check (LDPC) coded 2D data array. Furthermore, we show that the number of flipped bits can be optimized so that it is not beyond the error correcting capability of the code. Applied to Two Dimensional Magnetic Recording (TDMR) systems, our approach results in an order of magnitude gain in the frame error rate.

LanguageEnglish (US)
Title of host publication2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781509013289
DOIs
StatePublished - Feb 2 2017
Event59th IEEE Global Communications Conference, GLOBECOM 2016 - Washington, United States
Duration: Dec 4 2016Dec 8 2016

Other

Other59th IEEE Global Communications Conference, GLOBECOM 2016
CountryUnited States
CityWashington
Period12/4/1612/8/16

Fingerprint

Modulation
Magnetic recording
Error correction

Keywords

  • Constrained coding
  • Deliberate bit flipping
  • Generalized Belief Propagation
  • Low-density parity check codes
  • Two Dimensional Magnetic Recording

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Hardware and Architecture
  • Safety, Risk, Reliability and Quality

Cite this

Bahrami, M., & Vasic, B. (2017). Generalized belief propagation based deliberate bit flipping modulation coding. In 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings [7841858] Institute of Electrical and Electronics Engineers Inc.. DOI: 10.1109/GLOCOM.2016.7841858

Generalized belief propagation based deliberate bit flipping modulation coding. / Bahrami, Mohsen; Vasic, Bane.

2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2017. 7841858.

Research output: ResearchConference contribution

Bahrami, M & Vasic, B 2017, Generalized belief propagation based deliberate bit flipping modulation coding. in 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings., 7841858, Institute of Electrical and Electronics Engineers Inc., 59th IEEE Global Communications Conference, GLOBECOM 2016, Washington, United States, 12/4/16. DOI: 10.1109/GLOCOM.2016.7841858
Bahrami M, Vasic B. Generalized belief propagation based deliberate bit flipping modulation coding. In 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings. Institute of Electrical and Electronics Engineers Inc.2017. 7841858. Available from, DOI: 10.1109/GLOCOM.2016.7841858
Bahrami, Mohsen ; Vasic, Bane. / Generalized belief propagation based deliberate bit flipping modulation coding. 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2017.
@inbook{5396849251c1432e80882c7bd7f859d2,
title = "Generalized belief propagation based deliberate bit flipping modulation coding",
abstract = "We propose a novel approach to modulation coding using the Generalized Belief Propagation (GBP) algorithm. The idea is to completely eliminate a constrained encoder and, instead, embed a constraint into an error correction codeword by deliberately flipping the bits that violate the constraint. The GBP algorithm is used to keep the number of flipped bits small in order not to overburden the decoder. We incorporate our method to impose the two-dimensional (2D) no isolated bit constraint on a low-density parity check (LDPC) coded 2D data array. Furthermore, we show that the number of flipped bits can be optimized so that it is not beyond the error correcting capability of the code. Applied to Two Dimensional Magnetic Recording (TDMR) systems, our approach results in an order of magnitude gain in the frame error rate.",
keywords = "Constrained coding, Deliberate bit flipping, Generalized Belief Propagation, Low-density parity check codes, Two Dimensional Magnetic Recording",
author = "Mohsen Bahrami and Bane Vasic",
year = "2017",
month = "2",
doi = "10.1109/GLOCOM.2016.7841858",
booktitle = "2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - CHAP

T1 - Generalized belief propagation based deliberate bit flipping modulation coding

AU - Bahrami,Mohsen

AU - Vasic,Bane

PY - 2017/2/2

Y1 - 2017/2/2

N2 - We propose a novel approach to modulation coding using the Generalized Belief Propagation (GBP) algorithm. The idea is to completely eliminate a constrained encoder and, instead, embed a constraint into an error correction codeword by deliberately flipping the bits that violate the constraint. The GBP algorithm is used to keep the number of flipped bits small in order not to overburden the decoder. We incorporate our method to impose the two-dimensional (2D) no isolated bit constraint on a low-density parity check (LDPC) coded 2D data array. Furthermore, we show that the number of flipped bits can be optimized so that it is not beyond the error correcting capability of the code. Applied to Two Dimensional Magnetic Recording (TDMR) systems, our approach results in an order of magnitude gain in the frame error rate.

AB - We propose a novel approach to modulation coding using the Generalized Belief Propagation (GBP) algorithm. The idea is to completely eliminate a constrained encoder and, instead, embed a constraint into an error correction codeword by deliberately flipping the bits that violate the constraint. The GBP algorithm is used to keep the number of flipped bits small in order not to overburden the decoder. We incorporate our method to impose the two-dimensional (2D) no isolated bit constraint on a low-density parity check (LDPC) coded 2D data array. Furthermore, we show that the number of flipped bits can be optimized so that it is not beyond the error correcting capability of the code. Applied to Two Dimensional Magnetic Recording (TDMR) systems, our approach results in an order of magnitude gain in the frame error rate.

KW - Constrained coding

KW - Deliberate bit flipping

KW - Generalized Belief Propagation

KW - Low-density parity check codes

KW - Two Dimensional Magnetic Recording

UR - http://www.scopus.com/inward/record.url?scp=85015432540&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85015432540&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2016.7841858

DO - 10.1109/GLOCOM.2016.7841858

M3 - Conference contribution

BT - 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -