272 research outputs found
Joint Scattering Environment Sensing and Channel Estimation Based on Non-stationary Markov Random Field
This paper considers an integrated sensing and communication system, where
some radar targets also serve as communication scatterers. A location domain
channel modeling method is proposed based on the position of targets and
scatterers in the scattering environment, and the resulting radar and
communication channels exhibit a two-dimensional (2-D) joint burst sparsity. We
propose a joint scattering environment sensing and channel estimation scheme to
enhance the target/scatterer localization and channel estimation performance
simultaneously, where a spatially non-stationary Markov random field (MRF)
model is proposed to capture the 2-D joint burst sparsity. An expectation
maximization (EM) based method is designed to solve the joint estimation
problem, where the E-step obtains the Bayesian estimation of the radar and
communication channels and the M-step automatically learns the dynamic position
grid and prior parameters in the MRF. However, the existing sparse Bayesian
inference methods used in the E-step involve a high-complexity matrix inverse
per iteration. Moreover, due to the complicated non-stationary MRF prior, the
complexity of M-step is exponentially large. To address these difficulties, we
propose an inverse-free variational Bayesian inference algorithm for the E-step
and a low-complexity method based on pseudo-likelihood approximation for the
M-step. In the simulations, the proposed scheme can achieve a better
performance than the state-of-the-art method while reducing the computational
overhead significantly.Comment: 15 pages, 13 figures, submitted to IEEE Transactions on Wireless
Communication
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
Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks
Future wireless networks have a substantial potential in terms of supporting
a broad range of complex compelling applications both in military and civilian
fields, where the users are able to enjoy high-rate, low-latency, low-cost and
reliable information services. Achieving this ambitious goal requires new radio
techniques for adaptive learning and intelligent decision making because of the
complex heterogeneous nature of the network structures and wireless services.
Machine learning (ML) algorithms have great success in supporting big data
analytics, efficient parameter estimation and interactive decision making.
Hence, in this article, we review the thirty-year history of ML by elaborating
on supervised learning, unsupervised learning, reinforcement learning and deep
learning. Furthermore, we investigate their employment in the compelling
applications of wireless networks, including heterogeneous networks (HetNets),
cognitive radios (CR), Internet of things (IoT), machine to machine networks
(M2M), and so on. This article aims for assisting the readers in clarifying the
motivation and methodology of the various ML algorithms, so as to invoke them
for hitherto unexplored services as well as scenarios of future wireless
networks.Comment: 46 pages, 22 fig
Foundational principles for large scale inference: Illustrations through correlation mining
When can reliable inference be drawn in the "Big Data" context? This paper
presents a framework for answering this fundamental question in the context of
correlation mining, with implications for general large scale inference. In
large scale data applications like genomics, connectomics, and eco-informatics
the dataset is often variable-rich but sample-starved: a regime where the
number of acquired samples (statistical replicates) is far fewer than the
number of observed variables (genes, neurons, voxels, or chemical
constituents). Much of recent work has focused on understanding the
computational complexity of proposed methods for "Big Data." Sample complexity
however has received relatively less attention, especially in the setting when
the sample size is fixed, and the dimension grows without bound. To
address this gap, we develop a unified statistical framework that explicitly
quantifies the sample complexity of various inferential tasks. Sampling regimes
can be divided into several categories: 1) the classical asymptotic regime
where the variable dimension is fixed and the sample size goes to infinity; 2)
the mixed asymptotic regime where both variable dimension and sample size go to
infinity at comparable rates; 3) the purely high dimensional asymptotic regime
where the variable dimension goes to infinity and the sample size is fixed.
Each regime has its niche but only the latter regime applies to exa-scale data
dimension. We illustrate this high dimensional framework for the problem of
correlation mining, where it is the matrix of pairwise and partial correlations
among the variables that are of interest. We demonstrate various regimes of
correlation mining based on the unifying perspective of high dimensional
learning rates and sample complexity for different structured covariance models
and different inference tasks
A survey on 5G massive MIMO Localization
Massive antenna arrays can be used to meet the requirements of 5G, by exploiting different spatial signatures of users. This same property can also be harnessed to determine the locations of those users. In order to perform massive MIMO localization, refined channel estimation routines and localization methods have been developed. This paper provides a brief overview of this emerging field
- …