Sciweavers

ICASSP
2011
IEEE
12 years 8 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
SAMOS
2007
Springer
13 years 10 months ago
Low-Power Twiddle Factor Unit for FFT Computation
An integral part of FFT computation are the twiddle factors, which, in software implementations, are typically stored into RAM memory implying large memory footprint and power cons...
Teemu Pitkänen, Tero Partanen, Jarmo Takala