A modified PEG algorithm for construction of LDPC codes with Polynomial of Cycle

@article{Xiong2009AMP,
  title={A modified PEG algorithm for construction of LDPC codes with Polynomial of Cycle},
  author={Lei Xiong and Dongping Yao and Yimeng Wu},
  journal={2009 3rd IEEE International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications},
  year={2009},
  pages={524-527}
}
Progressive Edge-Growth (PEG) algorithm is a novel approach for construction of low-density parity-check (LDPC) codes with large girth. However, PEG algorithm ignores the effect of the number of shortest cycles. In this paper, we propose a modified PEG algorithm with Polynomial of Cycle, which achieves not only large girth, but also minimizes the number of shortest cycles significantly. Simulation results show that our proposed algorithm can improves the performance of LDPC codes. 

From This Paper

Topics from this paper.
3 Citations
15 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Irregular progressive edgegrowth (PEG) Tanner graphs[C

  • Xiao-Yu Hu, E.Eleftheriou, D.-M.Arnold
  • IEEE Internation Symposium on Information Theory…
  • 2002
1 Excerpt

Similar Papers

Loading similar papers…