Xref: utzoo comp.lang.fortran:1708 comp.lang.c++:2440
Path: utzoo!attcan!uunet!lll-winken!ames!xanth!mcnc!thorin!coggins!coggins
From: coggins@coggins.cs.unc.edu (Dr. James Coggins)
Newsgroups: comp.lang.fortran,comp.lang.c++
Subject: Re: Fast Fourier Transformer
Summary: I have one
Message-ID: <6217@thorin.cs.unc.edu>
Date: 18 Jan 89 13:36:55 GMT
References: <518@cs-spool.calgary.UUCP>
Sender: news@thorin.cs.unc.edu
Reply-To: coggins@coggins.UUCP (Dr. James Coggins)
Organization: University Of North Carolina, Chapel Hill
Lines: 30

In article <518@cs-spool.calgary.UUCP> vermeer@cpsc.ucalgary.ca (Willem Vermeer) writes:
>Does anyone have a FFT-program available, in whatever
>computerlanguage? Or does anyone have any idea where to look for one?
>
>
>Thanks in advance for the help,
>Willem Vermeer
>
>Willem Vermeer, University of Calgary: vermeer@cpsc.UCalgary.CA
>home: 1228 Varsity Estates Road Nw Calgary, AB, T3B 2W1 Canada

I have a C++ class definition for 1D and 2D FFTs.
The constructor for the class builds a bunch of tables that make
application of the transforms very fast.  Then there are forward
and inverse messages to apply the operations.  These messages take
images as arguments.

Some people think that a class has to be based on some data item.
They forget that algorithm is a noun.  An algorithm that is of
interest as an object of study itself can form a nice class. I call
these process encapsulations, or enzymes.  My FFT server is a prime
example, but there are many others.

---------------------------------------------------------------------
Dr. James M. Coggins          coggins@cs.unc.edu
Computer Science Department   
UNC-Chapel Hill               It has not been established whether
Chapel Hill, NC 27514-3175    intelligence is a survivable trait.
---------------------------------------------------------------------