3,017 research outputs found
Statistical Inference in Large Antenna Arrays under Unknown Noise Pattern
In this article, a general information-plus-noise transmission model is
assumed, the receiver end of which is composed of a large number of sensors and
is unaware of the noise pattern. For this model, and under reasonable
assumptions, a set of results is provided for the receiver to perform
statistical eigen-inference on the information part. In particular, we
introduce new methods for the detection, counting, and the power and subspace
estimation of multiple sources composing the information part of the
transmission. The theoretical performance of some of these techniques is also
discussed. An exemplary application of these methods to array processing is
then studied in greater detail, leading in particular to a novel MUSIC-like
algorithm assuming unknown noise covariance.Comment: 25 pages, 5 figure
Massive MIMO is a Reality -- What is Next? Five Promising Research Directions for Antenna Arrays
Massive MIMO (multiple-input multiple-output) is no longer a "wild" or
"promising" concept for future cellular networks - in 2018 it became a reality.
Base stations (BSs) with 64 fully digital transceiver chains were commercially
deployed in several countries, the key ingredients of Massive MIMO have made it
into the 5G standard, the signal processing methods required to achieve
unprecedented spectral efficiency have been developed, and the limitation due
to pilot contamination has been resolved. Even the development of fully digital
Massive MIMO arrays for mmWave frequencies - once viewed prohibitively
complicated and costly - is well underway. In a few years, Massive MIMO with
fully digital transceivers will be a mainstream feature at both sub-6 GHz and
mmWave frequencies. In this paper, we explain how the first chapter of the
Massive MIMO research saga has come to an end, while the story has just begun.
The coming wide-scale deployment of BSs with massive antenna arrays opens the
door to a brand new world where spatial processing capabilities are
omnipresent. In addition to mobile broadband services, the antennas can be used
for other communication applications, such as low-power machine-type or
ultra-reliable communications, as well as non-communication applications such
as radar, sensing and positioning. We outline five new Massive MIMO related
research directions: Extremely large aperture arrays, Holographic Massive MIMO,
Six-dimensional positioning, Large-scale MIMO radar, and Intelligent Massive
MIMO.Comment: 20 pages, 9 figures, submitted to Digital Signal Processin
Modulation Classification for MIMO-OFDM Signals via Approximate Bayesian Inference
The problem of modulation classification for a multiple-antenna (MIMO) system
employing orthogonal frequency division multiplexing (OFDM) is investigated
under the assumption of unknown frequency-selective fading channels and
signal-to-noise ratio (SNR). The classification problem is formulated as a
Bayesian inference task, and solutions are proposed based on Gibbs sampling and
mean field variational inference. The proposed methods rely on a selection of
the prior distributions that adopts a latent Dirichlet model for the modulation
type and on the Bayesian network formalism. The Gibbs sampling method converges
to the optimal Bayesian solution and, using numerical results, its accuracy is
seen to improve for small sample sizes when switching to the mean field
variational inference technique after a number of iterations. The speed of
convergence is shown to improve via annealing and random restarts. While most
of the literature on modulation classification assume that the channels are
flat fading, that the number of receive antennas is no less than that of
transmit antennas, and that a large number of observed data symbols are
available, the proposed methods perform well under more general conditions.
Finally, the proposed Bayesian methods are demonstrated to improve over
existing non-Bayesian approaches based on independent component analysis and on
prior Bayesian methods based on the `superconstellation' method.Comment: To be appear in IEEE Trans. Veh. Technolog
Sparsity-Cognizant Total Least-Squares for Perturbed Compressive Sampling
Solving linear regression problems based on the total least-squares (TLS)
criterion has well-documented merits in various applications, where
perturbations appear both in the data vector as well as in the regression
matrix. However, existing TLS approaches do not account for sparsity possibly
present in the unknown vector of regression coefficients. On the other hand,
sparsity is the key attribute exploited by modern compressive sampling and
variable selection approaches to linear regression, which include noise in the
data, but do not account for perturbations in the regression matrix. The
present paper fills this gap by formulating and solving TLS optimization
problems under sparsity constraints. Near-optimum and reduced-complexity
suboptimum sparse (S-) TLS algorithms are developed to address the perturbed
compressive sampling (and the related dictionary learning) challenge, when
there is a mismatch between the true and adopted bases over which the unknown
vector is sparse. The novel S-TLS schemes also allow for perturbations in the
regression matrix of the least-absolute selection and shrinkage selection
operator (Lasso), and endow TLS approaches with ability to cope with sparse,
under-determined "errors-in-variables" models. Interesting generalizations can
further exploit prior knowledge on the perturbations to obtain novel weighted
and structured S-TLS solvers. Analysis and simulations demonstrate the
practical impact of S-TLS in calibrating the mismatch effects of contemporary
grid-based approaches to cognitive radio sensing, and robust
direction-of-arrival estimation using antenna arrays.Comment: 30 pages, 10 figures, submitted to IEEE Transactions on Signal
Processin
Reciprocity Calibration for Massive MIMO: Proposal, Modeling and Validation
This paper presents a mutual coupling based calibration method for
time-division-duplex massive MIMO systems, which enables downlink precoding
based on uplink channel estimates. The entire calibration procedure is carried
out solely at the base station (BS) side by sounding all BS antenna pairs. An
Expectation-Maximization (EM) algorithm is derived, which processes the
measured channels in order to estimate calibration coefficients. The EM
algorithm outperforms current state-of-the-art narrow-band calibration schemes
in a mean squared error (MSE) and sum-rate capacity sense. Like its
predecessors, the EM algorithm is general in the sense that it is not only
suitable to calibrate a co-located massive MIMO BS, but also very suitable for
calibrating multiple BSs in distributed MIMO systems.
The proposed method is validated with experimental evidence obtained from a
massive MIMO testbed. In addition, we address the estimated narrow-band
calibration coefficients as a stochastic process across frequency, and study
the subspace of this process based on measurement data. With the insights of
this study, we propose an estimator which exploits the structure of the process
in order to reduce the calibration error across frequency. A model for the
calibration error is also proposed based on the asymptotic properties of the
estimator, and is validated with measurement results.Comment: Submitted to IEEE Transactions on Wireless Communications,
21/Feb/201
- …