Share Email Print

Proceedings Paper

Adaptive algorithm for interference canceling in array processing
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

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.

Paper Details

Date Published: 22 October 1996
PDF: 11 pages
Proc. SPIE 2846, Advanced Signal Processing Algorithms, Architectures, and Implementations VI, (22 October 1996); doi: 10.1117/12.255429
Show Author Affiliations
Franklin T. Luk, Rensselaer Polytechnic Institute (United States)
Sanzheng Qiao, City Univ. of Hong Kong (Hong Kong China)

Published in SPIE Proceedings Vol. 2846:
Advanced Signal Processing Algorithms, Architectures, and Implementations VI
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top