A new high rate code scheme with highly parallel and low complexity decoding algorithm

Author

Liao, Yu ; Kieffer, John C.

Author_Institution

Dept. of Electr. & Comput. Eng., Univ. of Minnesota, Minneapolis, MN, USA

Volume

8

Issue

6

fYear

2004

fDate

6/1/2004 12:00:00 AM

Firstpage

386

Lastpage

387

Abstract

A new high rate code scheme is proposed in this paper. It consists of serial concatenated recursive systematic ordinary (nonpunctured) convolutional codes with only 8 states in the trellis of the corresponding reciprocal dual codes. With a low complexity and highly parallel decoding algorithm, over additive white Gaussian noise channels, the proposed codes can achieve good bit error rate (BER) performance comparable to that of turbo codes and low density parity check (LDPC) codes. At code rate R=16/17, the overall decoding complexity of the proposed code scheme is almost half that of the LDPC codes.

Keywords

AWGN channels; channel coding; computational complexity; concatenated codes; convolutional codes; decoding; dual codes; error statistics; parallel algorithms; AWGN channel; BER; additive white Gaussian noise channel; bit error rate; convolutional code; high rate code scheme; nonpunctured code; parallel low complexity decoding algorithm; reciprocal dual code; serial concatenated recursive code; Additive white noise; Binary phase shift keying; Bit error rate; Concatenated codes; Convolutional codes; Decoding; Memoryless systems; Parity check codes; Polynomials; Turbo codes;

fLanguage

English

Journal_Title

Communications Letters, IEEE

Publisher

ieee

ISSN

1089-7798

Type

jour

DOI

10.1109/LCOMM.2004.828177

Filename

1306429