Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: Notesfiles $Revision: 1.6.2.17 $; site smu.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxj!mhuxn!houxm!ihnp4!inuxc!pur-ee!uiucdcs!smu!pedz
From: pedz@smu.UUCP
Newsgroups: net.wanted.sources
Subject: Re: Orphaned Response
Message-ID: <36800001@smu.UUCP>
Date: Wed, 5-Dec-84 16:11:00 EST
Article-I.D.: smu.36800001
Posted: Wed Dec  5 16:11:00 1984
Date-Received: Fri, 7-Dec-84 01:49:02 EST
References: <72@utcsrgv.UUCP>
Lines: 16
Nf-ID: #R:utcsrgv:-7200:smu:36800001:37777777600:698
Nf-From: smu!pedz    Dec  5 15:11:00 1984

I made an offer of an FFT program but I never sent it to the net
bacause of lack of interest.  The conditions for receiving a copy
was quit simple.  The program has been tested and works but I was
never satisfied with the answers that it produces.  I never found a
sequence of input points with a specified output.  So the condition
was to test the FFT program and determine if it did indeed produce
the correct answers.  If it did or did not, I wanted to know the
results and how you determined them.

Perry
convex!smu!pedz

p.s.  This is not intended for production or any extremely serious
work.  It is written in C and is as fast as I can make it without
going to an extreme amount of trouble.