SIAM Homepage | Search Catalog | New Books | Author Index | Series Index | Title Index | View My Shopping Cart



The catalog and shopping cart are hosted for SIAM by EasyCart. Your transaction is secure. If you have any questions about your order, contact siambooks@siam.org.

Purchase Now!

Arithmetic Complexity of ComputationsArithmetic Complexity of Computations

Shmuel Winograd



CBMS-NSF Regional Conference Series in Applied Mathematics 33

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.

Contents

Three Examples; General Background; Product of Polynomials; FIR Filters; Product of Polynomials Modulo a Polynomial; Cyclic Convolution and Discrete Fourier Transform.

1980 / iii + 93 pages / Softcover / ISBN-13: 978-0-898711-63-9 / ISBN-10: 0-89871-163-0 /
List Price $46.50 / SIAM/CBMS Member Price $32.55 / Order Code CB33
Price
Quantity desired
   



Search our catalog for:

Shopping cart provided by: EasyCart.com
Select quantity and list or member price and then click the "Click to Order" button to add books to your shopping cart.
Banner art adapted from a figure by Hinke M. Osinga and Bernd Krauskopf (University of Auckland, NZ.)