Near Shannon Limit for Turbo Code with Short Frames

Author

Chemak, Chokri ; Bouhlel, Mohamed Salim

Author_Institution

U.R. of Sci. Electron., Technol. of Images & Telecommun., Higher Inst. of Biotechnol., Sfax

Volume

1

fYear

0

fDate

0-0 0

Firstpage

1994

Lastpage

1997

Abstract

The increase of performances of turbo codes with short frame is the subject of a lot of research. Several techniques have been elaborated such as the choice of good interleaver or the use of a coder with high coding rate. In this paper, we present a new technique to increase the performances of turbo codes by increasing the constraint length therefore the free distance of the code. We could show that with the increase of constraint length, we could get good results concerning the reduction of the bit error rate (BER). We examine the performances in bit error rate (BER) of turbo codes for coding rates 1/2 and 1/3 with the use of variables constraint lengths. We used a Gaussian channel and a BPSK modulation for signal transmission. For decoding we use soft output Viterbi algorithm (SOVA)

Keywords

Gaussian channels; Viterbi decoding; error statistics; phase shift keying; turbo codes; BPSK modulation; Gaussian channel; bit error rate reduction; decoding; near Shannon limit; parallel concatenation; signal transmission; soft output Viterbi algorithm; turbo code; Binary phase shift keying; Bit error rate; Chemical technology; Convolution; Convolutional codes; Gaussian channels; Iterative decoding; Signal to noise ratio; Turbo codes; Viterbi algorithm; Parallel concatenation; Rate of Signal to Noise (Eb/N0); Turbo code; constraint length;

fLanguage

English

Publisher

ieee

Conference_Titel

Information and Communication Technologies, 2006. ICTTA '06. 2nd

Conference_Location

Damascus

Print_ISBN

0-7803-9521-2

Type

conf

DOI

10.1109/ICTTA.2006.1684696

Filename

1684696