https://scholars.lib.ntu.edu.tw/handle/123456789/118662
標題: | An FPT algorithm with a modularized structure for computingtwo-dimensional discrete Fourier transforms | 作者: | Wu, Ja-Ling Huang, Yuh-Ming |
公開日期: | 1991 | 卷: | 39 | 期: | 9 | 起(迄)頁: | 2148-2149 | 來源出版物: | IEEE Transactions on Signal Processing | 摘要: | In this corresnondence, the fast polynomial transform (FPT) for computing two-dimensional (2-D) discrete Fourier transforms (DFT‘s) is modularized into identical modules. In this new method, only FPT's and FFT's of the same length are required. As a consequence, the architecture is more regular and naturally suitable for multiprocessor and VLSI implementations. © 1991 IEEE |
URI: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-0026220187&doi=10.1109%2f78.134460&partnerID=40&md5=ec6362e12be367e97f13b94f30c582fd | DOI: | 10.1109/78.134460 | SDG/關鍵字: | Computer Systems, Digital - Multiprocessing; Mathematical Transformations - Fourier Transforms; Signal Processing - Digital Techniques; Fast Polynomial Transform; FPT Algorithms; Two-Dimensional Discrete Fourier Transform; Mathematical Techniques |
顯示於: | 資訊工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。