Fast polynomial transform and its implementation by computer
- 1 January 1981
- journal article
- Published by Institution of Engineering and Technology (IET) in IEE Proceedings E Computers and Digital Techniques
- Vol. 128 (2) , 50-60
- https://doi.org/10.1049/ip-e.1981.0010
Abstract
Recently a new algorithm was developed to compute two-dimensional cyclic convolution by what is called the FPT (fast polynomial transform) algorithm. In this paper this new algorithm is further studied and implemented on a general purpose computer. Methods to cope with finite core memory limitations are presented and actual computational speed performances are listed.Keywords
This publication has 1 reference indexed in Scilit:
- A digital system to produce imagery from SAR dataPublished by American Institute of Aeronautics and Astronautics (AIAA) ,1976