Parallel Factor-Based Model for Two-Dimensional Direction Estimation

Two-dimensional (2D) Direction-of-Arrivals (DOA) estimation for elevation and azimuth angles assuming noncoherent, mixture of coherent and noncoherent, and coherent sources using extended three parallel uniform linear arrays (ULAs) is proposed. Most of the existing schemes have drawbacks in estimating 2D DOA for multiple narrowband incident sources as follows: use of large number of snapshots, estimation failure problem for elevation and azimuth angles in the range of typical mobile communication, and estimation of coherent sources. Moreover, the DOA estimation for multiple sources requires complex pair-matching methods. The algorithm proposed in this paper is based on first-order data matrix to overcome these problems. The main contributions of the proposed method are as follows: (1) it avoids estimation failure problem using a new antenna configuration and estimates elevation and azimuth angles for coherent sources; (2) it reduces the estimation complexity by constructing Toeplitz data matrices, which are based on a single or few snapshots; (3) it derives parallel factor (PARAFAC) model to avoid pair-matching problems between multiple sources. Simulation results demonstrate the effectiveness of the proposed algorithm

Improved Direction of Arrival Estimation using Multiple Signal Classification (MUSIC) Algorithm with Decomposition and Normalization

It is important to determine the direction of arrival (DoA) of targets in various applications such as radar and sonar. Multiple Signal Classification (MUSIC), Estimation of Signal Parameters with Rotational In variance Technique (ESPRIT), and Weighted Subspace Fitting (WSF) are subspace-based methods that can be used to improve DoA estimation. MUSIC is effective for high-resolution, uncorrelated signals, but may struggle in cases where there are two nearby targets with a low signal-to-noise ratio (SNR). The goal of this research is to improve the performance of the MUSIC algorithm for DoA estimation with low SNR signals. The proposed solution involves decomposing and normalizing the signal during transmission. Simulations were conducted to test the modified procedure with MUSIC algorithm for DoA estimation, and it was found that received signal power improved though there is noisy environment as well as system can detect more number of targets. The proposed technique of decomposition and normalization could also be applied in other areas such as WiFi communication, autonomous vehicles and biomedical signal and image processing etc

Sensor array signal processing : two decades later

Caption title.Includes bibliographical references (p. 55-65).Supported by Army Research Office. DAAL03-92-G-115 Supported by the Air Force Office of Scientific Research. F49620-92-J-2002 Supported by the National Science Foundation. MIP-9015281 Supported by the ONR. N00014-91-J-1967 Supported by the AFOSR. F49620-93-1-0102Hamid Krim, Mats Viberg

Signal Processing and Propagation for Aeroacoustic Sensor Networking,” Ch

Passive sensing of acoustic sources is attractive in many respects, including the relatively low signal bandwidth of sound waves, the loudness of most sources of interest, and the inherent difficulty of disguising or concealing emitted acoustic signals. The availability of inexpensive, low-power sensing and signal-processing hardware enables application of sophisticated real-time signal processing. Among th

Array imperfection calibration for wireless channel multipath characterisation

As one of the fastest growing technologies in modern telecommunications, wireless networking has become a very important and indispensable part in our life. A good understanding of the wireless channel and its key physical parameters are extremely useful when we want to apply them into practical applications. In wireless communications, the wireless channel refers to the propagation of electromagnetic radiation from a transmitter to a receiver. The estimation of multipath channel parameters, such as angle of depature (AoD), angle of arrival (AoA), and time difference of arrival (TDoA), is an active research problem and its typical applications are radar, communication, vehicle navigation and localization in the indoor environment where the GPS service is impractical. However, the performance of the parameter estimation deteriorates significantly in the presence of array imperfections, which include the mutual coupling, antenna location error, phase uncertainty and so on. These array imperfections are hardly to be calibrated completely via antenna design. In this thesis, we experimentally evaluate an B matrix method to cope with these array imperfection, our results shows a great improvement of AoA estimation results

