Contact us on (02) 8445 2300
For all customer service and order enquiries

Woodslane Online Catalogues

9780898711639 Academic Inspection Copy

Arithmetic Complexity of Computations

Description
Table of
Contents
Google
Preview
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.
Google Preview content