16 research outputs found
Asymptotic Moments for Interference Mitigation in Correlated Fading Channels
We consider a certain class of large random matrices, composed of independent
column vectors with zero mean and different covariance matrices, and derive
asymptotically tight deterministic approximations of their moments. This random
matrix model arises in several wireless communication systems of recent
interest, such as distributed antenna systems or large antenna arrays.
Computing the linear minimum mean square error (LMMSE) detector in such systems
requires the inversion of a large covariance matrix which becomes prohibitively
complex as the number of antennas and users grows. We apply the derived moment
results to the design of a low-complexity polynomial expansion detector which
approximates the matrix inverse by a matrix polynomial and study its asymptotic
performance. Simulation results corroborate the analysis and evaluate the
performance for finite system dimensions.Comment: 7 pages, 2 figures, to be presented at IEEE International Symposium
on Information Theory (ISIT), Saint Petersburg, Russia, July 31 - August 5,
201
Low-Complexity Channel Estimation in Large-Scale MIMO using Polynomial Expansion
This paper considers pilot-based channel estimation in large-scale
multiple-input multiple-output (MIMO) communication systems, also known as
"massive MIMO". Unlike previous works on this topic, which mainly considered
the impact of inter-cell disturbance due to pilot reuse (so-called pilot
contamination), we are concerned with the computational complexity. The
conventional minimum mean square error (MMSE) and minimum variance unbiased
(MVU) channel estimators rely on inverting covariance matrices, which has cubic
complexity in the multiplication of number of antennas at each side. Since this
is extremely expensive when there are hundreds of antennas, we propose to
approximate the inversion by an L-order matrix polynomial. A set of
low-complexity Bayesian channel estimators, coined Polynomial ExpAnsion CHannel
(PEACH) estimators, are introduced. The coefficients of the polynomials are
optimized to yield small mean square error (MSE). We show numerically that
near-optimal performance is achieved with low polynomial orders. In practice,
the order L can be selected to balance between complexity and MSE.
Interestingly, pilot contamination is beneficial to the PEACH estimators in the
sense that smaller L can be used to achieve near-optimal MSEs.Comment: Published at IEEE International Symposium on Personal, Indoor and
Mobile Radio Communications (PIMRC 2013), 8-11 September 2013, 6 pages, 4
figures, 1 tabl
Performance comparison of multi-user detectors for the downlink of a broadband MC-CDMA system
In this paper multi-user detection techniques, such as Parallel and Serial Interference Cancellations (PIC & SIC), General Minimum Mean Square Error (GMMSE) and polynomial MMSE, for the downlink of a broadband Multi-Carrier Code Division Multiple Access (MCCDMA) system are investigated. The Bit Error Rate (BER) and Frame Error Rate (FER) results are evaluated, and compared with single-user detection (MMSEC, EGC) approaches, as well. The performance evaluation takes into account the system load, channel coding and modulation schemes
Robust Reduced-Rank Adaptive Processing Based on Parallel Subgradient Projection and Krylov Subspace Techniques
In this paper, we propose a novel reduced-rank adaptive filtering algorithm
by blending the idea of the Krylov subspace methods with the set-theoretic
adaptive filtering framework. Unlike the existing Krylov-subspace-based
reduced-rank methods, the proposed algorithm tracks the optimal point in the
sense of minimizing the \sinq{true} mean square error (MSE) in the Krylov
subspace, even when the estimated statistics become erroneous (e.g., due to
sudden changes of environments). Therefore, compared with those existing
methods, the proposed algorithm is more suited to adaptive filtering
applications. The algorithm is analyzed based on a modified version of the
adaptive projected subgradient method (APSM). Numerical examples demonstrate
that the proposed algorithm enjoys better tracking performance than the
existing methods for the interference suppression problem in code-division
multiple-access (CDMA) systems as well as for simple system identification
problems.Comment: 10 figures. In IEEE Transactions on Signal Processing, 201
Max-Min SINR in Large-Scale Single-Cell MU-MIMO: Asymptotic Analysis and Low Complexity Transceivers
This work focuses on the downlink and uplink of large-scale single-cell
MU-MIMO systems in which the base station (BS) endowed with antennas
communicates with single-antenna user equipments (UEs). Particularly, we
aim at reducing the complexity of the linear precoder and receiver that
maximize the minimum signal-to-interference-plus-noise ratio subject to a given
power constraint. To this end, we consider the asymptotic regime in which
and grow large with a given ratio. Tools from random matrix theory (RMT)
are then used to compute, in closed form, accurate approximations for the
parameters of the optimal precoder and receiver, when imperfect channel state
information (modeled by the generic Gauss-Markov formulation form) is available
at the BS. The asymptotic analysis allows us to derive the asymptotically
optimal linear precoder and receiver that are characterized by a lower
complexity (due to the dependence on the large scale components of the channel)
and, possibly, by a better resilience to imperfect channel state information.
However, the implementation of both is still challenging as it requires fast
inversions of large matrices in every coherence period. To overcome this issue,
we apply the truncated polynomial expansion (TPE) technique to the precoding
and receiving vector of each UE and make use of RMT to determine the optimal
weighting coefficients on a per-UE basis that asymptotically solve the max-min
SINR problem. Numerical results are used to validate the asymptotic analysis in
the finite system regime and to show that the proposed TPE transceivers
efficiently mimic the optimal ones, while requiring much lower computational
complexity.Comment: 13 pages, 4 figures, submitted to IEEE Transactions on Signal
Processin
Asynchronous CDMA Systems with Random Spreading-Part II: Design Criteria
Totally asynchronous code-division multiple-access (CDMA) systems are
addressed. In Part I, the fundamental limits of asynchronous CDMA systems are
analyzed in terms of spectral efficiency and SINR at the output of the optimum
linear detector. The focus of Part II is the design of low-complexity
implementations of linear multiuser detectors in systems with many users that
admit a multistage representation, e.g. reduced rank multistage Wiener filters,
polynomial expansion detectors, weighted linear parallel interference
cancellers. The effects of excess bandwidth, chip-pulse shaping, and time delay
distribution on CDMA with suboptimum linear receiver structures are
investigated. Recursive expressions for universal weight design are given. The
performance in terms of SINR is derived in the large-system limit and the
performance improvement over synchronous systems is quantified. The
considerations distinguish between two ways of forming discrete-time
statistics: chip-matched filtering and oversampling
Multi-Band Covariance Interpolation with Applications in Massive MIMO
In this paper, we study the problem of multi-band (frequency-variant)
covariance interpolation with a particular emphasis towards massive MIMO
applications. In a massive MIMO system, the communication between each BS with
antennas and each single-antenna user occurs through a collection of
scatterers in the environment, where the channel vector of each user at BS
antennas consists in a weighted linear combination of the array responses of
the scatterers, where each scatterer has its own angle of arrival (AoA) and
complex channel gain. The array response at a given AoA depends on the
wavelength of the incoming planar wave and is naturally frequency dependent.
This results in a frequency-dependent distortion where the second order
statistics, i.e., the covariance matrix, of the channel vectors varies with
frequency. In this paper, we show that although this effect is generally
negligible for a small number of antennas , it results in a considerable
distortion of the covariance matrix and especially its dominant signal subspace
in the massive MIMO regime where , and can generally incur a
serious degradation of the performance especially in frequency division
duplexing (FDD) massive MIMO systems where the uplink (UL) and the downlink
(DL) communication occur over different frequency bands. We propose a novel
UL-DL covariance interpolation technique that is able to recover the covariance
matrix in the DL from an estimate of the covariance matrix in the UL under a
mild reciprocity condition on the angular power spread function (PSF) of the
users. We analyze the performance of our proposed scheme mathematically and
prove its robustness under a sufficiently large spatial oversampling of the
array. We also propose several simple off-the-shelf algorithms for UL-DL
covariance interpolation and evaluate their performance via numerical
simulations.Comment: A short version of this paper was submitted to IEEE International
Symposium on Information Theory (ISIT), 201