All Questions
2 questions
3
votes
1
answer
2k
views
Deconvolution using the discrete Fourier transform
Summary: From discrete convolution theorem, it is understandable that we need 2N-1 point DFT of both sequences in order to avoid circular convolution. If we need to do deconvolution of a given ...
- 879
1
vote
1
answer
86
views
Subquadratic multiplication of probability mass functions (with log-convolution?)
We are currently looking for a fast, i.e. subquadratic, algorithm for the following equation:
$z_m = \sum_{i,j :\, (i \cdot j) = m} x_i \cdot y_j$.
That is, we are given two finite input vectors $x$ ...
- 13