We present an improved adaptive rank detection algorithm for on-line estimation and tracking of the signal subspace dimension in applications of spherical subspace trackers. The proposed algorithm uses different adaptive thresholds for the rank increase (up) and decrease (down) tests as well as a special set of fast tracking eigenvalue estimates in the rank decrease test, which can be obtained at little extra cost. It is based on an original investigation of the detection per-formance for the up and down tests that takes into account the exponential nature of the eigenvalue update in spherical subspace trackers. Through computer experiments in multi-user detection, it is shown that with the proposed algorithm, the time required to detect a ...
A new method is presented for estimating the column space (signal subspace) of a low rank data matri...
International audienceIn an airborne radar context, heterogeneous situations are a serious concern f...
Traditional subspace methods (SS) for blind channel identification require accurate rank estimation ...
This dissertation is concerned with the task of efficiently and accurately tracking the singular val...
A new subspace tracking algorithm which gives accurate estimates of the r largest singular values an...
Traditional adaptive lters assume that the eective rank of the input signal is the same as the input...
ABSTRACT. The LMS adaptive algorithm is the most popular algorithm for adaptive ltering because of i...
Erbay, Hasan/0000-0002-7555-541XWOS: 000273521400010This article presents an URV-based matrix decomp...
This paper provides a unified view of, and a further insight into, a class of optimal reduced-rankes...
Many decentralized subspace tracking algorithms has been proposed in the literature, see [1, 2, 5]. ...
Erbay, Hasan/0000-0002-7555-541XWOS: 000240086000013Traditionally, the singular value decomposition ...
This paper describes two new algorithms fortrac king thesubspac spanned by theprinc eigenvec1 of the...
A subspace tracking technique has drawn a lot of attentions due to its wide applications. The main o...
This paper provides a unified view of, and a further insight into, a class of optimal reduced-rank e...
Fast estimation and tracking of the principal subspace of a sequence of random vectors is a classic ...
A new method is presented for estimating the column space (signal subspace) of a low rank data matri...
International audienceIn an airborne radar context, heterogeneous situations are a serious concern f...
Traditional subspace methods (SS) for blind channel identification require accurate rank estimation ...
This dissertation is concerned with the task of efficiently and accurately tracking the singular val...
A new subspace tracking algorithm which gives accurate estimates of the r largest singular values an...
Traditional adaptive lters assume that the eective rank of the input signal is the same as the input...
ABSTRACT. The LMS adaptive algorithm is the most popular algorithm for adaptive ltering because of i...
Erbay, Hasan/0000-0002-7555-541XWOS: 000273521400010This article presents an URV-based matrix decomp...
This paper provides a unified view of, and a further insight into, a class of optimal reduced-rankes...
Many decentralized subspace tracking algorithms has been proposed in the literature, see [1, 2, 5]. ...
Erbay, Hasan/0000-0002-7555-541XWOS: 000240086000013Traditionally, the singular value decomposition ...
This paper describes two new algorithms fortrac king thesubspac spanned by theprinc eigenvec1 of the...
A subspace tracking technique has drawn a lot of attentions due to its wide applications. The main o...
This paper provides a unified view of, and a further insight into, a class of optimal reduced-rank e...
Fast estimation and tracking of the principal subspace of a sequence of random vectors is a classic ...
A new method is presented for estimating the column space (signal subspace) of a low rank data matri...
International audienceIn an airborne radar context, heterogeneous situations are a serious concern f...
Traditional subspace methods (SS) for blind channel identification require accurate rank estimation ...