Multicriterial Optimization Approach to Eliminating Multiplications

Widely used image compression algorithms, such as discrete cosine transform (DCT), can be described as applying a linear operator to a vector of samples. This is computationally quite complex and a number of algorithms have been developed to minimize the number of necessary operations, particularly multiplies. This paper describes a method to find approximations of the remaining multiplication constants in these algorithms, such that the approximation error is minimized for each substitution of multiplications by shifts and adds