Abstract
Most commonly used algorithms in digital signal processing are Fast Fourier Transform (FFT) and Inverse Fast Fourier Transform (IFFT). In FFT butterfly unit is the basic unit which contains components like multipliers and adders. Implementing these components plays a very tough role in designing of butterfly structure. To increase the performance of FFT further an approximate radix-8 Booth multiplier using approximate full recoding adder and Kogge-Stone adder is proposed. By using proposed multiplier performance of the FFT is increased by 20 %. When compared with conventional FFT using normal radix-8 booth multiplier.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
