Now showing items 31-35 of 35
THE DESIGN OF DFT ALGORITHMS
A broad class of efficient discrete Fourier transform algorithms is developed by partitioning short DFT algorithms into factors. The factored short DFT's are combined into longer DFT's using multidimensional index maps. ...
APPLICATIONS OF MULTIPLICATIVE COMPLEXITY THEORY TO CONVOLUTION AND THE DISCRETE FOURIER TRANSFORM (FAST, COMPUTATIONAL, DIGITAL FILTERING, SIGNAL PROCESSING, ALGORITHMS)
A review of the theory of multiplicative complexity and its application to common signal processing operations is presented. This review collects results on the multiplicative complexity of polynomial multiplication, ...