publication . Article . Preprint . 2011

interleaved product ldpc codes

Baldi, Marco; Cancellieri, Giovanni; Chiaraluce, Franco;
Open Access
  • Published: 05 Dec 2011 Journal: IEEE Transactions on Communications, volume 60, pages 895-901 (issn: 0090-6778, eissn: 1558-0857, Copyright policy)
  • Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Comment: 11 pages, 5 figures, accepted for publication in IEEE Transactions on Communications
ACM Computing Classification System: Data_CODINGANDINFORMATIONTHEORY
free text keywords: Electrical and Electronic Engineering, Interleaving, Serial concatenated convolutional codes, Theoretical computer science, Algorithm, Encoding (memory), Concatenated error correction code, Decoding methods, Electronic engineering, Computer science, Algorithm design, Low-density parity-check code, Error floor, Computer Science - Information Theory
20 references, page 1 of 2

[1] C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: Turbo codes,” in Proc. IEEE ICC 1993, Geneva, Switzerland, May 1993, pp. 1064-1070.

[2] S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, “Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding,” IEEE Trans. Inform. Theory, vol. 44, no. 3, pp. 909-926, May 1998. [OpenAIRE]

[3] L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Inform. Theory, vol. 20, no. 3, pp. 284-287, Mar. 1974. [OpenAIRE]

[4] R. G. Gallager, “Low-density parity-check codes,” IRE Trans. Inform. Theory, vol. IT-8, pp. 21-28, Jan. 1962.

[5] T. Richardson and R. Urbanke, “Efficient encoding of low-density parity-check codes,” IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 638-656, Feb. 2001.

[6] R. Pyndiah, “Near optimum decoding of product codes: block turbo codes,” IEEE Trans. Commun., vol. 46, no. 8, pp. 1003-1010, Aug. 1998. [OpenAIRE]

[7] O. Gazi and A. O. Yilmaz, “Turbo product codes based on convolutional codes,” ETRI Journal, vol. 28, no. 4, pp. 453-460, Aug. 2006. [OpenAIRE]

[8] W. E. Ryan and S. Lin, Channel Codes - Classical and Modern. Cambridge University, 2009.

[9] J. Xu, L. Chen, L. Zeng, L. Lan, and S. Lin, “Construction of low-density parity-check codes by superposition,” IEEE Trans. Commun., vol. 53, no. 2, pp. 243-251, Feb. 2005.

[10] Z. Qi and N. C. Sum, “LDPC product codes,” in Proc. ICCS 2004, Kraków, Poland, Sep. 2004, pp. 481-483.

[11] M. Esmaeili, “The minimal product parity check matrix and its application,” in Proc. IEEE ICC 2006, Istambul, Turkey, Jun. 2006, pp. 1113-1118. [OpenAIRE]

[12] N. Thomos, N. V. Boulgouris, and M. G. Strintzis, “Product code optimization for determinate state LDPC decoding in robust image transmission,” IEEE Trans. Image Processing, vol. 15, no. 8, pp. 2113-2119, Aug. 2006.

[13] X. Y. Hu and E. Eleftheriou, “Progressive edge-growth tanner graphs,” in Proc. IEEE Global Telecommunications Conference (GLOBECOM'01), San Antonio, Texas, Nov. 2001, pp. 995-1001.

[14] M. Baldi, G. Cancellieri, A. Carassai, and F. Chiaraluce, “LDPC codes based on serially concatenated multiple parity-check codes,” IEEE Commun. Lett., vol. 13, no. 2, pp. 142-144, Feb. 2009.

[15] F. Chiaraluce and R. Garello, “Extended Hamming product codes analytical performance evaluation for low error rate applications,” IEEE Trans. Wireless Commun., vol. 3, no. 6, pp. 2353-2361, Nov. 2004.

20 references, page 1 of 2
Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue
publication . Article . Preprint . 2011

interleaved product ldpc codes

Baldi, Marco; Cancellieri, Giovanni; Chiaraluce, Franco;