In this letter, the truncated redundancy averaging (TRA) method for structured covariance matrix estimation and its spatially asymptotic behavior for massive MIMO are studied. The TRA method can be applied to the ante...
详细信息
In this letter, the truncated redundancy averaging (TRA) method for structured covariance matrix estimation and its spatially asymptotic behavior for massive MIMO are studied. The TRA method can be applied to the antenna arrays exhibiting correlation redundancy, including linear and non-linear arrays. Resorting to Khinchin's statement on the law of large numbers for correlated random variables, it is derived that, for a uniform array, if its physical size is a strictly increasing linear or sub-linear function of the number of antenna elements, the convergence of the TRA estimate to the true covariancematrix occurs within one single channel realization. We also derive and demonstrate that lower spatial correlation leads to increased estimation performance.
In this paper, we deal with the problem of estimating the disturbance covariancematrix for radar signal processing applications, when a limited number of training data is present. We determine the maximum likelihood ...
详细信息
In this paper, we deal with the problem of estimating the disturbance covariancematrix for radar signal processing applications, when a limited number of training data is present. We determine the maximum likelihood (ML) estimator of the covariancematrix starting from a set of secondary data, assuming a special covariance structure (i.e., the sum of a positive semi-definite matrix plus a term proportional to the identity), and a condition number upper-bound constraint. We show that the formulated constrained optimization problem falls within the class of MAXDET problems and develop an efficient procedure for its solution in closed form. Remarkably, the computational complexity of the algorithm is of the same order as the eigenvalue decomposition of the sample covariancematrix. At the analysis stage, we assess the performance of the proposed algorithm in terms of achievable signal-to-interference-plus-noise ratio (SINR) both for a spatial and a Doppler processing. The results show that interesting SINR improvements, with respect to some existing covariancematrixestimation techniques, can be achieved.
A new class of disturbance covariancematrix estimators for radar signal processing applications is introduced following a geometric paradigm. Each estimator is associated with a given unitary invariant norm and perfo...
详细信息
A new class of disturbance covariancematrix estimators for radar signal processing applications is introduced following a geometric paradigm. Each estimator is associated with a given unitary invariant norm and performs the sample covariancematrix projection into a specific set of structuredcovariance matrices. Regardless of the considered norm, an efficient solution technique to handle the resulting constrained optimization problem is developed. Specifically, it is shown that the new family of distribution-free estimators shares a shrinkage-type form;besides, the eigenvalues estimate just requires the solution of a one-dimensional convex problem whose objective function depends on the considered unitary norm. For the two most common norm instances, i.e., Frobenius and spectral, very efficient algorithms are developed to solve the aforementioned one-dimensional optimization leading to almost closed-form covariance estimates. At the analysis stage, the performance of the new estimators is assessed in terms of achievable signal-to-interference-plus-noise ratio (SINR) both for spatial and Doppler processing scenarios assuming different data statistical characterizations. The results show that interesting SINR improvements with respect to some counterparts available in the open literature can be achieved especially in training starved regimes.
The estimation of signal covariance matrices is a crucial part of many signal processing algorithms. In some applications, the structure of the problem suggests that the underlying, true covariancematrix is the Krone...
详细信息
The estimation of signal covariance matrices is a crucial part of many signal processing algorithms. In some applications, the structure of the problem suggests that the underlying, true covariancematrix is the Kronecker product of two valid covariance matrices. Examples of such problems are channel modeling for multiple-input multiple-output (MIMO) communications and signal modeling of EEG data. In applications, it may also be that the Kronecker factors in turn can be assumed to possess additional, linear structure. The maximum-likelihood (ML) method for the associated estimation problem has been proposed previously. It is asymptotically efficient but has the drawback of requiring an iterative search for the maximum of the likelihood function. Two methods that are fast and noniterative are proposed in this paper. Both methods are shown to be asymptotically efficient. The first method is a noniterative variant of a well-known alternating maximization technique for the likelihood function. It performs on par with ML in simulations but has the drawback of not allowing for extra structure in addition to the Kronecker structure. The second method is based on covariance matching principles and does not suffer from this drawback. However, while the large sample performance is the same, it performs somewhat worse than the first estimator in small samples. In addition, the Cramer-Rao lower bound for the problem is derived in a compact form. The problem of estimating the Kronecker factors and the problem of detecting if the Kronecker structure is a good model for the covariancematrix of a set of samples are related. Therefore, the problem of detecting the dimensions of the Kronecker factors based on the minimum values of the criterion functions corresponding to the two proposed estimation methods is also treated in this work.
Concentration inequalities form an essential toolkit in the study of high-dimensional statistical methods. Most of the relevant statistics literature in this regard is, however, based on the assumptions of sub-Gaussia...
详细信息
Concentration inequalities form an essential toolkit in the study of high-dimensional statistical methods. Most of the relevant statistics literature in this regard is, however, based on the assumptions of sub-Gaussian or sub-exponential random variables/vectors. In this paper, we first bring together, through a unified exposition, various probabilistic inequalities for sums of independent random variables under much more general exponential type (namely sub-Weibull) tail assumptions. These results extract a part sub-Gaussian tail behavior of the sum in finite samples, matching the asymptotics governed by the central limit theorem, and are compactly represented in terms of a new Orlicz quasi-norm-the Generalized Bernstein-Orlicz norm-that typifies such kind of tail behaviors. We illustrate the usefulness of these inequalities through the analysis of four fundamental problems in high-dimensional statistics. In the first two problems, we study the rate of convergence of the sample covariancematrix in terms of the maximum elementwise norm and the maximum k-sub-matrix operator norm that are key quantities of interest in bootstrap procedures and high-dimensional structured covariance matrix estimation, as well as in high-dimensional and post-selection inference. The third example concerns the restricted eigenvalue condition, required in high-dimensional linear regression, which we verify for all sub-Weibull random vectors through a unified analysis, and also prove a more general result related to restricted strong convexity in the process. In the final example, we consider the Lasso estimator for linear regression and establish its rate of convergence to be generally root k log p/n, for k-sparse signals, under much weaker than usual tail assumptions (on the errors as well as the covariates), while also allowing for misspecified models and both fixed and random design. To our knowledge, these are the first such results for Lasso obtained in this generality. The common fe
Toeplitz covariancematrixestimation has many uses in statistical signal processing due to the stationarity assumption of many signals. For some applications, further constraints may exist on the maximum lag at which...
详细信息
ISBN:
(纸本)1424407281
Toeplitz covariancematrixestimation has many uses in statistical signal processing due to the stationarity assumption of many signals. For some applications, further constraints may exist on the maximum lag at which the correlation function is non-zero and thereby giving rise to a band-Toeplitz covariancematrix. In this paper, an existing EM-algorithm for Toeplitz estimation is generalized to the case of band-Toeplitz estimation. In addition, the Cramer-Rao lower-bound for unbiased band-Toeplitz covariancematrixestimation is derived and through simulations it is shown that the proposed estimator achieves the bound for medium and large sample-sizes.
暂无评论