product iamge

Arithmetic Complexity of Computations (CBMS-NSF Regional Conference Series in Applied Mathematics)

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Focuses on finding the minimum number of arithmetic operations needed to perform the computation and on finding a better algorithm when improvement is possible. The author concentrates on that class of problems concerned with computing a system of bilinear forms.

Results that lead to applications in the area of signal processing are emphasized, since (1) even a modest reduction in the execution time of signal processing problems could have practical significance; (2) results in this area are relatively new and are scattered in journal articles; and (3) this emphasis indicates the flavor of complexity of computation.

Author(s): Shmuel Winograd
Series: CBMS-NSF Regional Conference Series in Applied Mathematics
Publisher: Society for Industrial Mathematics
Year: 1987

Language: English
Pages: 100

Arithmetic Complexity of Computations......Page 3
ISBN 0-89871-163-0......Page 4
Contents......Page 5
I Introduction......Page 7
II Three Examples......Page 9
III General Background......Page 13
IV Product of Polynomials......Page 31
V FIR Filters......Page 45
VI Product of Polynomials Modulo a Polynomial......Page 63
VII Cyclic Convolution and Discrete Fourier Transform......Page 77
Bibliography......Page 99