By Topic

A Message-Passing Approach to Distributed Resource Allocation in Uplink DFT-Spread-OFDMA Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kai Yang ; Bell Labs., Alcatel-Lucent, Murray Hill, NJ, USA ; Prasad, N. ; Xiaodong Wang

In this paper, we consider the problem of resource allocation in the DFT-Spread-OFDMA (DFT-S-OFDMA) uplink. We show that the resource allocation problem can be formulated as a set packing problem, which in general is NP-hard. We propose polynomial-time message-passing based algorithms, one of which is guaranteed to yield a solution that is within a constant fraction of the optimal solution and is also asymptotically optimal in the limit as the number of subcarriers in the system goes to infinity. The message-passing based algorithm is also extended to solve the resource allocation problem over a multi-cell uplink in a distributed fashion. Our algorithms account for finite input alphabets and non-ideal practical outer codes. Extensive simulations are performed to assess the performance of the proposed algorithms and it is shown that they yield near-optimal solutions at a low complexity and with a low memory requirement.

Published in:

Communications, IEEE Transactions on  (Volume:59 ,  Issue: 4 )