Wu, Ja-LingJa-LingWuHuang, Yuh-MingYuh-MingHuang2009-05-062018-07-052009-05-062018-07-051991https://www.scopus.com/inward/record.uri?eid=2-s2.0-0026220187&doi=10.1109%2f78.134460&partnerID=40&md5=ec6362e12be367e97f13b94f30c582fdIn 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 IEEEapplication/pdf206037 bytesapplication/pdfen-USComputer Systems, Digital - Multiprocessing; Mathematical Transformations - Fourier Transforms; Signal Processing - Digital Techniques; Fast Polynomial Transform; FPT Algorithms; Two-Dimensional Discrete Fourier Transform; Mathematical Techniquesjournal article10.1109/78.1344602-s2.0-0026220187http://ntur.lib.ntu.edu.tw/bitstream/246246/155278/1/15.pdf