Low Complexity SOVA for Turbo Codes

Recently, trimming Soft-output Viterbi algorithm（T-SOVA） has been proposed to reduce the complexity of SOVA for Turbo codes. In its fi rst stage, a dynamic algorithm, lazy Viterbi algorithm, is used to indicate the minimal metric differences which brings obstacle on hardware implementation. This pap...

Full description

Saved in:
Bibliographic Details
Published in:China communications 2017-08, Vol.14 (8), p.33-40
Main Authors: Pei, Ruilin, Wang, Zulin, Huang, Qin, Wang, Jiaqing
Format: Article
Language:English
Subjects:
Complexity theory
Hardware
hardware implementation
local sorting
Measurement
Simulation
Sorting
SOVA
Turbo codes
Turbo码
Viterbi algorithm
仿真结果
动态算法
复杂度分析
最大似然
硬件实现
译码复杂度
软输出维特比算法
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Recently, trimming Soft-output Viterbi algorithm（T-SOVA） has been proposed to reduce the complexity of SOVA for Turbo codes. In its fi rst stage, a dynamic algorithm, lazy Viterbi algorithm, is used to indicate the minimal metric differences which brings obstacle on hardware implementation. This paper proposes a Viterbi algorithm（VA） based T-SOVA to facilitate hardware implementation. In the first stage of our scheme, a modified VA with regular structure is used to fi nd the maximum likelihood（ML） path and calculate the metric differences. Further, local sorting is introduced to trim the metric differences, which reduces the complexity of trimming operation. Simulation results and complexity analysis show that VA based T-SOVA performs as well as lazy VA based T-SOVA and is easier to be applied to hardware implementation.
ISSN:1673-5447
DOI:10.1109/CC.2017.8014345