Reduction of computational complexity in two-step SOVA decoder for turbo code

Author

Kim, Woo Tae ; Bae, Sang Jae ; Kang, Seog Geun ; Joo, Eon Kyeong

Author_Institution

Sch. of Electron. & Electr. Eng., Kyungpook Nat. Univ., Taegu, South Korea

Volume

3

fYear

2000

fDate

2000

Firstpage

1887

Abstract

A new two-step soft output Viterbi algorithm (SOVA) for turbo decoder with reduced decoding complexity is proposed and analyzed in this paper. Due to the algebraic structure of the proposed scheme, state and branch metrics can be obtained with parallel processing of matrix arithmetic. As a result, the number of multiplications to calculate state metrics of each stage can be decreased tremendously. Therefore, it can be expected that the proposed algebraic two-step SOVA decoder is suitable for applications in future mobile communication systems in which less computational complexity is essential

Keywords

Viterbi decoding; computational complexity; matrix algebra; turbo codes; algebraic decoder; branch metrics; computational complexity reduction; matrix arithmetic; mobile communication systems; parallel processing; soft output Viterbi algorithm; state metrics; turbo code; turbo decoder; two-step SOVA decoder; Arithmetic; Computational complexity; Decoding; Error correction codes; Explosives; Hardware; Mobile communication; Mobile computing; Turbo codes; Viterbi algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 2000. GLOBECOM '00. IEEE

Conference_Location

San Francisco, CA

Print_ISBN

0-7803-6451-1

Type

conf

DOI

10.1109/GLOCOM.2000.891961

Filename

891961