Conference paper
Characterization of line width variation
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000
Paper
On computing the discrete fourier transform
Abstract
A new algorithm for computing the Discrete Fourier Transform is described. The algorithm is based on a recent result in complexity theory which enables us to derive efficient algorithms for convolution. These algorithms are then used to obtain the new Discrete Fourier Transform algorithm. © 1978 American Mathematical Society.
Related
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
Shashanka Ubaru, Lior Horesh, et al.
Journal of Biomedical Informatics
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics