Re: [Numpy-discussion] chirp-z

Stefan van der Walt wrote: > > There is also the problem that you suddenly double your memory usage. Is it a problem for 1d signals ? I cannot think about an example where you would need to do fft long enough such as this is a problem for the applications I know of fft. Also, if you do several 1d

Re: [Numpy-discussion] chirp-z

On Mon, May 28, 2007 at 03:15:33PM +0900, David Cournapeau wrote: > Matthieu Brucher wrote: > > > > There really aren't any transparent fast fft convolutions in > > SciPy. The closest thing is in signaltools, fftconvolve, and if > > you ask it to convolve, say, sequences whose length ad

Re: [Numpy-discussion] chirp-z

On Sat, May 26, 2007 at 10:37:41PM -0600, Charles R Harris wrote: > I have been looking around for chirp-z code with a useable license. There is > the original fortran version by Rader et. al. out there, as well as a package > from FreeBSD at > http://ftp2.at.freebsd.org/pub/FreeBSD/distfiles/fxt-2

Re: [Numpy-discussion] chirp-z

> I'm a moderator on a French programming forum, and in the algorithm > area, there are people that even don't know the FFT algorithm that > want to make complicated thing with it, it is bound to fail. I suppose > that indicating this "limitation" in the docstring is enough, so that > people make

Re: [Numpy-discussion] chirp-z

Matthieu Brucher wrote: > > There really aren't any transparent fast fft convolutions in > SciPy. The closest thing is in signaltools, fftconvolve, and if > you ask it to convolve, say, sequences whose length add up to > 7902, then it will do a size 7901 transform. > > > BTW, is thi

Re: [Numpy-discussion] chirp-z

Charles R Harris wrote: > > > On 5/27/07, *Matthieu Brucher* <[EMAIL PROTECTED] > > wrote: > > Hi, > > Isn't the chirp transform only two cross-correlations ? And for a > fast one, there is a module in SciPy, and I think that kind of > operation belongs mo

Re: [Numpy-discussion] chirp-z

There really aren't any transparent fast fft convolutions in SciPy. The closest thing is in signaltools, fftconvolve, and if you ask it to convolve, say, sequences whose length add up to 7902, then it will do a size 7901 transform. BTW, is this really a glitch ? I think there is two schools th

Re: [Numpy-discussion] chirp-z

Umm, no, There really aren't any transparent fast fft convolutions in SciPy. The closest thing is in signaltools, fftconvolve, and if you ask it to convolve, say, sequences whose length add up to 7902, then it will do a size 7901 transform. Because 7901 is prime this takes about 300 times as lon

Re: [Numpy-discussion] chirp-z

On 5/27/07, Matthieu Brucher <[EMAIL PROTECTED]> wrote: Hi, Isn't the chirp transform only two cross-correlations ? And for a fast one, there is a module in SciPy, and I think that kind of operation belongs more to Scipy than Numpy ;) Umm, no, There really aren't any transparent fast fft co

Re: [Numpy-discussion] chirp-z

Sorry, not cross-correlation, convolution, too early in the morning here... 2007/5/27, Matthieu Brucher <[EMAIL PROTECTED]>: Hi, Isn't the chirp transform only two cross-correlations ? And for a fast one, there is a module in SciPy, and I think that kind of operation belongs more to Scipy than

Re: [Numpy-discussion] chirp-z

Hi, Isn't the chirp transform only two cross-correlations ? And for a fast one, there is a module in SciPy, and I think that kind of operation belongs more to Scipy than Numpy ;) Matthieu 2007/5/27, Charles R Harris <[EMAIL PROTECTED]>: All, I have been looking around for chirp-z code with a

[Numpy-discussion] chirp-z

All, I have been looking around for chirp-z code with a useable license. There is the original fortran version by Rader et. al. out there, as well as a package from FreeBSD at http://ftp2.at.freebsd.org/pub/FreeBSD/distfiles/fxt-2006.12.17.tgz. The latter is c++ and relies on function signatures