Capacity-approaching protograph codes
D. Divsalar, Sam Dolinar, Christopher Jones et al. · IEEE Journal on Selected Areas in Communications · 2009
This paper discusses construction of protograph-based low-density parity-check (LDPC) codes. Emphasis is placed on protograph ensembles whose typical minimum distance grows linearly with block size. Asymptotic performance analysis for both weight enumeration and iterative decoding threshold determination is provided and applied to a series of code constructions. Construction techniques that yield both low thresholds and linear minimum distance growth are introduced by way of example throughout. The paper also examines implementation strategies for high throughput decoding derived from first principles of belief propagation on bipartite graphs.
Cited by 353 works. doi:10.1109/jsac.2009.090806
Authors
References
- The Art of Computer Programming
- The Art of Computer Programming
- Low-density parity-check codes
- Low-Density Parity-Check Codes
- Good error-correcting codes based on very sparse matrices
- Design of capacity-approaching irregular low-density parity-check codes
- The capacity of low-density parity-check codes under message-passing decoding
- A recursive approach to low complexity codes
- Near Shannon limit performance of low density paritycheck codes
- Iterative decoding of binary block and convolutional codes