4,836 research outputs found
Position and Orientation Estimation through Millimeter Wave MIMO in 5G Systems
Millimeter wave signals and large antenna arrays are considered enabling
technologies for future 5G networks. While their benefits for achieving
high-data rate communications are well-known, their potential advantages for
accurate positioning are largely undiscovered. We derive the Cram\'{e}r-Rao
bound (CRB) on position and rotation angle estimation uncertainty from
millimeter wave signals from a single transmitter, in the presence of
scatterers. We also present a novel two-stage algorithm for position and
rotation angle estimation that attains the CRB for average to high
signal-to-noise ratio. The algorithm is based on multiple measurement vectors
matching pursuit for coarse estimation, followed by a refinement stage based on
the space-alternating generalized expectation maximization algorithm. We find
that accurate position and rotation angle estimation is possible using signals
from a single transmitter, in either line-of- sight, non-line-of-sight, or
obstructed-line-of-sight conditions.Comment: The manuscript has been revised, and increased from 27 to 31 pages.
Also, Fig.2, Fig. 10 and Table I are adde
Rectified Gaussian Scale Mixtures and the Sparse Non-Negative Least Squares Problem
In this paper, we develop a Bayesian evidence maximization framework to solve
the sparse non-negative least squares (S-NNLS) problem. We introduce a family
of probability densities referred to as the Rectified Gaussian Scale Mixture
(R- GSM) to model the sparsity enforcing prior distribution for the solution.
The R-GSM prior encompasses a variety of heavy-tailed densities such as the
rectified Laplacian and rectified Student- t distributions with a proper choice
of the mixing density. We utilize the hierarchical representation induced by
the R-GSM prior and develop an evidence maximization framework based on the
Expectation-Maximization (EM) algorithm. Using the EM based method, we estimate
the hyper-parameters and obtain a point estimate for the solution. We refer to
the proposed method as rectified sparse Bayesian learning (R-SBL). We provide
four R- SBL variants that offer a range of options for computational complexity
and the quality of the E-step computation. These methods include the Markov
chain Monte Carlo EM, linear minimum mean-square-error estimation, approximate
message passing and a diagonal approximation. Using numerical experiments, we
show that the proposed R-SBL method outperforms existing S-NNLS solvers in
terms of both signal and support recovery performance, and is also very robust
against the structure of the design matrix.Comment: Under Review by IEEE Transactions on Signal Processin
- …