Author pages are created from data sourced from our academic publisher partnerships and public sources.
- Publications
- Influence
Discrete Fourier transforms when the number of data samples is prime
- C. Rader
- Mathematics
- 1 June 1968
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 the… Expand
The chirp z-transform algorithm
- L. Rabiner, R. Schafer, C. Rader
- Mathematics
- 1 June 1969
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 CZT… Expand
Adaptive beamformer orthogonal rejection test
- N. Pulsone, C. Rader
- Mathematics, Computer Science
- IEEE Trans. Signal Process.
- 1 March 2001
TLDR
Algorithms for Statistical Signal Processing
- J. Proakis, C. L. Nikias, C. Rader, F. Ling, M. Moonen, I. Proudler
- Mathematics
- 15 January 2002
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
- L. Rabiner, R. Schafer, C. Rader
- Mathematics
- 6 May 1969
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 can… Expand
Hyperbolic householder transformations
- C. Rader, A. Steinhardt
- Mathematics, Computer Science
- IEEE Trans. Acoust. Speech Signal Process.
- 1 December 1986
TLDR
What is the fast Fourier transform
- W. Cochran, J. Cooley, +7 authors P. Welch
- Computer Science
- 1 June 1967
TLDR
A new principle for fast Fourier transformation
- C. Rader, N. Brenner
- Mathematics
- 1 June 1976
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. The… Expand