✦ LIBER ✦

Architecturally efficient FFT pruning algorithm

✍ Scribed by Singh, S.; Srinivasan, S.

Book ID: 121724587
Publisher: The Institution of Electrical Engineers
Year: 2005
Tongue: English
Weight: 73 KB
Volume: 41
Category: Article
ISSN: 0013-5194
DOI: 10.1049/el:20052994

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pruning the decimation in-time FFT algor

Pruning the decimation in-time FFT algorithm

✍ Skinner, D. 📂 Article 📅 1976 🏛 IEEE ⚖ 227 KB

FFT algorithm for both input and output

FFT algorithm for both input and output pruning

✍ Sreenivas, T.; Rao, P. 📂 Article 📅 1979 🏛 IEEE ⚖ 229 KB

An Efficient FFT Algorithm for Superscal

An Efficient FFT Algorithm for Superscalar and VLIW Processor Architectures

✍ Chris Basoglu; Woobin Lee; Yongmin Kim 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 480 KB

Real-Time Imaging 3, 441-453 (1997) applications, including digital video, images, graphics and audio. These new processors employ instruction-level parallelism, which includes the superscalar and very long instruction word (VLIW) computer architectures. Intel Pentium Pro, Hewlett-Packard PA-RISC 80

Implementation of Efficient FFT Algorith

Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures

✍ Linzer, E.N.; Feig, E. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 860 KB

An efficient pipelined fft architecture

✍ Yun-Nan Chang, ; Parhi, K.K. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 336 KB

Pruning the decimation-in-time FFT algor

Pruning the decimation-in-time FFT algorithm with frequency shift

✍ Nagai, K. 📂 Article 📅 1986 🏛 IEEE ⚖ 283 KB