Abstract
Multiplication is one of the essential operations in Digital Signal Processing (DSP) applications like Fast Fourier Transform (FFT), Digital filters etc. Design of multiplier is done, considering the tradeoffs between low power and high speed. The Braun's multiplier is one of the parallel array multiplier which is used for unsigned numbers multiplication. The dynamic power and delay of the Braun multiplier can be reduced by using the bypassing techniques i.e. 1-dimensional and 2-dimensional bypassing. This paper presents a comparative study of different bypassing multipliers on basis of area, power and delay for 4×4, 8×8 and 16×16 bits in FPGA Spartan - 3E using Xilinx 12.4 ISE tool and Synopsys.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
