1,264 research outputs found
Feedback Allocation For OFDMA Systems With Slow Frequency-domain Scheduling
We study the problem of allocating limited feedback resources across multiple
users in an orthogonal-frequency-division-multiple-access downlink system with
slow frequency-domain scheduling. Many flavors of slow frequency-domain
scheduling (e.g., persistent scheduling, semi-persistent scheduling), that
adapt user-sub-band assignments on a slower time-scale, are being considered in
standards such as 3GPP Long-Term Evolution. In this paper, we develop a
feedback allocation algorithm that operates in conjunction with any arbitrary
slow frequency-domain scheduler with the goal of improving the throughput of
the system. Given a user-sub-band assignment chosen by the scheduler, the
feedback allocation algorithm involves solving a weighted sum-rate maximization
at each (slow) scheduling instant. We first develop an optimal
dynamic-programming-based algorithm to solve the feedback allocation problem
with pseudo-polynomial complexity in the number of users and in the total
feedback bit budget. We then propose two approximation algorithms with
complexity further reduced, for scenarios where the problem exhibits additional
structure.Comment: Accepted to IEEE Transactions on Signal Processin
Dynamic Time-domain Duplexing for Self-backhauled Millimeter Wave Cellular Networks
Millimeter wave (mmW) bands between 30 and 300 GHz have attracted
considerable attention for next-generation cellular networks due to vast
quantities of available spectrum and the possibility of very high-dimensional
antenna ar-rays. However, a key issue in these systems is range: mmW signals
are extremely vulnerable to shadowing and poor high-frequency propagation.
Multi-hop relaying is therefore a natural technology for such systems to
improve cell range and cell edge rates without the addition of wired access
points. This paper studies the problem of scheduling for a simple
infrastructure cellular relay system where communication between wired base
stations and User Equipment follow a hierarchical tree structure through fixed
relay nodes. Such a systems builds naturally on existing cellular mmW backhaul
by adding mmW in the access links. A key feature of the proposed system is that
TDD duplexing selections can be made on a link-by-link basis due to directional
isolation from other links. We devise an efficient, greedy algorithm for
centralized scheduling that maximizes network utility by jointly optimizing the
duplexing schedule and resources allocation for dense, relay-enhanced OFDMA/TDD
mmW networks. The proposed algorithm can dynamically adapt to loading, channel
conditions and traffic demands. Significant throughput gains and improved
resource utilization offered by our algorithm over the static,
globally-synchronized TDD patterns are demonstrated through simulations based
on empirically-derived channel models at 28 GHz.Comment: IEEE Workshop on Next Generation Backhaul/Fronthaul Networks -
BackNets 201
Downlink Training in Cell-Free Massive MIMO: A Blessing in Disguise
Cell-free Massive MIMO (multiple-input multiple-output) refers to a
distributed Massive MIMO system where all the access points (APs) cooperate to
coherently serve all the user equipments (UEs), suppress inter-cell
interference and mitigate the multiuser interference. Recent works demonstrated
that, unlike co-located Massive MIMO, the \textit{channel hardening} is, in
general, less pronounced in cell-free Massive MIMO, thus there is much to
benefit from estimating the downlink channel. In this study, we investigate the
gain introduced by the downlink beamforming training, extending the previously
proposed analysis to non-orthogonal uplink and downlink pilots. Assuming
single-antenna APs, conjugate beamforming and independent Rayleigh fading
channel, we derive a closed-form expression for the per-user achievable
downlink rate that addresses channel estimation errors and pilot contamination
both at the AP and UE side. The performance evaluation includes max-min
fairness power control, greedy pilot assignment methods, and a comparison
between achievable rates obtained from different capacity-bounding techniques.
Numerical results show that downlink beamforming training, although increases
pilot overhead and introduces additional pilot contamination, improves
significantly the achievable downlink rate. Even for large number of APs, it is
not fully efficient for the UE relying on the statistical channel state
information for data decoding.Comment: Published in IEEE Transactions on Wireless Communications on August
14, 2019. {\copyright} 2019 IEEE. Personal use of this material is permitted.
Permission from IEEE must be obtained for all other use
- âŠ