請用此 Handle URI 來引用此文件：
http://localhost:8080/xmlui/handle/123456789/129886| 標題: | Fast Fourier Transforms |
| 作者: | C. Sidney Burrus |
| 公開日期: | 2012 |
| 出版社: | Rice University |
| 摘要: | This book uses an index map, a polynomial decomposition, an operator factorization, and a conversion to a filter to develop a very general and efficient description of fast algorithms to calculate the discrete Fourier transform (DFT). The work of Winograd is outlined, chapters by Selesnick, Pueschel, and Johnson are included, and computer programs are provided. |
| 連結: | http://cnx.org/contents/82e6ba6f-b828-42ef-9db1-8de4b448b869@22.1/Fast_Fourier_Transforms |
| 關鍵字: | Mathematics and StatisticsScience and Technology;Cooley Tukey FFTFast Fourier TransformFFTPFAPrime Factor AlgorithmWFTAWinograd Fourier Transform Algorithm |
| 主題: | 教科書-自然科學類 |
文件中的檔案：
沒有與此文件相關的檔案。
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。