Refined Reliability Combining for Binary Message Passing Decoding of Product Codes
Uložené v:
| Názov: | Refined Reliability Combining for Binary Message Passing Decoding of Product Codes |
|---|---|
| Autori: | Sheikh, Alireza, 1989, Graell I Amat, Alexandre, 1976, Liva, G., Alvarado, A. |
| Zdroj: | Journal of Lightwave Technology. 39(15):4958-4973 |
| Predmety: | product codes, Reliability, Product codes, complexity, Message passing, quantization errors, Decoding, bounded distance decoding, Binary message passing, Throughput, hard decision decoding, high speed communications, Iterative decoding, Encoding |
| Popis: | 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. |
| Prístupová URL adresa: | https://research.chalmers.se/publication/524426 https://research.chalmers.se/publication/524260 |
| Databáza: | SwePub |
Full Text Finder 
Nájsť tento článok vo Web of Science | Abstrakt: | 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. |
|---|---|
| ISSN: | 07338724 15582213 |
| DOI: | 10.1109/JLT.2021.3081586 |