Adaptive Time-sharing Based Grouping Code Assignment in Mobile WCDMA Networks

Conference: PIMRC 2005 - 16th Annual IEEE International Symposium on Personal Indoor and Mobile Radio Communications
09/11/2005 - 09/14/2005 at Berlin, Germany

Proceedings: PIMRC 2005

Pages: 5Language: englishTyp: PDF

Personal VDE Members are entitled to a 10% discount on this title

Chang, Ben-Jye (Department of Computer Science & Information Engineering, Chaoyang University of Technology, Taichung, Taiwan, ROC)
Chen, Min-Xiou; Hwang, Ren-Hung; Tsai, Kun-Chan (Department of Computer Science & Information Engineering, National Chungcheng University, Chiayi, Taiwan, ROC)

In 3G WCDMA, several multi-code assignment mechanisms have proposed to reduce the waste rate. Nevertheless, these methods bring two inevitable drawbacks including, high complexity of handling multiple codes, and increasing the cost of using more rake combiners at both the base stations and mobile nodes. Therefore, we propose an adaptive grouping code assignment herein to provide a single channelization code for any possible rate of traffic, even though the required rate is not powers of two of the basic rate. Based on the dynamic programming algorithm, the adaptive grouping approach forms several calls into a group. Then it allocates a subtree to the group and adaptively shares the subtree codes for these calls in the concept of time-sharing of slots during a group cycle time. Numerical results indicate that the proposed adaptive grouping approach reduces significantly the waste rate and thus increases the system utilization.