Title :
Computing decimated finite cross-ambiguity functions
Author :
Auslander, L. ; Tolimieri, R.
Author_Institution :
Dept. of Math., City Univ. of New York, NY, USA
fDate :
3/1/1988 12:00:00 AM
Abstract :
A fast algorithm computing decimated finite cross-ambiguity functions is designed, which is tailored for implementation on parallel computer architectures. Several standard methods carry out cross-ambiguity function computations in two stages, a coarse mode which estimates the location of peaks, and a fine mode relying on FFT algorithms which produces greater detail. The coarse mode computation is not required, but only decimated values ranging over the entire domain of the cross-ambiguity function are computed
Keywords :
computerised signal processing; parallel processing; FFT; coarse mode; decimated finite cross-ambiguity functions; fine mode; parallel computer architectures; Algorithm design and analysis; Biomedical imaging; Computer architecture; Concurrent computing; Fourier transforms; Helium; Radar imaging; Signal processing algorithms; Sonar; Speech analysis;
Journal_Title :
Acoustics, Speech and Signal Processing, IEEE Transactions on
