Transform algorithm for computing two-dimensional convolutions

B. Arambepola · 2005

Several theoretical results concerning the discrete Fourier transform are derived. These are then used to obtain an efficient algorithm for extending the range of lengths of a multi-dimensional convolver or correlator based on a transform processor or program. Methods of implementing this algorithm in hardware and software are also considered.

Read the paper · More papers on PaperTik