Arithmetic Complexity of Computations

NOTE EDITORE

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.

SOMMARIO

Three examples; General background; Product of polynomials; FIR filters; Product of polynomials modulo a polynomial; Cyclic convolution and discrete Fourier transform.

PREFAZIONE

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 leading to applications in signal processing are emphasized.

ALTRE INFORMAZIONI

• Condizione: Nuovo
• ISBN: 9780898711639
• Collana: CBMS-NSF Regional Conference Series in Applied Mathematics
• Dimensioni: 228 x 8 x 152 mm Ø 178 gr
• Formato: Brossura
• Pagine Arabe: 97