Flexible hardware encoding schemes for extended quasi-cyclic low-density parity-check codes

In this paper, extending technique is employed to quasi-cyclic low-density parity-check (QC-LDPC) codes to construct lower-rate codes from a higher-rate mother code since quasi-cyclic codes can be encoded with simple shift registers, with linear complexity based on their generators. We also present the fitting flexible hardware encoding schemes designed for extended QC-LDPC codes. In the serial-input case and parallel-input parallel-output case, the required maximum encoding circuits which are demanded at the lowest rate are adopted as practical encoder implementation for all of the extended QC-LDPC codes in a sequence and part of hardware units is disabled during higher-rate encoding to reduce power consumption, whereas the hardware circuits are the simplest and totally invariable for a sequence of extended QC-LDPC codes in the parallel-input serial-output case.

[1]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[2]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[3]  Chris Jones,et al.  Rate-compatible low-density parity-check codes , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[4]  Shu Lin,et al.  Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.

[5]  Shu Lin,et al.  Near Shannon limit quasi-cyclic low-density parity-check codes , 2004, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[6]  Zongwang Li,et al.  Efficient encoding of quasi-cyclic low-density parity-check codes , 2006, IEEE Trans. Commun..

[7]  D.J.C. MacKay,et al.  Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.