By Topic

Second-order power control with asymptotically fast convergence

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)
Jantti, R. ; Dept. of Autom. & Syst. Technol., Helsinki Univ. of Technol., Espoo, Finland ; Seong-Lyun Kim

This paper proposes a distributed power control algorithm that uses power levels of both current and previous iterations for power update. The algorithm is developed by applying the successive overrelaxation method to the power control problem. The gain from such a second-order algorithm is in faster convergence. Convergence analysis of the algorithm in case of feasible systems is provided in this paper. Using the distributed constrained power control (DCPC) as a reference algorithm, we carried out computational experiments on a DS-CDMA system. The results indicate that our algorithm significantly enhances the convergence speed of power control. A practical version of the proposed algorithm is provided and compared with the bang-bang type algorithm used in the IS-95 and the WCDMA systems. The results show that our algorithm also has a high potential for increasing the radio network capacity. Our analysis assumes that the system is feasible in the sense that we can support every active user by an optimal power control. When the system becomes infeasible because of high traffic load, it calls for other actions such as transmitter removal, which is beyond the scope of the present paper.

Published in:

Selected Areas in Communications, IEEE Journal on  (Volume:18 ,  Issue: 3 )