1980 / iii + 93 pages / Softcover / ISBN: 978-0-898711-63-9 / List Price $48.50 / SIAM/CBMS Member Price $33.95 / Order Code CB33
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.
Three Examples; General Background; Product of Polynomials; FIR Filters; Product of Polynomials Modulo a Polynomial; Cyclic Convolution and Discrete Fourier Transform.
This product hasn't received any reviews yet. Be the first to review this product!
All prices are in USD