The fast Fourier transform algorithm for the production of the permutation factor circulant matrices
Lai Yi-xin · 2004
A fast Fourier transform algorithm for the production of the permutation factor circulant matrices of order n based on the fast Fourier transform(FFT) was presented, and arithmetric complexity is O(nlog_2n).