European Journal of Scientific Research ISSN 1450-216X Vol.50 No.2 (2011), pp.151-156 EuroJournals Publishing, Inc. 2011 http://www.eurojournals.com/ejsr.

htm

Efficient Channelization Code Management in WCDMA

Mehdi Askari Behbahan Higher educational Complex, Behbahan, Iran E-mail: mehdiaskari58@yahoo.com Abstract In Wideband Code Division Multiple Access, Channelization codes are used to preserve the orthogonality between physical channels, in order to increasing system capacity. The Orthogonal Variable Spreading Factor (OVSF) codes are used as the channelization codes in this system. In WCDMA, it is possible to provide multi-rate service by employing the OVSF codes, which can be generated in the form of tree structure. This scheme is known as OVSF-CDMA. One important limitation of OVSF-CDMA is that the system must maintain the orthogonality among the assigned codes. The maintenance of the orthogonality among the assigned OVSF codes causes the code blocking problem. Efficient channelization code management, result in high efficiency of code utilization and increasing system capacity. This research compares the performance of static and dynamic OVSF code assignment schemes, in terms of call blocking probability and number of required call reassignment. Keywords: WCDMA, Multi-rate service, Blocking Probability, Code Assignment

1. Introduction
In order to support variable rates of data multimedia in CDMA system, a set of orthogonal codes with different lengths must be used, because the rate of information varies and the available bandwidth is fixed [1, 2]. It is possible to support higher data rates in direct sequence CDMA (DS-CDMA) systems by assigning multiple fixed-length orthogonal codes to a call [3]. In an alternative CDMA scheme witch is known as OVSF-CDMA, a single Orthogonal Variable Spreading Factor (OVSF) code is assigned to each user. In this case, a higher data rate can be accessed by using a lower spreading factor [4, 5]. In this paper, we focus on the environment where one single OVSF code is available for each call. OVSF codes can be represented as a code tree. The data rates provided are always a power of two with respect to the lowest-rate codes. OVSF codes assignment has significant impact on the code utilization of the system. There are two types of code assignment schemes: Static and Dynamic. This paper addressed both static and dynamic schemes in a WCDMA system where OVSF code tree are used. The general objective is to make the OVSF code tree as compact as possible so as to support more new calls by incurring less blocking probability and less reassignment costs.

2. OVSF Code System

In Wideband CDMA, two operations are applied to user data. The first is channelization, which transforms every data bits to a number of chips, thus increasing the bandwidth of the signal. The

Efficient Channelization Code Management in WCDMA

152

second operation is scrambling, which are used to separate the signals of different sources. In Fig. 1 the channelization structure of the reverse link (uplink) in the OVSF code system is shown. In this Figure, DPDCH is Dedicated Physical Data Channel and DPCCH is Dedicated Physical Control Channel.
Figure 1: Channelization in uplink

The channelization operation in WCDMA transforms each data symbol into a number of chips. The number of chips per data symbol is called spreading factor. The data symbol are spread in channelization operation firstly and then scrambled in scrambling operation [6, 7, 8]. The OVSF codes can be represented by a tree. Fig. 2 shows a K layer code tree [5]. The OVSF code tree is a binary tree with K layer, where each node represents a channelization code (k,m), k=0,1,,K, m=1,,2K. The lowest layer is the leaf layer and the highest layer is the root layer. The data rate that a code can be support is called its capacity. Let the capacity of the leaf codes (in layer K) be R. Then the capacity of the codes in layer (k-1),(k-2),,1,0 are 2R,4R,, 2K-1R,2KR respectively, as shown in Fig. 2.
Figure 2: a K layer code tree

Layer k has 2k codes and they sequentially labeled from left to right, starting from one. The mth code in layer k is referred to as code (k,m). The total capacity of all the codes in each layer is 2KR, irrespective of the layer number. We also define the maximum spreading factor Nmax=2K as the total number of codes in layer K. All lower layer codes spanned from a higher layer code are defined as descendent codes. All higher layer codes linking a particular code to the root code are called its mother codes [6, 9]. Note that all codes in each layer are mutually orthogonal. Furthermore, any two codes of different layers are also orthogonal expect for the case when one of the two codes is the mother code of the other [2].

3. Problem Statement
When a new call arrives requesting for a code of rate iR, where i is a power of two, we have to allocate a free code of rate iR for it. In static schemes we address the allocation algorithm when multiple free codes exist in the code tree. When no such free code exist but the remaining capacity of the code tree is sufficient (i.e. summation of data rates of all free code is greater than iR), we can use dynamic

