A new approach to constructing CSS codes based on factor graphs
Information Sciences: an International Journal
Capacity-approaching protograph codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Fast parallel weighted bit flipping decoding algorithm for LDPC codes
WTS'09 Proceedings of the 2009 conference on Wireless Telecommunications Symposium
Low Density Parity Check Code for the Single Carrier Frequency Division Multiple Access
FGIT '09 Proceedings of the 1st International Conference on Future Generation Information Technology
On the use of QC-LDPC code for data transfer using short and medium block length
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 3
Protograph LDPC codes over burst erasure channels
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
| Hi-index | 0.25 |
Low-density parity-check codes, turbo codes, and indeed most practically decodable capacity-approaching error correcting codes can all be understood as codes defined on graphs. Graphs not only describe the codes, but, more important, they structure the operation of the sum-product decoding algorithm (or one of many possible variations), which can be used for iterative decoding. Such coding schemes have the potential to approach channel capacity, while maintaining reasonable decoding complexity. In this tutorial article we review factor graphs, which can be used to describe codes and the joint probability distributions that must be dealt with in decoding. We also review the sum-product algorithm, and show how this algorithm leads to iterative decoding algorithms for codes defined on graphs.