ISCA Archive Interspeech 2008
ISCA Archive Interspeech 2008

Low complexity near-optimal unit-selection algorithm for ultra low bit-rate speech coding based on n-best lattice and Viterbi search

V. Ramasubramanian, D. Harish

We propose a low complexity unit-selection algorithm for ultra low bit-rate speech coding based on a first-stage N-best prequantization lattice and a second-stage run-length constrained Viterbi search to efficiently approximate the complete search space of the fully-optimal unit-selection algorithm recently proposed by us. By this, the proposed low complexity algorithm continues to be near-optimal in terms of rate-distortion performance while having highly reduced complexity.


Cite as: Ramasubramanian, V., Harish, D. (2008) Low complexity near-optimal unit-selection algorithm for ultra low bit-rate speech coding based on n-best lattice and Viterbi search. Proc. Interspeech 2008, 44

@inproceedings{ramasubramanian08_interspeech,
  author={V. Ramasubramanian and D. Harish},
  title={{Low complexity near-optimal unit-selection algorithm for ultra low bit-rate speech coding based on n-best lattice and Viterbi search}},
  year=2008,
  booktitle={Proc. Interspeech 2008},
  pages={44}
}