20,232 research outputs found
A Compact Formulation for the Mixed-Norm Minimization Problem
Parameter estimation from multiple measurement vectors (MMVs) is a
fundamental problem in many signal processing applications, e.g., spectral
analysis and direction-of- arrival estimation. Recently, this problem has been
address using prior information in form of a jointly sparse signal structure. A
prominent approach for exploiting joint sparsity considers mixed-norm
minimization in which, however, the problem size grows with the number of
measurements and the desired resolution, respectively. In this work we derive
an equivalent, compact reformulation of the mixed-norm
minimization problem which provides new insights on the relation between
different existing approaches for jointly sparse signal reconstruction. The
reformulation builds upon a compact parameterization, which models the
row-norms of the sparse signal representation as parameters of interest,
resulting in a significant reduction of the MMV problem size. Given the sparse
vector of row-norms, the jointly sparse signal can be computed from the MMVs in
closed form. For the special case of uniform linear sampling, we present an
extension of the compact formulation for gridless parameter estimation by means
of semidefinite programming. Furthermore, we derive in this case from our
compact problem formulation the exact equivalence between the
mixed-norm minimization and the atomic-norm minimization. Additionally, for the
case of irregular sampling or a large number of samples, we present a low
complexity, grid-based implementation based on the coordinate descent method
Wideband DOA Estimation via Sparse Bayesian Learning over a Khatri-Rao Dictionary
This paper deals with the wideband direction-of-arrival (DOA) estimation by exploiting the multiple measurement vectors (MMV) based sparse Bayesian learning (SBL) framework. First, the array covariance matrices at different frequency bins are focused to the reference frequency by the conventional focusing technique and then transformed into the vector form. Then a matrix called the Khatri-Rao dictionary is constructed by using the Khatri-Rao product and the multiple focused array covariance vectors are set as the new observations. DOA estimation is to find the sparsest representations of the new observations over the Khatri-Rao dictionary via SBL. The performance of the proposed method is compared with other well-known focusing based wideband algorithms and the Cramer-Rao lower bound (CRLB). The results show that it achieves higher resolution and accuracy and can reach the CRLB under relative demanding conditions. Moreover, the method imposes no restriction on the pattern of signal power spectral density and due to the increased number of rows of the dictionary, it can resolve more sources than sensors
Tyler's Covariance Matrix Estimator in Elliptical Models with Convex Structure
We address structured covariance estimation in elliptical distributions by
assuming that the covariance is a priori known to belong to a given convex set,
e.g., the set of Toeplitz or banded matrices. We consider the General Method of
Moments (GMM) optimization applied to robust Tyler's scatter M-estimator
subject to these convex constraints. Unfortunately, GMM turns out to be
non-convex due to the objective. Instead, we propose a new COCA estimator - a
convex relaxation which can be efficiently solved. We prove that the relaxation
is tight in the unconstrained case for a finite number of samples, and in the
constrained case asymptotically. We then illustrate the advantages of COCA in
synthetic simulations with structured compound Gaussian distributions. In these
examples, COCA outperforms competing methods such as Tyler's estimator and its
projection onto the structure set.Comment: arXiv admin note: text overlap with arXiv:1311.059
Covariance Estimation in Elliptical Models with Convex Structure
We address structured covariance estimation in Elliptical distribution. We
assume it is a priori known that the covariance belongs to a given convex set,
e.g., the set of Toeplitz or banded matrices. We consider the General Method of
Moments (GMM) optimization subject to these convex constraints. Unfortunately,
GMM is still non-convex due to objective. Instead, we propose COCA - a convex
relaxation which can be efficiently solved. We prove that the relaxation is
tight in the unconstrained case for a finite number of samples, and in the
constrained case asymptotically. We then illustrate the advantages of COCA in
synthetic simulations with structured Compound Gaussian distributions. In these
examples, COCA outperforms competing methods as Tyler's estimate and its
projection onto a convex set
Multisource Self-calibration for Sensor Arrays
Calibration of a sensor array is more involved if the antennas have direction
dependent gains and multiple calibrator sources are simultaneously present. We
study this case for a sensor array with arbitrary geometry but identical
elements, i.e. elements with the same direction dependent gain pattern. A
weighted alternating least squares (WALS) algorithm is derived that iteratively
solves for the direction independent complex gains of the array elements, their
noise powers and their gains in the direction of the calibrator sources. An
extension of the problem is the case where the apparent calibrator source
locations are unknown, e.g., due to refractive propagation paths. For this
case, the WALS method is supplemented with weighted subspace fitting (WSF)
direction finding techniques. Using Monte Carlo simulations we demonstrate that
both methods are asymptotically statistically efficient and converge within two
iterations even in cases of low SNR.Comment: 11 pages, 8 figure
Robust Positioning in the Presence of Multipath and NLOS GNSS Signals
GNSS signals can be blocked and reflected by nearby objects, such as buildings, walls, and vehicles. They can also be reflected by the ground and by water. These effects are the dominant source of GNSS positioning errors in dense urban environments, though they can have an impact almost anywhere. Non- line-of-sight (NLOS) reception occurs when the direct path from the transmitter to the receiver is blocked and signals are received only via a reflected path. Multipath interference occurs, as the name suggests, when a signal is received via multiple paths. This can be via the direct path and one or more reflected paths, or it can be via multiple reflected paths. As their error characteristics are different, NLOS and multipath interference typically require different mitigation techniques, though some techniques are applicable to both. Antenna design and advanced receiver signal processing techniques can substantially reduce multipath errors. Unless an antenna array is used, NLOS reception has to be detected using the receiver's ranging and carrier-power-to-noise-density ratio (C/N0) measurements and mitigated within the positioning algorithm. Some NLOS mitigation techniques can also be used to combat severe multipath interference. Multipath interference, but not NLOS reception, can also be mitigated by comparing or combining code and carrier measurements, comparing ranging and C/N0 measurements from signals on different frequencies, and analyzing the time evolution of the ranging and C/N0 measurements
- …