A bidirectional multiple stack algorithm

作     者：Li, KP Kallel, S 

作者机构：Univ British Columbia Dept Elect & Comp Engn Vancouver BC V6T 1Z4 Canada 

出 版 物：《IEEE TRANSACTIONS ON COMMUNICATIONS》 (IEEE Trans Commun)

年 卷 期：1999年第47卷第1期

页      面：6-9页

核心收录：

学科分类：0810[工学-信息与通信工程] 0808[工学-电气工程] 08[工学] 

基　　金：Natural Sciences and Engineering Research Council of Canada  NSERC 

主　　题：bidirectional sequential decoding stack algorithm 

摘      要：Bidirectional sequential decoding (BSD) substantially reduces the computational variability of conventional sequential decoding without compromising the error performance. However. BSD does not completely eliminate the erasure problem, We propose in this paper an erasure-free decoding algorithm which combines the idea of BSD in conjunction with that of the multiple stack algorithm (MSA). It is found that the nerv bidirectional multiple stack algorithm (BMSA) offers substantial advantages over the MSA in terms of computational effort, memory requirements, and error performance. The BMSA appears as an attractive alternative to the Viterbi Algorithm (VA) where low error probabilities and high decoding speeds are required.