153

Mehdi Askari

schemes. In dynamic schemes, relocate some codes in the code tree to find a free space for the new call. We define OVSF code blocking as the condition that a new call cannot be supported although the system has excess capacity to support the rate requirement of the call [6].

4. Static Code Assignment Schemes

In static schemes we address the allocation algorithm when multiple free codes exist in the code tree. 4.1. Ordered Scheme When a call requesting iR arrives, where i is a power of two, we need to find a code to accommodate this call. Our goal is to always vacate a larger capacity in the right-hand side of the code tree so as to accommodate higher-rate calls in the future [10]. So, if there is one or more than one free code in the code tree with a rate iR, pick the leftmost one in the code tree and assign it to the call. Otherwise, the call is rejected. 4.2. Optimal Scheme The objective of this scheme is to keep the remaining assignable codes in the most compact state after each code assignment without reassigning codes. To achieve this purpose into the existing busy codes, new-code assignments are packed as tightly as possible into the existing busy codes, i.e. the assignable code in the most congested position is found for the new call. As a result, the busy codes are also kept as compact as possible after each code assignment. For a typical branch, say the branch under (k,m), let C(k,m) be the assignable capacity of the branch, witch is defined as total capacity of the assignable leaf codes in this branch. In other word:
m.2 K k

C ( k , m) =

i =1+ ( m 1).2 K k

( I AK ,m)

(1)

Where

is the assignability index function of code (K, m) and is defined as [5]: is assignable 1 ( K , m) ( I AK , m ) = otherwise 0

( K , m) A

(2)

For example, in Fig. 3, the assignable capacity of code (2,2) is equal to 2 and the assignable capacity of code (2,3) is equal to 1.
Figure 3: a 3-layer code tree (for example)

When a call requesting iR arrives, where i is a power of two, we need to find a code to accommodate this call. If there is one or more than one code in the code tree with rate iR, pick the one whose ancestor codes has the least C(k,m). More specifically, suppose codes A and B are both of rates iR. We will compare the assignable capacity of their ancestors, respectively. The one with less assignable capacity (i.e. most compact) will be picked to accommodate the new call. When there are ties, we will go one level up. This is repeated until the subtree with the least assignable capacity is found. If ancestors, has equal C(k,m), we will follow the ordered scheme to assign the code.

Efficient Channelization Code Management in WCDMA

154

For example, consider the code tree in Fig. 3. Suppose a new call arriving requesting a rate 1R. By the ordered strategy, code (3,3) will be chosen, and by the optimal strategy, code (3,5) will be chosen.

5. Dynamic Code Assignment Schemes

Reassignment (Dynamic assignment) schemes are necessary when the capacity of the tree is enough to carry the incoming call, but no code of required rate is available. In this case, a code of the required rate can be become available, by transferring all the existing calls at the subbranch of the code to some other branches of the tree. 5.1. Ordered Scheme The idea of this scheme is to rearrange some of the busy code and pack them as tightly as possible to one side of the tree. In doing so, the assignable codes are aggregated together. This method is simple, but it incurs many unnecessary code reassignments. 5.2. Optimal Scheme Let a call requesting iR arrives to the system. In [6], a dynamic code assignment (DCA) algorithm is proposed based on code pattern search to find a branch of rate iR in the code tree which can be vacated with the minimum cost. However, where to place those relocate codes is not addressed in [6]. Assignment strategies for those relocated codes may have an impact on the system performance in the future [10]. In case a new call arrives requesting a rate iR, but no free code of such a rate exist, the following steps are taken: a. If the total amount of free capacity in the code tree is greater than iR, apply the DCA algorithm in [6] to find the minimum-cost branch with rate iR. Otherwise, the call is rejected. b. For the busy codes in the branch found above, we relocate them one-by-one starting from those with higher rates. For each busy code being relocated, we replace it based on static optimal scheme. If no free codes exist to accommodate the transferred call, the same reassignment (DCA) procedure is repeated recursively until all busy codes are relocated.

