Use of the Viterbi algorithm to compute error events of trellis phase coding in order of increasing distance
- 1 January 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 36 (10) , 1166-1170
- https://doi.org/10.1109/26.7535
Abstract
The use of the Viterbi algorithm to evaluate the minimum-distance parameters of trellis phase codes is extended to evaluate distances and paths of error events other than the free-distance event. Distances and paths are found for error events sequentially in order of increasing distance, starting with the free-distance event. Memory requirements increase slowly with the number of error events required. The time taken to find the next error event increases slowly with the number of error events already found. Results of sample calculations and computation times are included. >Keywords
This publication has 6 references indexed in Scilit:
- Digital Phase ModulationPublished by Springer Nature ,1986
- Convolutional Coding Combined with Continuous Phase ModulationIEEE Transactions on Communications, 1985
- An improved algorithm for evaluating trellis phase codes (Corresp.)IEEE Transactions on Information Theory, 1984
- Symbol Error Probability Bounds for Coherently Viterbi Detected Continuous Phase Modulated SignalsIEEE Transactions on Communications, 1981
- Continuous Phase Modulation--Part I: Full Response SignalingIEEE Transactions on Communications, 1981
- The viterbi algorithmProceedings of the IEEE, 1973