A low-complexity, reduced-power Viterbi Algorithm

Pooran Singh, Jayasimha S R · 1999

We present two memory-, process- and power-efficient algorithmic transformations for the Viterbi Algorithm (VA). The first performs in-place computations reducing memory required and bit transitions on the data address bus, while the second simplifies the traceback routine of the VA.

Read the paper · More papers on PaperTik