A review of closed-form Cramér-Rao Bounds for DOA estimation in the presence of Gaussian noise under a unified framework

The Cramér-Rao Bound (CRB) for direction of arrival (DOA) estimation has been extensively studied over the past four decades, with a plethora of CRB expressions reported for various parametric models. In the literature, there are different methods to derive a closed-form CRB expression, but many derivations tend to involve intricate matrix manipulations which appear difficult to understand. Starting from the Slepian-Bangs formula and following the simplest derivation approach, this paper reviews a number of closed-form Gaussian CRB expressions for the DOA parameter under a unified framework, based on which all the specific CRB presentations can be derived concisely. The results cover three scenarios: narrowband complex circular signals, narrowband complex noncircular signals, and wideband signals. Three signal models are considered: the deterministic model, the stochastic Gaussian model, and the stochastic Gaussian model with the a priori knowledge that the sources are spatially uncorrelated. Moreover, three Gaussian noise models distinguished by the structure of the noise covariance matrix are concerned: spatially uncorrelated noise with unknown either identical or distinct variances at different sensors, and arbitrary unknown noise. In each scenario, a unified framework for the DOA-related block of the deterministic/stochastic CRB is developed, which encompasses one class of closed-form deterministic CRB expressions and two classes of stochastic ones under the three noise models. Comparisons among different CRBs across classes and scenarios are presented, yielding a series of equalities and inequalities which reflect the benchmark for the estimation efficiency under various situations. Furthermore, validity of all CRB expressions are examined, with some specific results for linear arrays provided, leading to several upper bounds on the number of resolvable Gaussian sources in the underdetermined case

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

Angle-of-Arrival Measurement Techniques for Enhanced Positioning in Beyond 5G Systems

The new generation of mobile communication systems introduces new methods and technologies that may enhance positioning accuracy in some scenarios when the GNSS system cannot meet the requirements, such as indoor positioning and outdoor autonomous driving. The 3GPP standard and for the first time included the angle measurement as new positioning methods in 5G. The Angle of Arrival (AoA) is the angle measurement method on the uplink direction that can enjoy the new capabilities in 5G systems to enhance the positioning downs to centimeters.The new generation of mobile communication systems introduces new methods and technologies that may enhance positioning accuracy in some scenarios when the GNSS system cannot meet the requirements, such as indoor positioning and outdoor autonomous driving. The 3GPP standard and for the first time included the angle measurement as new positioning methods in 5G. The Angle of Arrival (AoA) is the angle measurement method on the uplink direction that can enjoy the new capabilities in 5G systems to enhance the positioning downs to centimeters. Multiple Signal Classification Method (MUSIC) is a high-accuracy super-resolution algorithm for AoA estimation. The MUSIC method for estimating AoA has many shortcomings that make it unsuitable for a wide variety of scenarios. Correlated multipath signals substantially reduce estimation accuracy. Additionally, this method is a searching algorithm that requires a significant amount of time to resolve AoA. In this thesis, a CASCADE algorithm was proposed to overcome MUSIC's constraints by estimating a coarse range of AoA using a rapid AoA algorithm and then passing that range to the second stage represented by MUSIC to estimate AoA correctly. Multipath signals were eliminated by modifying the proposed CASCADE to detect only the line of sight (LOS), which is the essential path for angular localization. Additionally, the thesis compares many AoA algorithms in the context of 5G systems. A sounding reference signal (SRS) in the mm-wave band was generated according to the 3GPP standards and utilized as the input to those algorithms. A simulation was conducted throughout this thesis by evaluating six AoA algorithms: Bartlet Beamforming, MVDR, MUSIC, ESPRIT, FFT, and the proposed CASCADE method. The results showed that the proposed algorithm achieves the best performance when using less than 64 array antenna elements. On the other hand, FFT alone can provide high accuracy when using an ultra massive antenna system (e.g., 256,512,1024). Additionally, the findings observed the effect of key parameters on the performance of AoA algorithms, such as low SNR, a small number of snapshots (samples), and the effect of multipath signals