Refined Reliability Combining for Binary Message Passing Decoding of Product Codes

Alireza Sheikh; Alexandre Graell I Amat; Gianluigi Liva; Alex Alvarado

doi:10.1109/JLT.2021.3081586

Refined Reliability Combining for Binary Message Passing Decoding of Product Codes

Alireza Sheikh (Corresponding author), Alexandre Graell I Amat, Gianluigi Liva, Alex Alvarado

Research output: Contribution to journal › Article › Academic › peer-review

17 Citations (SciVal)

1 Downloads (Pure)

Abstract

We propose a novel soft-aided iterative decoding algorithm for product codes (PCs). The proposed algorithm, named iterative bounded distance decoding with combined reliability (iBDD-CR), enhances the conventional iterative bounded distance decoding (iBDD) of PCs by exploiting some level of soft information. In particular, iBDD-CR can be seen as a modification of iBDD where the hard decisions of the row and column decoders are made based on a reliability estimate of the BDD outputs. The reliability estimates are derived by analyzing the extrinsic message passing of generalized low-density-parity check (GLDPC) ensembles, which encompass PCs. We perform a density evolution analysis of iBDD-CR for transmission over the additive white Gaussian noise channel for the GLDPC ensemble. We consider both binary transmission and bit-interleaved coded modulation with quadrature amplitude modulation. We show that iBDD-CR achieves performance gains up to 0.51 dB compared to iBDD with the same internal decoder data flow. This makes the algorithm an attractive solution for very high-throughput applications such as fiber-optic communications.

Original language	English
Article number	9435057
Pages (from-to)	4958-4973
Number of pages	16
Journal	Journal of Lightwave Technology
Volume	39
Issue number	15
DOIs	https://doi.org/10.1109/JLT.2021.3081586
Publication status	Published - 1 Aug 2021

Bibliographical note

Funding Information:
Manuscript received January 31, 2021; revised April 5, 2021; accepted April 27, 2021. Date of publication May 18, 2021; date of current version August 2, 2021. This work was supported by European Research Council (ERC) under the European Union’s Horizon 2020 Research and Innovation Programme under Grant 757791. (Corresponding author: Alireza Sheikh.) Alireza Sheikh is with Holst Centre, IMEC, 5656 AE Eindhoven, The Netherlands, and also with the Department of Electrical Engineering, Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands (e-mail: [email protected]).

Publisher Copyright:
© 1983-2012 IEEE.

Funding

Manuscript received January 31, 2021; revised April 5, 2021; accepted April 27, 2021. Date of publication May 18, 2021; date of current version August 2, 2021. This work was supported by European Research Council (ERC) under the European Union’s Horizon 2020 Research and Innovation Programme under Grant 757791. (Corresponding author: Alireza Sheikh.) Alireza Sheikh is with Holst Centre, IMEC, 5656 AE Eindhoven, The Netherlands, and also with the Department of Electrical Engineering, Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands (e-mail: [email protected]).

Keywords

Binary message passing
bounded distance decoding
complexity
hard decision decoding
high speed communications
product codes
quantization errors

Access to Document

10.1109/JLT.2021.3081586

Cite this

@article{f4817aba7ee84aa0a8fc2fb636d068a8,

title = "Refined Reliability Combining for Binary Message Passing Decoding of Product Codes",

abstract = "We propose a novel soft-aided iterative decoding algorithm for product codes (PCs). The proposed algorithm, named iterative bounded distance decoding with combined reliability (iBDD-CR), enhances the conventional iterative bounded distance decoding (iBDD) of PCs by exploiting some level of soft information. In particular, iBDD-CR can be seen as a modification of iBDD where the hard decisions of the row and column decoders are made based on a reliability estimate of the BDD outputs. The reliability estimates are derived by analyzing the extrinsic message passing of generalized low-density-parity check (GLDPC) ensembles, which encompass PCs. We perform a density evolution analysis of iBDD-CR for transmission over the additive white Gaussian noise channel for the GLDPC ensemble. We consider both binary transmission and bit-interleaved coded modulation with quadrature amplitude modulation. We show that iBDD-CR achieves performance gains up to 0.51 dB compared to iBDD with the same internal decoder data flow. This makes the algorithm an attractive solution for very high-throughput applications such as fiber-optic communications.",

keywords = "Binary message passing, bounded distance decoding, complexity, hard decision decoding, high speed communications, product codes, quantization errors",

author = "Alireza Sheikh and {Graell I Amat}, Alexandre and Gianluigi Liva and Alex Alvarado",

note = "Funding Information: Manuscript received January 31, 2021; revised April 5, 2021; accepted April 27, 2021. Date of publication May 18, 2021; date of current version August 2, 2021. This work was supported by European Research Council (ERC) under the European Union{\textquoteright}s Horizon 2020 Research and Innovation Programme under Grant 757791. (Corresponding author: Alireza Sheikh.) Alireza Sheikh is with Holst Centre, IMEC, 5656 AE Eindhoven, The Netherlands, and also with the Department of Electrical Engineering, Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands (e-mail: [email protected]). Publisher Copyright: {\textcopyright} 1983-2012 IEEE.",

year = "2021",

month = aug,

day = "1",

doi = "10.1109/JLT.2021.3081586",

language = "English",

volume = "39",

pages = "4958--4973",

journal = "Journal of Lightwave Technology",

issn = "0733-8724",

publisher = "Institute of Electrical and Electronics Engineers",

number = "15",

}

