EFFICIENT DEALIASED CONVOLUTIONS WITHOUT PADDING∗ JOHN C. BOWMAN† AND MALCOLM ROBERTS† SIAM J. Sci. Comput., 33:1, Abstract. Algorithms are developed for calculating dealiased linear convolution sums

First Page		Document Content
Date: 2016-02-21 19:03:42 Fourier analysis Convolution Discrete Fourier transform Multidimensional discrete convolution Fourier transform Circular convolution Fourier series Spectral method Discrete Hartley transform SchnhageStrassen algorithm		EFFICIENT DEALIASED CONVOLUTIONS WITHOUT PADDING∗ JOHN C. BOWMAN† AND MALCOLM ROBERTS† SIAM J. Sci. Comput., 33:1, Abstract. Algorithms are developed for calculating dealiased linear convolution sums Add to Reading List Source URL: www.math.ualberta.ca Download Document from Source Website File Size: 414,17 KB Share Document on Facebook

	EFFICIENT DEALIASED CONVOLUTIONS WITHOUT PADDING∗ JOHN C. BOWMAN† AND MALCOLM ROBERTS† SIAM J. Sci. Comput., 33:1, Abstract. Algorithms are developed for calculating dealiased linear convolution sums DocID: 1pIUd - View Document
	ISSN No: International Journal & Magazine of Engineering, Technology, Management and Research A Peer Reviewed Open Access International Journal DocID: 1p2Kd - View Document
	MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Reduced Complexity Blind Chromatic Dispersion Estimation for Digital Coherent Systems Arlunno, V.; Millar, D.S.; Koike-Akino, T.; Pajovic, M.; Kojima, K.; Par DocID: 1nwcG - View Document
	Modern Signal Processing MSRI Publications Volume 46, 2003 The Cooley–Tukey FFT and Group Theory DAVID K. MASLEN AND DANIEL N. ROCKMORE DocID: 18TUQ - View Document
	Recent Developments in the Sparse Fourier Transform Piotr Indyk MIT Joint work with Fadel Adib, Badih Ghazi, Haitham Hassanieh, Michael DocID: 12MCW - View Document