NASA NTRS · 19870000438
FPT Algorithm for Two-Dimensional Cyclic Convolutions
Abstract
Fast-polynomial-transform (FPT) algorithm computes two-dimensional cyclic convolution of two-dimensional arrays of complex numbers. New algorithm uses cyclic polynomial convolutions of same length. Algorithm regular, modular, and expandable.
Keep this discovery
Explore connections, maps & timelines
Truong, Trieu-Kie, Shao, Howard M., Pei, D. Y., Reed, Irving S.. 1987-09-01. FPT Algorithm for Two-Dimensional Cyclic Convolutions. https://ntrs.nasa.gov/citations/19870000438
Cite the original work for its findings. Save a collection to share your selection of sources.