Answers are grounded in this paper and cite their sources.
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.>
No takes yet. Share an insight, caveat, or question.
Auslander et al. (1988) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: