Title :
The compare of computation FFT on base cyclic convolutions for size of N=2n
Author_Institution :
CAD Dept., Lviv Polytech. Nat. Univ., Lviv
Abstract :
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.
Keywords :
convolution; fast Fourier transforms; matrix algebra; base cyclic convolution; computation FFT; computation discrete harmonic transform; fast Fourier transform; matrix algebra; Algorithm design and analysis; Discrete Fourier transforms; Discrete cosine transforms; Discrete transforms; Fast Fourier transforms; Fourier transforms; Matrix decomposition; Microelectronics; Micromechanical devices; Quantization; cyclic convolutions; discrete harmonic transform (DHT); hashing array; subarrays arguments and signs;
Conference_Titel :
Perspective Technologies and Methods in MEMS Design, 2009. MEMSTECH 2009. 2009 5th International Conference on
Conference_Location :
Zakarpattya
Print_ISBN :
978-966-2191-06-6
