DocumentCode :
2730061
Title :
Chebyshev inequality based max* approximation for reduced complexity decoding of turbo TCM
Author :
Sybis, Michal
Author_Institution :
Poznan Univ. of Technol., Poznan, Poland
fYear :
2010
fDate :
6-10 Sept. 2010
Firstpage :
265
Lastpage :
269
Abstract :
A reduced-complexity modified decoding algorithm for turbo trellis-coded modulation (TTCM) is proposed and evaluated in terms of complexity and bit error rate (BER) performance in an additive white Gaussian noise (AWGN) channel. A novel method is derived from the Chebyshev inequality. In this approach, the max* operation is performed on n≥2 arguments, thus the recursive calculations are avoided and a significant reduction in the number of operations performed per decoding step, as compared with the conventional Log-MAP, is achieved. Computer simulated BER performance evaluation results and complexity comparison are reported showing the near-optimal performance as well as noticeable implementation advantages of the proposed algorithms with respect to the Log-MAP decoding.
Keywords :
AWGN channels; Chebyshev approximation; decoding; error statistics; maximum likelihood decoding; recursive estimation; trellis coded modulation; turbo codes; AWGN channel; BER; Chebyshev inequality; Log-MAP decoding; additive white Gaussian noise; bit error rate; complexity; reduced complexity decoding; turbo TCM; turbo trellis-coded modulation; Approximation methods; Decoding; Jacobian matrices; Log-MAP algorithm; Turbo TCM; decoding algorithms; max* operator; reduced-complexity algorithms;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Turbo Codes and Iterative Information Processing (ISTC), 2010 6th International Symposium on
Conference_Location :
Brest
Print_ISBN :
978-1-4244-6744-0
Electronic_ISBN :
978-1-4244-6745-7
Type :
conf
DOI :
10.1109/ISTC.2010.5613853
Filename :
5613853
Link To Document :
بازگشت