Efficient encoding for a family of quasi-cyclic LDPC codes
- 22 March 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 7, 3996-4000 vol.7
- https://doi.org/10.1109/glocom.2003.1258979
Abstract
In general, encoding for LDPC codes can be difficult to realize efficiently. The paper presents techniques and architectures for LDPC encoding that are efficient and practical for a particular class of codes. These codes are the irregular partitioned permutation LDPC codes recently introduced by the author (Hocevar, D.E., Proc. IEEE Int. Conf. on Commun., p.2708-12, 2003). Since these codes are quasi-cyclic, it is known that a simpler encoding process does exist. The paper goes beyond that basic method by exploiting other structural properties to allow for a simpler and faster encoding process, in both software and hardware. Solutions for some rank deficient codes are also given.Keywords
This publication has 5 references indexed in Scilit:
- LDPC code construction with flexible hardware implementationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- A family of irregular LDPC codes with low encoding complexityIEEE Communications Letters, 2003
- Efficient encoding of low-density parity-check codesIEEE Transactions on Information Theory, 2001
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001
- Comparison of constructions of irregular Gallager codesIEEE Transactions on Communications, 1999