Cover Image

Multiplicative Complexity, Convolution, and the DFT /

Show other versions (1)

This book introduces multiplicative complexity theory and applies it to the computation of discrete convolutions and the discrete Fourier transform. A mathematical framework is established that enables the multiplicative complexity of many common bilinear systems to be determined. Semilinear systems...

Full description

Bibliographic Details
Main Author: Heideman, Michael T.
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: New York, NY : Springer New York, 1988.
Series:Signal processing and digital filtering.
Subjects:
Surfaces (Physics)
Electronic books.
Online Access:Connect to the full text of this electronic book
Table of Contents:
  • Introduction
  • Multiplicative Complexity of Linear and Bilinear Systems
  • Convolution and Polynomial Multiplication
  • Constrained Polynomial Multiplication
  • Multiplicative Complexity of Discrete Fourier Transform
  • Restricted and Constrained DFTs
  • Appendix A. Cyclotomic Polynomials and Their Properties
  • Appendix B. Complexities of Multidimensional Cyclic Convolutions
  • Appendix C. Programs for Computing Multiplicative Complexity
  • Appendix D. Tabulated Complexities of the One-Dimensional DFT
  • Problems
  • Bibliography
  • Index.