DocumentCode :
3589524
Title :
An effective simplifying scheme for Viterbi decoder
Author :
Peng, Zhang ; Guangguo, Bi ; Xiaohu, You
Volume :
2
fYear :
2004
Firstpage :
1363
Abstract :
A new reduced-state decoding method is presented. The method constructs state-sets, then classifies, compares, and selects states through certain rules based on a Viterbi algorithm (VA). The decoder complexity is reduced to increasing linearly with constraint-length, as compared to the VA whose complexity increases exponentially with constraint-length. Simulation results show the method significantly simplifies the VA at the cost of certain coding gain. It has several advantages such as simple implementation, easy programming and fast computation speed.
Keywords :
Viterbi decoding; computational complexity; digital communication; maximum likelihood sequence estimation; set theory; Viterbi algorithm; Viterbi decoder; constraint-length; decoder complexity; digital communication systems; maximum likelihood sequence estimation; reduced-state decoding method; state-sets; Bismuth; Computational modeling; Convolutional codes; Costs; Euclidean distance; Maximum likelihood decoding; Maximum likelihood estimation; Shift registers; State estimation; Viterbi algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Vehicular Technology Conference, 2004. VTC2004-Fall. 2004 IEEE 60th
ISSN :
1090-3038
Print_ISBN :
0-7803-8521-7
Type :
conf
DOI :
10.1109/VETECF.2004.1400246
Filename :
1400246
Link To Document :
بازگشت