Large information plus noise random matrix models and consistent subspace estimation in large sensor networks
Walid Hachem, Philippe Loubaton, Xavier Mestre, Jamal Najim, Pascal Vallet
Introduction
The classical source localization problem consists in estimating vector from samples collected in the matrix . This problem was extensively studied in the past (see e.g. and the references therein). The so-called subspace estimator of is based on the observation that if matrices and have both full rank , then the angles are solutions The angles are the unique solutions under certain assumptions on function of the equation , where represents the orthogonal projection matrix on the kernel of matrix . The existing subspace methods consist in estimating for each the quadratic form of by a certain term , and then to estimate the angles as the argument of the most significant local minima of function . This approach has been extensively developed when and fixed. In this context, can be estimated consistently for each by with the orthogonal projection matrix on the eigenspace associated to the smallest eigenvalues of the empirical covariance matrix . It clearly holds that converges torwards 0 almost surely, and this allows to prove that the corresponding estimators of the direction of arrivals are consistent.
If however and are of the same order of magnitude, a quite common situation if the number of sensors is large, then the above estimators show poor performances because is no longer an accurate estimator of . In order to study this context, Mestre & Lagunas were the first to propose consistent estimators of when in such a way that , with . In Mestre & Lagunas , it is assumed that the source signals are mutually independent complex Gaussian i.i.d. time series with unit variance elements. Under this assumption, can be written as
2 General notations and useful results
We now introduce various notations and results used throughout the paper.
The quantity will represent a generic positive constant whose main feature is to be deterministic and independent of and . The value of may change from one line to another.
We also notice that if is the Stieltjes transform of positive measure , then it holds that
Background on the Information plus Noise model and on the estimator of [23]
Assumption A-1: .
In this section, represents the complex valued random matrix given by
where and . Matrices and are assumed to satisfy the following assumptions
Assumption A-2: Matrix is deterministic and satisfies
Assumption A-4: The entries of matrix are i.i.d and follow the complex normal distribution .
We assume moreover that the non zero eigenvalues of have multiplicities 1 in order to simplify the notations. In the following, we denote by and the ordered eigenvalues and associated eigenvectors of . The eigenvalues and the eigenvectors of matrix are denoted and , and represents the empirical eigenvalue distribution of defined by
As we assume , the joint probability distribution of is absolutely continuous (see e.g. James ) and it holds that the have multiplicity 1 almost surely. We finally denote by the resolvent of matrix , i.e. .
It is well-known ([11, Th. 7.4], [9, Th. 1.1]) that it exists a sequence of deterministic probability measures such that weakly almost surely. Measure is characterized by its Stieltjes transform which is known to satisfy the equation
with and two polynomials with positive coefficients, independent of . Then,
Taking into account the previous result, it is shown in that
If we denote by the matrix-valued function defined by
then coincides with the Stieltjes transform of a positive matrix valued measure with support such that (see Hachem et al [13, Th. 2.4 & Prop. 2.2]), i.e.
In the remainder of the paper, we will make use of the following result proved in if is complex Gaussian and in Hachem et al in the non Gaussian case.
Consider two sequences of deterministic vectors , such that and . Then, it holds that
In order to present the chacterization of , we first introduce the following notations. We denote by and the functions defined by
We are now in position to characterize .
The function admits non-negative local extrema counting multiplicities (with ) whose preimages are denoted . Define and for . Then,
and the support of is given by
Moreover, for , each interval contains at least an element of the set and each eigenvalue of belongs to one of these intervals.
The second statement of the theorem shows that each eigenvalue of corresponds to a certain interval of . More precisely, an eigenvalue of will be said to be associated to cluster if it belongs to the interval . We note that the eigenvalue is necessarily associated to the first cluster .
and for each ,
3 Some useful evaluations
In this paragraph, we gather some useful bounds related to certain Stieltjes transforms. We first recall that the inequality
By using the identity, , we get after some algebra
Indeed, can be written as . Therefore, is equal to
Since is the Stieltjes transform of the distribution , it holds that
where denotes vector . We denote its eigenvalues. Then we have the following straighforward properties.
The zeros of are included in the set .
If the eigenvalues of have multiplicity one, the equation has multiplicity one solutions which coincide with the . Moreover, .
If the eigenvalue has multiplicity , i.e. , then,
and the that do not coincide with some eigenvalues of are zeros of .
Since , we recall that the eigenvalues have multiplicity 1 almost surely. However, in subsection 3.2, it will be necessary to define properly the solutions of everywhere. This explains why the case where some of the are multiple has to be considered.
Function is the Stieltjes transform of a probability measure whose support coincides with the set of all roots of the equation , which is included into the set . Therefore, it holds that
We recall the two following useful results of and .
for each . Then, with probability one, no eigenvalue of belongs to for large enough.
It is useful to mention that and that these two theorems are still valid if (see ).
The approach of is valid under the following assumptions.
Assumption A-5: For large enough, none of the strictly positive eigenvalues of is associated to the first cluster , i.e. for large enough.
Using theorems 3 and 4, we deduce that if are real numbers independent of satisfying
then, almost surely, for large enough, it holds that
Assumptions 2.5 and 2.5 thus imply that, almost surely, the smallest eigenvalues of are separated from the greatest ones for large enough in the sense that the 2 sets of eigenvalues are included into 2 disjoint intervals that do not depend on . It is interesting to remark that Assumptions 2.5 and 2.5 are "deterministic conditions" depending only on ,and on the eigenvalues of . If remains fixed, recent results of Benaych-Rao (see also ) imply that Assumptions A-5 and A-6 hold if and only if . If however scales with , the derivation of more explicit conditions equivalent to Assumptions 2.5 and 2.5 is still an open problem.
We are now in position to present the consistent estimator of proposed in . It is based on the observation that
where represents a contour enclosing and not the strictly positive eigenvalues of , and the symbol means that the contour is oriented clockwise. The estimator of is based on the observation that under Assumptions 2.5 and 2.5, function provides such a contour for large enough. In the following, for and , small enough, we consider the rectangle defined by
and its boundary . Then, the properties of function (see Proposition 1) imply that for large enough, the set is a contour enclosing the origin, but not the other eigenvalues of . Therefore, can also be written as
because . Using (5) and (8) as well as the following lemma
Almost surely, for large enough, the solutions of the equation satisfy
almost surely for large enough. In pratice, the above estimator is quite easy to implement because, as the localization of the poles of the integrand in (22) w.r.t. the contour is known (see lemma 2), the contour integral in (22) can be solved, and expressed in closed form in terms of the .
From now on, we assume that vector is given by (2) and that assumptions 2.5 and 2.5 hold. We consider , , and satisfying (18) as well a rectangle defined by (20). We prove here the following result.
Assume assumptions A-1 to A-6 hold. Then, we have
In the following, we denote by the set
We first establish in Sections 3.1 and 3.2 that the events and defined by
and elsewhere, and define the random variable
The purpose of this section is to prove the following technical result.
and elsewhere. From this definition, we clearly have
we finally obtain that (29) holds for .
The first term of the r.h.s of (31) can be upperbounded as follows
Using Hölder’s inequality, we get immediately that
Plugging the previous estimates into (32), we get
In this section, we will prove the following result.
We follow the same approach than in Section 3.1 and first prove that the satisfy a property similar to (7). For this, we study the behaviour of the Stieltjes transform of the distribution defined by
and use Lemma 1 as well as the inverse Stieltjes transform formula (3). Our starting point is the following result showing that the empirical eigenvalue distribution of is very similar to the distribution of the eigenvalues of . The following auxiliary result will be useful.
Assume assumptions A-1 to A-6 hold. It holds that
Proof: The proof is given in Appendix 5.1.
We now prove the fundamental following result.
Proof: Using that is a rank 1 perturbation of , we obtain immediately that
In order to study the expectation of this expression, we use (11) and (15). Moreover, (6) and a straightforward application of the Poincaré inequality to considered for fixed as a function of the entries of leads immediately to
This immediately implies (35). Now define the function by
When , this converges towards , a real quantity because and belong to . This shows that . Consequently,
where represents the orthogonal projection matrix on the 1–dimensionnal eigenspace associated to the eigenvalue of .
a property also established in the appendix. We now prove the following result.
Assume assumptions A-1 to A-6 hold. It holds that
Indeed, if represent the eigenvectors of , then
As , Jensen’s inequality yields to (41). Therefore, it holds that
As , we get using lemma 7 that
We remark that on the set ,and write the righthandside of (42) as
for each integer . This completes the proof of lemma 9.
Assume that (38) holds until integer . We write as previously that
The Cauchy-Schwarz inequality leads immediately to
As for the second term of the r.h.s. of (43), we use Poincaré inequality and Hölder’s inequality to obtain
3 End of the proof of theorem 5
We now complete the proof of Theorem 5 when function is given by
for . We recall that is defined by
Assume assumptions A-1 to A-6 hold. For each , it holds that
and remark that for each and for each , there exists such that . For each , it holds that
It is easy to check that the third term of the r.h.s. of (45) satisfies
In order to evaluate the behaviour of the supremum over of the first term of the r.h.s. of (45), we prove that for each ,
for some constant term . Inequality (46) thus implies that
for each integer . Borel-Cantelli’s lemma eventually implies that
We finally study the supremum of the second term of (45). We denote by the elements of . Let , then
In order to complete the proof of Theorem 5, we establish the following proposition.
where the constant does not depend on the sequence .
Proof: In order to shorten the notations, we denote by and the functions defined by
If we denote by and the events defined by
then on and on .
We now establish (49) by induction on , and first consider the case . We write the second moment of as
As implies that , Lemma 10 implies that
The same conclusions hold when the derivatives w.r.t. variables are considered. This shows that the first term of the r.h.s. of (52) is a term. We now evaluate the behaviour of the second term of the r.h.s. of (52), and establish that
for each integer . We express as . Lemma 10 implies that . Therefore, it is sufficient to check that
for each integer . can be written as
for each integer . Using similar calculations and Proposition 3, we obtain that
for each integer . This completes the proof of (55) and establishes that
Assume assumptions A-1 to A-6 hold. It holds that
We express as where
Using Lemma 10, (59) for will be established if we show that
This completes the proof of (59) for . In order to show (59) for , we first remark that by Lemma 10, is uniformly bounded on , and write that
The Poincaré inequality and Lemma 12 imply that
for some deterministic constant (see Lemma 10). This completes the proof of (49) for .
We now assume that (49) holds until integer and write that
The Cauchy-Schwarz inequality implies that
Consistency of the angular estimates
For , with probability one,
In order to establish the proposition, we follow a classical approach initiated by Hannan to study sinusoid frequency estimates. For this, we first recall the following useful lemma.
Appendix
We first give the following useful technical result. Its proof, based on Poincaré’s inequality, is elementary and therefore omitted.
Moreover, the same results still hold when is replaced by .
We are now in position to establish Lemma 4. We have to establish that
We first notice that (62) is equivalent to
In order to prove (63), we first show that
where is given by with
In order to complete the proof of the lemma, we establish that
Proof: We first observe that (66) and (67) imply that
We first need to establish the following useful Lemma.
Therefore, it holds that . Writing , we obtain that . By differentiability of on and continuity of at ,
Using Lemma 4.6 in Haagerup-Thorbjornsen , we obtain
Proof: We start by observing that for any integers , matrix writes
Using Theorem 6 and for the inequality,
4 Proof of Lemma 11: differentiability of the regularization factor
and it remains to apply the composition formula for differentials to obtain (50).
hence the derivative (50) is zero on .
if . Indeed, given , let . Since ,
5 Proof of lemma 12: various estimates
Thus, (80) follows immediately from (13).
Lemma 18 immediately implies that the following uniform bounds hold.
Proof: We first recall that inequality (10) holds. Therefore, the uniform convergence result (79) implies that
for large enough. This establishes (82) that holds for large enough. In order to prove (83), we express as
and use (78) and (80). The proof of (84) is similar, and is based on the identity
and that and are uniformly bounded from below by (13) and (80) (recall that is one of the eigenvalues of ).
with .
As for the use of the Poincaré inequality, we have:
Moreover, the same kind of uniform bounds still hold when is replaced by .
The proofs of these results are based on elementary arguments, and are thus omitted. Following the calculations of and , we obtain that
After some calculations using Lemmas 19, 20, 21, we eventually obtain that
for all large . In order to prove (56) and (57), it remains to handle the terms involving the difference . We show in the following that
for all large . We start as usual with the identity , to get
There exists a constant independent of such that
Proof: It is shown in and that is the determinant of the following linear system
We deduce from this that for all large . Therefore, we can invert the system (95) and obtain
for all large . This establishes (57) and completes the proof of (56).