Paper Info
Title
Complexity Reduction of Convolutional and Turbo Decoding Based on Reliability Thresholds
Abstract
In this paper we propose a method that aims at reducing the complexity of convolutional and turbo decoding. Some calculations performed in decoding processing can be eliminated based on reliability thresholds. For convolutional and turbo decoding, the complexity is proportional to the number of branches in the trellis. For convolutional decoding, based on the Viterbi algorithm, we define reliability thresholds for the received samples of the signal and show that is possible to eliminate some branches in the trellis and consequently to reduce the complexity. For turbo decoding based on MAP algorithm, we set a threshold to classify each information bit log likelihood ratio (LLR). When the LLR is reliable, we take a decision on information bits and eliminate some branches in the trellis. Furthermore, we also define a criterion for stopping decoding wich further reduces the complexity. In this paper we show that it is possible to reduce decoding complexity of convolutional codes almost 80 % without performance degradation when compared to Viterbi algorithm over Rayleigh fading channels. In turbo decoding, we show that complexity varies with $${E_{b}}/{N_{0}}$$Eb/N0 and it is reduced when more iterations are computed, tending to zero for higher iterations.
Year
DOI
Venue
2015
10.1007/s11277-015-2282-9
Wireless Personal Communications
Keywords
Field
DocType
Convolutional codes,Turbo codes,Complexity reduction
Convolutional code,Sequential decoding,Computer science,Serial concatenated convolutional codes,Turbo code,Reduction (complexity),Real-time computing,Decoding methods,List decoding,Viterbi algorithm
Journal
Volume
Issue
ISSN
82
3
0929-6212
Citations 
PageRank 
References 
1
0.35
9
Authors
2
Name
Order
Citations
PageRank
Luís Otávio Mataveli110.68
Celso Almeida236.47