Multiplierless approximation of transforms with adder constraint

This letter describes an algorithm for systematically finding a multiplierless approximation of transforms by replacing floating-point multipliers with VLSI-friendly binary coefficients of the form k/2ⁿ. Assuming the cost of hardware binary shifters is negligible, the total number of binary adders employed to approximate the transform can be regcarrier as an index of complexity. Because the new algorithm is more systematic and faster than trial-and-error binary approximations with adder constraint, it is a much more efficient design tool. Furthermore, the algorithm is not limited to a specific transform; various approximations of the discrete cosine transform are presented as examples of its versatility.