Re: Efficient Column-wise FFT Routines?

Article View: comp.lang.fortran

Article #4634

#4634

From: Gerry Picard
Date: Fri, 29 Mar 1996 13:44

27 lines
1504 bytes

In article <4jev78$bp7@dawn.mmm.com>, rbmccammon@mmm.com says...
>
>
>warrenp@titan.colorado.edu (Pete Warren) wrote:
>>Greetings all,
>>
>>I am trying to perform large scale FFT's on complex data in a column (or

>Way back in '79, the IEEE Press published a set of Fortran routines for 
signal 
>processing.  I think that they are still available.  ISBN 0-87942-127-4, 
distributed 

I vaugely remember a (mentioned above?) IEEE Press book called Digital 
Signal Processing that i used for a FFT routine called FFT842.  The FFT 
performed radix 8 manipulation on the data until there was only a radix 4, 
radix 2, or no operation to be performed on the data.  It was a modified 
Cooley-Turkey (sp?) that sped up the operation.  It was a complex FFT but 
used two reals for the real and imaginary (fake :-)) part.

The source is in FORTRAN.  I have a copy of the source.

Gerry

email address thomas_picard@ccmail.orl.mmc.com

The opinions expressed here are mine alone.

Technical Details

Message-ID: <4jgpfh$q53@theopolis.orl.mmc.com>

Path: arc1-ca.pugleaf.net!news.orl.mmc.com!usenet

References: <warrenp-2603961110500001@ren.colorado.edu> <4jev78$bp7@dawn.mmm.com>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!news.orl.mmc.com!usenet
From: thomas_picard@ccmail.orl.mmc.com (Gerry Picard)
Newsgroups: comp.lang.fortran,comp.lang.c
Subject: Re: Efficient Column-wise FFT Routines?
Date: 29 Mar 1996 13:44:17 GMT
Organization: Lockheed Martin
Message-ID: <4jgpfh$q53@theopolis.orl.mmc.com>
References: <warrenp-2603961110500001@ren.colorado.edu> <4jev78$bp7@dawn.mmm.com>
NNTP-Posting-Host: sys4720.orl.mmc.com
Mime-Version: 1.0
Content-Type: Text/Plain; charset=US-ASCII
X-Newsreader: WinVN 0.99.7

Reply to Parent Message