Sciweavers

ICASSP
2011
IEEE
13 years 2 months ago
New radix-based FHT algorithm for computing the discrete Hartley transform
In this paper, a new fast Hartley transform (FHT) algorithmradix-22 suitable for pipeline implementation of the discrete Hartley transform (DHT) is presented. The proposed algorit...
Monir Taha Hamood, Said Boussakta
CAIP
1999
Springer
145views Image Analysis» more  CAIP 1999»
14 years 3 months ago
Optimized Fast Algorithms for the Quaternionic Fourier Transform
Abstract. In this article, we deal with fast algorithms for the quaternionic Fourier transform (QFT). Our aim is to give a guideline for choosing algorithms in practical cases. Hen...
Michael Felsberg, Gerald Sommer