Implementation of Fixed Point FFT(512,1K,2K,4K) on FPGA.pdf

None
Share this:
Embed*
Cite this:
Niazi, Adnan; Ambooken, Anoop (2012): Implementation of Fixed Point FFT(512,1K,2K,4K) on FPGA.pdf. figshare.
http://dx.doi.org/10.6084/m9.figshare.96996
Retrieved 09:57, Aug 29, 2014 (GMT)

Description

The fast Fourier transform (FFT) is one of the most widely used and important signal processing functions, for example, in applications related to digital communications and image processing. Since the computational complexity of the FFT is O(N log2N), where N the number of inputs, the FFT potentially requires multi-cycle processing, and can become a major bottleneck for overall system performance. To relieve this bottleneck, many commercial FPGA IP blocks provide a streaming form of the FFT with single-cycle-per-sample throughput. This high-throughput form of FFT comes by exploiting the locality of reference and massive parallelism offered by modern FPGA fabrics. Multiple butterflies can be easily implemented on the FPGA. The twiddle factors and the intermediates data samples can be stored either in block RAM or Distributed RAM or a combination of both. This completely eliminates the need for off chip memory access which may slow down the FFT considerably. This report descirbes the implementation of FFT on a Xilinx-6 FPGA.

Links

Comments (0)

You must be logged in to post comments.

Cite "Filename"

Place your mouse over the citation text to select it

Embed "Implementation of Fixed Point FFT(512,1K,2K,4K) on FPGA.pdf"

Place your mouse over the embed code to select and copy it

Claim article

You claim request was sent. I will be handled in the next 24 hours.

Close window

Feedback

We appreciate all your comments, questions, suggestions or gratitude.

Login

The username or password entered are wrong.

Reset password

Your password will be sent to your registered e-mail address.

Create account

I agree to the Terms & Conditions *