Abstract
In this letter, we propose a layered decoding algorithm for protograph-based low-density parity-check Hadamard codes (PLDPC-HCs), which have been shown to be ultimate-Shannon-limit approaching. Compared with the standard decoding algorithm, the layered decoding algorithm improves the convergence rate by about two times. At a bit error rate of 2.0\times 10^{-5} , the layered decoder using 20 decoding iterations shows a very small degradation of 0.03 dB compared with the standard decoder using 40 decoding iterations. Moreover, the layered decoder using 21 decoding iterations shows the same error performance as the standard decoder using 41 decoding iterations.
Original language | English |
---|---|
Article number | 9349523 |
Pages (from-to) | 1776-1780 |
Number of pages | 5 |
Journal | IEEE Communications Letters |
Volume | 25 |
Issue number | 6 |
DOIs | |
Publication status | Published - Jun 2021 |
Keywords
- Convergence rate
- layered decoding
- protograph-based LDPC-Hadamard codes
- ultimate Shannon limit
ASJC Scopus subject areas
- Modelling and Simulation
- Computer Science Applications
- Electrical and Electronic Engineering