| 书目名称 | Transforms and Fast Algorithms for Signal Analysis and Representations | | 编辑 | Guoan Bi,Yonghong Zeng | | 视频video | | | 概述 | Comprehensive presentation of recent results and developments on several widely used transforms and their fast algorithms.In many cases, new options are provided for improved or new fast algorithms, s | | 丛书名称 | Applied and Numerical Harmonic Analysis | | 图书封面 |  | | 描述 | . . . that is what learning is. You suddenly understand something you‘ve un derstood all your life, but in a new way. Various transforms have been widely used in diverse applications of science, engineering and technology. New transforms are emerging to solve many problems, which may have been left unsolved in the past, or newly created by modern science or technologies. Various meth ods have been continuously reported to improve the implementation of these transforms. Early developments of fast algorithms for discrete transforms have significantly stimulated the advance of digital signal processing technologies. More than 40 years after fast Fourier transform algorithms became known, several discrete transforms, including the discrete Hart ley transform and discrete cosine transform, were proposed and widely used for numerous applications. Although they all are related to the discrete Fourier transform, different fast algorithms and their implementations have to be separately developed to minimize compu tational complexity and implementation costs. In spite of the tremendous increase in the speed of computers or processors, the demands for higher processing throughout seemingl | | 出版日期 | Textbook 2004 | | 关键词 | Fourier transform; algorithms; communication; complexity; discrete Fourier transform; electronics; fast Fo | | 版次 | 1 | | doi | https://doi.org/10.1007/978-0-8176-8220-0 | | isbn_softcover | 978-1-4612-6499-6 | | isbn_ebook | 978-0-8176-8220-0Series ISSN 2296-5009 Series E-ISSN 2296-5017 | | issn_series | 2296-5009 | | copyright | Birkhäuser Boston 2004 |
The information of publication is updating
|
|
发表于 2025-3-21 18:05:43
