110368     Fast Fourier Transform and Two Applications  Version:
December 1977/April 1978
 
Submitted by: E. H. Carlton, Medical University of South Carolina,
Charleston, SC
 
Operating System: LSI-11, RT-11 V2  Source Language: MACRO-11  Memory
Required: 8-28K  Hardware Required: KEV11 EIS/FIS, Schmidt trigger,
Realtime clock, A/D converter, D/A converter, X-Y oscilloscope, Analog
plotter KEV11 EIS/FIS.  Keywords: Conversions, Scientific Applications
 
Abstract: FFT is a radix-2 complex fast Fourier transform written
in MACRO-11 assembly language for an LSI-11 computer
with EIS and RT-11 operating system.
 
WF 3D can be used to obtain Wiener filtered or
unfiltered averages of analog signals.  The user sets
on-line, the number of sweeps, number of points per
sweep, time between points, and chooses the filter. Both
recursive and non-recursive versions of the Wiener
filter, as well as unfiltered signal averaging are
available.
 
CSPEC samples analog inputs, computes and stores on
diskette the power spectrum of each sweep, and plots the
compressed spectral array.  The user selects, on-line,
the number of sweeps, number of points per sweep, time
between points, artificat rejection level, horizontal
and vertical offsets and smoothing factor.
 
Media (Service Charge Code): User's Manual (EA), One RX01 Diskette
(KA)  Format: RT-11, 600' Magnetic Tape (MA)  Format: RT-11