Sliding FFT == freq. spectra in real time

Thread View: comp.dsp

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Brian Willoughby Thu, 28 Sep 1989 23:26

#299

Author: Brian Willoughby
Date: Thu, 28 Sep 1989 23:26

19 lines
1378 bytes

I looked up the EDN article that I mentioned in an earlier post:
Electronic Design News, Sept. 29, 1988, page 161, "Sliding FFT computes
frequency spectra in real time", by Tom Springer of Pinson Associates
Inc.

I don't have anything to try this out with (yet), but it appears to offer
more than a tenfold increase in speed when computing FFT's.  It updates
at the sample rate, provided that the system can compute N*4 multiply and
N*6 add/subtract operations N times per sample, where N is the number of
points.  I would be curious as to how fast the 56000 could execute this
algorithm.  BTW, it uses a pre-computed exponential phase shift table as
a constant factor, which eliminates the need for trig functions during
the real-time computations.

Brian Willoughby
UUCP:           ...!{tikal, sun, uunet, elwood}!microsoft!brianw
InterNet:       microsoft!brianw@uunet.UU.NET
  or:           microsoft!brianw@Sun.COM
Bitnet          brianw@microsoft.UUCP

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads