Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications

In this paper a deterministic algorithm for the length reduction problem is presented. This algorithm enables a new tool for performing fast convolution in sparse data. While the regular fast convolution of vectors V1, V2 whose sizes are N1, N2 respectively, takes O(N1 log N2) using FFT, the proposed algorithm performs the convolution in O(n1 log3 n1), where n1 is the number

• Type: Conference
• Year: 2007
• Where: CPM
• Authors: Amihood Amir, Oren Kapah, Ely Porat
• Keywords: CPM 2007, Fast Convolution, Length Reduction Problem, Regular Fast Convolution