All Questions

Basic convolutions can be computed efficiently by taking fourier transforms and applying the convolution theorem. Is there something analogous for a more general transform, where we have a varying ...

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 ...