Tail-Biting LDPC Convolutional Codes

In this paper, the tail-biting version of the low-density parity-check convolutional codes (LDPCCCs) is introduced and investigated. The definition of the tail-biting LDPCCCs (TB-LDPCCCs) is given through their parity-check matrices and the basic ideas behind the architectures of the encoders and decoders for these codes are also presented. In addition, the asymptotical lower bound for the minimum distance of these codes and simulation results are shown.

[1]  Kamil Sh. Zigangirov,et al.  Time-varying periodic convolutional codes with low-density parity-check matrix , 1999, IEEE Trans. Inf. Theory.

[2]  K.Sh. Zigangirov,et al.  Periodic time-varying convolutional codes with low-density parity-check matrices , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

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

[4]  A. J. Viterbi.  Error-correcting coding for CDMA systems , 1994, Proceedings of IEEE 3rd International Symposium on Spread Spectrum Techniques and Applications (ISSSTA'94).

[5]  Michael Horstein,et al.  Review of 'Low-Density Parity-Check Codes' (Gallager, R. G.; 1963) , 1964, IEEE Transactions on Information Theory.

[6]  Michael Lentmaier,et al.  Distance Bounds for an Ensemble of LDPC Convolutional Codes , 2007, IEEE Transactions on Information Theory.

[7]  Alberto Jiménez Feltström.  Iteratively Decodable Convolutional Codes: Analysis and Implementation Aspects , 2006 .

[8]  Ali Emre Pusane,et al.  A Comparison Between LDPC Block and Convolutional Codes , 2006 .

[9]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.