Displaying 1 result from an estimated 1 matches for "next_power_of_2".
2007 Feb 06
0
convolve: request for "usual" behaviour + some improvements + some fixes
...n is the best case for the fft, the worst case
> being
> when
> > Herve> the length is a prime number):
> ...
> > The typical approach here and definitely the idea of the
> > original author of convolve() - would be to use nextn() here
> > instead of "next_power_of_2()".
>
> The current implementation of convolve uses an fft-buffer of length
> nx + ny - 1 for "open" convolution, not nextn().
> The fft-based convolution is by nature "circular". However it can be
> used for "open" convolutions: the trick is to pad...