DocumentCode
3351395
Title
A fast algorithm to estimate the distance spectrum of turbo codes
Author
Scalise, Sandro ; Bae, Young-Jik Ko ; Ernst, Harald
Author_Institution
DLR, Wessling, Germany
Volume
1
fYear
2003
fDate
23 Feb.-1 March 2003
Firstpage
90
Abstract
The computational complexity required by the complete calculation of the distance spectrum of turbo codes, even limited to low weight input sequences, makes it too slow for practical purposes such as interleaver optimization or effective bit error rate bounding. A fast algorithm for distance spectrum estimation purposes is presented. A comparison with complete computed spectra, theoretically derived spectra and results from previous works are presented for both deterministic and uniform interleavers.
Keywords
computational complexity; error statistics; parameter estimation; turbo codes; BER; bit error rate bounding; computational complexity; distance spectrum estimation; interleaver optimization; low weight input sequences; turbo codes; Bit error rate; Computational complexity; Convolution; Convolutional codes; Decoding; Hamming distance; Signal to noise ratio; Spectral analysis; Telephony; Turbo codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Telecommunications, 2003. ICT 2003. 10th International Conference on
Print_ISBN
0-7803-7661-7
Type
conf
DOI
10.1109/ICTEL.2003.1191183
Filename
1191183
Link To Document