Direction-finding arrays of directional sensors for randomly located sources

The problem of directional sensor placement and orientation is considered when statistical information about the source direction of arrival is available. We focus on two-sensor arrays and form a cost function based on the Cramer-Rao bound that depends on the probability distribution of the coplanar source direction. Proper positioning and orientation of the sensors enable the two-sensor array to have an accuracy comparable to that of a three-or four-sensor uniform circular array

Gridless Two-dimensional DOA Estimation With L-shaped Array Based on the Cross-covariance Matrix

The atomic norm minimization (ANM) has been successfully incorporated into the two-dimensional (2-D) direction-of-arrival (DOA) estimation problem for super-resolution. However, its computational workload might be unaffordable when the number of snapshots is large. In this paper, we propose two gridless methods for 2-D DOA estimation with L-shaped array based on the atomic norm to improve the computational efficiency. Firstly, by exploiting the cross-covariance matrix an ANM-based model has been proposed. We then prove that this model can be efficiently solved as a semi-definite programming (SDP). Secondly, a modified model has been presented to improve the estimation accuracy. It is shown that our proposed methods can be applied to both uniform and sparse L-shaped arrays and do not require any knowledge of the number of sources. Furthermore, since our methods greatly reduce the model size as compared to the conventional ANM method, and thus are much more efficient. Simulations results are provided to demonstrate the advantage of our methods

Subspace-based order estimation techniques in massive MIMO

Order estimation, also known as source enumeration, is a classical problem in array signal processing which consists in estimating the number of signals received by an array of sensors. In the last decades, numerous approaches to this problem have been proposed. However, the need of working with large-scale arrays (like in massive MIMO systems), low signal-to-noise- ratios, and poor sample regime scenarios, introduce new challenges to order estimation problems. For instance, most of the classical approaches are based on information theoretic criteria, which usually require a large sample size, typically several times larger than the number of sensors. Obtaining a number of samples several times larger than the number of sensors is not always possible with large-scale arrays. In addition, most of the methods found in literature assume that the noise is spatially white, which is very restrictive for many practical scenarios. This dissertation deals with the problem of source enumeration for large-scale arrays, and proposes solutions that work robustly in the small sample regime under various noise models. The first part of the dissertation solves the problem by applying the idea of subspace averaging. The input data are modelled as subspaces, and an average or central subspace is computed. The source enumeration problem can be seen as an estimation of the dimension of the central subspace. A key element of the proposed method is to construct a bootstrap procedure, based on a newly proposed discrete distribution on the manifold of projection matrices, for stochastically generating subspaces from a function of experimentally determined eigenvalues. In this way, the proposed subspace averaging (SA) technique determines the order based on the eigenvalues of an average projection matrix, rather than on the likelihood of a covariance model, penalized by functions of the model order. The proposed SA criterion is especially effective in high-dimensional scenarios with low sample support for uniform linear arrays in the presence of white noise. Further, the proposed SA method is extended for: i) non-white noises, and ii) non-uniform linear arrays. The SA criterion is sensitive with the chosen dimension of extracted subspaces. To solve this problem, we combine the SA technique with a majority vote approach. The number of sources is detected for increasing dimensions of the SA technique and then a majority vote is applied to determine the final estimate. Further, to extend SA for arrays with arbitrary geometries, the SA is combined with a sparse reconstruction (SR) step. In the first step, each received snapshot is approximated by a sparse linear combination of the rest of snapshots. The SR problem is regularized by the logarithm-based surrogate of the l-0 norm and solved using a majorization-minimization approach. Based on the SR solution, a sampling mechanism is proposed in the second step to generate a collection of subspaces, all of which approximately span the same signal subspace. Finally, the dimension of the average of this collection of subspaces provides a robust estimate for the number of sources. The second half of the dissertation introduces a completely different approach to the order estimation for uniform linear arrays, which is based on matrix completion algorithms. This part first discusses the problem of order estimation in the presence of noise whose spatial covariance structure is a diagonal matrix with possibly different variances. The diagonal terms of the sample covariance matrix are removed and, after applying Toeplitz rectification as a denoising step, the signal covariance matrix is reconstructed by using a low-rank matrix completion method adapted to enforce the Toeplitz structure of the sought solution. The proposed source enumeration criterion is based on the Frobenius norm of the reconstructed signal covariance matrix obtained for increasing rank values. The proposed method performs robustly for both small and large-scale arrays with few snapshots. Finally, an approach to work with a reduced number of radio–frequency (RF) chains is proposed. The receiving array relies on antenna switching so that at every time instant only the signals received by a randomly selected subset of antennas are downconverted to baseband and sampled. Low-rank matrix completion (MC) techniques are then used to reconstruct the missing entries of the signal data matrix to keep the angular resolution of the original large-scale array. The proposed MC algorithm exploits not only the low- rank structure of the signal subspace, but also the shift-invariance property of uniform linear arrays, which results in a better estimation of the signal subspace. In addition, the effect of MC on DOA estimation is discussed under the perturbation theory framework. Further, this approach is extended to devise a novel order estimation criterion for missing data scenario. The proposed source enumeration criterion is based on the chordal subspace distance between two sub-matrices extracted from the reconstructed matrix after using MC for increasing rank values. We show that the proposed order estimation criterion performs consistently with a very few available entries in the data matrix.This work was supported by the Ministerio de Ciencia e Innovación (MICINN) of Spain, under grants TEC2016-75067-C4-4-R (CARMEN) and BES-2017-080542

A Cramér-Rao bounds based analysis of 3D antenna array geometries made from ULA branches

