Order Total (1 Item Items):
Shipping Destination:
Multiplicative Complexity Convolution Dft by Heideman Michael (16 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (16)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (15)
- As New, Fine or Near Fine (1)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (5)
- Not Print on Demand (11)
Language (1)
Price
- Any Price
- Under US$ 25 (No further results match this refinement)
- US$ 25 to US$ 50
- Over US$ 50
Free Shipping
Seller Location
Seller Rating
-
Hardcover. Condition: Très bon. Ancien livre de bibliothèque. Edition 1988. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1988. Ammareal gives back up to 15% of this item's net price to charity organizations.
-
Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
-
Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
-
Condition: New. pp. 168.
-
Condition: New. pp. 155.
-
US$ 89.56
US$ 13.39 shipping
Ships from United Kingdom to U.S.A.Quantity: 2 available
Add to basketPaperback. Condition: Brand New. 163 pages. 9.25x6.10x0.38 inches. In Stock.
-
Condition: New. pp. 155.
-
Condition: New. pp. 155.
-
Condition: New.
-
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book is intended to be a comprehensive reference to multiplicative com plexity theory as applied to digital signal processing computations. Although a few algorithms are included to illustrate the theory, I concentrated more on the develop ment of the theory itself. Howie Johnson's infectious enthusiasm for designing efficient DfT algorithms got me interested in this subject. I am grateful to Prof. Sid Burrus for encouraging and supporting me in this effort. I would also like to thank Henrik Sorensen and Doug Jones for many stimulating discussions. lowe a great debt to Shmuel Winograd, who, almost singlehandedly, provided most of the key theoretical results that led to this present work. His monograph, Arithmetic Complexity o/Computations, introduced me to the mechanism behind the proofs of theorems in multiplicative complexity. enabling me to return to his earlier papers and appreciate the elegance of his methods for deriving the theory. The second key work that influenced me was the paper by Louis Auslander and Winograd on multiplicative complexity of semilinear systems defined by polynomials. After reading this paper, it was clear to me that this theory could be applied to many impor tant computational problems. These influences can be easily discerned in the present work.
-
Taschenbuch. Condition: Neu. Multiplicative Complexity, Convolution, and the DFT | Michael T. Heideman | Taschenbuch | viii | Englisch | 2011 | Springer | EAN 9781461283997 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
-
Multiplicative Complexity, Convolution, and the DFT
Language: English
Published by Springer, Chapman And Hall/CRC Nov 2011, 2011
ISBN 10: 146128399X ISBN 13: 9781461283997
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book is intended to be a comprehensive reference to multiplicative com plexity theory as applied to digital signal processing computations. Although a few algorithms are included to illustrate the theory, I concentrated more on the develop ment of the theory itself. Howie Johnson's infectious enthusiasm for designing efficient DfT algorithms got me interested in this subject. I am grateful to Prof. Sid Burrus for encouraging and supporting me in this effort. I would also like to thank Henrik Sorensen and Doug Jones for many stimulating discussions. lowe a great debt to Shmuel Winograd, who, almost singlehandedly, provided most of the key theoretical results that led to this present work. His monograph, Arithmetic Complexity o/Computations, introduced me to the mechanism behind the proofs of theorems in multiplicative complexity. enabling me to return to his earlier papers and appreciate the elegance of his methods for deriving the theory. The second key work that influenced me was the paper by Louis Auslander and Winograd on multiplicative complexity of semilinear systems defined by polynomials. After reading this paper, it was clear to me that this theory could be applied to many impor tant computational problems. These influences can be easily discerned in the present work. 168 pp. Englisch.
-
Multiplicative Complexity, Convolution, and the DFT
Language: English
Published by Springer-Verlag New York Inc., 2011
ISBN 10: 146128399X ISBN 13: 9781461283997
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
US$ 79.09
US$ 18.07 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPaperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
-
Condition: New. Print on Demand pp. 168 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
-
Condition: New. PRINT ON DEMAND pp. 168.
-
Multiplicative Complexity, Convolution, and the DFT
Language: English
Published by Springer New York, Springer New York Nov 2011, 2011
ISBN 10: 146128399X ISBN 13: 9781461283997
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book is intended to be a comprehensive reference to multiplicative com plexity theory as applied to digital signal processing computations. Although a few algorithms are included to illustrate the theory, I concentrated more on the develop ment of the theory itself. Howie Johnson's infectious enthusiasm for designing efficient DfT algorithms got me interested in this subject. I am grateful to Prof. Sid Burrus for encouraging and supporting me in this effort. I would also like to thank Henrik Sorensen and Doug Jones for many stimulating discussions. lowe a great debt to Shmuel Winograd, who, almost singlehandedly, provided most of the key theoretical results that led to this present work. His monograph, Arithmetic Complexity o/Computations, introduced me to the mechanism behind the proofs of theorems in multiplicative complexity. enabling me to return to his earlier papers and appreciate the elegance of his methods for deriving the theory. The second key work that influenced me was the paper by Louis Auslander and Winograd on multiplicative complexity of semilinear systems defined by polynomials. After reading this paper, it was clear to me that this theory could be applied to many impor tant computational problems. These influences can be easily discerned in the present work.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 168 pp. Englisch.
