IMPROVED BIT-REVERSAL ALGORITHM FOR THE FAST FOURIER TRANSFORM.

Research output: Contribution to journalConference articlepeer-review

12 Scopus citations

Abstract

The recording effect of the fast Fourier transform is considered which requires that the elements of the data array be permuted by bit-reversing the array index. The bit-reversal algorithm given by B. Gold and C. M. Rader (1969) is referred to. Several improvements are made to this algorithm that result in improved efficiency. A closed-form expression is derived for the largest index that must be bit-reversed. A computational analysis is given, comparing the original and modified algorithms.

Original languageEnglish (US)
Pages (from-to)1407-1410
Number of pages4
JournalICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
StatePublished - Jan 1 1988
Externally publishedYes

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'IMPROVED BIT-REVERSAL ALGORITHM FOR THE FAST FOURIER TRANSFORM.'. Together they form a unique fingerprint.

Cite this