1 November 1991 Extension of Rader's algorithm for high-speed multidimensional autocorrelation
Author Affiliations +
The computation of an estimate of the autocorrelation function from available data enters a great number of signal processing applications and typically represents the bulk of the computation time required in each application. This work investigates frequency domain techniques for the evaluation of the autocorrelation of multidimensional signals: in particular, the extension of Rader's algorithm for 1D signals is considered. The bidimensional case is treated in detail because it is of special interest for applications and because the reasoning used can be readily applied to higher dimension signals. The direct extension of Rader's algorithm to the multidimensional case is not optimal with respect to the choice of the subblock dimension, unlike in the one dimensional case: a modified algorithm is proposed that allows further computational savings and is particularly attractive for the data organization. The computation time required by frequency domain techniques is evaluated in detail. The analysis confirms that the proposed frequency domain techniques lead to significant computation time savings.
© (1991) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
R. Rinaldo, R. Rinaldo, Riccardo Bernardini, Riccardo Bernardini, Guido Maria Cortelazzo, Guido Maria Cortelazzo, } "Extension of Rader's algorithm for high-speed multidimensional autocorrelation", Proc. SPIE 1606, Visual Communications and Image Processing '91: Image Processing, (1 November 1991); doi: 10.1117/12.50336; https://doi.org/10.1117/12.50336

Back to Top