The key idea of approximate computing is to trade off accuracy in computation, for better performance and energy efficiency. Many important applications such as, multimedia signal processing and image processing applications etc. can essentially tolerate inaccurate computation. Approximate com- putting has the ability to tolerate lack of accuracy and soft errors found in many applications to gain remarkable energy. It can provide considerable reductions in circuit complexity, delay, area and energy consumption by easing accuracy requirements. In this paper, we propose approximate multiplier design with 32-bits using Vedic multiplier and altered partial product, that demonstrate reduced area and shorter critical path delay than the conventional multiplier. The proposed design is analyzed using Xilinx.
Approximate computing, approximate multi- plier, approximate compressors, approximate adders.
IRE Journals:
Sulakshana W
"Design of Approximate Multiplier to Reduce Delay and Area" Iconic Research And Engineering Journals Volume 5 Issue 9 2022 Page 354-358
IEEE:
Sulakshana W
"Design of Approximate Multiplier to Reduce Delay and Area" Iconic Research And Engineering Journals, 5(9)