A novel low complexity LDPC encoder based on RU algorithm with dynamic programming

@article{Sun2010ANL,
  title={A novel low complexity LDPC encoder based on RU algorithm with dynamic programming},
  author={Xiangran Sun and Zhibin Zeng and Zhanxin Yang},
  journal={2010 3rd International Congress on Image and Signal Processing},
  year={2010},
  volume={7},
  pages={3258-3262}
}
In this paper, we present a low-complexity high-efficiency LDPC encoder, based on classic method of Richardson and Urbanke with a novel dynamic programming algorithm, which we propose to substitute greedy algorithm for approximate triangulation with sparse matrix of LDPC codes. For the LDPC code in CMMB, for example, the complexity of encoding is reduced effectively, and an implementation of LDPC encoder for two different code rate (1/2 and 3/4) on Altera Stratix II EP1S180F102014 can achieve… CONTINUE READING
1 Citations
8 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Sparse matrix methods and probabilistic algorithm

  • R. M. Neal
  • IMA Program On Codes, Systems, and Graphic Models…
  • 1999
Highly Influential
3 Excerpts

Near Shannon limit performance of lowdensity parity-check codes

  • D.J.C. MacKay, R. M. Neal
  • Electron. Lett, vol. 32, 1996, pp. 1645.
  • 1996
1 Excerpt

Similar Papers

Loading similar papers…