Multiplicative Complexity, Convolution, and the Dft - Rilegato

Heideman, M. T.

 
9780387968100: Multiplicative Complexity, Convolution, and the Dft
Rilegato
ISBN 10: 0387968105 ISBN 13: 9780387968100
Casa editrice: Springer Verlag, 1988

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Contenuti

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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore
Springer Verlag
Data di pubblicazione
1988
Lingua
Inglese
ISBN 10 
0387968105
ISBN 13 
9780387968100
Rilegatura
Copertina rigida
Numero di pagine
163
Redattore
Burrus C. S.
Contatto del produttore
non disponibile
Persona responsabile
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Germania

Altre edizioni note dello stesso titolo

9781461283997: "Multiplicative Complexity, Convolution, and the Dft"

Edizione in evidenza

ISBN 10:  146128399X ISBN 13:  9781461283997
Casa editrice: Springer, 2013
Brossura