A Synthesizable IP Core for DVB-S2 LDPC Code Decoding
Proceedings of the conference on Design, Automation and Test in Europe - Volume 3
Disclosing the LDPC code decoder design space
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Opportunistic spectral usage: bounds and a multi-band CSMA/CA protocol
IEEE/ACM Transactions on Networking (TON)
Capacity-approaching protograph codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
IEEE Transactions on Wireless Communications
On universal properties of capacity-approaching LDPC code ensembles
IEEE Transactions on Information Theory
On the fundamental system of cycles in the bipartite graphs of LDPC code ensembles
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Protograph LDPC codes over burst erasure channels
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Hi-index | 0.31 |
LDPC codes were invented in 1960 by R. Gallager. They were largely ignored until the discovery of turbo codes in 1993. Since then, LDPC codes have experienced a renaissance and are now one of the most intensely studied areas in coding. In this article we review the basic structure of LDPC codes and the iterative algorithms that are used to decode them. We also briefly consider the state of the art of LDPC design.