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

doi:10.1093/ietcom/e89-b.12.3306

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

Full Text Views

0

Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Communications Vol.E89-B No.12 pp.3306-3318

Publication Date: 2006/12/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1093/ietcom/e89-b.12.3306

Type of Manuscript: PAPER

Category: Wireless Communication Technologies

Cite this

Copy

Ben-Jye CHANG, Min-Xiou CHEN, Ren-Hung HWANG, Kun-Chan TSAI, "Single Code-Based Dynamic Grouping with Cycle Interleaving Algorithm for Reducing Waste Rate in WCDMA Cellular Networks" in IEICE TRANSACTIONS on Communications, vol. E89-B, no. 12, pp. 3306-3318, December 2006, doi: 10.1093/ietcom/e89-b.12.3306.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e89-b.12.3306/_p

Copy

@ARTICLE{e89-b_12_3306,
author={Ben-Jye CHANG, Min-Xiou CHEN, Ren-Hung HWANG, Kun-Chan TSAI, },
journal={IEICE TRANSACTIONS on Communications},
title={Single Code-Based Dynamic Grouping with Cycle Interleaving Algorithm for Reducing Waste Rate in WCDMA Cellular Networks},
year={2006},
volume={E89-B},
number={12},
pages={3306-3318},
abstract={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.},
keywords={},
doi={10.1093/ietcom/e89-b.12.3306},
ISSN={1745-1345},
month={December},}

Copy

TY - JOUR
TI - Single Code-Based Dynamic Grouping with Cycle Interleaving Algorithm for Reducing Waste Rate in WCDMA Cellular Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 3306
EP - 3318
AU - Ben-Jye CHANG
AU - Min-Xiou CHEN
AU - Ren-Hung HWANG
AU - Kun-Chan TSAI
PY - 2006
DO - 10.1093/ietcom/e89-b.12.3306
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E89-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2006
AB - 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.
ER -