Efficient Design of Structured LDPC Codes 


Vol. 31,  No. 1, pp. 14-19, Jan.  2006


PDF Full-Text
  Abstract

The high encoding complexity of LDPC codes can be solved by designing structured parity-check matrix. If the parity-check matrix of LDPC codes is composed of same type of blocks, decoder implementation can be simple, this structure allow structured decoding and required memory for storing the parity-check matrix can be reduced largely. In this paper, we propose a construction algorithm for short block length structured LDPC codes based on girth condition, PEG algorithm and variable node connectivity. The code designed by this algorithm shows similar performance to other codes without structured constraint in low SNR and better performance in high SNR than those by simulation.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

B. Chung, J. Kim, H. Song, "Efficient Design of Structured LDPC Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 1, pp. 14-19, 2006. DOI: .

[ACM Style]

Bi-Woong Chung, Joon-Sung Kim, and Hong-Yeop Song. 2006. Efficient Design of Structured LDPC Codes. The Journal of Korean Institute of Communications and Information Sciences, 31, 1, (2006), 14-19. DOI: .

[KICS Style]

Bi-Woong Chung, Joon-Sung Kim, Hong-Yeop Song, "Efficient Design of Structured LDPC Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 1, pp. 14-19, 1. 2006.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880