By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Woo Tae Kim ; Sch. of Electron. & Electr. Eng., Kyungpook Nat. Univ., Taegu, South Korea ; Sang Jae Bae ; Seog Geun Kang ; Eon Kyeong Joo

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

Published in:

Global Telecommunications Conference, 2000. GLOBECOM '00. IEEE  (Volume:3 )

Date of Conference:

2000