z-logo
open-access-imgOpen Access
Low Power and High Performance Structures for Fast Fourier Transform Processor
Author(s) -
Anwar Bhasha,
M. Madhavi
Publication year - 2015
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/ijca2015907619
Subject(s) - computer science , power (physics) , fourier transform , fast fourier transform , parallel computing , discrete fourier transform (general) , short time fourier transform , algorithm , fourier analysis , mathematics , mathematical analysis , physics , quantum mechanics
Fast Fourier Transform (FFT) being the most important block in many signal processing and communication systems, consumes more power due to its huge computational complexity. Hence, low power design for FFT hardware gains the focus of researchers now-a-days. There are many algorithms and architectures proposed in the literature to achieve lower computational complexity and power dissipation. In this work, some of the best suitable algorithms and architectures for hardware implementation are analyzed in terms of complexity, speed and power consumption by using Xilinx ISE tools and proposed a low power and high performance architecture and algorithm combination for FFT computations.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom