Two-variable modularized fast polynomial transform algorithm for 2-D discrete Fourier transforms

摘要

A novel two-variable modularized fast polynomial transform (FPT) algorithm is presented. In this method, only fast polynomial transforms and fast Fourier transforms of the same length are required. The modularity, regularity, and easy extensibility of the proposed algorithm make it of great practical value in computing multidimensional discrete Fourier transforms (DFTs).