A fast complex integer convolution using a hybrid transformIt is shown that the Winograd transform can be combined with a complex integer transform over the Galois field GF(q-squared) to yield a new algorithm for computing the discrete cyclic convolution of complex number points. By this means a fast method for accurately computing the cyclic convolution of a sequence of complex numbers for long convolution lengths can be obtained. This new hybrid algorithm requires fewer multiplications than previous algorithms.
Document ID
19790054756
Acquisition Source
Legacy CDMS
Document Type
Conference Proceedings
Authors
Reed, I. S. (Southern California, University Los Angeles, Calif., United States)
K Truong, T. (California Institute of Technology, Jet Propulsion Laboratory, Pasadena Calif., United States)
Date Acquired
August 9, 2013
Publication Date
January 1, 1978
Subject Category
Cybernetics
Meeting Information
Meeting: ITC/USA/''78; Proceedings of the International Telemetering Conference