Three solvers for MIMO noise radar clutter cancellation - a performance comparison

The problem of canceling strong clutter echos in a MIMO noise radar is considered. Execution times of three algorithms is compared. The first solution is a standard Least Squares approach employing Cholesky decomposition of the transmitted signal sample autocorrelation matrix. The second approach is based on careful waveform design which guarantees that the signal sample autocorrelation matrix has Toeplitz structure. This enables one to employ the Levinson recursion instead of the Cholesky decomposition. The third approach lies between the first two. It does not employ waveform design but takes advantage of almost Toeplitz structure of the autocorrelation matrix by means of a modified, Levinson-like recursion.