TY - JOUR

T1 - Refined Reliability Combining for Binary Message Passing Decoding of Product Codes

AU - Sheikh, Alireza

AU - Graell I Amat, Alexandre

AU - Liva, Gianluigi

AU - Alvarado, Alex

N1 - Funding Information: Manuscript received January 31, 2021; revised April 5, 2021; accepted April 27, 2021. Date of publication May 18, 2021; date of current version August 2, 2021. This work was supported by European Research Council (ERC) under the European Union’s Horizon 2020 Research and Innovation Programme under Grant 757791. (Corresponding author: Alireza Sheikh.) Alireza Sheikh is with Holst Centre, IMEC, 5656 AE Eindhoven, The Netherlands, and also with the Department of Electrical Engineering, Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands (e-mail: [email protected]). Publisher Copyright: © 1983-2012 IEEE.

PY - 2021/8/1

Y1 - 2021/8/1

N2 - We propose a novel soft-aided iterative decoding algorithm for product codes (PCs). The proposed algorithm, named iterative bounded distance decoding with combined reliability (iBDD-CR), enhances the conventional iterative bounded distance decoding (iBDD) of PCs by exploiting some level of soft information. In particular, iBDD-CR can be seen as a modification of iBDD where the hard decisions of the row and column decoders are made based on a reliability estimate of the BDD outputs. The reliability estimates are derived by analyzing the extrinsic message passing of generalized low-density-parity check (GLDPC) ensembles, which encompass PCs. We perform a density evolution analysis of iBDD-CR for transmission over the additive white Gaussian noise channel for the GLDPC ensemble. We consider both binary transmission and bit-interleaved coded modulation with quadrature amplitude modulation. We show that iBDD-CR achieves performance gains up to 0.51 dB compared to iBDD with the same internal decoder data flow. This makes the algorithm an attractive solution for very high-throughput applications such as fiber-optic communications.

AB - We propose a novel soft-aided iterative decoding algorithm for product codes (PCs). The proposed algorithm, named iterative bounded distance decoding with combined reliability (iBDD-CR), enhances the conventional iterative bounded distance decoding (iBDD) of PCs by exploiting some level of soft information. In particular, iBDD-CR can be seen as a modification of iBDD where the hard decisions of the row and column decoders are made based on a reliability estimate of the BDD outputs. The reliability estimates are derived by analyzing the extrinsic message passing of generalized low-density-parity check (GLDPC) ensembles, which encompass PCs. We perform a density evolution analysis of iBDD-CR for transmission over the additive white Gaussian noise channel for the GLDPC ensemble. We consider both binary transmission and bit-interleaved coded modulation with quadrature amplitude modulation. We show that iBDD-CR achieves performance gains up to 0.51 dB compared to iBDD with the same internal decoder data flow. This makes the algorithm an attractive solution for very high-throughput applications such as fiber-optic communications.

KW - Binary message passing

KW - bounded distance decoding

KW - complexity

KW - hard decision decoding

KW - high speed communications

KW - product codes

KW - quantization errors

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

U2 - 10.1109/JLT.2021.3081586

DO - 10.1109/JLT.2021.3081586

M3 - Article

AN - SCOPUS:85107192375

SN - 0733-8724

VL - 39

SP - 4958

EP - 4973

JO - Journal of Lightwave Technology

JF - Journal of Lightwave Technology

IS - 15

M1 - 9435057

ER -

Refined Reliability Combining for Binary Message Passing Decoding of Product Codes

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

FUN-NOTCH: Fundamentals of the Nonlinear Optical Channel

Cite this

Refined Reliability Combining for Binary Message Passing Decoding of Product Codes

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Projects

FUN-NOTCH: Fundamentals of the Nonlinear Optical Channel

Cite this