.png){kind=icon}
.png){kind=icon}
Return
A bidirectional multiple stack algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/26.747805.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
bidirectional
sequential decoding
stack algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
No organization information available