ETRI Journal

Electronics and Telecommunications Research Institute (한국전자통신연구원)
권호 표지

Fast Implementation of the Progressive Edge-Growth Algorithm

  • Chen, Lin (National Laboratory of Radar Signal Processing, Xidian University) ;
  • Feng, Da-Zheng (National Laboratory of Radar Signal Processing, Xidian University)
  • Received : 2008.11.11
  • Accepted : 2009.02.18
  • Published : 2009.04.30
Download PDF
⟨ Previous Next ⟩

Abstract

A computationally efficient implementation of the progressive edge-growth algorithm is presented. This implementation uses an array of red-black (RB) trees to manage the layered structure of check nodes and adopts a new strategy to expand the Tanner graph. The complexity analysis and the simulation results show that the proposed approach reduces the computational effort effectively. In constructing a low-density parity check code with a length of $10^4$, the RB-tree-array-based implementation takes no more 10% of the time required by the original method.

Keywords

References

  1. X.-Y. Hu, E. Eleftheriou, and D.-M. Arnold “Regular and Irregular Progressive Edge-Growth Tanner Graphs,” IEEE Trans. Inform. Theory, vol. 51, no. 1, Jan. 2005, pp. 386-398. https://doi.org/10.1109/TIT.2004.839541
  2. M. Andersson, Graph Optimization for Sparse Graph Codes, M.S. thesis, KTH, Stockholm, Sweden 2007, Available online: http://www.ee.kth.se/php/modules/publications/reports/2007/IRSB- XR-EE-KT%202007:001.pdf
  3. S. Mohan and J. Anderson, “Computationally Optimal Metric First Code Tree Search Algorithms,” IEEE Trans. Comm., vol. 32, no. 6, June 1984, pp. 710-717. https://doi.org/10.1109/TCOM.1984.1096122
  4. T. Cormen et al., Introduction to Algorithms (Second Edition), MIT Press, Cambridge, Massachusetts London, 2001.
  5. T.J. Richardson, M.A. Shokrollahi, and R.L. Urbanke, “Design of Capacity-Approaching Irregular Low-Density Parity-Check Codes,” IEEE Trans. Inform. Theory, vol. 47, no. 2, Feb. 2001, pp. 619-637. https://doi.org/10.1109/18.910578