7 search results - page 1 / 2 » Low-Power Twiddle Factor Unit for FFT Computation |
SAMOS
2007
Springer
13 years 11 months ago
2007
Springer
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...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
HPCC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Low-power design became crucial with the widespread use of the embedded systems, where a small battery has to last for a long period. The embedded processors need to efï¬...
HIPEAC
2009
Springer
14 years 2 days ago
2009
Springer
In this article, we present a parallel implementation of a 1024 point Fast Fourier Transform (FFT) operating with a subthreshold supply voltage, which is below the voltage that tur...
APCCAS
2006
IEEE
13 years 7 months ago
2006
IEEE
- In this paper, the grouped scheme is specially applied to compute the fast Fourier transform (FFT) when the portions of transformed outputs are calculated selectively. The groupe...