[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## Re: interesting FFT benchmarking!

**From**: |
Geraint Paul Bevan |

**Subject**: |
Re: interesting FFT benchmarking! |

**Date**: |
Tue, 29 Jul 2003 17:30:03 +0100 |

**User-agent**: |
Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.4) Gecko/20030624 |

address@hidden wrote:
>
> Anybody has any idea of what is going on here? Octave transforms complex
> signals as fast as Matlab transforms real signals, and transforms real
> signals as slow as matlab does with complex signals!! Why isn't the
> transform from real signals faster in octave?...
>
I may be wrong, but I think you'll find that Octave converts real data
into complex data before performing a Fourier transform.
If you look in liboctave/oct-fftw.h, you will notice that there is no
declaration for octave_fftw involving real matrices.
An additional clue is the fact that only the complex variants of fftpack
are present in libcruft/fftpack.
--
Geraint Bevan
Department of Mechanical Engineering
University of Glasgow
Tel: +44 (0)141 330 5917
-------------------------------------------------------------
Octave is freely available under the terms of the GNU GPL.
Octave's home on the web: http://www.octave.org
How to fund new projects: http://www.octave.org/funding.html
Subscription information: http://www.octave.org/archive.html
-------------------------------------------------------------