Total: 1
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.