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

Power Allocation for Interference-Limited Cognitive Multiple Access Channels

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)
Dong Li ; Fac. of Inf. Technol., Macau Univ. of Sci. & Technol., Macau, China ; Ying-Chang Liang

In this letter, we investigate the optimal power allocation for interference-limited cognitive multiple access channels. The objective is to minimize the outage probability of cognitive users (CUs) while satisfying the interference constraint on the primary user (PU). The formulated optimization problem is non-convex, but can be efficiently solved by the aid of logarithmic transformation. For comparison, we also analyze two suboptimal power allocation schemes by assigning equal interference (EI) or equal transmit power (ETP) to each CU. We derive closed-form expressions for both schemes, and asymptotically analyze their performance. Simulations results confirm the correctness of our analysis and effectiveness of the proposed schemes.

Published in:

Wireless Communications Letters, IEEE  (Volume:2 ,  Issue: 3 )

Date of Publication:

June 2013

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.