Re: [boost] Re: FFT

From: John Suters (johnds_at_[hidden])
Date: 2001-11-01 14:11:27

My apologies. I've been lurking for a little while, and did do a couple of
searches through the archive loooking for threads on this subject, but I
didn't look in the files section until after I made my post, and so didn't
see your stuff in there. I've got Numerical Recipes, but I've tended to look
for other resources, as I find the code dense. I'll certainly reread the fft
chapter a bit more carefully now.

I would be most interested in any relevant references you could provide.
I've obviously bitten off a little more to chew than I had originally
thought, but I'll make some changes to my stuff (to make it look a bit more
<algorithm>ish and post it up on the files section for people to have a look
at anyway. It'll only be the 2^n algorithm, but I figure that'll be useful
in and of itself (for the ap integer class being worked on by Helmut, I
think). I can then get to work on the more general forms.

John

----- Original Message -----
From: "Hubert HOLIN" <Hubert.Holin_at_[hidden]>
To: <boost_at_[hidden]>
Sent: Wednesday, October 31, 2001 11:37 PM
Subject: [boost] Re: FFT

> Paris (U.E.), le 01/11/2001
>
> Bonsoir
>
> I guess the need is here, at least it was there a few month
> ago :-)  .
>
> Last time this was discussed here, I uploaded a (very) old
> implementation of a basic version (borrowing some ideas if not the code
> from NR) to the vault, where it still gathers dust. I will readress
> that, as the need for it in my current work will finaly resurface in
> the reasonably near future, but for the time being, it is in stasis
> (too many things to do, too litle time... and a mostly irrelevant day
> job!). Perhaps it may still be of use, if you are willing to take up
> the torch (and save me work ;-)  ). At the very least, I can provide
> some interesting (math) literature I was intending to use, beyond NR.
>
> Good luck!
>
> Hubert Holin
> Hubert.Holin_at_[hidden]
>
> I am not a mad scientist, I am a mad mathematician!
>
> --- In boost_at_y..., johnds_at_t... wrote:
> > Would there be any interest in a fast fourier transformation class?
> > I've written one that has the following signature:
> >
> > template<class DOUBLE,
> > class COMPLEX = std::complex<DOUBLE>,
> > class VECTOR = std::vector<COMPLEX> >
> > class fft
> > {
> > static inline void transform(VECTOR&, bool);
> > };
> >
> > The bool parameter on the transform specifies whether we're taking
> > the inverse or not, and defaults to false.
> >
> > The reason for the class (as distinct from a templated function) is
> > to enable default template arguments -
> > there's no actual state.
> >
> > If there's interest, I'll tidy things up (appropriate copyright etc)
> > and upload it for initial review.
> >
> > John
>
>
>
> Info: http://www.boost.org  Unsubscribe:
<mailto:boost-unsubscribe_at_[hidden]>
>
> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/
>
>
>