Construction of Optimal Concatenated Zigzag Codes Using Density Evolution with a Gaussian Approximation 


Vol. 31,  No. 9, pp. 825-830, Sep.  2006


PDF
  Abstract

Capacity-approaching codes using iterative decoding have been the main subject of research activities during past decade. Especially, LDPC codes show the best asymptotic performance and density evolution has been used as a powerful technique to analyze and design good LDPC codes. In this paper, we apply density evolution with a Gaussian approximation to the concatenated zigzag (CZZ) codes by considering both flooding and two-way schedulings. Based on this density evolution analysis, the threshold values are computed for various CZZ codes and the optimal structure of CZZ codes for various code rates are obtained. Also, simulation results are provided to confirm the analytical results.

  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. Hong and D. Shin, "Construction of Optimal Concatenated Zigzag Codes Using Density Evolution with a Gaussian Approximation," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 9, pp. 825-830, 2006. DOI: .

[ACM Style]

Song-Nam Hong and Dong-Joon Shin. 2006. Construction of Optimal Concatenated Zigzag Codes Using Density Evolution with a Gaussian Approximation. The Journal of Korean Institute of Communications and Information Sciences, 31, 9, (2006), 825-830. DOI: .

[KICS Style]

Song-Nam Hong and Dong-Joon Shin, "Construction of Optimal Concatenated Zigzag Codes Using Density Evolution with a Gaussian Approximation," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 9, pp. 825-830, 9. 2006.