NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Collections About News Help Login
Back to Results
FPT Algorithm for Two-Dimensional Cyclic ConvolutionsFast-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.
Document ID
19870000438
Acquisition Source
Legacy CDMS
Document Type
Other - NASA Tech Brief
Authors
Truong, Trieu-Kie (Caltech)
Shao, Howard M. (Caltech)
Pei, D. Y. (Caltech)
Reed, Irving S. (Caltech)
Date Acquired
August 13, 2013
Publication Date
September 1, 1987
Publication Information
Publication: NASA Tech Briefs
Volume: 11
Issue: 8
ISSN: 0145-319X
Subject Category
Mathematics And Information Sciences
Report/Patent Number
NPO-16835
Accession Number
87B10438
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.

Available Downloads

There are no available downloads for this record.

Related Records

There are no records associated with this record.
No Preview Available