Tanner Graph Based Low Complexity Cycle Search Algorithm for Design of Block LDPC Codes 


Vol. 39,  No. 8, pp. 637-642, Aug.  2014


PDF
  Abstract

In this paper, we propose a efficient shift index searching algorithm for design of the block LDPC codes. It is combined with the message-passing based cycle search algorithm and ACE algorithm. We can determine the shift indices by ordering of priority factors which are effect on the LDPC code performance. Using this algorithm, we can construct the LDPC codes with low complexity compare to trellis-based search algorithm and save the memory for storing the parity check matrix.

  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]

S. C. Myung, K. J. Jeon, B. h. Ko, S. R. Lee, K. S. Kim, "Tanner Graph Based Low Complexity Cycle Search Algorithm for Design of Block LDPC Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 39, no. 8, pp. 637-642, 2014. DOI: .

[ACM Style]

Se Chang Myung, Ki Jun Jeon, Byung hoon Ko, Seong Ro Lee, and Kwang Soon Kim. 2014. Tanner Graph Based Low Complexity Cycle Search Algorithm for Design of Block LDPC Codes. The Journal of Korean Institute of Communications and Information Sciences, 39, 8, (2014), 637-642. DOI: .

[KICS Style]

Se Chang Myung, Ki Jun Jeon, Byung hoon Ko, Seong Ro Lee, Kwang Soon Kim, "Tanner Graph Based Low Complexity Cycle Search Algorithm for Design of Block LDPC Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 39, no. 8, pp. 637-642, 8. 2014.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880