𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Radix-2 decimation-in-frequency algorithm for the computation of the real-valued FFT

✍ Scribed by Sekhar, B.R.; Prabhu, K.M.M.

Book ID
119791225
Publisher
IEEE
Year
1999
Tongue
English
Weight
110 KB
Volume
47
Category
Article
ISSN
1053-587X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The equivalence of decimation in time an
The equivalence of decimation in time and decimation in frequency in FFT computations
✍ Nai-Kuan Tsao πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 840 KB

A data and error complexity analysis of two algorithms for fast Fourier transforms is presented. The results show that the algorithm using decimation in time is "equivalent" to the one using decimation in frequency. This is also supported by the numerical experiments described.

A new proposed algorithm of arbitrary ra
A new proposed algorithm of arbitrary radix for the computation of the 2D DFT
✍ D. Chikouche; A. Khellaf; S. Bouguezel πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 109 KB πŸ‘ 2 views

In this paper, we propose a new approach for computing 2D FFT's that are suitable for implementation on a systolic array architecture. Our algorithm is derived in this paper from a Cooley decimation-in-time algorithm by using an appropriate indexing process. It is proved that the number of multiplic