Multiplicative Complexity, Convolution, and the DFT

By C S T Burrus and Michael T. Heideman

This book is intended to be a comprehensive reference to multiplicative com- plexity theory as applied to digital signal processing computations. Although a few algorithms are included to illustrate the theory, I concentrated more on the develop- ment of the theory itself. Howie Johnson's infectious enthusiasm for designing efficient DfT algorithms got me interested in this subject. I am grateful to Prof. Sid Burrus for encouraging and supporting me in this effort. I would also like to thank Henrik Sorensen and Doug Jones for many stimulating discussions. lowe a great debt to Shmuel Winograd, who, almost singlehandedly, provided most of the key theoretical results that led to this present work. His monograph, Arithmetic Complexity o/Computations, introduced me to the mechanism behind the proofs of theorems in multiplicative complexity. enabling me to return to his earlier papers and appreciate the elegance of his methods for deriving the theory. The second key work that influenced me was the paper by Louis Auslander and Winograd on multiplicative complexity of semilinear systems defined by polynomials. After reading this paper, it was clear to me that this theory could be applied to many impor- tant computational problems. These influences can be easily discerned in the present work.

• Format: Paperback
• Language: English
• ISBN: 146128399X
• ISBN13: 9781461283997
• Release Date: November 2011
• Publisher: Springer
• Length: 155 Pages
• Weight: 0.54 lbs.
• Dimensions: 0.4" x 6.1" x 9.2"