NASA NTRS · 19780007135
A new fast algorithm for computing a complex number: Theoretic transforms
Abstract
A high-radix fast Fourier transformation (FFT) algorithm for computing transforms over GF(sq q), where q is a Mersenne prime, is developed to implement fast circular convolutions. This new algorithm requires substantially fewer multiplications than the conventional FFT.
Keep this discovery
Explore connections, maps & timelines
Reed, I. S., Liu, K. Y., Truong, T. K.. 1977-06-15. A new fast algorithm for computing a complex number: Theoretic transforms. https://ntrs.nasa.gov/citations/19780007135
Cite the original work for its findings. Save a collection to share your selection of sources.