✦ LIBER ✦

Unscrambling for fast DFT algorithms

✍ Scribed by Burrus, C.S.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Meeting on fast algorithms for DFT

📂 Article 📅 1983 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 105 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

Realization of an in-place unscrambler f

✍ Miodrag Popović; Dragutin Šević 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 294 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

Fast algorithms for lpdeconvolution

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