6. Numerical Results
Our proposed schemes are evaluated on a 6-layer code tree. The call arrival process is modeled by a Poisson distribution with mean arrival rate =1-16 calls/unit time, while the call duration is exponentially distributed with a mean value of 1/=0.25 unit of time, according to [6]. The possible rates for a new call are R, 2R, 4R, and 8R, each with a different probability of appearance. In our simulation we use a uniform rate distribution R:2R:4R:8R=25:25:25:25 (calls have equal probability to request for rate 1R, 2R, 4R, 8R) and a more realistic scenario with lower rate calls being more probable (R:2R:4R:8R=40:40:10:10). To ensure stable results, each point on the figures has been produced by a simulation run with at least 10000 incoming calls. Fig.4 shows the code blocking probability at different traffic load / (average service rate average call duration) and uniform rate distribution. We can see that Dynamic Optimal (D-Optimal) strategy performs the best and which is followed by the Dynamic Ordered (D-Ordered), Static Optimal (S-Optimal) and Static Ordered (S-Ordered), respectively. According to this figure, at light load, the blocking probability is quiet insensitive to code placement algorithm. Another important result is that code blocking rate of dynamic schemes is obviously less than that of static schemes. But code reassignment strategy at dynamic schemes makes the implementation of these schemes more complicated than static schemes. Fig.5 shows the code blocking rate for different code rate distribution at static ordered (SOrdered) scheme. According to this Fig, we can see that the blocking probability is larger when the

155

Mehdi Askari

code rates are uniformly distributed. This subject is correct for Dynamic Ordered scheme too. These results are expected because in (40:40:10:10) distribution, calls of rate R and 2R have more probability for occurrence. And this issue means more use of code trees lower layers; thus generating more assignable calls. Fig. 6 shows the number of code reassignment for dynamic algorithms. We can see that dynamic ordered (D-Ordered) algorithm has many code reassignments more than dynamic optimal (DOptimal) algorithm.
Figure 4: Code blocking rate due to traffic load (Erlang) for different schemes

Figure 5: Code blocking rate due to traffic load (Erlang) for different code rate distribution at static Ordered Scheme

Figure 6: Code Number of code reassignment for dynamic algorithms

7. Summary and Concluding Remarks

We have considered the problem of assignment single OVSF codes at the WCDMA third generation mobile communication systems. We have shown that OVSF codes assignment do have significant impacts on the code utilization of the system. The main idea is to keep the code tree less fragmented so as to accept more calls. So, we compare some static and dynamic code assignment schemes. In static

Efficient Channelization Code Management in WCDMA

156

schemes, we have no code reassignment after each assignment. But in dynamic schemes, code reassignment have important role to have no code blocking.

References
[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] Adachi, F., M. Sawahashi, and H. Suda, 1998. Wideband DS-CDMA for next-generation mobile communication system, IEEE communications Magazine, vol. 36, pp: 56-69, DOI: 10.1109/35.714618 Dinan, E., B. Jabbari, 1998. Spreading Codes for Direct Sequence CDMA and Wideband CDMA Cellular Networks, IEEE Communications Magazine, vol. 36, pp. 48-54, DOI: 10.1109/35.714616. Askari, M., R. Saadat, and M. Nakhkash, 2008. Assignment of OVSF Codes in Wideband CDMA, In Proc. CSICC2008, pp: 723-727, DOI: 10.1007/978-3-540-89985-3_89. Adachi, F., M. Sawahashi, and K. Okawa, 1997, Tree structured generation of orthogonal spreading codes with different length for forward link of DS-CDMA mobile radio, Electronic Letters, vol. 33 (1), pp: 27-28, DOI: 10.1049/el:19970022. Yang, Y., T.S. Yum, 2001. Maximally Flexible Assignment of orthogonal variable spreading factor codes for multi-rate Traffic, Technical Report, Department of Information Engineering, Hong Kong. Minn, T., K. Y. Siu, 2000. Dynamic assignment of orthogonal variable-spreading-factor codes in W-CDMA, IEEE Journal on Selected Areas in communications, pp: 14291440, DOI: 10.1109/49.864008. Chan, W., F. Y. L. Chin, D. Ye, Y. Zhang and H. Zhu, 2007, Greedy Online Frequency Allocation in Cellular Networks, Information Processing Letters, pp:55-61, DOI: 10.1016/j.ipl.2006.11.015. Chin Lin, I., R.D. Gitlin, 1995. Multi-Code CDMA Wireless Personal Communications Networks, Proc. ICC95, pp:1060-1064, DOI: 10.1109/ICC.1995.524263. Chen, J.C., W. Chen, 2001. Implementation of an Efficient Channelization Code Assignment Algorithm in 3G WCDMA, Technical Report, Institute of computer Science, Taiwan. Tseng, Y., C. Chao, 2002. Code Placement and Replacement Strategies for Wideband CDMA OVSF Code Tree Management, IEEE transactions on mobile computing, 1(4), pp: 293-302, DOI: 10.1109/TMC.2002.1175542