Summary
The 2018 International Symposium on Information Theory and Its Applications　(ISITA2018)
2018
Session Number:We-AM-1-1
Session:
Number:We-AM-1-1.5
Tree-Search Decoding Using Reduced-Size Stacks
Hsiang-Shun Shih, Chih-Shin Wang, Chia-Chun Chen, Mao-Chao Lin,
pp.543-547
Publication Date:2018/10/18
Online ISSN:2188-5079
DOI:10.34385/proc.55.We-AM-1-1.5
PDF download
Summary:
A? algorithm is a kind of tree search algorithm which aims to decode short block codes. In the A ? algorithm, a stack is needed to store the partially computed paths. The cost of maintaining the stack is very significant. As the size of the stack increases, the computation cost to maintain it will grow quadratically. In this paper, we propose methods which classify paths in the tree according to the deviation from the hard decision path to restrict the stack size. Such a design can reduce the needed stack size and meanwhile avoid the degradation of error performances.