On the distribution of computation for sequential decoding using the stack algorithm
- 1 May 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 25 (3) , 323-331
- https://doi.org/10.1109/tit.1979.1056048
Abstract
An analytical procedure is presented for generating the computational distribution for the Zigangirov-Jelinek stack algorithm. Multitype branching processes are employed to develop a procedure for estimating sequential decoding computation, without the need for simulation, but with sufficient accuracy to be a valid design tool. At information rates about the cutoff rateR_{o}the calculated computational performance is virtually Identical to that obtained by time consuming simulations.Keywords
This publication has 11 references indexed in Scilit:
- Robustly optimal rate one-half binary convolutional codes (Corresp.)IEEE Transactions on Information Theory, 1975
- Certain infinite Markov chains and sequential decodingDiscrete Mathematics, 1972
- Variable-length codes and the Fano metricIEEE Transactions on Information Theory, 1972
- An Empirical Comparison of Two Sequential Decoding AlgorithmsIEEE Transactions on Communications, 1971
- Fast Sequential Decoding Algorithm Using a StackIBM Journal of Research and Development, 1969
- An upper bound on moments of sequential decoding effortIEEE Transactions on Information Theory, 1969
- A lower bound to the distribution of computation for sequential decodingIEEE Transactions on Information Theory, 1967
- The distribution of the sequential decoding computation timeIEEE Transactions on Information Theory, 1966
- A heuristic discussion of probabilistic decodingIEEE Transactions on Information Theory, 1963
- The Theory of Branching ProcessesPublished by Springer Nature ,1963