Refined Reliability Combining for Binary Message Passing Decoding of Product Codes
Artikel i vetenskaplig tidskrift, 2021

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.

quantization errors

product codes

Product codes

Iterative decoding

high speed communications

Binary message passing

Message passing

hard decision decoding

Reliability

Throughput

complexity

Decoding

bounded distance decoding

Encoding

Författare

Alireza Sheikh

IMEC

Alexandre Graell I Amat

Chalmers, Elektroteknik, Kommunikations- och antennsystem, Kommunikationssystem

G. Liva

Deutsches Zentrums für Luft- und Raumfahrt (DLR)

A. Alvarado

Technische Universiteit Eindhoven

Journal of Lightwave Technology

0733-8724 (ISSN)

Vol. 39 15 4958-4973

Ämneskategorier

Telekommunikation

Kommunikationssystem

Signalbehandling

DOI

10.1109/JLT.2021.3081586

Mer information

Senast uppdaterat

2021-08-07