Abstract
Fast Fourier transform (FFT) is an efficient algorithm to calculate Discrete Fourier Transform (DFT) and its inverse. A wide variety of applications like Digital Signal processing and image processing rely heavily on it. The FFT computation is done by the FFT processors and its design is a key factor for the application. The proposed design implements a radix-4 FFT processor, which incorporates a low power commutator and a Butterfly structure without a multiplier. The parallel pipe lined architecture of the processor also has higher throughput with lowered power consumption.
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.
