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

Guan Henry Lin*, Tsern-Huei Lee

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

Abstract

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.

Original languageEnglish
Pages360-365
Number of pages6
StatePublished - 27 Jun 2005
EventProceedings - 6th World Wireless Congress, WWC - San Francisco, CA, United States
Duration: 25 May 200527 May 2005

Conference

ConferenceProceedings - 6th World Wireless Congress, WWC
CountryUnited States
CitySan Francisco, CA
Period25/05/0527/05/05

Fingerprint Dive into the research topics of 'A novel memory-saving technique of viterbi decoder for feedforward convolutional coding'. Together they form a unique fingerprint.

Cite this