By Topic

An efficient conflict-free parallel memory access scheme for dual-butterfly constant geometry radix-2 FFT processor

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ji-yang Yu ; Radar Res. Lab., Beijing Inst. of Technol., Beijing ; Yang Li

In this paper, a parallel access scheme for dual-butterfly constant geometry radix-2 Fast Fourier Transform (FFT) algorithm is proposed. According to the constant geometry, the proposed method in this paper utilizes the Least Significant Bit (LSB) and the Most Significant Bit (MSB) of the data counter to decrease the computational complexity of the address generation for reads and writes. It allows simultaneous access to the 4 operands needed for the dual parallel butterfly calculations, so it only costs (N/4)*log2(N) clock periods for calculating a N complex point radix-2 FFT or IFFT in hardware implementation. For every stage has the same architecture, it also enhances the implement flexibility of the FFT algorithm.

Published in:

Signal Processing, 2008. ICSP 2008. 9th International Conference on

Date of Conference:

26-29 Oct. 2008