On Wed, 12 Jul 2006 07:04:56 -0700, Tom St Denis wrote:

>

Ruan Hongning wrote:
>Hi, Friends:

May I know what's the fastest way to implement 1D/2D convolution?

Buy a book on DSP and read it?

My guess is a for loop and multiplications.

Tom

Off topic, I think. sci.math.num-analysis perhaps?

For what it's worth I've found that (my implementation of)

1D convolution via the fft is faster than the straightforward

implementation for (double) vectors of length greater than 64,

and slower otherwise, on a common or garden pc using gcc.

Implementing convolution using the fft is discussed in numerical

recipes, for example.

Duncan