Reliable transmission with low complexity Reed-Solomon block turbo codes

Author

Zhou, Rong ; Picart, Annie ; Pyndiah, Ramesh ; Goalie, A.

Author_Institution

Dept. of Signal & Commun., GET-ENST de Bretagne, Brest, France

fYear

2004

fDate

20-22 Sept. 2004

Firstpage

193

Lastpage

197

Abstract

We show here that low complexity Reed-Solomon (RS) block turbo codes (BTC) based on Q-ary symbol and bit concatenation can both achieve reliable transmission at less than 1 dB from Shannon limit using quadrature phase shift keying (QPSK) over additive white Gaussian noise (AWGN) channel. These near Shannon performances are due to a proper choice of RS component codes in the construction of RS product codes. RS-BTC based on Q-ary symbol concatenation has a great advantage in terms of block size over those based on bit concatenation. Compared to Bose-Chaudhuri-Hocquenghem (BCH) BTC of similar code rate, its smaller memory size is worth noting from the practical point of view.

Keywords

AWGN channels; Reed-Solomon codes; block codes; communication complexity; concatenated codes; iterative decoding; quadrature phase shift keying; telecommunication network reliability; turbo codes; AWGN channel; Bose-Chaudhuri-Hocquenghem BTC; Q-ary symbol; Shannon limit; additive white Gaussian noise; bit concatenation; low complexity Reed-Solomon block turbo code; quadrature phase shift keying; AWGN channels; Additive white noise; Iterative decoding; Magnetohydrodynamics; Parity check codes; Product codes; Quadrature phase shift keying; Reed-Solomon codes; Telephony; Turbo codes;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communication Systems, 2004, 1st International Symposium on

Print_ISBN

0-7803-8472-5

Type

conf

DOI

10.1109/ISWCS.2004.1407236

Filename

1407236