A relationship between the structures of the radix-2 DIT FHT and complex-valued FFT algorithms

Author

Bouguezel, Saad ; Ahmad, M. Omair ; Swamy, M.N.S.

Author_Institution

Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que., Canada

Volume

2

fYear

2004

Firstpage

1111

Abstract

By reformulating the existing radix-2 decimation-in-time (DIT) FHT and complex-valued FFT algorithms using an efficient index mapping, a close relationship between the two algorithms is established. A detailed comparison between the two algorithms is carried out. It is shown that these algorithms have similar structures and can be implemented using the same butterfly. In view of this relationship and the fact that the DHT is an efficient alternative to the DFT for real data, it should be possible to use a single software or hardware module to compute the DHT as well as the forward and inverse complex-valued DFTs.

Keywords

digital arithmetic; discrete Fourier transforms; discrete Hartley transforms; signal processing; DFT; DHT; butterfly; complex-valued FFT algorithms; digital signal processing; discrete Fourier transform; discrete Hartley transform; fast Fourier transform; fast Hartley transform; hardware module; radix-2 decimation-in-time FHT; software module; Algorithm design and analysis; Application software; Digital signal processing; Discrete Fourier transforms; Fast Fourier transforms; Fourier transforms; Hardware; Hydrogen; Signal processing algorithms;

fLanguage

English

Publisher

ieee

Conference_Titel

Electrical and Computer Engineering, 2004. Canadian Conference on

ISSN

0840-7789

Print_ISBN

0-7803-8253-6

Type

conf

DOI

10.1109/CCECE.2004.1345314

Filename

1345314