A lower-complexity Viterbi algorithm

Sarvar Patel. A lower-complexity Viterbi algorithm. In 1995 International Conference on Acoustics, Speech, and Signal Processing, ICASSP '95, Detroit, Michigan, USA, May 08-12, 1995. pages 592-595, IEEE Computer Society, 1995. [doi]

@inproceedings{Patel95-1,
  title = {A lower-complexity Viterbi algorithm},
  author = {Sarvar Patel},
  year = {1995},
  doi = {10.1109/ICASSP.1995.479667},
  url = {http://doi.ieeecomputersociety.org/10.1109/ICASSP.1995.479667},
  researchr = {https://researchr.org/publication/Patel95-1},
  cites = {0},
  citedby = {0},
  pages = {592-595},
  booktitle = {1995 International Conference on Acoustics, Speech, and Signal Processing, ICASSP '95, Detroit, Michigan, USA, May 08-12, 1995},
  publisher = {IEEE Computer Society},
  isbn = {0-7803-2431-5},
}