A MAP equivalent SOVA for non-binary turbo codes

Author

Tan, Jun ; Stüber, Gordon L.

Author_Institution

Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA

Volume

2

fYear

2000

fDate

2000

Firstpage

602

Abstract

An optimal MAP equivalent SOVA decoding algorithm and its simplified suboptimal algorithm for non-binary codes are proposed. The implementation of its suboptimal algorithm is simpler, while its performance is very close to the optimal log-MAP algorithm. The proposed SOVA can be used as a decoder for turbo trellis coded modulation (TTCM). Simulation results for both the proposed SOVA and the log-MAP algorithms for TTCM and binary turbo codes are presented. It is concluded that the proposed SOVA performs very close to the log-MAP algorithm for both the TTCM and binary turbo codes, and its performance is better than the conventional SOVA

Keywords

Viterbi decoding; binary codes; convolutional codes; decoding; iterative decoding; optimisation; trellis coded modulation; turbo codes; AWGN channel; MAP equivalent SOVA; TTCM; Viterbi decoding; binary turbo codes; iterative decoder; nonbinary turbo codes; optimal MAP equivalent SOVA decoding algorithm; optimal log-MAP algorithm; performance; pseudo-random interleavers; recursive systematic convolutional codes; simulation results; soft-output Viterbi algorithm; suboptimal algorithm; turbo trellis coded modulation; Concatenated codes; Convolutional codes; Degradation; Delay estimation; Interference; Iterative algorithms; Iterative decoding; Modulation coding; Turbo codes; Viterbi algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 2000. ICC 2000. 2000 IEEE International Conference on

Conference_Location

New Orleans, LA

Print_ISBN

0-7803-6283-7

Type

conf

DOI

10.1109/ICC.2000.853567

Filename

853567