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

Joint Power Control and Receiver Optimization of CDMA Transceivers Using Successive Interference Cancellation

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)
Benvenuto, N. ; Dept. of Inf. Eng., Padova Univ. ; Carnevale, G. ; Tomasin, S.

In a broadband uplink code-division multiple-access transmission, the interference among users, depending on the correlation of specific channels and codes, may be significant. Hence, when successive interference cancellation (SIC) is performed at the base station, the minimization of power consumption at the mobile terminals is achieved if a joint optimization of power control and ordering (JOPCO) of user detection is carried out. In this paper, we first investigate a closed-form solution to JOPCO, based on the assumption of perfect interference cancellation and complete knowledge of channel correlation among users. By describing the JOPCO problem as an optimization on a suitable graph, it is seen that the optimum solution is NP-hard, and we approximate it by a greedy algorithm. For a practical implementation, we then model JOPCO as a discrete stochastic optimization problem, and we derive a discrete stochastic approximation (DSA) algorithm that iteratively adapts the transmit powers and the SIC detection order. The DSA solution removes the hypothesis on perfect cancellation and explicit knowledge of the users' correlation. Moreover, by a suitable description of the problem, we obtain a simplified DSA algorithm having reduced requirements in both computational complexity and memory. Performance of the various algorithms is assessed by simulations in a universal mobile telecommunications system scenario

Published in:

Communications, IEEE Transactions on  (Volume:55 ,  Issue: 3 )

Date of Publication:

March 2007

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.