Iterative decoding of q-ary product turbo codes in FFH-CDMA systems

Author

Nascimento, Vagner Vale do ; Portugheis, Jaime ; Cunha, Daniel Carvalho da

Author_Institution

Sch. of Electr. & Comput. Eng., State Univ. of Campinas, Campinas

fYear

2008

fDate

6-9 July 2008

Firstpage

121

Lastpage

125

Abstract

This paper presents a study about q-ary product turbo codes applied to FFH-CDMA systems. A method to implement the q-ary soft decoding is proposed. First, an adaptation of Chase decoding algorithm to satisfy q-ary symbols requirements is developed. The adaptation does not significantly increase decoding complexity when compared to the binary algorithm. Second, a modification of iterative (turbo) decoding allows appropriate feedback of decoded q-ary symbols and their reliabilities in each decoder iteration. Simulation results indicate a good performance/complexity trade-off of the q-ary turbo coded system when compared to other previous proposed systems.

Keywords

code division multiple access; computational complexity; iterative decoding; product codes; turbo codes; Chase decoding algorithm; FFH-CDMA system; binary algorithm; decoding complexity; g-ary soft decoding; iterative decoding; q-ary product turbo codes; AWGN; Channel capacity; Detectors; Fading; Feedback; Frequency conversion; Iterative algorithms; Iterative decoding; Turbo codes; Viterbi algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Signal Processing Advances in Wireless Communications, 2008. SPAWC 2008. IEEE 9th Workshop on

Conference_Location

Recife

Print_ISBN

978-1-4244-2045-2

Electronic_ISBN

978-1-4244-2046-9

Type

conf

DOI

10.1109/SPAWC.2008.4641582

Filename

4641582