International audienceIn the context of passive sources localization using antenna array, the estimation accuracy of elevation, and azimuth are related not only to the kind of estimator which is used, but also to the geometry of the considered antenna array. Although there are several available results on the linear array, and also for planar arrays, other geometries existing in the literature, such as 3D arrays, have been less studied. In this paper, we study the impact of the geometry of a family of 3D models of antenna array on the estimation performance of elevation, and azimuth. The Cramer-Rao Bound (CRB), which is widely spread in signal processing to characterize the estimation performance will be used here as a useful tool to find the optimal configuration. In particular, we give closed-form expressions of CRB for a 3D antenna array under both conditional, and unconditional observation models. Thanks to these explicit expressions, the impact of the third dimension to the estimation performance is analyzed. Particularly, we give criterions to design an isotropic 3D array depending on the considered observation model. Several 3D particular geometry antennas made from uniform linear array (ULA) are analyzed, and compared with 2D antenna arrays. The isotropy condition of such arrays is analyzed. The presented framework can be used for further studies of other types of arrays

NUV-DoA: NUV Prior-based Bayesian Sparse Reconstruction with Spatial Filtering for Super-Resolution DoA Estimation

Achieving high-resolution Direction of Arrival (DoA) recovery typically requires high Signal to Noise Ratio (SNR) and a sufficiently large number of snapshots. This paper presents NUV-DoA algorithm, that augments Bayesian sparse reconstruction with spatial filtering for super-resolution DoA estimation. By modeling each direction on the azimuth's grid with the sparsity-promoting normal with unknown variance (NUV) prior, the non-convex optimization problem is reduced to iteratively reweighted least-squares under Gaussian distribution, where the mean of the snapshots is a sufficient statistic. This approach not only simplifies our solution but also accurately detects the DoAs. We utilize a hierarchical approach for interference cancellation in multi-source scenarios. Empirical evaluations show the superiority of NUV-DoA, especially in low SNRs, compared to alternative DoA estimators.Comment: 5 pages include reference, 11 figures, submitted to ICASSP 2024, on Sep 6 202

New Approach for Unambiguous High-Resolution Wide-Swath SAR Imaging

The high-resolution wide-swath (HRWS) SAR system uses a small antenna for transmitting waveform and multiple antennas both in elevation and azimuth for receiving echoes. It has the potential to achieve wide spatial coverage and fine azimuth resolution, while it suffers from elevation pattern loss caused by the presence of topographic height and impaired azimuth resolution caused by nonuniform sampling. A new approach for HRWS SAR imaging based on compressed sensing (CS) is introduced. The data after range compression of multiple elevation apertures are used to estimate direction of arrival (DOA) of targets via CS, and the adaptive digital beamforming in elevation is achieved accordingly, which avoids the pattern loss of scan-on-receive (SCORE) algorithm when topographic height exists. The effective phase centers of the system are nonuniformly distributed when displaced phase center antenna (DPCA) technology is adopted, which causes Doppler ambiguities under traditional SAR imaging algorithms. Azimuth reconstruction based on CS can resolve this problem via precisely modeling the nonuniform sampling. Validation with simulations and experiment in an anechoic chamber are presented

A Supervised Learning Framework for Joint Estimation of Angles-of-Arrival and Number of Sources

Machine learning is a promising technique for angle-of-arrival (AOA) estimation of waves impinging a sensor array. However, the majority of the methods proposed so far only consider a known, fixed number of impinging waves, i.e., a fixed number of sources (NOS). This paper proposes a machine-learning-based estimator designed for the case when the NOS is variable and hence unknown a priori. The proposed estimator comprises a framework of single-label classifiers. Each classifier predicts if waves are present within certain randomly selected segments of the array\u27s field of view (FOV), resulting from discretising the FOV with a certain (FOV) resolution. The classifiers\u27 predictions are combined into a probabilistic angle spectrum, whereupon the NOS and the AOAs are estimated jointly by applying a probability threshold whose optimal level is learned from data. The estimator\u27s performance is assessed using a new performance metric: the joint AOA estimation success rate. Numerical simulations show that for low SNR (-10 dB), a low FOV resolution (2\ub0) yields a higher success rate than a high resolution (1\ub0), whereas the opposite applies for mid (0 dB) and high (10 dB) SNRs. In nearly all simulations, except one at low SNR and a high FOV resolution, the proposed estimator outperforms the MUSIC algorithm if the maximum allowed AOA estimation error is approximately equal to (or larger than) the FOV resolution

Cooperative Transmitter-Receiver Arrayed Communications

This thesis is concerned with array processing for wireless communications. In particular, cooperation between the transmitter and receiver or between systems is exploited to further improve the system performance. Based on this idea, three technical chapters are presented in this thesis. Initially in Chapter 1, an introduction including array processing, multiple-input multiple-output (MIMO) communication systems and the background of cognitive radio is presented. In Chapter 2, a novel approach for estimating the direction-of-departure (DOD) is proposed using the cooperative beamforming. This proposed approach is featured by its simplicity (beam rotation at the transmitter) and effectiveness (illustrated in terms of channel capacity). Chapter 3 is concerned with integration of spatio-temporal (ST) processing into an antenna array transmitter, given a joint transmitter-receiver system with ST processing at the receiver but spatial-only processing at the transmitter. The transmit ST processing further improves the system performance in convergence, mean-square error (MSE) and bit error rate (BER). In Chapter 4, a basic system structure for radio coexistence problem is proposed based on the concept of MIMO cognitive radio. Cooperation between the licensed radio and the cognitive radio is exploited. Optimisation of the sum channel capacity is considered as the criterion and it is solved using a multivariable water-filling algorithm. Finally, Chapter 5 concludes this thesis and gives suggestions for future work