| 書目名稱 | Fast Fourier Transform and Convolution Algorithms |
| 編輯 | Henri J. Nussbaumer |
| 視頻video | http://file.papertrans.cn/342/341278/341278.mp4 |
| 叢書名稱 | Springer Series in Information Sciences |
| 圖書封面 |  |
| 描述 | 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. The book consists of eight chapters. The first two chapters are devoted to background information and to introductory material on number theory and polynomial algebra. This section is limited to the basic concepts as they apply to other parts of the book. Thus, we have restricted our discussion of number theory to congruences, primitive roots, quadratic residues, and to the properties of Mersenne and Fermat numbers. The section on polynomial algebra deals primarily with the divisibility and congruence properties of polynomials and with algebraic computational complexity. The rest of the book is focused directly on fast digital filtering and discrete Fourier transform algorithms. We have attempted to present these techniques in a unified way by using polynomial algebra as extensively as possible. This objective has led us to reformulate many of the algorithms which are discussed in the book. It has been our experience that such a presentation serves to clarify the relationship between the algorithms and often provi |
| 出版日期 | Book 19811st edition |
| 關(guān)鍵詞 | Fourier; Fourier transform; algorithms; boundary element method; complexity; computational complexity; con |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-662-00551-4 |
| isbn_ebook | 978-3-662-00551-4Series ISSN 0720-678X |
| issn_series | 0720-678X |
| copyright | Springer-Verlag Berlin Heidelberg 1981 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-14 23:13
發(fā)表于 2025-3-21 18:46:34
