By Topic

Address generators for mapping arrays in bit-reversed order

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
$33 $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)
T. R. Harley ; Texas Instrum.' VoIP Group, Germantown, MD, USA ; G. P. Maheshwaramurthy

A new technique enables fast Fourier transform (FFT) software to more efficiently use memory and processing time. The technique is used to design address pair generators for mapping an array in bit-reversed order. For exemplary digital signal processing (DSP) processors, in-place bit-reversed mappings based on the new technique were found to often have better computational efficiency than an out-of-place mapping.

Published in:

IEEE Transactions on Signal Processing  (Volume:52 ,  Issue: 6 )