Layered Decoding for Protograph-Based Low-Density Parity-Check Hadamard Codes

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.

[1]  H. Jin,et al.  Irregular repeat accumulate codes , 2000 .

[2]  Stephan ten Brink,et al.  Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..

[3]  Huan Huan Xu,et al.  CRC-aided Iterative Decoding of Turbo-hadamard Codes , 2018, 2018 IEEE 4th International Conference on Computer and Communications (ICCC).

[4]  Dariush Divsalar,et al.  Coding theorems for 'turbo-like' codes , 1998 .

[5]  Michael Lentmaier,et al.  On generalized low-density parity-check codes based on Hamming component codes , 1999, IEEE Communications Letters.

[6]  J. Boutros,et al.  Generalized low density (Tanner) codes , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[7]  Chiu-Wing Sham,et al.  An Ultimate-Shannon-Limit-Approaching Gbps Throughput Encoder/Decoder System , 2020, IEEE Transactions on Circuits and Systems II: Express Briefs.

[8]  Sandro Bellini,et al.  Safe Early Stopping for Layered LDPC Decoding , 2015, IEEE Communications Letters.

[9]  R. Michael Buehrer.  Code Division Multiple Access (CDMA) , 2006, Code Division Multiple Access.

[10]  Marc P. C. Fossorier,et al.  Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices , 2004, IEEE Trans. Inf. Theory.

[11]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[12]  Francis C. M. Lau,et al.  Hardware Design of Concatenated Zigzag Hadamard Encoder/Decoder System With High Throughput , 2020, IEEE Access.

[13]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[14]  Alain Glavieux,et al.  Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes" , 1998 .

[15]  Steven W. McLaughlin,et al.  Layered BP Decoding for Rate-Compatible Punctured LDPC Codes , 2007, IEEE Communications Letters.

[16]  C. K. Michael Tse,et al.  Generalized LDPC code with single-parity-check product constraints at super check nodes , 2012, 2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC).

[17]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[18]  D.E. Hocevar,et al.  A reduced complexity decoder architecture via layered decoding of LDPC codes , 2004, IEEE Workshop onSignal Processing Systems, 2004. SIPS 2004..

[19]  Dariush Divsalar,et al.  Accumulate repeat accumulate codes , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[20]  Xiaodong Wang,et al.  EXIT Functions of Hadamard Components in Repeat–Zigzag–Hadamard (RZH) Codes With Parallel Decoding , 2007, IEEE Transactions on Information Theory.

[21]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[22]  Guoan Bi,et al.  A Survey on Protograph LDPC Codes and Their Applications , 2015, IEEE Communications Surveys & Tutorials.

[23]  Mohammad Gholami,et al.  Quasi-cyclic low-density parity-check codes based on finite set systems , 2014, IET Commun..

[24]  Evangelos Eleftheriou,et al.  Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.

[25]  Lajos Hanzo,et al.  Survey of Turbo, LDPC, and Polar Decoder ASIC Implementations , 2019, IEEE Communications Surveys & Tutorials.

[26]  Li Ping,et al.  Interleave division multiple-access , 2006, IEEE Trans. Wirel. Commun..

[27]  Francis C. M. Lau,et al.  A Turbo-Hadamard Encoder/Decoder System with Hundreds of Mbps Throughput , 2018, 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC).

[28]  Guosen Yue,et al.  Low-rate generalized low-density parity-check codes with hadamard constraints , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[29]  David J. C. MacKay,et al.  Good Codes Based on Very Sparse Matrices , 1995, IMACC.

[30]  Li Ping,et al.  Concatenated zigzag hadamard codes , 2006, IEEE Transactions on Information Theory.

[31]  Li Ping,et al.  Generalized Low-Density Parity-Check Codes Based on Hadamard Constraints , 2007, IEEE Transactions on Information Theory.

[32]  Xingcheng Liu,et al.  An efficient dynamic schedule for layered belief-propagation decoding of LDPC codes , 2009, IEEE Communications Letters.

[33]  Marco Chiani,et al.  Protograph LDPC Codes Design Based on EXIT Analysis , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[34]  J. Thorpe.  Low-Density Parity-Check (LDPC) Codes Constructed from Protographs , 2003 .

[35]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[36]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[37]  Li Ping,et al.  Low-rate turbo-Hadamard codes , 2001, IEEE Trans. Inf. Theory.

[38]  William E. Ryan,et al.  Low-Floor Tanner Codes Via Hamming-Node or RSCC-Node Doping , 2006, AAECC.

[39]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[40]  P. W. Zhang,et al.  Protograph-based LDPC-Hadamard Codes , 2020, 2020 IEEE Wireless Communications and Networking Conference (WCNC).

[41]  Pablo M. Olmos,et al.  On Generalized LDPC Codes for 5G Ultra Reliable Communication , 2018, 2018 IEEE Information Theory Workshop (ITW).

[42]  Stephan ten Brink,et al.  Design of low-density parity-check codes for modulation and detection , 2004, IEEE Transactions on Communications.

[43]  William E. Ryan,et al.  Enumerators for Protograph-Based Ensembles of LDPC and Generalized LDPC Codes , 2011, IEEE Transactions on Information Theory.

[44]  William E. Ryan,et al.  Quasi-cyclic generalized ldpc codes with low error floors , 2007, IEEE Transactions on Communications.