Research on Parallel Convolutional LDPC Code Based on Random Interleaver

Abstract:

Starting from pseudo-random interleaver and parallel convolution respectively, this paper has proposed a simple and fast LDPC encoding method without the loss of BER performance. when we use S-random interleaver, it has a good adaptation in both Gaussian noise channel and Rayleigh fading channel. And it can conduct random pre-encoding directly and does not need to look up for 4-cycles. Even if the number of iterations is low, its performance also remains stable.

• Periodical: Applied Mechanics and Materials (Volumes 427-429)
• Pages: 1510-1513
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.427-429.1510
• Online since: September 2013
• Authors: Ce Lun Liu, Xu Su, Long Bo Han, Xiao Jie Wen
• Keywords: Low-Density Parity-Check (LDPC), Parallel Convolution, Random Interleaver

References

[1] R. G Gallager. Low density parity-check codes. Cambridge[M]. MA: MIT Press, (1963).

[2] D.J.C. MacKay, S.T. Wilson and M.C. Davey, "comparision of constructions of irregular Gallager codes[J]. IEEE Trans. Commun, 1999, 47, pp.1449-1454.

DOI: 10.1109/26.795809

[3] J. Lu and J. Mouru, TS-LDPC Codes: Turbo-structured codes with large girthgeometries[J]. IEEE Trans. Inform. Theory, 2007, 53(3): 1080-1094.

DOI: 10.1109/tit.2006.890690

[4] R. M. Neal, Sparse matrix methods and probabilistic inference algorithm. 1999. Available at http: /www. cs. utoronto. ca/~radford.

[5] T. J. Richardson and R. L. Urbanke, Efficient encoding of low-density parity-check codes[J]. IEEE Trans. Inform. Theory, Feb. 2001, 47(2), pp.638-656.

DOI: 10.1109/18.910579

[6] Wang Dan. On the encoding and decoding slgorithms of LDPC code[D]. Xidian University. (2006).