✦ LIBER ✦

A general scrambling rule for multidimensional FFT algorithms

✍ Scribed by Bernardini, R.; Cortelazzo, G.M.; Mian, G.A.

Book ID: 119789839
Publisher: IEEE
Year: 1994
Tongue: English
Weight: 748 KB
Volume: 42
Category: Article
ISSN: 1053-587X
DOI: 10.1109/78.298284

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generating multipliers for a radix-4 par

Generating multipliers for a radix-4 parallel FFT algorithm

✍ J.A Johnston 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 823 KB

A Generalized Mixed-Radix Algorithm for

A Generalized Mixed-Radix Algorithm for Memory-Based FFT Processors

✍ Chen-Fong Hsiao; Yuan Chen; Chen-Yi Lee 📂 Article 📅 2010 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 461 KB

A general packing algorithm for multidim

A general packing algorithm for multidimensional resource requirements

✍ K. Maruyama; S. K. Chang; D. T. Tang 📂 Article 📅 1977 🏛 Springer 🌐 English ⚖ 935 KB

Greedy algorithm for the general multidi

Greedy algorithm for the general multidimensional knapsack problem

✍ Yalçın Akçay; Haijun Li; Susan H. Xu 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 328 KB

A segmented FFT algorithm for vector com

A segmented FFT algorithm for vector computers

✍ Mike Ashworth; Andrew G. Lyne 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 627 KB

A parallel FFT algorithm for transputer

A parallel FFT algorithm for transputer networks

✍ Yonggen Huang; Yakup Paker 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 468 KB

Huang, Y. and Y Paker, A parallel FFT algorithm for transputer networks, Parallel Computing 17 (1991) 895-906 This paper presents a parallel FFT algorithm suitable for MIMD machines\_ It has the properties of uniform granularity, the dominance of computation, and suitability to large data matrices T