Verwandte Artikel zu Fast Fourier Transform and Convolution Algorithms:...
Fast Fourier Transform and Convolution Algorithms: 2 (Springer Series in Information Sciences) - Softcover
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
- VerlagSpringer Berlin Heidelberg
- Erscheinungsdatum1982
- ISBN 10 354011825X
- ISBN 13 9783540118251
- EinbandTapa blanda
- SpracheEnglisch
- Anzahl der Seiten292
- Kontakt zum HerstellerNicht verfügbar
Neu kaufen
Diesen Artikel anzeigen
EUR 48,37
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerSuchergebnisse für Fast Fourier Transform and Convolution Algorithms:...
Foto des Verkäufers
Fast Fourier Transform and Convolution Algorithms (Springer Series in Information Sciences, 2, Band 2)
Verlag:
Springer Berlin Heidelberg, 1982
ISBN 10: 354011825X
ISBN 13: 9783540118251
Gebraucht
paperback
Anbieter: Studibuch, Stuttgart, Deutschland
Verkäuferbewertung 5 von 5 Sternen
paperback. Zustand: Befriedigend. Seiten; 9783540118251.4 Gewicht in Gramm: 500. Bestandsnummer des Verkäufers 710098
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Fast Fourier Transform and Convolution Algorithms
Verlag:
Springer Berlin Heidelberg, 1990
ISBN 10: 354011825X
ISBN 13: 9783540118251
Gebraucht
Softcover
Anbieter: Buchpark, Trebbin, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: Gut. Zustand: Gut | Seiten: 292 | Sprache: Englisch | Produktart: Bücher. Bestandsnummer des Verkäufers 22641722/203
Anzahl: 1 verfügbar
Foto des Verkäufers
Fast Fourier Transform and Convolution Algorithms Springer Series in Information Sciences, 2
Verlag:
Springer Berlin Heidelberg, 1982
ISBN 10: 354011825X
ISBN 13: 9783540118251
Gebraucht
Broschiert
Anbieter: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Broschiert. Zustand: 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. Bestandsnummer des Verkäufers 2148792
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Fast Fourier Transform and Convolution Algorithms (Volume 2)
Anbieter: Anybook.com, Lincoln, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers 9825718
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Fast Fourier Transform and Convolution Algorithms (Springer Series in Information Sciences, 2)
Anbieter: BooksRun, Philadelphia, PA, USA
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: Good. 2nd. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. Bestandsnummer des Verkäufers 354011825X-11-1
Anzahl: 1 verfügbar
Foto des Verkäufers
Fast Fourier Transform and Convolution Algorithms
Print-on-DemandAnbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 editi. Bestandsnummer des Verkäufers 4881544
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Fast Fourier Transform and Convolution Algorithms
Verlag:
Springer Berlin / Heidelberg, 1982
ISBN 10: 354011825X
ISBN 13: 9783540118251
Gebraucht
Softcover
Anbieter: Better World Books: West, Reno, NV, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: Good. Used book that is in clean, average condition without any missing pages. Bestandsnummer des Verkäufers 1823178-6
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Fast Fourier Transform and Convolution Algorithms (Springer Series in Information Sciences, 2)
Anbieter: Anybook.com, Lincoln, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers 8247778
Anzahl: 1 verfügbar
Foto des Verkäufers
Fast Fourier Transform and Convolution Algorithms
Verlag:
Springer Berlin Heidelberg Sep 1982, 1982
ISBN 10: 354011825X
ISBN 13: 9783540118251
Neu
Taschenbuch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783540118251
Anzahl: 2 verfügbar
Foto des Verkäufers
Fast Fourier Transform and Convolution Algorithms
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783540118251
Anzahl: 1 verfügbar