Design of a fast sequential decoding algorithm based on dynamic searching strategy

Wen Wei Yang*, Li Fu Jeng, Chen-Yi Lee

*此作品的通信作者

研究成果: Conference article同行評審

2 引文 斯高帕斯(Scopus)

摘要

This paper presents a new sequential decoding algorithm based on dynamic searching strategy to improve decoding efficiency. The searching strategy is to exploit both sorting and path recording techniques. By means of sorting, we can identify the correct path in a very fast way and then, by path recording, we can recover the bit sequence without degrading decoding performance. We also develop a conditional resetting scheme to overcome the buffer overflow problem encountered in conventional sequential decoding algorithms. Simulation results show that for a given code, decoding efficiency remains the same as that obtained from maximum likelihood function by appropriately selecting sorting length and decoding depth. In addition, this algorithm can be mapped onto an area-efficient VLSI architecture to implement long constraint length convolutional decoders for high-speed digital communications.

原文English
文章編號409131
頁(從 - 到)165-168
頁數4
期刊Proceedings - IEEE International Symposium on Circuits and Systems
3
DOIs
出版狀態Published - 30 五月 1994
事件Proceedings of the 1994 IEEE International Symposium on Circuits and Systems. Part 3 (of 6) - London, England
持續時間: 30 五月 19942 六月 1994

指紋

深入研究「Design of a fast sequential decoding algorithm based on dynamic searching strategy」主題。共同形成了獨特的指紋。

引用此