• Publications
  • Influence
Discrete Fourier transforms when the number of data samples is prime
The discrete Fourier transform of a sequence of N points, where N is a prime number, is shown to be essentially a circular correlation. This can be recognized by rearranging the members of theExpand
  • 498
  • 32
The chirp z-transform algorithm
A computational algorithm for numerically evaluating the z -transform of a sequence of N samples is discussed. This algorithm has been named the chirp z -transform (CZT) algorithm. Using the CZTExpand
  • 510
  • 29
Adaptive beamformer orthogonal rejection test
TLDR
This paper introduces a new detection algorithm we call the adaptive beamformer orthogonal rejection test (ABORT). Expand
  • 143
  • 17
Algorithms for Statistical Signal Processing
1. Introduction. Characterization of Signals. Characterization of Linear Time-Invariant Systems. Sampling of Signals. Linear Filtering Methods Based on the DFT. The Cepstrum. Summary and References.Expand
  • 124
  • 16
The chirp z-transform algorithm and its application
We discuss a computational algorithm for numerically evaluating the z-transform of a sequence of N samples. This algorithm has been named the chirp z-transform algorithm. Using this algorithm one canExpand
  • 310
  • 11
  • PDF
Hyperbolic householder transformations
  • C. Rader, A. Steinhardt
  • Mathematics, Computer Science
  • IEEE Trans. Acoust. Speech Signal Process.
  • 1 December 1986
TLDR
A class of transformation matrices, analogous to the Householder Matrices, is developed, with a nonorthogonal property designed to permit the efficient deletion of data from least-squares problems. Expand
  • 127
  • 10
Advanced Digital Signal Processing
Outline:
  • 211
  • 9
  • PDF
What is the fast Fourier transform
TLDR
The fast Fourier transform is a computational tool which facilitates signal analysis such as power spectrum analysis and filter simulation. Expand
  • 388
  • 7
  • PDF
A new principle for fast Fourier transformation
An alternative form of the fast Fourier transform (FFT) is developed. The new algorithm has the peculiarity that none of the multiplying constants required are complex-most are pure imaginary. TheExpand
  • 155
  • 7
Fast transforms: Algorithms, analyses, applications
  • 156
  • 6