New importance sampling methods for simulating sequential decoders
- 1 January 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 39 (5) , 1716-1722
- https://doi.org/10.1109/18.259665
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On the optimality and stability of exponential twisting in Monte Carlo estimationIEEE Transactions on Information Theory, 1993
- On large deviations theory and asymptotically efficient Monte Carlo estimationIEEE Transactions on Information Theory, 1990
- A new method for Viterbi decoder simulation using importance samplingIEEE Transactions on Communications, 1990
- On the distribution of the number of computations in any finite number of subtrees for the stack algorithm (Corresp.)IEEE Transactions on Information Theory, 1985
- A branching process analysis of the average number of computations of the stack algorithmIEEE Transactions on Information Theory, 1984
- An analysis of sequential decoding for specific time-invariant convolutional codesIEEE Transactions on Information Theory, 1978
- Convolutional codes III. Sequential decodingInformation and Control, 1974
- Variable-length codes and the Fano metricIEEE Transactions on Information Theory, 1972
- 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