✦ LIBER ✦

On computing the 2-D FFT

✍ Scribed by Sevic, D.

Book ID: 118739516
Publisher: IEEE
Year: 1999
Tongue: English
Weight: 133 KB
Volume: 47
Category: Article
ISSN: 1053-587X
DOI: 10.1109/78.757237

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On computing the split-radix FFT

✍ Sorensen, H.; Heideman, M.; Burrus, C. 📂 Article 📅 1986 🏛 IEEE ⚖ 579 KB

Efficient 2D FFT implementation on media

Efficient 2D FFT implementation on mediaprocessors

✍ Coskun Mermer; Donglok Kim; Yongmin Kim 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 226 KB

We have developed an efficient implementation to compute the 2D fast Fourier transform (FFT) on a new very long instruction word programmable mediaprocessor. Using instructionlevel parallelism and a multimedia instruction set, our radix-4 Cooley-Tukey algorithm optimally maps the FFT computation to

On the use of symmetry in FFT computatio

On the use of symmetry in FFT computation

✍ Rabiner, L. 📂 Article 📅 1979 🏛 IEEE ⚖ 555 KB

Computing the discrete-time “analytic” s

Computing the discrete-time “analytic” signal via FFT

✍ Marple, L., Jr. 📂 Article 📅 1999 🏛 IEEE 🌐 English ⚖ 111 KB

FFT-based bispectrum computation on pola

FFT-based bispectrum computation on polar rasters

✍ Bessios, A.G.; Nikias, C.L. 📂 Article 📅 1991 🏛 IEEE 🌐 English ⚖ 303 KB

On the testability of array structures f

On the testability of array structures for FFT computation

✍ Chao Feng; Jon C. Muzio; Fabrizio Lombardi 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 881 KB