Complex rotary codes revisited: a low-complexity high-performance decoding approach

In this paper, based on a belief-propagation decoding strategy, a class of generalized parity-check codes called complex rotary codes is investigated. It is shown that, by using iterative sum-product decoding, the complex rotary codes have a much lower decoding complexity than Turbo codes, but have almost the same performance for the high code rate and short frame case (frame length< 500 bits). It is also shown that the prime block size of complex rotary codes is essential to achieve better performance because of its uniform checking characteristic.

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

[2]  Desmond P. Taylor,et al.  Multiple serially concatenated single parity check codes , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[3]  Desmond P. Taylor,et al.  Multiple parallel concatenated single parity check codes , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[4]  Ching He,et al.  A comparison of low complexity turbo-like codes , 2002, Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002..

[5]  Ramesh Pyndiah,et al.  Near-optimum decoding of product codes: block turbo codes , 1998, IEEE Trans. Commun..

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

[7]  Li Ping.  Turbo-SPC codes , 2001, IEEE Trans. Commun..

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

[9]  Bahram Honary,et al.  Construction of low-density parity-check codes based on balanced incomplete block designs , 2004, IEEE Transactions on Information Theory.

[10]  T. Aaron Gulliver,et al.  Single parity check product codes , 2001, IEEE Trans. Commun..