摘要 |
The traceback operation for a Viterbi algorithm can be minimized by producing optimal path values for each state in the trellis, and updating the optimal path values at each state for each symbol. The optimal path value can be used to quickly determine the output values for the system without requiring a traceback which would typically require a memory read for each transmitted symbol.
|