Sequential Coding Algorithms: A Survey and Cost Analysis
John T Anderson, Seshadri Mohan · IRE Transactions on Communications Systems · 1984
The cost of a number of sequential coding search algorithms is analyzed in a systematic manner. These algorithms search code trees, and find use in data compression, error correction, and maximum likelihood sequence estimation. The cost function is made up of the size of and number of accesses to storage. It is found that algorithms that utilize sorting are much more expensive to use than those that do not; metric-first searching regimes are less efficient than breadth-first or depth-first regimes. Cost functions are evaluated using experimental data obtained from data compression and error correction studies.
Cited by 548 works. doi:10.1109/tcom.1984.1096023
Authors
References
- The Art of Computer Programming
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- The Art of Computer Programming
- Fast Sequential Decoding Algorithm Using a Stack
- Design of a linguistic statistical decoder for the recognition of continuous speech
- The contour extraction problem with biomedical applications
- Adaptive Tree Encoding of Speech at 8000 Bits/s with a Frequency-Weighted Error Criterion
- A 2-cycle algorithm for source coding with a fidelity criterion
- Adaptive Delta Modulation with Delayed Decision
- Generalized stack algorithms for decoding convolutional codes