For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Single Code-Based Dynamic Grouping with Cycle Interleaving Algorithm for Reducing Waste Rate in WCDMA Cellular Networks
Ben-Jye CHANG Min-Xiou CHEN Ren-Hung HWANG Kun-Chan TSAI
IEICE TRANSACTIONS on Communications
Publication Date: 2006/12/01
Online ISSN: 1745-1345
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Wireless Communication Technologies
WCDMA, OVSF code, time-sharing, waste rate, dynamic grouping, cycle interleaving,
Full Text: PDF>>
3G must offer high data rates since it should support real-time multimedia services; one performance enhancement, the use of the OVSF code tree, has adopted in 3G WCDMA networks. Unfortunately, this technique allows the link capacity to be set at the base rate times powers of two. This results in wasting bandwidth while the required rate is not powers of two of the basic rate. Several multi-code assignment mechanisms have been proposed to reduce the waste rate, but incur some drawbacks, including high complexity of handling multiple codes and increasing cost of using more rake combiners. Our solution is a dynamic grouping code assignment that allows any rate to be achieved with a single code for any possible rate of traffic. The dynamic grouping approach first forms several calls into a group. It then allocates a subtree to the group and dynamically shares the subtree codes based on time-sharing of slots within a group cycle time. The waste rate and code blocking is thus reduced significantly. Since transmission delay and jitter may occur in such a time-sharing approach, two schemes of cycle interleaving are proposed to minimize delay and jitter. Numerical results demonstrate that the proposed approach reduces the waste rate and increases the system utilization obviously, and the proposed cycle interleaving schemes minimizes delay and jitter significantly.