Arithmetic complexity of computations / Shmuel Winograd.
By: Winograd, S
.
Material type: 
BookSeries: CBMS-NSF regional conference series in applied mathematics ; 33.Publisher: Philadelphia, Pa. : Society for Industrial and Applied Mathematics, 1980Description: 93 p. ; 25 cm. + pbk.ISBN: 0898711630 .Subject(s): Bilinear forms -- Data processing | Computational complexityDDC classification: 511.8 | Item type | Current library | Call number | Copy number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
| General Lending | MTU Bishopstown Library Lending | 511.8 (Browse shelf(Opens below)) | 1 | Available | 00038760 | ||
| General Lending | MTU Bishopstown Library Lending | 511.8 (Browse shelf(Opens below)) | 1 | Available | 00041226 |
Enhanced descriptions from Syndetics:
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.
"Based on lectures given by the author at the University of Pittsburgh.".
Bibliography: (page 93).
Introduction -- Three examples -- General background -- Product of polynomials -- Fir filters -- Product of polynomials modulo a polynomial -- Cyclic convolution and discrete fourier transform.
Table of contents provided by Syndetics
- Three examples
- General background
- Product of polynomials
- FIR filters
- Product of polynomials modulo a polynomial
- Cyclic convolution and discrete Fourier transform