166 research outputs found
The influence of random element displacement on DOA estimates obtained with (Khatri-Rao-)root-MUSIC
Although a wide range of direction of arrival (DOA) estimation algorithms has been described for a diverse range of array configurations, no specific stochastic analysis framework has been established to assess the probability density function of the error on DOA estimates due to random errors in the array geometry. Therefore, we propose a stochastic collocation method that relies on a generalized polynomial chaos expansion to connect the statistical distribution of random position errors to the resulting distribution of the DOA estimates. We apply this technique to the conventional root-MUSIC and the Khatri-Rao-root-MUSIC methods. According to Monte-Carlo simulations, this novel approach yields a speedup by a factor of more than 100 in terms of CPU-time for a one-dimensional case and by a factor of 56 for a two-dimensional case
Maximizing the Number of Spatial Nulls with Minimum Sensors
In this paper, we attempt to unify two array processing frameworks viz, Acoustic Vector Sensor (AVS) and two level nested array to enhance the Degrees of Freedom (DoF) significantly beyond the limit that is attained by a Uniform Linear Hydrophone Array (ULA) with specified number of sensors. The major focus is to design a line array architecture which provides high resolution unambiguous bearing estimation with increased number of spatial nulls to mitigate the multiple interferences in a deep ocean scenario. AVS can provide more information about the propagating acoustic field intensity vector by simultaneously measuring the acoustic pressure along with tri-axial particle velocity components. In this work, we have developed Nested AVS array (NAVS) ocean data model to demonstrate the performance enhancement. Conventional and MVDR spatial filters are used as the response function to evaluate the performance of the proposed architecture. Simulation results show significant improvement in performance viz, increase of DoF, and localization of more number of acoustic sources and high resolution bearing estimation with reduced side lobe level
Scaling transform based information geometry method for DOA estimation
By exploiting the relationship between probability density and the differential geometry structure of received data and geodesic distance, the recently proposed information geometry (IG) method can provide higher accuracy and resolution ability for direction of arrival (DOA) estimation than many existing methods. However, its performance is not robust even for high signal to noise ratio (SNR). To have a deep understanding of its unstable performance, a theoretical analysis of the IG method is presented by deriving the relationship between the cost function and the number of array elements, powers and DOAs of source signals, and noise power. Then, to make better use of the nonlinear and super resolution property of the cost function, a Scaling TRansform based INformation Geometry (STRING) method is proposed, which simply scales the array received data or its covariance matrix by a real number. However, the expression for the optimum value of the scalar is complicated and related to the unknown signal DOAs and powers. Hence, a decision criterion and a simple search based procedure are developed, guaranteeing a robust performance. As demonstrated by computer simulations, the proposed STRING method has the best and robust angle resolution performance compared with many existing high resolution methods and even outperforms the classic Cramer-Rao bound (CRB), although at the cost of a bias in the estimation results
Recommended from our members
Structured Sub-Nyquist Sampling with Applications in Compressive Toeplitz Covariance Estimation, Super-Resolution and Phase Retrieval
Sub-Nyquist sampling has received a huge amount of interest in the past decade. In classical compressed sensing theory, if the measurement procedure satisfies a particular condition known as Restricted Isometry Property (RIP), we can achieve stable recovery of signals of low-dimensional intrinsic structures with an order-wise optimal sample size. Such low-dimensional structures include sparse and low rank for both vector and matrix cases. The main drawback of conventional compressed sensing theory is that random measurements are required to ensure the RIP property. However, in many applications such as imaging and array signal processing, applying independent random measurements may not be practical as the systems are deterministic. Moreover, random measurements based compressed sensing always exploits convex programs for signal recovery even in the noiseless case, and solving those programs is computationally intensive if the ambient dimension is large, especially in the matrix case. The main contribution of this dissertation is that we propose a deterministic sub-Nyquist sampling framework for compressing the structured signal and come up with computationally efficient algorithms. Besides widely studied sparse and low-rank structures, we particularly focus on the cases that the signals of interest are stationary or the measurements are of Fourier type. The key difference between our work from classical compressed sensing theory is that we explicitly exploit the second-order statistics of the signals, and study the equivalent quadratic measurement model in the correlation domain. The essential observation made in this dissertation is that a difference/sum coarray structure will arise from the quadratic model if the measurements are of Fourier type. With these observations, we are able to achieve a better compression rate for covariance estimation, identify more sources in array signal processing or recover the signals of larger sparsity. In this dissertation, we will first study the problem of Toeplitz covariance estimation. In particular, we will show how to achieve an order-wise optimal compression rate using the idea of sparse arrays in both general and low-rank cases. Then, an analysis framework of super-resolution with positivity constraint is established. We will present fundamental robustness guarantees, efficient algorithms and applications in practices. Next, we will study the problem of phase-retrieval for which we successfully apply the sparse array ideas by fully exploiting the quadratic measurement model. We achieve near-optimal sample complexity for both sparse and general cases with practical Fourier measurements and provide efficient and deterministic recovery algorithms. In the end, we will further elaborate on the essential role of non-negative constraint in underdetermined inverse problems. In particular, we will analyze the nonlinear co-array interpolation problem and develop a universal upper bound of the interpolation error. Bilinear problem with non-negative constraint will be considered next and the exact characterization of the ambiguous solutions will be established for the first time in literature. At last, we will show how to apply the nested array idea to solve real problems such as Kriging. Using spatial correlation information, we are able to have a stable estimate of the field of interest with fewer sensors than classic methodologies. Extensive numerical experiments are implemented to demonstrate our theoretical claims
Multi-source parameter estimation and tracking using antenna arrays
This thesis is concerned with multi-source parameter estimation and tracking using antenna arrays in wireless communications. Various multi-source parameter estimation and tracking algorithms are presented and evaluated.
Firstly, a novel multiple-input multiple-output (MIMO) communication system is proposed for multi-parameter channel estimation. A manifold extender is presented for increasing the degrees of freedom (DoF). The proposed approach utilises the extended manifold vectors together with superresolution subspace type algorithms, to achieve the estimation of delay, direction of departure (DOD) and direction of arrival (DOA) of all the paths of the desired user in the presence of multiple access interference (MAI).
Secondly, the MIMO system is extended to a virtual-spatiotemporal system by incorporating the temporal domain of the system towards the objective of further increasing the degrees of freedom. In this system, a multi-parameter es-
timation of delay, Doppler frequency, DOD and DOA of the desired user, and a beamformer that suppresses the MAI are presented, by utilising the proposed virtual-spatiotemporal manifold extender and the superresolution subspace type
algorithms.
Finally, for multi-source tracking, two tracking approaches are proposed based on an arrayed Extended Kalman Filter (arrayed-EKF) and an arrayed Unscented Kalman Filter (arrayed-UKF) using two type of antenna arrays: rigid array and
flexible array. If the array is rigid, the proposed approaches employ a spatiotemporal state-space model and a manifold extender to track the source parameters, while if it is flexible the array locations are also tracked simultaneously.
Throughout the thesis, computer simulation studies are presented to investigate and evaluate the performance of all the proposed algorithms.Open Acces
An Expanding and Shift Scheme for Constructing Fourth-Order Difference Co-Arrays
An expanding and shift (EAS) scheme for efficient fourth-order difference co-array construction is proposed. It consists of two sparse sub-arrays, where one of them is modified and shifted according to the analysis provided. The number of consecutive lags of the proposed structure at the fourth order is consistently larger than two previously proposed methods. Two effective construction examples are provided with the second sparse sub-array chosen to be a two-level nested array, as such a choice can increase the number of consecutive lags further. Simulations are performed to show the improved performance by the proposed method in comparison with existing structures
Performance Bounds for Parameter Estimation under Misspecified Models: Fundamental findings and applications
Inferring information from a set of acquired data is the main objective of
any signal processing (SP) method. In particular, the common problem of
estimating the value of a vector of parameters from a set of noisy measurements
is at the core of a plethora of scientific and technological advances in the
last decades; for example, wireless communications, radar and sonar,
biomedicine, image processing, and seismology, just to name a few. Developing
an estimation algorithm often begins by assuming a statistical model for the
measured data, i.e. a probability density function (pdf) which if correct,
fully characterizes the behaviour of the collected data/measurements.
Experience with real data, however, often exposes the limitations of any
assumed data model since modelling errors at some level are always present.
Consequently, the true data model and the model assumed to derive the
estimation algorithm could differ. When this happens, the model is said to be
mismatched or misspecified. Therefore, understanding the possible performance
loss or regret that an estimation algorithm could experience under model
misspecification is of crucial importance for any SP practitioner. Further,
understanding the limits on the performance of any estimator subject to model
misspecification is of practical interest. Motivated by the widespread and
practical need to assess the performance of a mismatched estimator, the goal of
this paper is to help to bring attention to the main theoretical findings on
estimation theory, and in particular on lower bounds under model
misspecification, that have been published in the statistical and econometrical
literature in the last fifty years. Secondly, some applications are discussed
to illustrate the broad range of areas and problems to which this framework
extends, and consequently the numerous opportunities available for SP
researchers.Comment: To appear in the IEEE Signal Processing Magazin
- …