High Performance SC-LDPC Code Based on Affine Permutation Matrices

doi:10.13190/j.jbupt.2021-175

Journal of Beijing University of Posts and Telecommunications ›› 2022, Vol. 45 ›› Issue (2): 131-136.doi: 10.13190/j.jbupt.2021-175

• REPORTS • Previous Articles

High Performance SC-LDPC Code Based on Affine Permutation Matrices

ZHU Kun, YANG Hongwen

School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China

Received:2021-08-18 Published:2021-12-16

Abstract

Abstract: Spatially-coupled (SC) low density parity check (LDPC) code is a kind of LDPC code with convolution structure. This structure not only brings convolution gain but also introduces memory structure. For codes using sliding window decoding, the previous error message will affect the subsequent decoding, especially for SC-LDPC codes with long coupling length, which is easy to cause error propagation. Therefore, SC-LDPC codes have stricter requirements for structural design than traditional LDPC block codes. To improve the design space and performance of SC-LDPC codes, an affine permutation matrix (APM) is proposed to replace the traditional cyclic permutation matrix for code construction. The full cycles and non-full cycles phenomena in APM-LDPC code's structures are discovered and demonstrated, and the non-full cycles phenomenon only occurs in APM-LDPC code is proved. The APM-SC-LDPC code with non-full cycles phenomenon can significantly reduce the number of short cycles, the error-floor and significantly improve in waterfall region.

Key words: affine permutation matrix, spatially coupled low density parity check code, cycles distribution, waterfall region, error floor

CLC Number:

TN911.22

ZHU Kun, YANG Hongwen. High Performance SC-LDPC Code Based on Affine Permutation Matrices[J]. Journal of Beijing University of Posts and Telecommunications, 2022, 45(2): 131-136.

References

[1] JIMENEZ F A, ZIGANGIROV K S. Time-varying periodic convolutional codes with low-density parity-check matrix[J]. IEEE Transactions on Information Theory, 1999, 45(6):2181-2191.
[2] KUDEKAR S, RICHARDSON T J, URBANKE R L. Threshold saturation via spatial coupling:why convolutional LDPC ensembles perform so well over the BEC[J]. IEEE Transactions on Information Theory, 2011, 57(2):803-834.
[3] IYENGAR A R, PAPALEO M, SIEGEL P H, et al. Windowed decoding of protograph-based LDPC convolutional codes over erasure channels[J]. IEEE Transactions on Information Theory, 2012, 58(4):2303-2320.
[4] DEHGHAN A, BANIHASHEMI A H. On the tanner graph cycle distribution of random LDPC, random protograph-based LDPC, and random quasi-cyclic LDPC code ensembles[J]. IEEE Transactions on Information Theory, 2018, 64(6):4438-4451.
[5] GHOLAMI M, ALINIA M. High-performance binary and non-binary low-density parity-check codes based on affine permutation matrices[J]. IET Communications, 2015, 9(17):2114-2123.
[6] GHOLAMI M, ALINIA M. Explicit APM-LDPC codes with girths 6, 8, and 10[J]. IEEE Signal Processing Letters, 2017, 24(6):741-745.
[7] SCHMALEN L, AREF V, CHO J, et al. Spatially coupled soft-decision error correction for future lightwave systems[J]. Journal of Lightwave Technology, 2015, 33(5):1109-1116.
[8] BOCHAROVA I E, KUDRYASHOV B D, JOHANNESSON R. Searching for binary and nonbinary block and convolutional LDPC codes[J]. IEEE Transactions on Information Theory, 2016, 62(1):163-183.
[9] MYUNG S, YANG K, PARK D S. A combining method of structured LDPC codes from affine permutation matrices[C]//2006 IEEE International Symposium on Information Theory. Piscataway, NJ:IEEE Press, 2006:674-678.
[10] ZHU K, WU Z J. Comprehensive study on CC-LDPC, BC-LDPC and polar code[C]//2020 IEEE Wireless Communications and Networking Conference Workshops. Piscataway, NJ:IEEE Press, 2020:1-6.

High Performance SC-LDPC Code Based on Affine Permutation Matrices

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 4

Recommended Articles

Metrics

Comments

[1]	CHEN Zijie, JI Xiaodong, PENG Mugen, WANG Zhifeng, LIU Xiqing. Code-Hopping Multiple Access and Its Pattern Design [J]. Journal of Beijing University of Posts and Telecommunications, 2022, 45(1): 82-87.
[2]	WU Jiang, XU Ke-feng, LI Yun-bo. Verification of OFEC Code under Open ROADM Standard in 300 Gbit/s FPGA System [J]. Journal of Beijing University of Posts and Telecommunications, 2021, 44(4): 135-140.
[3]	ZHANG Ya-kun, ZHANG Ya-mei, ZHOU Lin, HE Yu-cheng. Structure Design of SC-LDPC Code over Additive White Gaussian Noise Channel [J]. Journal of Beijing University of Posts and Telecommunications, 2020, 43(1): 35-39.
[4]	Zhao Shuang hongwen yang. The Impact of Feedback Delay to the Performance of Selective Transmit Diversity under TimeVarying Rayleigh Channel [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2009, 32(4): 94-98.