Cart (Loading....) | Create Account
Close category search window

Conflict-free parallel access scheme for mixed-radix FFT supporting I/O permutations

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)
Sorokin, H. ; Tampere Univ. of Technol., Tampere, Finland ; Takala, J.

FFT algorithms are inherently highly parallel and often require frequent access to memory indicating need for high memory bandwidth. Unfortunately, in-place FFT algorithms access data in specific data patterns, thus conflict-free parallel access calls for specialized access schemes. In this paper, we propose a conflict-free parallel access scheme for mixed-radix FFT computations, which supports not only the kernel computations but also I/O permutations of the FFT. The scheme supports all the sequence sizes of power-of-two and all the power-of-two numbers of memory modules. The implementation of the address generation unit is simple requiring only XOR gates and hardwiring.

Published in:

Acoustics, Speech and Signal Processing (ICASSP), 2011 IEEE International Conference on

Date of Conference:

22-27 May 2011

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.