Adaptive algorithm for interference canceling in array processing

Franklin T. Luk; Sanzheng Qiao

doi:10.1117/12.255429

22 October 1996 Adaptive algorithm for interference canceling in array processing

Franklin T. Luk, Sanzheng Qiao

Proceedings Volume 2846, Advanced Signal Processing Algorithms, Architectures, and Implementations VI; (1996) https://doi.org/10.1117/12.255429
Event: SPIE's 1996 International Symposium on Optical Science, Engineering, and Instrumentation, 1996, Denver, CO, United States

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.

Citation Download Citation

Franklin T. Luk and Sanzheng Qiao "Adaptive algorithm for interference canceling in array processing", Proc. SPIE 2846, Advanced Signal Processing Algorithms, Architectures, and Implementations VI, (22 October 1996); https://doi.org/10.1117/12.255429

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available