642 research outputs found
Performance of Orthogonal Beamforming for SDMA with Limited Feedback
On the multi-antenna broadcast channel, the spatial degrees of freedom
support simultaneous transmission to multiple users. The optimal multiuser
transmission, known as dirty paper coding, is not directly realizable.
Moreover, close-to-optimal solutions such as Tomlinson-Harashima precoding are
sensitive to CSI inaccuracy. This paper considers a more practical design
called per user unitary and rate control (PU2RC), which has been proposed for
emerging cellular standards. PU2RC supports multiuser simultaneous
transmission, enables limited feedback, and is capable of exploiting multiuser
diversity. Its key feature is an orthogonal beamforming (or precoding)
constraint, where each user selects a beamformer (or precoder) from a codebook
of multiple orthonormal bases. In this paper, the asymptotic throughput scaling
laws for PU2RC with a large user pool are derived for different regimes of the
signal-to-noise ratio (SNR). In the multiuser-interference-limited regime, the
throughput of PU2RC is shown to scale logarithmically with the number of users.
In the normal SNR and noise-limited regimes, the throughput is found to scale
double logarithmically with the number of users and also linearly with the
number of antennas at the base station. In addition, numerical results show
that PU2RC achieves higher throughput and is more robust against CSI
quantization errors than the popular alternative of zero-forcing beamforming if
the number of users is sufficiently large.Comment: 27 pages; to appear in IEEE Transactions on Vehicular Technolog
Achieving Large Multiplexing Gain in Distributed Antenna Systems via Cooperation with pCell Technology
In this paper we present pCellTM technology, the first commercial-grade
wireless system that employs cooperation between distributed transceiver
stations to create concurrent data links to multiple users in the same
spectrum. First we analyze the per-user signal-to-interference-plus-noise ratio
(SINR) employing a geometrical spatial channel model to define volumes in space
of coherent signal around user antennas (or personal cells, i.e., pCells). Then
we describe the system architecture consisting of a general-purpose-processor
(GPP) based software-defined radio (SDR) wireless platform implementing a
real-time LTE protocol stack to communicate with off-the-shelf LTE devices.
Finally we present experimental results demonstrating up to 16 concurrent
spatial channels for an aggregate average spectral efficiency of 59.3 bps/Hz in
the downlink and 27.5 bps/Hz in the uplink, providing data rates of 200 Mbps
downlink and 25 Mbps uplink in 5 MHz of TDD spectrum.Comment: IEEE Asilomar Conference on Signals, Systems, and Computers, Nov.
8-11th 2015, Pacific Grove, CA, US
How much does transmit correlation affect the sum-rate scaling of MIMO Gaussian broadcast channels?
This paper considers the effect of spatial correlation between transmit antennas on the sum-rate capacity of the MIMO Gaussian broadcast channel (i.e., downlink of a cellular system). Specifically, for a system with a large number of users n, we analyze the scaling laws of the sum-rate for the dirty paper coding and for different types of beamforming transmission schemes. When the channel is i.i.d., it has been shown that for large n, the sum rate is equal to M log log n + M log P/M + o(1) where M is the number of transmit antennas, P is the average signal to noise ratio, and o(1) refers to terms that go to zero as n → ∞. When the channel exhibits some spatial correlation with a covariance matrix R (non-singular with tr(R) = M), we prove that the sum rate of dirty paper coding is M log log n + M log P/M + log det(R) + o(1). We further show that the sum-rate of various beamforming schemes achieves M log log n + M log P/M + M log c + o(1) where c ≤ 1 depends on the type of beamforming. We can in fact compute c for random beamforming proposed in and more generally, for random beamforming with preceding in which beams are pre-multiplied by a fixed matrix. Simulation results are presented at the end of the paper
Linear Precoding in Cooperative MIMO Cellular Networks with Limited Coordination Clusters
In a cooperative multiple-antenna downlink cellular network, maximization of
a concave function of user rates is considered. A new linear precoding
technique called soft interference nulling (SIN) is proposed, which performs at
least as well as zero-forcing (ZF) beamforming. All base stations share channel
state information, but each user's message is only routed to those that
participate in the user's coordination cluster. SIN precoding is particularly
useful when clusters of limited sizes overlap in the network, in which case
traditional techniques such as dirty paper coding or ZF do not directly apply.
The SIN precoder is computed by solving a sequence of convex optimization
problems. SIN under partial network coordination can outperform ZF under full
network coordination at moderate SNRs. Under overlapping coordination clusters,
SIN precoding achieves considerably higher throughput compared to myopic ZF,
especially when the clusters are large.Comment: 13 pages, 5 figure
AirSync: Enabling Distributed Multiuser MIMO with Full Spatial Multiplexing
The enormous success of advanced wireless devices is pushing the demand for
higher wireless data rates. Denser spectrum reuse through the deployment of
more access points per square mile has the potential to successfully meet the
increasing demand for more bandwidth. In theory, the best approach to density
increase is via distributed multiuser MIMO, where several access points are
connected to a central server and operate as a large distributed multi-antenna
access point, ensuring that all transmitted signal power serves the purpose of
data transmission, rather than creating "interference." In practice, while
enterprise networks offer a natural setup in which distributed MIMO might be
possible, there are serious implementation difficulties, the primary one being
the need to eliminate phase and timing offsets between the jointly coordinated
access points.
In this paper we propose AirSync, a novel scheme which provides not only time
but also phase synchronization, thus enabling distributed MIMO with full
spatial multiplexing gains. AirSync locks the phase of all access points using
a common reference broadcasted over the air in conjunction with a Kalman filter
which closely tracks the phase drift. We have implemented AirSync as a digital
circuit in the FPGA of the WARP radio platform. Our experimental testbed,
comprised of two access points and two clients, shows that AirSync is able to
achieve phase synchronization within a few degrees, and allows the system to
nearly achieve the theoretical optimal multiplexing gain. We also discuss MAC
and higher layer aspects of a practical deployment. To the best of our
knowledge, AirSync offers the first ever realization of the full multiuser MIMO
gain, namely the ability to increase the number of wireless clients linearly
with the number of jointly coordinated access points, without reducing the per
client rate.Comment: Submitted to Transactions on Networkin
Sum Rates, Rate Allocation, and User Scheduling for Multi-User MIMO Vector Perturbation Precoding
This paper considers the multiuser multiple-input multiple-output (MIMO)
broadcast channel. We consider the case where the multiple transmit antennas
are used to deliver independent data streams to multiple users via vector
perturbation. We derive expressions for the sum rate in terms of the average
energy of the precoded vector, and use this to derive a high signal-to-noise
ratio (SNR) closed-form upper bound, which we show to be tight via simulation.
We also propose a modification to vector perturbation where different rates can
be allocated to different users. We conclude that for vector perturbation
precoding most of the sum rate gains can be achieved by reducing the rate
allocation problem to the user selection problem. We then propose a
low-complexity user selection algorithm that attempts to maximize the high-SNR
sum rate upper bound. Simulations show that the algorithm outperforms other
user selection algorithms of similar complexity.Comment: 27 pages with 6 figures and 2 tables. Accepted for publication in
IEEE Trans. Wireless Comm
- …