The compare of computation FFT on base cyclic convolutions for size of N=2 n
Ihor Prots’ko · International Conference on Perspective Technologies and Methods in MEMS Design · 2009
The efficient computation of discrete harmonic transforms or FFT (fast Fourier transform) is introduced. The cyclic convolutions is fundamental of algorithms for computation discrete harmonic transform. The main difference structures of the basis matrix is considered.