✦ LIBER ✦

Note a note on prime factor FFT algorithms

✍ Scribed by Clive Temperton

Book ID: 107788714
Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 415 KB
Volume: 52
Category: Article
ISSN: 0021-9991
DOI: 10.1016/0021-9991(83)90024-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Implementation of a prime factor FFT alg

Implementation of a prime factor FFT algorithm on CRAY-1

✍ Clive Temperton 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 819 KB

Comments on "A prime factor FFT algorith

Comments on "A prime factor FFT algorithm using high-speed convolution"

✍ Agarwal, R. 📂 Article 📅 1978 🏛 IEEE ⚖ 96 KB

NOTE ON PRIME NUMBERS

✍ G. A. Miller 📂 Article 📅 1921 🏛 School Science and Mathematics Association 🌐 English ⚖ 43 KB

A prime factor FFT algorithm implementat

A prime factor FFT algorithm implementation using a program generation technique

✍ Perez, F.; Takaoka, T. 📂 Article 📅 1987 🏛 IEEE ⚖ 385 KB

A Note on Exponential Polynomials and Pr

A Note on Exponential Polynomials and Prime Factors

✍ Rod McBeth 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

A NOTE ON EXPONENTIAL POLYNOMIALS AND PRIME FACTORS by ROD MCBETH in London (England) Let p,, p 2 , p 3 , . . . denote the progression 2 , 3 , 5 , . . . of primes. The polynomials f of the class EP given in [l] can be correlated with functions p ( f ; -) which are based on the above progression. The

A note on strongly prime radicals

✍ J. F. Watters 📂 Article 📅 1995 🏛 Akadmiai Kiad 🌐 English ⚖ 326 KB