By Topic

Queue-aided BLRU scheme for orthogonal variable-spreading-factor code assignment in 3G WCDMA

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)
Jui-Chi Chen ; Inst. for Comput. Sci., Nat. Chung-Hsing Univ., Taichung, Taiwan ; Wen-Shyen E Chen

In 3G WCDMA, orthogonal variable-spreading-factor (OVSF) codes are valuable and scarce resources. Some single-code and multicode assignment algorithms have been proposed to support as many users as possible. Most of the algorithms suffer from a "code-set fragmentation" problem, which definitely increases the call blocking probability (CBP) of a system. In order to resolve this issue, code-exchange and reassignment policies is applied, but system complexity is also increased. In this paper, we propose a queue-aided best-fit LRU (QBLRU) code assignment scheme to improve system utilization and to obtain lower CBP than that of dynamic optimal reassignment schemes. Simulation results show that the QBLRU scheme has the lowest CBP and the highest utilization and it is an efficient OVSF code assignment scheme.

Published in:

Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 2003. 14th IEEE Proceedings on  (Volume:1 )

Date of Conference:

7-10 Sept. 2003