1,081 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
Space Division Multiple Access with a Sum Feedback Rate Constraint
On a multi-antenna broadcast channel, simultaneous transmission to multiple
users by joint beamforming and scheduling is capable of achieving high
throughput, which grows double logarithmically with the number of users. The
sum rate for channel state information (CSI) feedback, however, increases
linearly with the number of users, reducing the effective uplink capacity. To
address this problem, a novel space division multiple access (SDMA) design is
proposed, where the sum feedback rate is upper-bounded by a constant. This
design consists of algorithms for CSI quantization, threshold based CSI
feedback, and joint beamforming and scheduling. The key feature of the proposed
approach is the use of feedback thresholds to select feedback users with large
channel gains and small CSI quantization errors such that the sum feedback rate
constraint is satisfied. Despite this constraint, the proposed SDMA design is
shown to achieve a sum capacity growth rate close to the optimal one. Moreover,
the feedback overflow probability for this design is found to decrease
exponentially with the difference between the allowable and the average sum
feedback rates. Numerical results show that the proposed SDMA design is capable
of attaining higher sum capacities than existing ones, even though the sum
feedback rate is bounded.Comment: 29 pages; submitted to IEEE Transactions on Signal Processin
Resource Allocation for Outdoor-to-Indoor Multicarrier Transmission with Shared UE-side Distributed Antenna Systems
In this paper, we study the resource allocation algorithm design for downlink
multicarrier transmission with a shared user equipment (UE)-side distributed
antenna system (SUDAS) which utilizes both licensed and unlicensed frequency
bands for improving the system throughput. The joint UE selection and
transceiver processing matrix design is formulated as a non-convex optimization
problem for the maximization of the end-to-end system throughput (bits/s). In
order to obtain a tractable resource allocation algorithm, we first show that
the optimal transmitter precoding and receiver post-processing matrices jointly
diagonalize the end-to-end communication channel. Subsequently, the
optimization problem is converted to a scalar optimization problem for multiple
parallel channels, which is solved by using an asymptotically optimal iterative
algorithm. Simulation results illustrate that the proposed resource allocation
algorithm for the SUDAS achieves an excellent system performance and provides a
spatial multiplexing gain for single-antenna UEs.Comment: accepted for publication at the IEEE Vehicular Technology Conference
(VTC) Spring, Glasgow, Scotland, UK, May 201
Opportunistic Relaying in Wireless Networks
Relay networks having source-to-destination pairs and half-duplex
relays, all operating in the same frequency band in the presence of block
fading, are analyzed. This setup has attracted significant attention and
several relaying protocols have been reported in the literature. However, most
of the proposed solutions require either centrally coordinated scheduling or
detailed channel state information (CSI) at the transmitter side. Here, an
opportunistic relaying scheme is proposed, which alleviates these limitations.
The scheme entails a two-hop communication protocol, in which sources
communicate with destinations only through half-duplex relays. The key idea is
to schedule at each hop only a subset of nodes that can benefit from
\emph{multiuser diversity}. To select the source and destination nodes for each
hop, it requires only CSI at receivers (relays for the first hop, and
destination nodes for the second hop) and an integer-value CSI feedback to the
transmitters. For the case when is large and is fixed, it is shown that
the proposed scheme achieves a system throughput of bits/s/Hz. In
contrast, the information-theoretic upper bound of bits/s/Hz
is achievable only with more demanding CSI assumptions and cooperation between
the relays. Furthermore, it is shown that, under the condition that the product
of block duration and system bandwidth scales faster than , the
achievable throughput of the proposed scheme scales as .
Notably, this is proven to be the optimal throughput scaling even if
centralized scheduling is allowed, thus proving the optimality of the proposed
scheme in the scaling law sense.Comment: 17 pages, 8 figures, To appear in IEEE Transactions on Information
Theor
Distributed Multicell Beamforming Design Approaching Pareto Boundary with Max-Min Fairness
This paper addresses coordinated downlink beamforming optimization in
multicell time-division duplex (TDD) systems where a small number of parameters
are exchanged between cells but with no data sharing. With the goal to reach
the point on the Pareto boundary with max-min rate fairness, we first develop a
two-step centralized optimization algorithm to design the joint beamforming
vectors. This algorithm can achieve a further sum-rate improvement over the
max-min optimal performance, and is shown to guarantee max-min Pareto
optimality for scenarios with two base stations (BSs) each serving a single
user. To realize a distributed solution with limited intercell communication,
we then propose an iterative algorithm by exploiting an approximate
uplink-downlink duality, in which only a small number of positive scalars are
shared between cells in each iteration. Simulation results show that the
proposed distributed solution achieves a fairness rate performance close to the
centralized algorithm while it has a better sum-rate performance, and
demonstrates a better tradeoff between sum-rate and fairness than the Nash
Bargaining solution especially at high signal-to-noise ratio.Comment: 8 figures. To Appear in IEEE Trans. Wireless Communications, 201
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
- …