Computer program uses fast-polynomial-transformation (FPT) algorithm applicable to two-dimensional mathematical convolutions. Two-dimensional cyclic convolutions converted to one-dimensional convolutions in polynomial rings. Program decomposes cyclic polynomials into polynomial convolutions of same length. Only FPT's and fast Fourier transforms of same length required. Modular approach saves computional resources. Program written in C.
Fast-Polynomial-Transform Program
NASA Tech Briefs ; 11 , 10
1987-11-01
Miscellaneous
No indication
English
Fast Edge Directed Polynomial Interoplation
British Library Conference Proceedings | 2005
|Fast edge directed polynomial interpolation
IEEE | 2005
|Multicomponent Signal Analysis Using the Polynomial-Phase Transform
Online Contents | 1996
|