✦ LIBER ✦

Comments on "An FFT algorithm based fast algorithm for arbitrary polynomial transformation

✍ Scribed by Shuenn-Shyang Wang; Wen-Guo Lin

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An FFT algorithm based fast algorithm fo

✍ Krishna, H. 📂 Article 📅 1989 🏛 IEEE ⚖ 308 KB

An efficient algorithm for cyclic convol

✍ Cheng Lizhi; Jiang Zengrong 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 548 KB

An efficient FFT algorithm based on the

✍ Gupta, A.; Rao, K.R. 📂 Article 📅 1991 🏛 IEEE 🌐 English ⚖ 372 KB

Fast parallel algorithms for polynomial

✍ D. Bini; V. Pan 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 817 KB

Comments on "Very Fast Fourier Transform

✍ Prakash, S.; Rao, V.V. 📂 Article 📅 1981 🏛 IEEE 🌐 English ⚖ 129 KB

Comment on "An Algorithm for a Fast Hada

✍ Carl, J.W. 📂 Article 📅 1971 🏛 IEEE 🌐 English ⚖ 367 KB