By Topic

A novel method for storage architecture of pipeline 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

3 Author(s)
Ting Zhang ; Inst. of Microelectron., Beijing, China ; Lan Chen ; Yan Feng

This paper presents a new method to improve the storage architecture of the pipeline fast Fourier transform (FFT) processor. The main idea is interpreted as follows. The FFT butterfly calculation can operate with the same reading and writing address every time. In this case, each butterfly operation unit (BFU) can read and write on the same RAM at one time. Then the pipeline purpose is achieved by cyclically alternating the associated orders of BFUs and RAMs. Compared to the traditional project, this method can save almost 50% storage devices without sacrificing performance. It has been proven correct and feasible with the hardware design and verification.

Published in:

ASIC (ASICON), 2011 IEEE 9th International Conference on

Date of Conference:

25-28 Oct. 2011