Close category search window
 

The Subchannel-Allocation for OFDMA Relaying Downlink Systems with Total Power Constraint

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

2 Author(s)
Kwak, R. ; Dept. of Electr. Eng., Stanford Univ., Stanford, CA ; Cioffi, J.M.

This paper considers the subchannel-allocation problem to maximize the sum-rate in orthogonal frequency- division multiple-access (OFDMA) regenerative relaying downlink systems with a total power constraint. Based on the Lagrange dual decomposition and the optimal condition of the problem, this paper proposes three heuristic algorithms: an extended modified inverse subchannel signal-to-noise ratio algorithm, a bit accumulation algorithm, and a bit ratio algorithm. Simulation results show that relaying systems with proposed algorithms outperform optimally resource-allocated OFDMA systems without relay stations by almost 100% ~ 270% depending on the system power, which confirms that subchannel-allocation is a key factor in obtaining a huge performance gain.

Published in:
Vehicular Technology Conference, 2008. VTC 2008-Fall. IEEE 68th

Date of Conference: 21-24 Sept. 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.