A fast encoding algorithm for vector quantization

In this letter, we present a fast encoding algorithm for vector quantization that uses two characteristics of a vector, mean, and variance. Although a similar method using these features was already proposed, it handles these features separately, On the other hand, the proposed algorithm utilizes these features simultaneously to save computation time all the more. Since the proposed algorithm rejects those codewords that are impossible to be the nearest codeword, it produces the same output as the conventional full search algorithm. The simulation results confirm the effectiveness of the proposed algorithm.