Live briefing
Everything about Prime-factor FFT algorithm
Fast Fourier Transform algorithm
The prime-factor algorithm (PFA), also called the Good–Thomas algorithm (1958/1963), is a fast Fourier transform (FFT) algorithm that re-expresses the discrete Fourier transform (DFT) of a size N = N1N2 as a two-dimensional N1 × N2 DFT, but only for the case where N1 and N2 are relatively prime. These smaller transforms of size N1 and N2 can then be evaluated by applying PFA recursively or by using some other FFT algorithm. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Prime-factor FFT algorithmA 5-minute orientation
- Skim a recent paper: A Method to Obtain Non-Power-of-Two FFT Flow Graphs Based on a New Prime Factor AlgorithmInfluential work since 2022
- Pick up a classic book: Mathematical Techniques in Chrystallography and Materials ScienceThe most-reprinted book on the subject
- Read the landmark paper: A prime factor FFT algorithm using high-speed convolutionCited 240 times
- Go sideways: White noise analysisA closely related topic
- Go sideways: Almost contact manifoldA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A prime factor FFT algorithm using high-speed convolution
An in-place, in-order prime factor FFT algorithm
Implementation of a self-sorting in-place prime factor FFT algorithm
A Generalized Prime Factor FFT Algorithm for any $N = 2^p 3^q 5^r $
Note a note on prime factor FFT algorithms
Implementation of a prime factor FFT algorithm on CRAY-1
A prime factor FFT algorithm implementation using a program generation technique
A self-sorting in-place prime factor real/half-complex FFT algorithm
🆕 Influential since 2022
📚 Books worth reading
Mathematical Techniques in Chrystallography and Materials ScienceEdward Prince · 2004- 📕Tech15projects.com · 2014
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- White noise analysis In probability theory, a branch of mathematics, white noise analysis, otherwise known as Hida calculus, is a framework for infinite-dimensional and stochastic…
- Almost contact manifold In the mathematical field of differential geometry, an almost-contact structure is a certain kind of geometric structure on a smooth manifold, obtained…
- Witt vector In mathematics, a Witt vector is an infinite sequence of elements of a commutative ring. Ernst Witt showed how to put a ring structure on the set of Witt…
- Momentum map In mathematics, specifically in symplectic geometry, the momentum map (or, by false etymology, moment map) is a tool associated with a Hamiltonian action…
- Hopf invariant In mathematics, in particular in algebraic topology, the Hopf invariant is a homotopy invariant of certain maps between n-spheres. In 1931 Heinz Hopf used…
- Reproducing kernel Hilbert space In functional analysis, a discipline within mathematics, a reproducing kernel Hilbert space (RKHS) is a Hilbert space of functions in which point evaluation…
- Łojasiewicz inequality In real algebraic geometry, the Łojasiewicz inequality, named after Stanisław Łojasiewicz, gives an upper bound for the distance of a point to the nearest…
- Multilinear form In abstract algebra and multilinear algebra, a multilinear form on a vector space V {\displaystyle V} over a field K {\displaystyle K} is a map f : V k…