Articles liés à Fast Fourier Transform and Convolution Algorithms
Synopsis
In the first edition of this book, we covered in Chapter 6 and 7 the applications to multidimensional convolutions and DFT's of the transforms which we have introduced, back in 1977, and called polynomial transforms. Since the publication of the first edition of this book, several important new developments concerning the polynomial transforms have taken place, and we have included, in this edition, a discussion of the relationship between DFT and convolution polynomial transform algorithms. This material is covered in Appendix A, along with a presentation of new convolution polynomial transform algorithms and with the application of polynomial transforms to the computation of multidimensional cosine transforms. We have found that the short convolution and polynomial product algorithms of Chap. 3 have been used extensively. This prompted us to include, in this edition, several new one-dimensional and two-dimensional polynomial product algorithms which are listed in Appendix B. Since our book is being used as part of several graduate-level courses taught at various universities, we have added, to this edition, a set of problems which cover Chaps. 2 to 8. Some of these problems serve also to illustrate some research work on DFT and convolution algorithms. I am indebted to Mrs A. Schlageter who prepared the manuscript of this second edition. Lausanne HENRI J. NUSSBAUMER April 1982 Preface to the First Edition This book presents in a unified way the various fast algorithms that are used for the implementation of digital filters and the evaluation of discrete Fourier transforms.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
- ÉditeurSpringer Berlin Heidelberg
- Date d'édition1982
- ISBN 10 354011825X
- ISBN 13 9783540118251
- ReliureBroché
- Langueanglais
- Numéro d'édition2
- Nombre de pages292
- Coordonnées du fabricantnon disponible
Acheter neuf
Afficher cet article
EUR 53,49
EUR 10,99 expédition depuis Allemagne vers France
Destinations, frais et délaisRésultats de recherche pour Fast Fourier Transform and Convolution Algorithms
Image fournie par le vendeur
Fast Fourier Transform and Convolution Algorithms Springer Series in Information Sciences, 2
Edité par
Springer Berlin Heidelberg, 1982
ISBN 10 : 354011825X
ISBN 13 : 9783540118251
Ancien ou d'occasion
Broschiert
Vendeur : books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Broschiert. Etat : Gut. 2nd corr. and updated ed. 276 Seiten Das Buch befindet sich in einem gut erhaltenen Zustand. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 460. N° de réf. du vendeur 2148792
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Fast Fourier Transform and Convolution Algorithms (Springer Series in Information Sciences, 2, Band 2)
Edité par
Springer Berlin Heidelberg, 1982
ISBN 10 : 354011825X
ISBN 13 : 9783540118251
Ancien ou d'occasion
paperback
Vendeur : Studibuch, Stuttgart, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
paperback. Etat : Befriedigend. Seiten; 9783540118251.4 Gewicht in Gramm: 500. N° de réf. du vendeur 710098
Quantité disponible : 1 disponible(s)
Image d'archives
Fast Fourier Transform and Convolution Algorithms (Volume 2)
Edité par
Springer-Verlag, 1982
ISBN 10 : 354011825X
ISBN 13 : 9783540118251
Ancien ou d'occasion
Couverture souple
Vendeur : Anybook.com, Lincoln, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : Good. Volume 2. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. Clean from markings. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,550grams, ISBN:354011825X. N° de réf. du vendeur 9825718
Quantité disponible : 1 disponible(s)
Image d'archives
Fast Fourier Transform and Convolution Algorithms
Edité par
Springer Berlin Heidelberg, 1990
ISBN 10 : 354011825X
ISBN 13 : 9783540118251
Ancien ou d'occasion
Couverture souple
Vendeur : Buchpark, Trebbin, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : Gut. Zustand: Gut - Gebrauchs- und Lagerspuren. 2. Auflage. Aus der Auflösung einer renommierten Bibliothek. Kann Stempel beinhalten. | Seiten: 292 | Sprache: Englisch | Produktart: Bücher. N° de réf. du vendeur 22641722/203
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Fast Fourier transform and convolution algorithms. Springer series in information sciences; Bd. 2.
Edité par
Berlin, Springer, 1982
ISBN 10 : 354011825X
ISBN 13 : 9783540118251
Ancien ou d'occasion
Softcover
Vendeur : Antiquariat Bookfarm, Löbnitz, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Softcover. 2., corr. and updated ed. Ex-library with stamp and library-signature. GOOD condition, some traces of use. C-03996 354011825X Sprache: Englisch Gewicht in Gramm: 1050. N° de réf. du vendeur 2489931
Quantité disponible : 1 disponible(s)
Image d'archives
Fast Fourier Transform and Convolution Algorithms (Springer Series in Information Sciences, 2)
Edité par
Springer (edition 2nd), 1982
ISBN 10 : 354011825X
ISBN 13 : 9783540118251
Ancien ou d'occasion
Paperback
Vendeur : BooksRun, Philadelphia, PA, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Good. 2nd. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. N° de réf. du vendeur 354011825X-11-1
Quantité disponible : 1 disponible(s)
Image d'archives
Fast Fourier Transform and Convolution Algorithms (Springer Series in Information Sciences, 2)
Edité par
Springer, 1990
ISBN 10 : 354011825X
ISBN 13 : 9783540118251
Ancien ou d'occasion
Couverture souple
Vendeur : Anybook.com, Lincoln, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,500grams, ISBN:354011825X. N° de réf. du vendeur 8247778
Quantité disponible : 1 disponible(s)
Image d'archives
Fast Fourier Transform and Convolution Algorithms (Springer Series in Information Sciences, 2)
Edité par
Springer (edition 2nd), 1982
ISBN 10 : 354011825X
ISBN 13 : 9783540118251
Ancien ou d'occasion
Paperback
Vendeur : BooksRun, Philadelphia, PA, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : As New. 2nd. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. N° de réf. du vendeur 354011825X-10-1
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Fast Fourier Transform and Convolution Algorithms
Edité par
Springer Berlin Heidelberg, 1982
ISBN 10 : 354011825X
ISBN 13 : 9783540118251
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - In the first edition of this book, we covered in Chapter 6 and 7 the applications to multidimensional convolutions and DFT's of the transforms which we have introduced, back in 1977, and called polynomial transforms. Since the publication of the first edition of this book, several important new developments concerning the polynomial transforms have taken place, and we have included, in this edition, a discussion of the relationship between DFT and convolution polynomial transform algorithms. This material is covered in Appendix A, along with a presentation of new convolution polynomial transform algorithms and with the application of polynomial transforms to the computation of multidimensional cosine transforms. We have found that the short convolution and polynomial product algorithms of Chap. 3 have been used extensively. This prompted us to include, in this edition, several new one-dimensional and two-dimensional polynomial product algorithms which are listed in Appendix B. Since our book is being used as part of several graduate-level courses taught at various universities, we have added, to this edition, a set of problems which cover Chaps. 2 to 8. Some of these problems serve also to illustrate some research work on DFT and convolution algorithms. I am indebted to Mrs A. Schlageter who prepared the manuscript of this second edition. Lausanne HENRI J. NUSSBAUMER April 1982 Preface to the First Edition This book presents in a unified way the various fast algorithms that are used for the implementation of digital filters and the evaluation of discrete Fourier transforms. N° de réf. du vendeur 9783540118251
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Fast Fourier Transform and Convolution Algorithms
Edité par
Springer Berlin Heidelberg Sep 1982, 1982
ISBN 10 : 354011825X
ISBN 13 : 9783540118251
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In the first edition of this book, we covered in Chapter 6 and 7 the applications to multidimensional convolutions and DFT's of the transforms which we have introduced, back in 1977, and called polynomial transforms. Since the publication of the first edition of this book, several important new developments concerning the polynomial transforms have taken place, and we have included, in this edition, a discussion of the relationship between DFT and convolution polynomial transform algorithms. This material is covered in Appendix A, along with a presentation of new convolution polynomial transform algorithms and with the application of polynomial transforms to the computation of multidimensional cosine transforms. We have found that the short convolution and polynomial product algorithms of Chap. 3 have been used extensively. This prompted us to include, in this edition, several new one-dimensional and two-dimensional polynomial product algorithms which are listed in Appendix B. Since our book is being used as part of several graduate-level courses taught at various universities, we have added, to this edition, a set of problems which cover Chaps. 2 to 8. Some of these problems serve also to illustrate some research work on DFT and convolution algorithms. I am indebted to Mrs A. Schlageter who prepared the manuscript of this second edition. Lausanne HENRI J. NUSSBAUMER April 1982 Preface to the First Edition This book presents in a unified way the various fast algorithms that are used for the implementation of digital filters and the evaluation of discrete Fourier transforms. 292 pp. Englisch. N° de réf. du vendeur 9783540118251
Quantité disponible : 2 disponible(s)