NASA NTRS · 19770051516
Fast algorithm for computing complex number-theoretic transforms
Abstract
A high-radix FFT algorithm for computing transforms over FFT, 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-05-12. Fast algorithm for computing complex number-theoretic transforms. https://ntrs.nasa.gov/citations/19770051516
Cite the original work for its findings. Save a collection to share your selection of sources.