Bound for Minkowski metric or quadratic metric applied to VQ codeword 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 L(1) metric to L(n) metric. This bound can also be extended to a quadratic metric which can be applied to the hidden Markov model with Gaussian mixture probability density function.