Tree-Search Decoding with Path Constraints for Linear Block Codes
Journal
IEEE Wireless Communications and Networking Conference (WCNC)
Pages
753-757
Date Issued
2014-04
Author(s)
Abstract
The A* algorithm is an efficient method for decoding short linear block code based on tree search. However, it may suffer very long decoding latency in the worst-case channel condition. In this paper, we propose to apply some restrictions on the Hamming weights of search paths in the tree-search decoding. Simulation results show that with proper selection of path constraints in the A* algorithm, the worst-case decoding complexity (or latency) can be significantly reduced with only slight sacrifice of the bit error rates.
Type
conference paper