Path deletions for finite stack-size sequential-type decoding algorithms

Chen Yi Wang*, Shin Lin Shieh, Po-Ning Chen, Yunghsiang S. Han

*此作品的通信作者

研究成果: Conference contribution同行評審

摘要

In this work, we focus on a specific practical constraint on sequential-type decoding algorithms, that is, finite stack size. Under such a practical constraint, the path deletion policy that is required when the stack exceeds its upper limit becomes essential in performance and decoding complexity. We then examined several path deletion schemes for sequential-type decoding algorithms that can produce decoding outputs in an on-the-fly fashion. Our result indicates that path deletion based on Fano metric in most cases can achieve better performance when the memory saving is critical in system design. In case the decoding process is allowed to start after the reception of the entire received word, we proposed an alternative path deletion scheme based on a two-pass decoding structure, in which the backward pass estimates the heuristic function in terms of the M-algorithm for use of the forward decoding search. As the M-algorithm can be hardware-implemented, only the computational complexity of the forward pass is accounted. Simulation results show that the computational complexity of the forward pass not only outperforms the stack algorithm with Fano metric but is smaller than that of the two-pass super-code decoder proposed in [9].

原文English
主出版物標題ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications
頁面757-761
頁數5
DOIs
出版狀態Published - 1 12月 2010
事件2010 20th International Symposium on Information Theory and Its Applications, ISITA 2010 and the 2010 20th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA 2010 - Taichung, Taiwan
持續時間: 17 10月 201020 10月 2010

出版系列

名字ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications

Conference

Conference2010 20th International Symposium on Information Theory and Its Applications, ISITA 2010 and the 2010 20th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA 2010
國家/地區Taiwan
城市Taichung
期間17/10/1020/10/10

指紋

深入研究「Path deletions for finite stack-size sequential-type decoding algorithms」主題。共同形成了獨特的指紋。

引用此