An Improved FFT Digit-Reversal Algorithm

Jeffrey J. Rodriguez

doi:10.1109/29.31281

An Improved FFT Digit-Reversal Algorithm

Jeffrey J. Rodriguez

Research output: Contribution to journal › Article › peer-review

17 Scopus citations

Abstract

In this correspondence, several improvements are made to the bit-reversal algorithm of Gold and Rader. The savings in computation are obtained by observing that not all indexes need to be reversed. In particular, a closed-form expression is derived for the largest index that must be digit-reversed (for an arbitrary radix). A computational analysis is given, comparing the original and modified algorithms.

Original language	English (US)
Pages (from-to)	1298-1300
Number of pages	3
Journal	IEEE Transactions on Acoustics, Speech, and Signal Processing
Volume	37
Issue number	8
DOIs	https://doi.org/10.1109/29.31281
State	Published - Aug 1989
Externally published	Yes

ASJC Scopus subject areas

Signal Processing

Access to Document

10.1109/29.31281

Cite this

@article{2b7aa0104f1b48f89d044cd7285b91f7,

title = "An Improved FFT Digit-Reversal Algorithm",

abstract = "In this correspondence, several improvements are made to the bit-reversal algorithm of Gold and Rader. The savings in computation are obtained by observing that not all indexes need to be reversed. In particular, a closed-form expression is derived for the largest index that must be digit-reversed (for an arbitrary radix). A computational analysis is given, comparing the original and modified algorithms.",

author = "Rodriguez, {Jeffrey J.}",

year = "1989",

month = aug,

doi = "10.1109/29.31281",

language = "English (US)",

volume = "37",

pages = "1298--1300",

journal = "IEEE Transactions on Acoustics, Speech, and Signal Processing",

issn = "0096-3518",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "8",

}

TY - JOUR

T1 - An Improved FFT Digit-Reversal Algorithm

AU - Rodriguez, Jeffrey J.

PY - 1989/8

Y1 - 1989/8

N2 - In this correspondence, several improvements are made to the bit-reversal algorithm of Gold and Rader. The savings in computation are obtained by observing that not all indexes need to be reversed. In particular, a closed-form expression is derived for the largest index that must be digit-reversed (for an arbitrary radix). A computational analysis is given, comparing the original and modified algorithms.

AB - In this correspondence, several improvements are made to the bit-reversal algorithm of Gold and Rader. The savings in computation are obtained by observing that not all indexes need to be reversed. In particular, a closed-form expression is derived for the largest index that must be digit-reversed (for an arbitrary radix). A computational analysis is given, comparing the original and modified algorithms.

UR - http://www.scopus.com/inward/record.url?scp=0024715383&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024715383&partnerID=8YFLogxK

U2 - 10.1109/29.31281

DO - 10.1109/29.31281

M3 - Article

AN - SCOPUS:0024715383

SN - 0096-3518

VL - 37

SP - 1298

EP - 1300

JO - IEEE Transactions on Acoustics, Speech, and Signal Processing

JF - IEEE Transactions on Acoustics, Speech, and Signal Processing

IS - 8

ER -

An Improved FFT Digit-Reversal Algorithm

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this