Journal Home > Volume 18 , Issue 1
Tsinghua Science and Technology 2013, 18(1): 57-61 https://doi.org/10.1109/TST.2013.6449408
Open Access | Issue | Published: 07 February 2013

Low Complexity LDPC Decoder with Modified Sum-Product Algorithm

Show Author's Information Chen Qian,  Weilong Lei,  Zhaocheng Wang( )
Tsinghua National Laboratory for Information Science and Technology, Department of Electronic Engineering, Tsinghua University, Beijing 100084, China
Keywords:
Low Density Parity Check (LDPC) code, decoding, look-up table
Cite this article:
Qian C, Lei W, Wang Z. Low Complexity LDPC Decoder with Modified Sum-Product Algorithm. Tsinghua Science and Technology, 2013, 18(1): 57-61. https://doi.org/10.1109/TST.2013.6449408
Download citation
EndNote(RIS)
BibTeX

474

Views

23

Downloads

Citations

7

Crossref

N/A

WoS

10

Scopus

0

CSCD

Abstract Full text About this article

This paper describes an efficient implementation of the Sum-Product Algorithm (SPA) within a Low Density Parity Check (LDPC) code decoder, where a horizontal process correction term is used to improve the decoding performance of the Min-Sum algorithms. The correction term is implemented as a look-up table. The algorithm uses the correction term redundancy by means of a coordinate transformation to reduce the hardware complexity. Simulations and hardware tests indicate that the decoding performance is very good with the appropriate look-up table.


menu
Abstract
Full text
Outline
About this article

Low Complexity LDPC Decoder with Modified Sum-Product Algorithm

Show Author's information Chen Qian, Weilong Lei, Zhaocheng Wang( )
Tsinghua National Laboratory for Information Science and Technology, Department of Electronic Engineering, Tsinghua University, Beijing 100084, China

Abstract

This paper describes an efficient implementation of the Sum-Product Algorithm (SPA) within a Low Density Parity Check (LDPC) code decoder, where a horizontal process correction term is used to improve the decoding performance of the Min-Sum algorithms. The correction term is implemented as a look-up table. The algorithm uses the correction term redundancy by means of a coordinate transformation to reduce the hardware complexity. Simulations and hardware tests indicate that the decoding performance is very good with the appropriate look-up table.

Keywords: Low Density Parity Check (LDPC) code, decoding, look-up table

References(14)

[1]
R. G. Gallager, Low-density parity-check codes, IEEE Trans. Inf. Theory, vol. 8, no. 1, pp. 21-28, Jan. 1962.
DOI Google Scholar
[2]
D. J. MacKay and R. M. Neal, Near shannon limit performance of low-density parity check codes, Electron. Lett., vol. 33, no. 6, pp. 457-458, Mar. 1997.
DOI Google Scholar
[3]
Framing Structure, Channel Coding and Modulation for Digital Television Terrestrial Broadcasting System, (in Chinese), GB 20600-2006, Standardization Administration of the People’s Republic of China, 2006.
[4]
Digital Video Broadcasting (DVB), Frame structure channel coding and modulation for a second generation digital terrestrial television broadcasting system (DVB-T2), ETSI EN 302 755 v1.1.1, Sept. 2009.
DOI
[5]
L. Dai, Z. Wang, and Z. Yang, Next-generation digital television terrestrial broadcasting systems: Key technologies and research trends, IEEE Commun. Magazine, vol. 50, no.6, pp. 150-158, Jun. 2012.
DOI Google Scholar
[6]
W. E. Ryan and S. Lin, Channel Codes: Classical and Modern, New York, NY, USA: Cambridge University Press, 2009.
DOI
[7]
D. J. MacKay, Good error-correcting codes based on very sparse matrices, IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
DOI Google Scholar
[8]
M. P. C. Fossorier, M. Mihaljevic, and H. Imai, Reduced complexity iterative decoding of low-density parity check codes based on belief propagation, IEEE Trans. Commun., vol. 47, no. 5, pp. 673-680, May 1999.
DOI Google Scholar
[9]
A. J. Felstrom and K. S. Zigangirov, Time-varying periodic convolutional codes with low-density parity-check matrix, IEEE Trans. Inf. Theory, vol. 45, no.6, pp. 2181-2191, Sep. 1999.
DOI Google Scholar
[10]
J. Chen, Reduced complexity decoding algorithms for low-density parity check codes and turbo codes, Ph.D. dissertation, Dept. Electrical Engineering, The University of Hawaii, Honolulu, USA, 2003.
[11]
J. Chen and M. P. C. Fossorier, Near optimum universal belief propagation based decoding of low-density parity check codes, IEEE Trans. Commun., vol. 50, no. 3, pp. 406-414, Mar. 2002.
DOI Google Scholar
[12]
J. Chen, A. Dholakia, E. Eleftheriou, M. P. C. Fossorier, and X. Hu, Reduced-complexity decoding of LDPC codes, IEEE Trans. Commun., vol. 53, no. 7, pp. 1232, Jul. 2005.
DOI Google Scholar
[13]
X. Hu and D. M. Arnold, Regular and irregular progressive edge-growth tanner graphs, IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 386-389, Jan. 2005.
DOI Google Scholar
[14]
I. Djurdjevic, J. Xu, K. A. Ghaffar, and S. Lin, A class of low-density parity-check codes constructed based on reed-solomon codes with two information symbols, IEEE Commun. Lett., vol. 7, no. 7, pp. 317-319, Jul. 2003.
DOI Google Scholar
Publication history
Copyright
Acknowledgements
Rights and permissions

Publication history

Received: 17 February 2012
Accepted: 10 December 2012
Published: 07 February 2013
Issue date: February 2013

Copyright

© The author(s) 2013

Acknowledgements

This work was supported by Tsinghua University Initiative Scientific Research Program (No. 2010THZ0) and the National Key Basic Research (973) Program of China (No. 2012CB316000).

Rights and permissions

Return