✦ LIBER ✦

Meeting on fast algorithms for DFT

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Unscrambling for fast DFT algorithms

✍ Burrus, C.S. 📂 Article 📅 1988 🏛 IEEE ⚖ 242 KB

Timing of some fast DFT-algorithms

✍ A.J. van der Steen 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 382 KB

Fast algorithms for the DFT and other si

✍ Suehiro, N.; Hatori, M. 📂 Article 📅 1986 🏛 IEEE ⚖ 261 KB

Fast DFT matrices transform based on gen

✍ Ying Guo; Yun Mao; Dong Sun Park; Moon Ho Lee 📂 Article 📅 2011 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 556 KB

On fast algorithms for two servers

✍ Marek Chrobak; Lawrence L Larmore 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 443 KB

Fast algorithms for lpdeconvolution

✍ Yarlagadda, R.; Bednar, J.; Watt, T. 📂 Article 📅 1985 🏛 IEEE ⚖ 922 KB