A novel memory-saving technique of viterbi decoder for feedforward convolutional coding

Guan Henry Lin*, Tsern-Huei Lee

*Corresponding author for this work

研究成果: Paper同行評審

摘要

Viterbi Algorithm(VA) has been invented for decades as the decoder of Convolution code. It helps reduce the computational complexity required to search for maximum likelihood signal sequence. Though VA could be used generally, people nowadays still try hard to improve it in two aspects. One is efficiency and the other is memory size. For the former, parallel hardware is introduced to block- process received signal sequence. The disadvantage of various methods in this category is mainly on the increase of hardware. As for the later problem, windowed TBM is developed to reduce the memory size which is used to store all the possible survival paths. The presence of windowed TBM is due to the finding of common tail. It is popularly applied and is considered as the minimal required memory length. However, for the general feedforward convolutional coders, there are some innate characteristics that we could use to improve both of the mentioned aspects. On one hand, efficiency could be slightly improved without adding extra hardware. On the other hand and most important of all, further reduction of the required memory length could be obtained to the extent that is several times smaller than length of the common tail. We name this technique as BW-TBM.

原文English
頁面360-365
頁數6
出版狀態Published - 27 六月 2005
事件Proceedings - 6th World Wireless Congress, WWC - San Francisco, CA, United States
持續時間: 25 五月 200527 五月 2005

Conference

ConferenceProceedings - 6th World Wireless Congress, WWC
國家United States
城市San Francisco, CA
期間25/05/0527/05/05

指紋 深入研究「A novel memory-saving technique of viterbi decoder for feedforward convolutional coding」主題。共同形成了獨特的指紋。

引用此