INTERSPEECH 2008
9th Annual Conference of the International Speech Communication Association

Brisbane, Australia
September 22-26, 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

Siemens Corporate Technology India, India

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.

Full Paper

Bibliographic reference.  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", In INTERSPEECH-2008, 44.