Bit reversal in FFT from matrix viewpoint

Author

Biswas, Amitava

Author_Institution

Dept. of Mech. Eng., Indian Inst. of Technol., Kharagpur, India

Volume

39

Issue

6

fYear

1991

fDate

6/1/1991 12:00:00 AM

Firstpage

1415

Lastpage

1418

Abstract

The computation of a minimum and sufficient set of addresses, along with corresponding bit-reversed addresses, is necessary to do unscrambling in conventional FFT (fast Fourier transform) procedures. A matrix-based interpretation of this problem is presented, and typical software and hardware solutions are described. An overall relationship between the two sets of primary and secondary indices is shown, obviating any additional relationship at individual pairwise level. Although the algorithms have been discussed on radix-2 basis, they can be modified for a radix if necessary

Keywords

BASIC listings; computerised signal processing; digital arithmetic; fast Fourier transforms; mathematics computing; matrix algebra; BASIC program; FFT; bit reversal; bit-reversed addresses; computation; hardware; matrix viewpoint; primary indices; secondary indices; signal processing; software; unscrambling; High-resolution imaging; Holography; Image resolution; Microwave antenna arrays; Microwave imaging; Milling machines; Optical imaging; Radar imaging; Reflection; Ultrasonic imaging;

fLanguage

English

Journal_Title

Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

1053-587X

Type

jour

DOI

10.1109/78.136547

Filename

136547