Re: Looking for 2D FFT code...

Article View: comp.dsp

Article #479

#479

From: michael k finegan
Date: Wed, 25 Oct 1989 22:27

13 lines
768 bytes

sdw@hpsad.HP.COM (Steve Warwick) writes:

>Try "Numerical Recipies in C" page 467 for the complete code.

>(This one was easy..)

>Steve Warwick
But don't plan to compile it on a 16 bit machine, and don't mind
wasting M+N elements of your N+1 by M+1 array ... Anyone actually
translate all the indices from 1 <= j <= N, to 0 <= j < N ?

				Michael Finegan
				mfinegan@uceng.uc.edu

Technical Details

Message-ID: <2576@uceng.UC.EDU>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!iuvax!uceng!mfinegan

References: <5047@orca.WV.TEK.COM> <9520008@hpsad.HP.COM>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!iuvax!uceng!mfinegan
From: mfinegan@uceng.UC.EDU (michael k finegan)
Newsgroups: comp.dsp
Subject: Re: Looking for 2D FFT code...
Message-ID: <2576@uceng.UC.EDU>
Date: 25 Oct 89 22:27:13 GMT
References: <5047@orca.WV.TEK.COM> <9520008@hpsad.HP.COM>
Organization: Univ. of Cincinnati, College of Engg.
Lines: 13

Reply to Parent Message