An Input-Adaptive Algorithm for High Performance Sparse Fast Fourier Transform Shuo Chen and Xiaoming Li University of Delaware, Newark, DE, USA [removed] [removed]

First Page		Document Content
Date: 2013-09-23 21:44:01 Fourier analysis Fast Fourier transform Discrete Fourier transform Twiddle factor FFTW Convolution Adaptive filter Finite impulse response Discrete Hartley transform Mathematical analysis Digital signal processing Mathematics		An Input-Adaptive Algorithm for High Performance Sparse Fast Fourier Transform Shuo Chen and Xiaoming Li University of Delaware, Newark, DE, USA [removed] [removed] Add to Reading List Source URL: parasol.tamu.edu Download Document from Source Website File Size: 623,19 KB Share Document on Facebook

	Design of a Convolution Engine optimised for Reverb Fons ADRIAENSEN Abstract Real-time convolution has become a practical tool DocID: 1voiR - View Document
	Lecture VI: Convolution representation of discrete-time systems Maxim Raginsky BME 171: Signals and Systems Duke University DocID: 1vjTH - View Document
	Design of a Convolution Engine optimised for Reverb Fons Adriaensen 4th Linux Audio Conference ZKM Karlsruhe DocID: 1v8Vz - View Document
	Towards Optimal Winograd Convolution on Manycores Zhen Jia∗† Aleksandar Zlateski∗‡ Fredo Durand‡ Kai Li† † Princeton University ‡ Massachusetts Institute of Technology ∗ Equally contributed Motivation a DocID: 1uSaj - View Document
	KDD CUP 2017 Travel Time Prediction Predicting Travel Time – The Winning Solution of KDD CUP 2017 Team: Convolution Ke Hu DocID: 1uNhQ - View Document