Adaptive algorithm for interference canceling in array processing
Franklin T. Luk, Sanzheng Qiao · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1996
In array processing, one technique for cancelling interference in the presence of colored noise is the ULLV decomposition of a pair of matrices. The factorization is stable and accurate, and is easy to update when a row is added to either one of the two matrices. In earlier work, we made the assumptions that both matrices must have at least as many rows as columns and that the matrix representing interference must have full column rank. In this paper, we relax the latter restriction and allow the interference matrix to be rank deficient. We present an algorithm for computing the decomposition and two techniques for updating it. The details on updating are quite different from those in the full rank case.