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.
FPT Algorithm for Two-Dimensional Cyclic Convolutions
NASA Tech Briefs ; 11 , 8
1987-09-01
Miscellaneous
No indication
English
Fast DFT Algorithm Using Subgroup Convolutions
Springer Verlag | 2021
|VLSI Unit for Two-Dimensional Convolutions
NTRS | 1983
|Convolutions of IFRA Distributions
NTIS | 1975
|Tubing, Plastic, Flexible, Convoluted, Polytetrafluoroethylene, Standard Convolutions
SAE Technical Papers | 1999
Tubing, Plastic, Flexible, Convoluted, Polytetrafluoroethylene, Standard Convolutions
SAE Technical Papers | 2011