By Topic

The Symmetric Group in Data Permutation, With Applications to High-Bandwidth Pipelined FFT Architectures

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

1 Author(s)
Parsons, A. ; Univ. of California, Berkeley, CA

We have developed an efficient architecture for permuting data streams in-place based on properties of the symmetric group in abstract algebra. This architecture uses half the memory of a conventional double-buffering architecture with only a modest increase in addressing logic. The flexibility and efficiency of this permuter has enabled the development of an automatic generator of streaming Fast Fourier Transform (FFT) architectures capable of handling a configurable number of time samples in parallel. These architectures achieve 100% multiplier utilization efficiency, and require only 25% more buffering than the theoretical minimum for normal-ordered frequency output. We present parametrized generators of these permutation and FFT architectures in an open-source library targeting field programmable gate arrays.

Published in:

Signal Processing Letters, IEEE  (Volume:16 ,  Issue: 6 )