Optimal use of high-speed programmable digital signal processors generally demands familiarity with machine architectural features and hence, production of programs whose structure reflects and exploits those features. In contrast, it is apparent that little effort has been made to develop programming techniques which fully realize the signal processing computational capability of standard minicomputers. In this paper, it is shown that a functional high-level language signal processing program can easily be modified so as to produce a similar program which, when executed, automatically generates another program containing precomputed algorithm sequencing and data access information. The generated program will then utilize central processor arithmetic and logical capability only for data-dependent computation. In this way, instructions normally associated with computation for program sequencing/control or data access are eliminated, and all benefits of increased algorithm complexity for reduction of data-dependent arithmetic computation are in fact realized as decreased program execution time. Examples are given of Fortran programs which generate Fortran FFT subroutines and, for completeness, assembly language realizations of the Pfeifer/Blankinship autocorrelation algorithm. Results demonstrate that, using this technique, standard minicomputers may execute digital signal processing algorithms faster than peripheral processors which normally require standard minicomputers as host processors.
[1]
W. Blankinship.
Note on computing autocorrelations
,
1974
.
[2]
J. Markel,et al.
FFT pruning
,
1971
.
[3]
L. Rabiner,et al.
A novel implementation for narrow-band FIR digital filters
,
1975
.
[4]
G. Bongiovanni,et al.
Procedures for computing the discrete Fourier transform on staggered blocks
,
1976
.
[5]
L. Pfeifer.
Multiplication reduction in short-term autocorrelation
,
1973
.
[6]
Shmuel Winograd.
On computing the Discrete Fourier Transform.
,
1976
.
[7]
G. Bergland,et al.
A radix-eight fast Fourier transform subroutine for real-valued series
,
1969
.
[8]
R. Singleton.
An algorithm for computing the mixed radix fast Fourier transform
,
1969
.
[9]
M. Knudsen.
Real-time linear-predictive coding of speech on the SPS-41 triple-microprocessor machine
,
1975
.
[10]
Peter D. Welch,et al.
The Fast Fourier Transform and Its Applications
,
1969
.
[11]
L. Morris.
Fast speech spectrogram reduction and display on minicomputer/Graphics processors
,
1975
.
[12]
D. Skinner.
Pruning the decimation in-time FFT algorithm
,
1976
.