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

Author

Ma, Zheng ; Fan, Pingzhi ; Chen, Qingchun ; Hao, Li ; Darnell, Michael

Author_Institution

Provincial Key Lab. of Inf. Coding & Transm., Southwest Jiaotong Univ., Chengdu

Volume

56

Issue

12

fYear

2008

fDate

12/1/2008 12:00:00 AM

Firstpage

1988

Lastpage

1992

Abstract

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.

Keywords

computational complexity; iterative decoding; parity check codes; turbo codes; Turbo code; belief-propagation decoding strategy; complex rotary code; generalized parity-check codes; iterative sum-product decoding; low-complexity high-performance decoding approach; Chromium; Educational programs; Iterative decoding; Laboratories; Mobile communication; Multidimensional systems; Parity check codes; Sum product algorithm; Turbo codes; Wireless communication; Complex rotary (CR) code; Turbo code; iterative decoding; sum-product algorithm;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

Conference_Location

12/1/2008 12:00:00 AM

ISSN

0090-6778

Type

jour

DOI

10.1109/TCOMM.2008.050112

Filename

4711159