By Topic

Optimal code assignment and call admission control for OVSF-CDMA systems constrained by blocking probabilities

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
$33 $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)
Jun-Seong Park ; Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA ; Lei Huang ; Lee, D.C. ; Kuo, C.-C.J.

The tradeoff between the throughput and the blocking probability of various code assignment schemes for OVSF-CDMA (orthogonal variable spreading factor CDMA) systems is investigated, and the optimal fixed and dynamic code assignment schemes that maximize the average data throughput under a blocking probability constraint are proposed. The optimal schemes are obtained using constrained optimization through the Markov decision process and linear programming. The performance of each scheme is numerically evaluated. Numerical results demonstrate that the proposed new schemes can achieve a satisfactory balance between the average throughput and the blocking probability.

Published in:

Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE  (Volume:5 )

Date of Conference:

29 Nov.-3 Dec. 2004