×

A new sufficient algorithm for computing a few DFT points. (English) Zbl 0691.42011

Circuits and systems, Proc. Int. IEEE Symp., Espoo/Finl. 1988, 1915-1918 (1988).
[For the entire collection see Zbl 0686.00021.]
The paper describes a new method for computing a prescribed number of points in discrete Fourier transform (DFT). The method originally combines two previously known algorithms obtaining better performance than both ones.
Reviewer: C.A.Marinov

MSC:

42A38 Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type
65R10 Numerical methods for integral transforms

Citations:

Zbl 0686.00021