Performance of turbo codes with short frame sizes

Author

Koorapaty, Havish ; Wang, Yi-Pin Eric ; Balachandran, Kumar

Author_Institution

Ericsson Inc., Research Triangle Park, NC, USA

Volume

1

fYear

1997

fDate

4-7 May 1997

Firstpage

329

Abstract

Parallel concatenated convolutional codes (turbo codes) have been shown to yield very good performance for long block sizes. We consider the applicability of such codes to practical mobile communication scenarios, where block sizes for speech or control functions are typically short. We compare the performance of turbo codes with convolutional codes that incur similar decoding complexity. For representative cases, we show that convolutional coding performs better than turbo coding when frame sizes are below a threshold

Keywords

Gaussian channels; Rayleigh channels; Viterbi decoding; computational complexity; concatenated codes; convolutional codes; land mobile radio; maximum likelihood decoding; AWGN channels; Rayleigh fading channels; Viterbi decoding; decoding complexity; maximum likelihood decoding; mobile communication; parallel concatenated convolutional codes; short frame sizes; turbo codes; Concatenated codes; Convolutional codes; Error correction; Fading; Iterative decoding; Maximum likelihood decoding; Mobile communication; Size control; Speech coding; Turbo codes;

fLanguage

English

Publisher

ieee

Conference_Titel

Vehicular Technology Conference, 1997, IEEE 47th

Conference_Location

Phoenix, AZ

ISSN

1090-3038

Print_ISBN

0-7803-3659-3

Type

conf

DOI

10.1109/VETEC.1997.596374

Filename

596374