Multiplicative complexity, convolution, and the DFT
By: Michael T. Heideman, C.S Burrus, consulting editor.
Contributors: Burrus, C. S.
Publisher: Springer-Verlag; Springer
Published: 1988
Place of publication: New York
Language: eng
Number of pages: 155
Subjects: Computational complexity; Fourier transformations; Convolutions (Mathematics)
Notes: Bibliography: p. 147-150.
Originally presented as the author's thesis (Ph. D.--Rice University) under title: Applications of multiplicative complexity theory to convolution and the discrete Fourier transform.
Includes index.