Bound for Minkowski metric or quadratic metric applied to VQcodeword search

A bound for a Minkowski metric based on L_p distortion measure is proposed and evaluated as a means to reduce the computation in vector quantisation. This bound provides a better criterion than the absolute error inequality (AEI) elimination rule on the Euclidean distortion measure. For the Minkowski metric of order n, this bound contributes the elimination criterion from the L₁ metric to L _n metric. This bound can also be an extended quadratic metric which can be a hidden Markov model (HMM) with a Gaussian mixture probability density function (PDF). In speech recognition, the HMM with the Gaussian mixture VQ codebook PDF has been shown to be a promising method