Tree-Search Decoding Using Reduced-Size Stacks
Journal
Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018
Pages
511-515
Date Issued
2019
Author(s)
Abstract
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.
SDGs
Type
conference paper