High-performance, low-complexity decoding of generalized low-density parity-check codes

@inproceedings{Zhang2001HighperformanceLD,
  title={High-performance, low-complexity decoding of generalized low-density parity-check codes},
  author={Tong Zhang and Keshab K. Parhi},
  booktitle={GLOBECOM},
  year={2001}
}
A class of pseudo-random compound error-correcting codes, called Generalized Low-Density (GLD) Parity-Check codes, has been proposed recently. As a generalization of Gallager’s Low-Density ParityCheck (LDPC) codes, GLD codes are also asymptotically good in the sense of minimum distance criterion and can be effectively decoded based on iterative soft-input soft-output (SISO) decoding of individual constituent codes. The code performance and decoding complexity of GLD code are heavily dependent… CONTINUE READING

References

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

Compound codes based on graphs and their iterative decoding

  • O. Pothier
  • Ph.D. thesis, Ecole Nationale Suprieure des…
  • 2000
Highly Influential
5 Excerpts

A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain

  • P. Robertson, E. Villeburn, P. Hoeher
  • IEEE International Conference on Communications…
  • 1995
Highly Influential
3 Excerpts

Zemor, “Generalized low density (Tanner) codes

  • J. Boutros, O. Pothier
  • Proceedings of ICC’99,
  • 1999
3 Excerpts

Iterative decoding of generalized low-density parity-check codes

  • M. Lentmaier, K. S. Ziganfirov
  • Proceedings of IEEE International Symposium on…
  • 1998
3 Excerpts

Improved decoding with the SOVA in a parallel concatenated (turbo-code) scheme

  • L. Papke, P. Robertson, E. Villebrun
  • IEEE International Conference on Communications…
  • 1996
1 Excerpt

Similar Papers

Loading similar papers…