Fast Sequential Decoding Algorithm Using a Stack
F. Jelinek · IBM Journal of Research and Development · 1969
In this paper a new sequential decoding algorithm is introduced that uses stack storage at the receiver. It is much simpler to describe and analyze than the Fano algorithm, and is about six times faster than the latter at transmission rates equal to Rcomp, the rate below which the average number of decoding steps is bounded by a constant. Practical problems connected with implementing the stack algorithm are discussed and a scheme is described that facilitates satisfactory performance even with limited stack storage capacity. Preliminary simulation results estimating the decoding effort and the needed stack size are presented.
Cited by 541 works. doi:10.1147/rd.136.0675
Authors
References
- Principles of Communication Engineering
- A heuristic discussion of probabilistic decoding
- A lower bound to the distribution of computation for sequential decoding
- Sequential decoding for reliable communication
- A hybrid sequential and algebraic decoding scheme
- An upper bound on moments of sequential decoding effort
- Successive decoding scheme for memoryless channels
- Practical sequential decoding and a simple hybrid scheme.