By Topic

High Performance Algorithm for Twiddle Factor of Variable-size FFT Processor and its Implementation

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)
Liu Hongxia ; Xi''an Microelectron. Technol. Inst., Xi''an, China ; Huang Shitan

This paper presents a new storage and address accessing scheme of twiddle factors based on Multi-bank memory architecture. It makes the three twiddle factors needed by a mixed-radix 4/2 butterfly operation can be accessed simultaneously. It also makes it possible to design a variable-size FFT processor with only one three-bank twiddle factor lookup table which is advantageous over those other existing algorithms that need double of it. The algorithm proposed can be implemented with only one shift register and an accumulator. In addition, the access number of one of the three banks and its size are reduced by half. Therefore, its implementation is low complexity and area saving.

Published in:

Industrial Control and Electronics Engineering (ICICEE), 2012 International Conference on

Date of Conference:

23-25 Aug. 2012