The determination of the searching sequence for VQ encoding
Most VQ encoding algorithms are proposed to reject codewords or stop searching codewords as soon as possible by using various criteria. This paper proposes an algorithm to dynamically determine the codeword searching sequence for a given input vector, which can further improve the codeword elimination efficiency. An encoding algorithm is also proposed based on this idea.<<ETX>>