| 書目名稱 | Fast Fourier Transform and Convolution Algorithms |
| 編輯 | Henri J. Nussbaumer |
| 視頻video | http://file.papertrans.cn/342/341277/341277.mp4 |
| 叢書名稱 | Springer Series in Information Sciences |
| 圖書封面 |  |
| 描述 | 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 |
| 出版日期 | Textbook 1982Latest edition |
| 關(guān)鍵詞 | Algorithms; Digitales Filter; Faltung (Math; ); Fourier; Fourier-Transformation; convolution |
| 版次 | 2 |
| doi | https://doi.org/10.1007/978-3-642-81897-4 |
| isbn_softcover | 978-3-540-11825-1 |
| isbn_ebook | 978-3-642-81897-4Series ISSN 0720-678X |
| issn_series | 0720-678X |
| copyright | Springer-Verlag Berlin Heidelberg 1982 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-15 02:20
發(fā)表于 2025-3-21 16:53:11
