An efficient multidimensional decimation-in-frequency FHT algorithm based on the radix-2/4 approach

Author

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

Author_Institution

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

fYear

2005

fDate

23-26 May 2005

Firstpage

2405

Abstract

An efficient multidimensional (MD) split vector-radix (SVR) decimation-in-frequency (DIF) fast Hartley transform (FHT) algorithm is proposed by introducing a two-step decomposition strategy coupled with an efficient index mapping and the Kronecker product. Compared to existing MD FHT algorithms, the proposed one significantly reduces the complexity. In addition, the butterfly of the proposed algorithm is characterized by simple closed-form expressions allowing easy software or hardware implementation of the algorithm.

Keywords

Hartley transforms; computational complexity; digital arithmetic; multidimensional signal processing; Kronecker product; butterfly; closed-form expressions; complexity; fast Hartley transform; higher-dimension signals; index mapping; multidimensional decimation-in-frequency FHT algorithm; radix-2/4 approach; split vector-radix algorithm; two-step decomposition strategy; Application software; Arithmetic; Closed-form solution; Discrete Fourier transforms; Fourier transforms; Hardware; Multidimensional systems; Signal processing; Software algorithms; Virtual reality;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 2005. ISCAS 2005. IEEE International Symposium on

Print_ISBN

0-7803-8834-8

Type

conf

DOI

10.1109/ISCAS.2005.1465110

Filename

1465110