1,953 research outputs found
Adaptive OFDM Index Modulation for Two-Hop Relay-Assisted Networks
In this paper, we propose an adaptive orthogonal frequency-division
multiplexing (OFDM) index modulation (IM) scheme for two-hop relay networks. In
contrast to the traditional OFDM IM scheme with a deterministic and fixed
mapping scheme, in this proposed adaptive OFDM IM scheme, the mapping schemes
between a bit stream and indices of active subcarriers for the first and second
hops are adaptively selected by a certain criterion. As a result, the active
subcarriers for the same bit stream in the first and second hops can be varied
in order to combat slow frequency-selective fading. In this way, the system
reliability can be enhanced. Additionally, considering the fact that a relay
device is normally a simple node, which may not always be able to perform
mapping scheme selection due to limited processing capability, we also propose
an alternative adaptive methodology in which the mapping scheme selection is
only performed at the source and the relay will simply utilize the selected
mapping scheme without changing it. The analyses of average outage probability,
network capacity and symbol error rate (SER) are given in closed form for
decode-and-forward (DF) relaying networks and are substantiated by numerical
results generated by Monte Carlo simulations.Comment: 30 page
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
- …