Cart (Loading....) | Create Account
Close category search window
 

An Efficient Power Allocation Algorithm for OFDM Based Underlay Cognitive Radio Networks

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

4 Author(s)
Xun Zhou ; Nat. Key Lab. of Sci. & Technol. on Commun., Univ. of Electron. Sci. & Lechnology of China (UESLC), Chengdu, China ; Bin Wu ; Pin-Han Ho ; Xiang Ling

We consider power allocation in OFDM based underlay cognitive radio networks with partially known inter-system CSI (Channel State Information). Under a given total transmit power limit at the SU (Secondary User) transmitter, the goal is to assign a certain amount of power for signal transmission in each OFDM sub-channel, such that the SU's overall throughput can be maximized, and the average interference to the PU can be kept within a target outage probability level. The existing algorithm adopts an iterative binary searching process to find the solution, where the classic Water-Filling (WF) is invoked in each loop, which needs a relatively long running time. In this paper, an efficient algorithm is proposed to solve the problem in a much simpler and faster way. Specifically, we first propose an efficient approach to implement WF based on some in-depth theoretical analysis. Then, a novel power allocation algorithm is proposed by removing the binary searching process. Our algorithm runs WF only once and then directly calculates the final solution. Numerical results show that it can run tens to hundreds times faster than the existing algorithms, depending on the total number of OFDM sub-channels.

Published in:

Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE

Date of Conference:

5-9 Dec. 2011

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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.