Multiplierless approximation of transforms with adder constraint
IEEE Signal Processing Letters2002Vol. 9(11), pp. 344–347
Citations Over TimeTop 10% of 2002 papers
Abstract
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/sup n/. Assuming the cost of hardware binary shifters is negligible, the total number of binary adders employed to approximate the transform can be regarded 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.
Related Papers
- → A comparative study on adders(2017)62 cited
- → Efficient design of approximate adders for FPGAs(2023)1 cited
- → Low Power High Speed based Various Adder Architectures using SPST(2016)3 cited
- → Area Efficient Approximate Constant-or Adder(2021)
- → Design of an Accuracy Enhanced Imprecise Adder with Half Adder-based Approximation(2021)