KR100362574B1 - Apparatus and method for allocating channel using ovsf code for uplink synchronous transmission scheme in w-cdma communication system - Google Patents

Abstract

First and second half first diffusion factor nodes in which 2 ^m −1 spreading factor nodes are arranged in a tree shape in m + 1 rows and bisected first spreading factor nodes in a column corresponding to the maximum spreading factor And a first and second orthogonal codes for data signal and control signal spreading of a mobile communication system having an OVSF code divided into a pair of trees having a plurality of trees. Control an orthogonal code corresponding to one of the spreading factor nodes of at least some of the spreading factor nodes in the m + 1th column, which is the self-node of one of the second spreading factor nodes following the 1 spreading factor nodes Allocating a first orthogonal code for signal spreading and a second orthogonal code corresponding to one of the other nodes maintaining orthogonality with one of the second spreading factor nodes for data signal spreading An assignment process is performed to allocate first and second orthogonal codes for spreading data signals and control signals.

Description

Orthogonal Code Assignment Apparatus and Method for Reverse Synchronous Transmission Method of Asynchronous Code Division Multiple Access Communication System {APPARATUS AND METHOD FOR ALLOCATING CHANNEL USING OVSF CODE FOR UPLINK SYNCHRONOUS TRANSMISSION

The present invention relates to a channel communication apparatus and method for a code division multiple access communication system, and more particularly, to an apparatus and method for assigning an orthogonal code for channel division in a code division multiple access communication system.

A code division multiple access (CDMA) communication system uses orthogonal codes to distinguish channels, and the code division multiple access method has a synchronous method and an asynchronous method. do. In the following description of the present invention, a code division multiple access (W-CDMA: Wideband Code Division Multiple Access (W-CDMA)) communication system of an asynchronous method (or Universal Mobile Terrestrial System (UMTS)), which is a next-generation mobile communication system, will be described. The embodiments of the present invention will be described by way of example. However, it should be noted that the present invention is not limited to the W-CDMA scheme and can be applied to other CDMA schemes such as CDMA 2000. The operation of allocating channels with orthogonal codes will be described by using the W-CDMA scheme as an example. do.

1 illustrates an architecture of a W-CDMA communication system.

As illustrated in FIG. 1, all processes related to connection of an arbitrary user equipment (UE) are referred to as a radio network controller (RNC). It will be referred to as "RNC"). Resource allocation for each UE connected to the base station transmitter Node B is also in charge of the RNC managing the base station transmitter Node B.

Here, a common packet channel (CPCH: Common Channel) (hereinafter referred to as "CPCH") or a random access channel (RACH), which is a common channel for a certain UE to access a specific base station. In the case of using the " RACH "), the RNC can use an uplink channel resource, i.e., an uplink scrambling code and an OVSF code, for CPCH or RACH available to the UE and the base station transmitter. Information about Orthogonal Variable Spreading Factor (hereinafter referred to as OVSF). The OVSF code is a kind of orthogonal code and has the same function as the Walsh code used in CDMA2000. In particular, the RNC provides OVSF code node set information available to the base station.

As such, when a successful connection between the UE and the base station transmitter is established, the UE communicates with the base station transmitter using a dedicated physical channel (DPCH: hereinafter referred to as "DPCH") in a forward or reverse direction. Will continue. In the W-CDMA system, the channels use an asynchronous method that does not synchronize with the base station transmitter, in which case one UE uses its own scrambling code so that the base station transmitter can identify the UE. Must be granted.

Therefore, a backward synchronous transmission scheme (USTS: Uplink Synchronous Transmission Scheme (hereinafter referred to as "USTS") has been proposed. When using the USTS, a single scrambling code can be given to a plurality of UEs to enable communication. The method using the USTS is such that it is possible to grant the same one scrambling code to the plurality of UEs by obtaining synchronization when the reverse DPCH of the plurality of UEs is received at the base station. Therefore, the number of scrambling codes allocated in one cell may be reduced, thereby reducing the mutual interference between a plurality of UE signals. The base station distinguishes a plurality of UEs using USTS using a channelization code provided by the RNC, that is, an OVSF code having orthogonality to each other. Here, for convenience of description, a set of a plurality of UEs which are assigned and used with the same single scrambling code will be defined as a USTS group.

The process of acquiring backward synchronization using the USTS method is divided into two steps, and the respective steps will be described below. The first step is an initial synchronization step, in which a base station receives a signal of a UE through a RACH and measures a time difference between a reception time of receiving a signal of a UE through the RACH and a preset reference time. . The time difference between the measured reception time and the reference time is transmitted to the UE through a forward access channel (FACH), and a reference time is transmitted through the forward access channel. Receiving the time difference between the UE and the time difference to obtain the initial synchronization by adjusting the transmission time.

The second step is a tracking process, in which the base station periodically compares a reception time of a UE signal with a reference time, and will be referred to as a transmit power control bit (TPC) of a control channel. ) Transmits a time alignment bit to the UE. In this case, since the time adjustment bit is transmitted through the transmission power control bit of the control channel, the time adjustment bit is transmitted once every two frames, and a unit for adjusting the transmission time of the time adjustment bit may be set to n chips. . If the time adjustment bit adjusts the transmission time in units of 1/8 chips, if the time adjustment bit is "1", the UE advances the transmission time by 1/8 chip, and if the bit is "0", 1 / This will delay the transmission time by 8 chips.

Here, an OVSF code, which is an orthogonal code for channel classification of a currently used W-CDMA communication system, will be described with reference to FIG. 2.

In the forward direction, different channels may be distinguished by the OVSF code, and the channels may have different data rates. On the other hand, in case of the reverse direction, each channel is distinguished from each other, or in the case of USTS in which each UE uses the same scrambling code, it distinguishes channels of respective terminals. The OVSF codes C _{n and k} are uniquely determined according to a spreading factor (hereinafter referred to as “SF”) and a code number k. In the OVSF code C _{n, k} , n represents an SF value, k has a value within a range of 0 ≦ k ≦ SF-1, and is generated according to Equation 1 below.

Looking at the OVSF codes generated from SF = 1 to SF = 4 according to Equation 1, Equation 2 can be expressed as follows.

C _1,0 = (1)

C _2,0 = (1, 1)

C _2,1 = (1, -1)

C _4,0 = (1, 1, 1, 1)

C _4,1 = (1, 1, -1, -1)

C _4,2 = (1, -1, 1, -1)

C _4,3 = (1, -1, -1, 1)

FIG. 2 illustrates the OVSF code-tree. In the detailed description of the present invention, in the OVSF code-tree, C _{n, k} is represented by a term Node. The OVSF code C _1,0 is represented as node C _1,0 or C _1,0 node in the OVSF code-tree.

The characteristics of the OVSF code will be described with reference to FIG. 2. Child-nodes corresponding to the mother-node do not maintain orthogonality with the parent-node. For example, if node C _4,0 is assigned to a specific channel, all mother-nodes C _2,0 , C corresponding to node C _4,0 as shown in the OVSF code-tree. all characters based on the _1,0 and C _4,0 - node (node Child-or sub-node) of C _8,0, C _8,1 and _{C 16,0, C 16,1, C 16,2} , Orthogonality cannot be maintained when other channels are assigned to C _16,3, and the like. In the following description, a sub-tree refers to all child nodes of the specific node. That is, when C _4,0 = (1, 1, 1, 1) is assigned to a specific channel in Equation 2, C _2,0 = (1, 1) and C _8,0 = (1, 1). , 1, 1, 1, 1, 1, 1) and C _8,1 = (1, 1, 1, 1, -1, -1, -1, -1) is not orthogonal to each other. Therefore, when allocating the OVSF codes to channels having different SF values (different data rates), the OVSF codes must be allocated so that orthogonality with the assigned OVSF codes can be maintained.

Herein, referring to FIG. 3, a dedicated physical control channel (DPCCH: hereinafter referred to as "DPCCH") and a dedicated physical data channel (DPDCH) with OVSF will be referred to as "DPDCH". This process will be described. In general, if the SF of the DPDCH has a value of 8 or more, only one is used, but if SF = 4, up to 6 DPDCHs may be used if necessary. As shown in FIG. 3, channels may be divided into two parts, an I channel and a Q channel, and two parts may be distinguished by using a complex scrambling code, and thus, the same channelization code may be assigned to each one. In FIG. 3, the OVSF code C _256,0 is assigned to the DPCCH, and the following channelization codes are assigned to six DPDCHs.

C _{d, n} = C _{4, k}

Provided that if n = 1 or 2, then k = 1,

if n = 3 or 4, k = 3,

If n = 5 or 6, k = 2.

For many UEs using USTS, the RNC allocates one reverse scrambling code and an available OVSF code as a resource for the DPCH. DPDCH (data portion) using SF = 4, SF = 8, SF = 16, SF = 32, SF = 64, SF = 128, SF = 256 required for one DPCH for resource allocated by the RNC, and SF The OVSF code is allocated to distinguish the channels of the DPCCH (control part) using = 256. The RNC informs the base station and the UE of the node information about the OVSF code of the DPCH (DPDCH, DPCCH, etc.) through a message.

Here, for the convenience of explanation, the lowest SF is assumed to be SF = 64.

An OVSF code-tree when the SF is at most 64 will be described with reference to FIG. 4. If SF of DPDCH is 4 and node C _4,1 is assigned in the OVSF code-tree, the corresponding OVSF code of DPCCH is node C _4,0 belonging to the same parent C _2,0 as node C _4,1. The lowest node C of _64,15 is allocated. As another example, when SF of DPDCH is 4 and node C _4,2 is allocated in the OVSF code-tree, the OVSF code of the corresponding DPCCH is a node belonging to the same node C _2,1 as node C _4,2. The lowest node C _64,63 of C _4,3 is allocated.

As described above, the conventional OVSF code allocation method for all channels or services having a pair of the DPCCH having the fixed SF value and the DPDCH having the variable SF value in pairs has the following problem.

The problem is that the nodes of the DPCCH are always allocated in pairs for the given node of the DPDCH, so the number of OVSF codes that can be assigned to the DPDCH is reduced. That is, when a specific node is allocated to the data portion of the OVSF code-tree (that is, when an OVSF of a specific node is allocated when assigning an OVSF for channel classification of the DPDCH), all persons existing under the allocated specific node. The node's OVSF code is not orthogonal to the node of the already assigned DPDCH. Therefore, there is a problem in that the self-nodes of the allocated specific node cannot be assigned to the data portion at the same time. That is, when the nodes C _4,1 and C _4,2 having SF = 4 are allocated to the DPDCHs, the nodes C _4,0 and C _4,3 should be allocated to the DPCCHs corresponding to the DPDCHs. The OVSF code for the data portion of 4 cannot be allocated, and thus, in the OVSF code-tree structure as shown in FIG. 4, the data portion can allocate only two channels having a maximum SF = 4.

In the conventional OVSF code allocation method, when one child node connected to a specific parent node is allocated to the data portion, the other one child node is allocated to the control portion, thereby limiting the use of the OVSF code. As a result, there is a lack of resources for allocating channels. In order to solve the problem of limiting the number of OVSF code allocations of the DPDCH shown in the conventional OVSF code allocation method, the OVSF code allocation of the DPDCH can be further increased by setting a separate OVSF code allocation area of the DPCCH. For example, all OVSF codes with SF = 64 with node C _4,0 as the parent node are used as DPCCH only, and nodes C _4,1 , C _4,2 C _4,3 for the data portion with SF = 4. If a DPDCH is allocated to a maximum of three channels can be provided.

Accordingly, an object of the present invention is to provide an apparatus and method for allocating an orthogonal code to have a data channel having a variable data rate and a control channel thereof in a code division multiple access communication system.

Another object of the present invention is to provide a method and apparatus for efficiently managing a limited orthogonal code resource in a code division multiple access communication system.

It is still another object of the present invention to configure an OVSF code for a control channel among OVSF codes in a code division multiple access communication system as a group of nodes that are not orthogonal to each other, and to assign OVSF codes for one control channel to each of the groups. Give a way.

It is still another object of the present invention to provide an apparatus and method for efficiently allocating a channel to a mobile station by a base station apparatus in a code division multiple access communication system.

It is still another object of the present invention to provide a method and apparatus for determining a channel to be used by a mobile station apparatus receiving channel allocation related information received from a base station in a code division multiple access communication system.

It is still another object of the present invention to provide an apparatus and method for determining an OVSF code by a base station apparatus of a code division multiple access communication system to allocate a reverse DPCH channel to a mobile station using a reverse synchronous transmission scheme.

In order to achieve the above object, a method of allocating a channel code of a CDMA communication system according to an embodiment of the present invention includes 2 ^m -1 arranged in trees having a parent node and a child node, where m is an integer of 3 or more. Receiving a spreading factor node C _{SF, k} from the base station and a group including the received spreading factor node C _{SF, k} . And (here Is a process of diffusing a signal of a dedicated physical channel with an orthogonal code corresponding to a selected one of the spreading factor node and its child nodes in a group; By the received spreading factor node And And spreading a signal of a dedicated physical control channel with an orthogonal code corresponding to each of the spreading factor nodes determined by.

In the case where the spreading factor SF is 64 in the spreading factor node C _{SF, k} and the spreading factor SF256 of the corresponding control part is F (C _{data, 64, k} ) = C _{control, 256,127-k} . And F (C _{data, 64,32 + k} ) = C _{control, 256,255-k,} where k is 0,1,2,3, ...., 23 _{data, 64, k} ) is mapped to the diffusion factor C of the dedicated physical control channel _{256,127-k, and} the diffusion factor C of the dedicated physical control channel is mapped to the diffusion factor C of the dedicated physical data channel ( _{data, 64, 32 + k} ). _{control, 256,255-k} is mapped.

The spreading factor SF is 64 in the spreading factor node C _{SF, k} and the spreading factor SF256 of the control part corresponding thereto is F (C _{data, 64, k} ) = C _{control, 256, 96 + k} . And F (C _{data, 64,32 + k} ) = C _{control, 256,224 + k} ., Where k is 0,1,2,3, ...., 23 spreading factor C _{control, 256,96 + k} of the dedicated physical control channel to _{data, 64, k} ), and spreading the dedicated physical control channel to the spreading factor of the dedicated physical data channel (C _{data, 64,32 + k} ). Factor C _{control, 256,224 + k} is mapped.

The spreading factor SF is 128 at the spreading factor node C _{SF, k} and the spreading factor SF256 of the control portion corresponding to the spreading factor SF is _k, in the spreading factor C _{data, 128, k} of the dedicated physical data channel. If is even, then F (C _{data, 128, k} ) = C _{control, 256,127-k} . And F (C _{data, 128,64 + k} ) = C _{control, 256,255-k} . _{Respectively,} the spreading factor of the dedicated physical control channel is mapped and F (C _{data, 128,2n + 1} when k is odd. ) = F (C _{data, 128,2 (n + 8) +1} ) = F (C _{data, 128,2 (n + 16) +1} ) = C _{control, 256,103-n} and F (C _{data, 128, 64 + 2n + 1} ) = F (C _{data, 128,64 + 2 (n + 8) +1} ) = F (C _{data, 128,64 + 2 (n + 16) +1} ) = C _{control, 256,207-} The spreading factor of the dedicated physical control channel is mapped by _n ( _{where 0} ≦ _n ≦ 7).

In addition, the OVSF code generating apparatus of the reverse channel of the terminal of the CDMA communication system according to an embodiment of the present invention for achieving the above object is 2 ^m -1 arranged in a tree having a parent node and a child node (where m is A storage device for storing three spreading factor nodes; an input device for receiving one spreading factor node C _{SF, k} from a base station; and a group including the received spreading factor node C _{SF, k} . And (here H) selects a node of the data portion of the received spreading factor node and one of its self-nodes in the group, and by the received spreading factor node And An OVSF code allocator for selecting a spreading factor node of the control portion determined by the < RTI ID = 0.0 > and / or < / RTI > an orthogonal code of a dedicated physical data channel and a dedicated physical control channel corresponding to the selected data portion and the spreading factor node of the control portion, respectively. And a dedicated data channel spreader for spreading a signal of a dedicated physical data channel with an orthogonal code of the generated data portion, and a dedicated control channel spreader for spreading a signal of a dedicated control channel with an orthogonal code of the generated control portion. It is characterized by.

In addition, the OVSF code generator of the reverse channel receiver of the base station of the CDMA communication system according to an embodiment of the present invention for achieving the above object is 2 ^m -1 arranged in trees having a parent node and a child node (where m is a group including memory for storing three spreading factor nodes; an input device for receiving one spreading factor node C _{SF, k} from a base station, and the received spreading factor node C _{SF, k} . of And (here H) selects the node of the data portion of the received spreading factor node and one of its self-nodes in the group, and by the received spreading factor node. And An OVSF code allocator for selecting a spreading factor node of the control portion determined by the < RTI ID = 0.0 > and / or < / RTI > And a dedicated data channel despreader for spreading a signal of a dedicated physical data channel received with an orthogonal code of the generated data portion, and a dedicated data channel despreader for receiving a signal of a dedicated control channel received with an orthogonal code of the generated control portion. And a control channel despreader.

In addition, the method for allocating the OVSF code of the CDMA communication system according to an embodiment of the present invention for achieving the above object, 2 ^m -1 spreading factor nodes are arranged in a tree shape in m = 1 column, the maximum spreading factor Is divided into a pair of trees having first and second half first diffusion factor nodes bisecting the first spreading factor nodes in a column corresponding to the second spreading factor nodes, each of the pair of trees being the first spreading factor Orthogonal code corresponding to one of the spreading factor nodes of at least some of the spreading factor nodes in the m + 1th column that is the self-node of one of the second spreading factor nodes next to the nodes. Allocate a first orthogonal code and assign a second orthogonal code corresponding to one of the remaining nodes maintaining orthogonality with the one of the second spreading factor nodes for data signal spreading. It is characterized in that the assignment of the first and second orthogonal codes for spreading the data signal and the control signal.

Wherein the maximum spreading factor node is C _{4, k} (where K = 0,1,2,3), the first spreading factor nodes are C _4,0 and C _4,2 and the second spreading factor nodes are C _4,1 and C _4,3 , and the second diffusion factor nodes C _4,1 and C _4,3 of the _child nodes are C _8,2 and C _8,3 and C _8,6 and C _{8,7, respectively.} and, among these Bolzano C _8,3 and characterized in that the assignment of node C _8,7 to the second orthogonal code, for spreading the control signal, and assigning the rest of the nodes with a first orthogonal code, for spreading the data signal.

Further, the first orthogonal codes for spreading the data signal and the second orthogonal codes for spreading the control signal are F (C _{data, 64, k} ) = C _{control, 256,127-k} . And F (C _{data, 64, 32 + k} ) = C _{control, 256, 255-k,} wherein the spreading factor of the data signal is 64 and the spreading factor of the control signal is 256, and k is 0, 1, 2, 3,. ..., 23) to be mapped.

1 is a diagram showing the structure of an asynchronous code division multiple access communication system;

2 illustrates an OVSF code-tree used in an asynchronous code division multiple access communication system.

3 is a diagram illustrating an OVSF code-tree when SF is at most 64 in an asynchronous code division multiple access communication system.

4 is a diagram illustrating spreading of a fixed fixed physical data channel and a fixed control physical channel in an asynchronous code division multiple access communication system.

5 is a diagram illustrating a structure of an OVSF code generator of a base station in a code division multiple access communication system according to an embodiment of the present invention.

6 is a diagram illustrating a structure of an OVSF code generator of a terminal in a code division multiple access communication system according to an embodiment of the present invention.

7 is a flowchart illustrating a process of allocating an OVSF code in a code division multiple access communication system according to an embodiment of the present invention.

Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings. It should be noted that in the following description, only parts necessary for understanding the operation according to the present invention will be described, and descriptions of other parts will be omitted so as not to distract from the gist of the present invention.

First, a code division multiple access (CDMA) communication system uses orthogonal codes to distinguish channels, and the code division multiple access method is a synchronous method and an asynchronous method. This exists. In the following description of the present invention, a code division multiple access (W-CDMA: Wideband Code Division Multiple Access (W-CDMA)) communication system of an asynchronous method (or Universal Mobile Terrestrial System (UMTS)), which is a next-generation mobile communication system, will be described. The embodiments of the present invention will be described by way of example. However, it should be noted that the present invention is not limited to the W-CDMA scheme and can be applied to other CDMA schemes such as CDMA 2000. The operation of allocating channels with orthogonal codes will be described by using the W-CDMA scheme as an example. do.

First, in the first embodiment of the present invention, the Spreading Factor (SF) of the control portion of the Dedicated Physical Channel (DPCH) is hereinafter referred to as "DPCH", and the SF of the data portion is 4, 8, It is assumed that 16, 32, and 64 can be values, and in the second embodiment, SF of the control portion of the CPCH is 256 and SF of the data portion is 4, 8, 16, 32, 64, 128, 256 as the value. Assume that you can have The OVSF code allocation method of the present invention is applicable to a channel or a service in which a data portion and a control portion exist in pairs as in an example of RACH and CPCH, and are not limited by SF values.

The present invention allocates a specific node as an OVSF code of a control part in an OVSF code-tree consisting of a plurality of nodes in a mobile communication system, in which channels in which a data part and a control part exist in pairs are serviced. Use the method of assigning part of OVSF code. In the embodiment of the present invention, the OVSF code tree is divided into four nodes, three of these nodes are allocated to the data portion, and the other one is allocated to the control portion. That is, as shown in FIG. 4, nodes C _4,0 , C _8,0 , C _16,0 , C _32,0 , C _64,0 are not orthogonal to each other, so that if one of these nodes If a node is already assigned to a channel, the other nodes cannot be allocated due to the nature of the OVSF code-tree. Therefore, these non-orthogonal nodes are grouped (ie, sub-tree), and a node corresponding to one of the groups is allocated to the control part.

In the embodiment of the present invention, as in the case of C _4,0 , C _8,0 , C _16,0 , C _32,0 , C _64,0 , nodes that are not orthogonal to each other are configured as separate groups to each group. We present a method for allocating a control node. As a result, the present invention is a method of simultaneously assigning up to (2/3) * SF nodes to the data portion for each SF.

First embodiment

Here, the first embodiment of the present invention will be described in detail.

First, a sub-tree of nodes C _{4 and 3} , which is one of SF = 4 nodes, is allocated as a node for the control part. In the following description, C _4,3 nodes are allocated for the control part, but the control part is a node C _4,0 , C _4,1 , C _{4,2 that} is not node C _4,3 among the nodes whose SF = 4. You can select one of them and assign it to the control part. Nodes present in the sub-trees of the C _4,3 nodes are not allocated for the data portion because they are allocated to the control portion, and 12 nodes with SF = 64, that is, the nodes C _64,52 . C _64,53 , C _64,54 , ..., C _64,63 are defined as nodes for the control part. Nodes for the control part (nodes C _64,52 . C _64,53 , C _64,54 , ..., C _64,63 ) and nodes for the data part with SF = 16 (node C _{16,0) , C 16,1, C 16,2, ...} , C 16,11) and defines a one-to-one mapping (mapping). Here, the mapping between the nodes uses a mapping function F1 (C _{data, 16, k} ) = C _{control, 64, 63-k} (0 ≦ _k ≦ 11). And the _{data C, 16, k} refers to node C _{16, k} of a data section, and C _{control, 64,63-k} refers to node C _64,63-k of the control part. For each data portion node whose SF = 16, a group between nodes having no orthogonality may be configured as shown in Table 1 below by using the following rule.

Data part Control part (SF = 64) SF = 4 SF = 8 SF = 16 C _4,0 C _8,0 C _16,0 C _64,63 C _16,1 C _64,62 C _8,1 C _16,2 C _64,61 C _16,3 C _64,60 C _4,1 C _8,2 C _16,4 C _64,59 C _16,5 C _64,58 C _8,3 C _16,6 C _64,57 C _16,7 C _64,56 C _4,2 C _8,4 C _16,8 C _64,55 C _16,9 C _64,54 C _8,5 C _16,10 C _64,53 C _16,11 C _64,52

Table 1 shows an example in which a node allocated to the control portion is allocated to C _64,63-k . However, when the node allocated to the control portion is allocated to C _{64,48 + k} , the nodes may be sequentially allocated from C _64,48 to C _64,59 . In addition, the node assigned to the control portion has the same effect even if properly set so that it can be mapped one-to-one with the node allocated to the data portion.

Rule 1

If p satisfying (p * SF, p * k) = (16, n) for SF ≤ 16 or (p * 16, p * n) = (SF, k) for SF> 16, C _{SF, k} and C _{16, n} are one group. At this time, 0≤k≤3 * SF / 4-1.

According to Rule 1, the OVSF codes of all data parts and control parts whose SF ≤ 16 (SF = 4, SF = 8, SF = 16) are determined. In addition, in the case of SF> 16 (SF = 32, SF = 64, SF = 128, ...), some may apply to <Rule 1>, but some may not apply to <Rule 1>. exist. There is a method of not using a node to which <rule 1> does not apply. Therefore, the node that does not matter by applying the <rule 1> applies the <rule 1>, and if the <rule 1> is applied, the additional nodes for the control part for the nodes are not used. You need a mapping rule. When using the mapping rules it may be used for C _{64,51, 64,50} C, C _{64,49, 64,48} C that is not assigned to the control part. That is, in the case of SF = 32, one of the nodes in which k is an odd or even number in C _{32, k} corresponds to the nodes in the control portion allocated to C _{16, k} , respectively _, and in the case of SF = 64, C _{64 , k} to K is one of (multiple of 4), (multiple of 4) -1, (multiple of 4) -2 or (multiple of 4) -4, respectively _, of the control portion assigned to C _{16, k} Match nodes. The nodes of the remaining data parts that are not assigned to the nodes of the control part are allocated according to additional mapping rules. In the embodiment of the present invention, when the additional mapping rule is needed, C _{32, k} to k is odd (C _32,1, C _32,3, C _{32,5, ...,} C _32,21, C _32,23 ), and if SF = 64 _{, k} is not a multiple of 4 in C _{64, k} (C _64,1, C _64,2, C _64,3, C _{64 , 5,} C _64,6, C _64,7, C _{64,9, ...,} C _64,43, C _64,45, C _64,46, C _64,47 Mapping rules for this can take many forms. A basic example is as follows.

(1) When SF = 32

In this case, the nodes of even numbers C _{32, k} to k (C _32,0 , C _32,2 , C _32,4 , C _32,6 , ..., C _32,22 ) are the 12 control parts. _Are mapped to nodes of C _64,63 , C _64,62 , C _64,61 , C _64,60 , ..., C _64,52 , respectively. And the current sub-C _4,3 - four nodes for the one of the nodes in the tree corresponding to the SF = 64 1/4, i.e. C _{64,48, 64,49} C, C ₆₄ C _{64,50, 51} is not used. Therefore, these nodes control the nodes C _32,1 , C _32,3 , C _32,5 , C _32,7 , ..., C _32,23 with SF = 32 and k is odd in C _{32, k} Can be used as part. For example, you can set up a many-to-one function between twelve SF = 32 nodes and four control parts:

Rule 2

F2 (C _{data, 32,2n + 1} ) = F2 (C _{data, 32,2 (n + 4) +1} ) = F2 (C _{data, 32,2 (n + 8) +1} ) = C _{control, 64 , 51-n}

Where (0≤n≤3).

Therefore, when additional mapping rules such as <Rule 2> are used, when SF = 32, nodes having k being odd among the C _{32, k} nodes of the data portion are allocated to the control portion as shown in Table 2 below. It is assigned to nodes that are not _{(C 64,51, C 64,50, C} 64,49, C 64,48).

n Data part Control part F2 (C _{data, 32,2n + 1} ) F2 (C _{data, 32,2 (n + 4) +1} ) F2 (C _{data, 32,2 (n + 8) +1} ) n = 0 C _32,1 C _32,9 C _32,17 C _64,51 n = 1 C _32,3 C _32,11 C _32,19 C _64,50 n = 2 C _32,5 C _32,13 C _32,21 C _64,49 n = 3 C _32,7 C _32,15 C _32,23 C _64,48

Therefore _{, when} the data portion of the C _{32, k} node is allocated to the nodes of the control portion by using the results as shown in Table 2 _, it is shown in Table 3 below.

Data part Control part (SF = 64) SF = 4 SF = 8 SF = 16 SF = 32 C _4,0 C _8,0 C _16,0 C _32,0 C _64,63 C _32,1 C _64,51 C _16,1 C _32,2 C _64,62 C _32,3 C _64,50 C _8,1 C _16,2 C _32,4 C _64,61 C _32,5 C _64,49 C _16,3 C _32,6 C _64,60 C _32,7 C _64,48 C _4,1 C _8,2 C _16,4 C _32,8 C _64,59 C _32,9 C _64,51 C _16,5 C _32,10 C _64,58 C _32,11 C _64,50 C _8,3 C _16,6 C _32,12 C _64,57 C _32,13 C _64,49 C _16,7 C _32,14 C _64,56 C _32,15 C _64,48 C _4,2 C _8,4 C _16,8 C _32,16 C _64,55 C _32,17 C _64,51 C _16,9 C _32,18 C _64,54 C _32,19 C _64,50 C _8,5 C _16,10 C _32,20 C _64,53 C _32,21 C _64,49 C _16,11 C _32,22 C _64,52 C _32,23 C _64,48

(2) When SF = 64

In the case of SF = 64, the following cases are classified according to the remainder obtained by dividing k by 4 in C _{64, k} . First, when k is a multiple of 4 in node C _{64, k} , the node of the control part is determined by <rule 2>. Second, if k is divided by 4 and the remainder is 2 (that is, k = 4n + 2) and k is divided by 4 and the remainder is 3 (that is, k = 4n + 3), k is equal to <Rule 3>. Set the node when the remainder divided by 4 is 2 as the data part, and the node when the remainder divided by 4 is 3 as the control part.

Rule 3

F3 (C _{data, 64,4n + 2} ) = C _{control, 64,4n + 3} (0≤n≤11)

Third, there are 12 cases where k is divided by 4 and the remainder is 1 (that is, k = 4n + 1). There are several ways to allocate these 12 nodes as data and control parts. As an example, set the following mapping.

Rule 4

F4-1 (C _{data, 64,4n + 1} ) = C _{control, 64,51-n} (0≤n≤3)

F4-2 (C _{data, 64,4 (n + 4) +1} ) = C _{control, 64,4n + 1} ) (0≤n≤3)

Using the above mapping rule, if SF≤16, three quarters of the total nodes can be simultaneously allocated to the data portion for each SF, and if SF≥32 or more, the total number of nodes for each SF is the same as in the prior art. 1/2 can be assigned to the data part simultaneously.

Second embodiment

Meanwhile, the second embodiment of the present invention allocates SF = 256 for the control portion, and SF for the data portion is SF = 4, SF = 8, SF = 16, SF = 32, SF = 64, SF = 128. Consider the case where SF = 256 is possible. In this case, even if SF for data part is SF = 32, SF = 64, SF = 128, SF = 256, as in RACH (Random Access Channel), the following rule is used to use mapping rule for data part and control part. Can be. As in the case of the first embodiment in which the SF for the control part is 64, even when the SF is 256, the sub-tree of one of the nodes whose SF = 4 is used for the control part. For convenience, we assume this node is C _4,4 . Define one-to-one mapping for 48 SF = 64 nodes and 48 SF = 256 nodes for the data portion as follows.

Rule 5

F5 (C _{data, 64, k} ) = C _{control, 256,255-k} .

Accordingly, in the case of <rule 5>, C _{data, 64, k} nodes of the data portion are allocated to the C _{control, 256, 255-k} nodes of the control portion, as shown in Table 4 below.

Data part Control part (SF = 256) SF = 4 SF = 8 SF = 16 SF = 32 SF = 64 C _4,0 C _8,0 C _16,0 C _32,0 C _64,0 C _256,255 C _64,1 C _256,254 C _32,1 C _64,2 C _256,253 C _64,3 C _256,252 C _16,1 C _32,2 C _64,4 C _256,251 C _64,5 C _256,250 C _32,3 C _64,6 C _256,249 C _64,7 C _256,248 C _8,1 C _16,2 C _32,4 C _64,8 C _256,247 C _64,9 C _256,246 C _32,5 C _64,10 C _256,245 C _64,11 C _256,244 C _16,3 C _32,6 C _64,12 C _256,243 C _64,13 C _256,242 C _32,7 C _64,14 C _256,241 C _64,15 C _256,240 C _4,1 C _8,2 C _16,4 C _32,8 C _64,16 C _256,239 C _64,17 C _256,238 ㆍ ·· ㆍ ·· ㆍ ·· ㆍ ·· ㆍ ·· ㆍ ·· C _32,15 C _64,31 C _256,225 C _64,32 C _256,224 C _4,2 C _8,4 C _16,8 C _32,16 C _64,33 C _256,223 C _64,34 C _256,222 C _32,17 C _64,35 C _256,221 C _64,36 C _256,220 C _16,9 C _32,18 C _64,37 C _256,219 C _64,38 C _256,218 C _32,19 C _64,39 C _256,217 C _64,40 C _256,216 C _8,5 C _16,10 C _32,20 C _64,41 C _256,215 C _64,42 C _256,214 C _32,21 C _64,43 C _256,213 C _64,44 C _256,212 C _16,11 C _32,22 C _64,45 C _256,211 C _64,46 C _256,210 C _32,23 C _64,47 C _256,209 C _64,48 C _256,208

According to the mapping rule, nodes of the control part for the data part corresponding to 48 SF = 64 nodes are determined as shown in Table 4 above. Nodes that will use the same control part as the 48 SF = 64 nodes are grouped using the following rules.

Rule 6

If p satisfying (p * SF, p * k) = (64, n) for SF ≤ 64 or (p * 64, p * n) = (SF, k) for SF> 64 , C _{SF, k} and C _{64, n} are one group. At this time, 0≤k≤3 * SF / 4-1.

Using the mapping of <rule 6>, if SF≤64, the nodes of the control part for the data part nodes are determined as shown in <Table 4>, wherein 3 * SF / 4 data part nodes for each SF Can be assigned at the same time. In Rule 6, when SF = 128, when k is odd in C _{data, 128, k} (C _128,1 , C _128,3 , C _128,5 , C _128,7 , ..., when the C _128,95) with SF = 256 C in the _{data, 256, k} when k is not a multiple of _{4 (C 256,1, C 256,2,} C 256,3, C 256,5, C 256 _{, 6,} C _256,7, C _{256,9, ...,} C _256,187, C _256,189, C _256,190, C _256,191) mapping is required, the following is an example for this.

(1) If SF is 128

Currently, 16 nodes corresponding to 1/4 of SF = 256 nodes in the subtree of C _4,3 , that is, C _256,192 , C _256,193 , C _256,194 , ..., C _256,207 are not used. . Thus, these nodes can be used as the control portion of nodes where SF = 128 and k is odd at C _{128, k} . For example, you can set up a many-to-one function between 48 SF = 128 nodes and 16 nodes with SF = 256 nodes.

Rule 7

F7 (C _{data, 128,2n + 1} ) = F7 (C _{data, 128,2 (n + 16) +1} ) = F7 (C _{data, 128,2 (n + 32) +1} ) = C _{control, 256,207 -n}

Where (0 ≦ n ≦ 15).

(2) If SF is 256

SF = 256 is divided into the following cases according to the remainder obtained by dividing k by 4 in C _{256, k} . First, when k is a multiple of 4 in C _{256, k} , the node of the control part is determined according to rule 7 above. Second, if k is divided by 4 and the remainder is 2 (that is, k = 4n + 2) and k is divided by 4 and the remainder is 3 (that is, k = 4n + 3), then k is equal to rule 8 Set the node when the remainder divided by 2 is the data part, and set the node when the remainder divided by 4 is 3 as the control part.

Rule 8

F8 (C _{data, 256,4n + 2} ) = C _{contorl, 256,4n + 3} (0≤n≤47)

Third, there are 48 cases where k is divided by 4 and the remainder is 1 (that is, k = 4n + 1). There are several ways to allocate these 48 nodes as data and control parts. As an example, set the following mapping.

Rule 9

F9-1 (C _{data, 256,4n + 1} ) = C _{control, 256,207-n} (0≤n≤15)

F9-2 (C _{data, 256,4 (n + 16) +1} ) = C _{control, 256,4n + 1} ) (0≤n≤15)

Using the above mapping rule, if SF≤64, three quarters of the total nodes can be allocated to each SF simultaneously as the data portion, and if SF≥128 or more, the total nodes of the total nodes can be assigned to each SF as in the prior art. 1/2 can be assigned to the data part simultaneously.

Therefore, the mapping rule can be summarized as follows.

The base station may assign one of the following OVSF code nodes C _{data, SF, k} to the UE in one scrambling code.

C _{data, SF, k}

only,

In Equation 3, the SF value takes one of SF = 4, SF = 8, SF = 16, SF = 32, SF = 64, SF = 128, and SF = 256. A UE assigned an OVSF code node from a base station according to Equation 3 may use upper branch nodes with a larger SF value in a sub code tree. That is, for example _, a UE assigned C _{data, 8,1} has an SF value greater than 8 in the Sub code tree and has upper branch nodes, that is, C _{data, 16,2,} C _{data, 32,4,} C _{data, 64 You can use, 8,} C _{data, 128,16,} C _{data, 256,32} codes.

The UE assigned the code C _{data, SF, k} for the DPDCH transmits the DPCCH using the C _{control, 256, 256-n} node according to the mapping rule. And the value of _n in the C _{control, 256, 256-n} is determined by the following equation (4).

n = k * 64 / SF

K = 1,3,5, ..., 93,95 when SF excluded from Equation 3 is 128, and k = 1,2,3,5,6,7, when 93,95 and SF are 256 The mapping for ..., 187, 189, 190, 191 may be determined using the mapping given in the rules <Rule 7> <Rule 8> <Rule 9> and the like.

FIG. 5 is a diagram illustrating a configuration of an apparatus for generating an OVSF code of a dedicated physical data channel and a dedicated physical control channel in a base station according to an embodiment of the present invention. Such a configuration can be used as the OVSF code generator of the uplink receiver of the base station.

Referring to FIG. 5, the input device 110 receives a control signal for an OVSF code, and the control signal includes SF information of a data portion. The control signal processor 111 processes the control signal received from the input device 110 and transfers SF information of the data portion to the OVSF code processor 112. The OVSF code processor 112 then controls the node of the data portion using the SF information of the data portion and controls the node of the control portion corresponding to the node of the determined data portion. On the other hand, the storage device 114 has the OVSF node set information provided by the RNC, and stores the node information of the data portion and the control portion that can be allocated in the future, as well as the node information of the data portion and the control portion that are already allocated. The OVSF code processor 112 determines the node of the data portion by referring to the data portion node information assignable in the storage device 114. The operator 113 performs an operation of determining node information of the control unit according to the command of the OVSF code processor 112. A detailed flowchart of the algorithm of the calculator 113 is shown in FIG. 7 to be described later. Here, the control signal processor 111, the OVSF code processor 112, the calculator 113, and the storage device 114 take the channel code of the data portion and the OVSF code of the data portion, and the channel code of the control portion mapped to the OVSF code of the data portion. Corresponds to the OVSF code allocator to assign. The set data part and control part node information is provided to the OVSF code generator 115, and in the OVSF code generator 115, OVSF ((C _{data, SF, K} ) {or OVSF (C _{data, SF, k} ) and OVSF (C _{data, SF, (SF / 2) -k} )} and OVSF (C _{control, 4SF, SF-1-K} ) {or OVSF (C _control to spread the channel data of the control part. _{, 4SF, 2SF-1-k} ) and OVSF (C _{control, 4SF, 4SF-1-k} )} The despreader 121 then multiplies the descrambled signal by the OVSF code of the data portion to signal the data channel. Despread and despreader 121 multiplies the descrambled signal by the OVSF code of the control portion to despread the signal of the control channel.

6 is a diagram illustrating a configuration of an apparatus for generating an OVSF code of a dedicated physical data channel and a dedicated physical control channel in a terminal according to an embodiment of the present invention. The OVSF code generating apparatus as described above can be used for the channel transmitter of the reverse link.

Referring to FIG. 6, the input device 210 receives a control signal for an OVSF code of a data portion from a base station, and the control signal includes node information of the data portion. The control signal processor 211 processes the control signal received from the input device 210 and transfers node information of the data portion to the calculator 212. The operator 212 performs an operation of determining node information of the control part. A detailed flowchart of the algorithm of the calculator 113 is shown in FIG. 7. Here, the control signal processor 211 and the operator 212 correspond to an OVSF code allocator for taking the channel code of the data portion and the OVSF code of the data portion and allocating the channel code of the control portion mapped to the OVSF code of the data portion. The set data part and control part node information is provided to the OVSF code generator 213. In the OVSF code generator 213, OVSF ((C _{data, SF, K} ) {or OVSF (C _{data, SF, k} ) and OVSF (C _{data, SF, (SF / 2) -k} )} and OVSF (C _{control, 4SF, SF-1-K} ) {or OVSF (C _control to spread the channel data of the control part. _{, 4SF, 2SF-1-k} ) and OVSF (C _{control, 4SF, 4SF-1-k} )}, and the data of the data channel DPDCH is spread with the OVSF code of the data portion in channel spreader 221. The data of the control channel (DPCCH) is spread by the channel spreader 222 and the OVSF code of the control part, and the signals spread by the channel spreaders 221 and 222 are added to the adder 223 and then the scrambling code and the scrambling code. It is multiplied and output.

7 is a flowchart illustrating a method for allocating an OVSF code according to the present invention.

In step 300 of FIG. 7, the OVSF code node information C _{Z, k} of the data portion is received as an input value (C _{data, SF, K} , that is, Z is SF of the data portion). Where Z is the spreading factor value of the data portion, and k is the code number in the OVSF code-tree. In step 301, if the SF value given in step 300 is less than or equal to Y / 4, go to step 302; Y is the SF value of the control part. In step 302, m is calculated using Equation 5 below.

m ← k * Y / (4 * SF)

Thereafter, in step 303, C _{Y, Y-1-m} (C _{control, SF, SF-1-m} , ie, Y is SF of the control part) is determined as the control part. In step 304, if the Z value is equal to Y / 2, the flow goes to step 305; otherwise, the flow goes to step 308. In step 305, when the value of k is divided by 2, if the remainder is 0, the process moves to step 306; In step 306, a value obtained by dividing k by 2 is set to an m value. In step 307, C _{Y, Y-1-m} is determined as the OVSF of the control part. In step 321, the remainder obtained by dividing (k-1) / 2 by 16 is set to the m value, and the (13/16) * Y value is set to the p value. In step 322, C _{Y, p-1-m} is determined as a control part.

In step 308, the value of k is divided by 4, and if the remainder is 0, the flow moves to step 309; otherwise, the flow moves to step 331. In step 309, a value obtained by dividing k by 4 is set to m. In step 310, C _{Y, Y-1-m} is determined as a control part. In step 331, k is divided by 4, and if the remainder is 2, the flow moves to step 332; otherwise, the flow moves to step 333. In step 332, C _{Y, k + 1} is determined as the control part. In step 333, the remainder obtained by dividing (k-1) / 4 by 16 is set to m, and (13/16) * Y is set to p. In step 334, C _{Y, p-1-m} is determined as the control part.

Third embodiment

Next, a third embodiment of the present invention will be described. Since UEs using the Uplink Synchronous Transmission Scheme (USTS) have low mobility, SFs can be limitedly used. Therefore, in the third embodiment, SFs of DPDCHs of a UE using one USTS are used. It is assumed that SF of the data portion is fixed to one value.

In the third embodiment, SF = 256 is allocated for the DPCCH (control part) and SF = 4, SF = 8, SF = 16, SF = 32, SF = 64, SF = 128, for the DPDCH (data part). Variable assignment of one of SF = 256 is made. First, the DPDCH defines the mapping from the top of the OVSF tree structure among the nodes that match the predetermined SF, and the DPCCH defines the mapping from the last of the OVSF tree structure among the nodes with SF = 256. That is, the mapping function F11 (C _{data, SF, k} ) = C _{control, 256, 255-k} (0≤k≤11) is used. In this case, the maximum value of the number of nodes that can be allocated in one OVSF code tree can be known. In the following, SF = 4 and SF = 64 will be described as an example.

(1) When SF = 4

In order not to lose the orthogonality of OVSF code, assign C _4,0 , C _4,1 , C _4,2 to DPDCH and mapping function F11 (C _{data, 4, k} ) = C _{control, 256,255-k} (0≤k≤ 3) _Assign C _256,255 , C _256,254 , and C _256,253 to DPCCH accordingly. When the OVSF code is allocated as described above, up to three nodes can be allocated while maintaining orthogonality.

(2) When SF = 64

In order that the node allocated to the DPCCH does not exist in the sub-tree of the node allocated to the DPDCH, up to 51 nodes may be allocated to each of the DPDCH and the DPCCH. I.e. DPDCH is C _64,0, C _64,1, ..., it assigned to the C _64,50 and DPCCH are mapped to function _{F11 (C data, 64, k} ) = C control, 256,255-k (0≤k≤63 We _assign C _256,255 , C _256,254 , ..., C _256,205 to DPCCH. SF = 256 in the node tree is C _{256,196, 256,197 C,} C _{256,198, 256,199,} and C _64,51 of the C sub-sub C _64,50 SF = 256 in the node tree is C _{256,200, 256,201 C,} C _256,202 , C _256,203 . Also, nodes whose SF = 256 in the C- _64,52 sub-trees are C _256,204 , C _256,205, C _256,206 and C _256,207 . In view of the above, all nodes except C _64,51 with SF = 64 and C _256,200 , C _256,201, C _256,202 , C _256,203 with SF-256 thereof are allocated. However, _assuming that C _64,51 of SF = 64 is allocated to another DPDCH, there are no more nodes to allocate to DPCCH. Therefore, the maximum number of assignable nodes is 51 each.

The maximum number of OVSF nodes that can be allocated by one OVSF code tree for SF of a predetermined DPDCH can be found in Rule 10 below.

Rule 10

The maximum integer x that satisfies the <Rule 10> is the maximum number of OVSF nodes to which a DPDCH in SF and a DPCCH of SF 256 can be allocated. According to Rule 10, the maximum number of nodes that can be allocated when the SF of the DPDCH is 4 is 3, 7 is the SF is 8, 15 is the SF is 16, 28 is the SF is 32, and 51 is the SF is 64. OVSF code nodes can be allocated to 85 DPDCHs and DPCCHs, respectively.

Fourth embodiment

A channelization code allocation method in a situation in which the scrambling code range of the DPDCH is defined based on the above rules will be described with reference to the fourth embodiment of the present invention.

First, in a situation where the range of the DPDCH scrambling code is defined, a code is allocated based on the largest scrambling code. As described above, the second embodiment of the present invention has described a process of allocating codes based on setting SF to 64. That is, in the second embodiment of the present invention, a case in which the code of SF 64 assigned to the DPDCH and the code of SF 256 assigned to the DPCCH is mapped to maintain orthogonality is described as an embodiment. In the second embodiment, there is an OVSF code that is not used in the orthogonal codes assigned to the data portion in the case of SF 128 and SF 256. Therefore, the OVSF code not used in the second embodiment is assigned to the data portion. It provided methods for allocation. In the fourth embodiment, a code allocation method based on other SFs except for SF 64 will be described.

(1) How to assign code based on SF 256

When the code is assigned with the SF of 256, the SF of the orthogonal code assigned to the DPDCH is defined as 4 ≦ SF ≦ 256, which is the same as the method of setting the maximum DPDCH having the SF 256. If the DPDCH may have SF = 256, half of the OVSF code nodes are allocated for the DPDCH, and the other half are allocated for the DPCCH. That is, grouping 1/2 on the OVSF code tree into an orthogonal code (OVSF) group for data allocation to the DPDCH, and grouping 1/2 on the OVSF code tree into a control orthogonal coding group to assign 1/2 to the DPCCH. will be. For example, C- _{2,0 child} -nodes of the upper half of the entire OVSF code tree are allocated for DPDCH, and the remaining C _{2,1 child} -nodes are allocated for DPCCH. When the OVSF code is assigned to one of the C _2,0 self-nodes in the DPDCH, the OVSF code is allocated to the DPCCH according to the following <rule 11>.

Rule 11

F 11 (C _{data, 256, k} ) = C _{control, 256,255-k} . (Where 0≤k≤SF / 2-1)

If p satisfying (p * SF, p * k) = (256, n) for SF ≤ 256, C _{SF, k} and C _{256, n} are nodes belonging to the same group.

(2) How to assign code based on SF 128

When the code is assigned with the SF of 128, the SF of the orthogonal code assigned to the DPDCH is defined as 4 ≦ SF ≦ 128, which is the same as the method of setting the maximum DPDCH having the SF 128. When the code is assigned based on the SF as 128, as described in the third embodiment of the present invention, the code allocation method when the SF is fixed to 128 is used. That is, SF = 128 of the node C _128,0 - assigns C _256,255 for the DPCCH-C 85 out of the nodule _128,84 allocated for the DPDCH, and these all-in node that does not SF = 256 nodes C _256,171 . Here, it is also possible to allocate nodes for the DPDCH, which are both nodes of the node allocated for the DPDCH and not at the same time as the node of the node allocated for the DPCCH. When the OVSF code of one of the nodes is allocated to the DPDCH, the OVSF code is allocated to the DPCCH according to the following <rule 12>.

Rule 12

F 12 (C _{data, 128, k} ) = C _{control, 256,255-k} . (Where 0≤k≤ [85 * SF / 128-1], where [x] is the maximum integer not exceeding x)

If p satisfying (p * SF, p * k) = (128, n) for SF ≤ 128, C _SF, k and C _{128, n} become nodes belonging to the same group. In the case of allocating SF 256, C 256, _2n and C _{128, n} can be allocated to the same DPCCH in the same group, and can be used by applying an unused OVSF code of SF 256 as in the second embodiment. Do.

(3) How to assign code based on SF 64

When the code is assigned with 64 as SF, the orthogonal code SF assigned to the DPDCH is defined as 4≤SF≤64, and is the same as the method for setting the maximum DPDCH having SF 64. The second embodiment is modified to set the SF to 64. That is, SF = 64 of node C _64,0 - allocates C _256,255 for the DPCCH-allocate 51 of C _64,50 for the DPDCH, and these parent-node of the node that does not SF = 256 C _256,204. Of course, it is also possible to assign nodes for the DPDCH that are both the parent node of the node allocated for the DPDCH and not the parent node of the node allocated for the DPCCH. When the OVSF code is assigned to the DPDCH as one of the nodes, the OVSF code is assigned to the DPCCH according to <rule 13>.

Rule 13

F 13 (C _{data, 64, k} ) = C _{control, 256,255-k} . (Where 0≤k≤ [51 * SF / 64-1])

If p satisfying (p * SF, p * k) = (64, n) for SF ≤ 64, C _{SF, k} and C _{64, n} are one group. In the case of allocating SF 128 and SF 256, the second embodiment may be modified and allocated to the DPCCH.

(4) How to assign code based on SF 32

When the code is assigned with 32 as SF, the orthogonal code SF assigned to the DPDCH is defined as 4 ≦ SF ≦ 32, and is the same as the method for setting the maximum DPDCH having SF 32 to the maximum. As described in the third embodiment, an allocation method when SF is fixed to 32 is used. That is, 28 of the nodes C _32,0 -C _32,27 of SF = 32 are allocated for the DPDCH, and nodes C _256,227 -C _256,255 of SF = 256, which do not make them the parent node, are allocated for the DPCCH. Of course, the nodes of the node allocated for the DPDCH and not the parent node of the node allocated for the DPCCH may also be allocated for the DPDCH. When the OVSF code is assigned to the DPDCH as one of the nodes, the OVSF code is allocated to the DPCCH according to the following <rule 14>.

Rule 14

F14 (C _{data, 32, k} ) = C _{control, 256,255-k} . (Where 0≤k≤ [28 * SF / 32-1])

If p satisfying (p * SF, p * k) = (32, n) for SF ≤ 32, C _{SF, k} and C _{32, n} are nodes in the same group. In addition, when SF 128 and SF 256 are allocated, it is possible to allocate them to the DPCCH as described in the second embodiment.

(5) Method of allocating codes based on 4≤SF≤16

First, 15 nodes C _16,0 to C _16,14 of SF = 16 are allocated for the DPDCH, and nodes C _256,241 to C _256,255 of SF = 256, which do not have them as the parent node, are allocated for the DPCCH. Of course, the nodes of the node allocated for the DPDCH and not the parent node of the node allocated for the DPCCH may also be allocated for the DPDCH. When the OVSF code is assigned to the DPDCH as one of the nodes, the OVSF code is assigned to the DPCCH according to the following <rule 15>.

Rule 15

F15 (C _{data, 16, k} ) = C _{control, 256,255-k} . (Where 0≤k≤ [15 * SF / 16-1])

If p satisfying (p * SF, p * k) = (16, n) for SF ≤ 16, C _{SF, k} and C _{16, n} are nodes in the same group. In addition, when the SF 64, the SF 128, and the SF 256 are allocated, they may be allocated to the DPCCH similarly to the second embodiment of the present invention described above.

(6) Method of allocating codes based on 4≤SF≤8

When a code is assigned based on 4≤SF≤8, the orthogonal code SF assigned to the DPDCH is defined as 4≤SF≤8, and the same method as for setting the maximum DPDCH having SF8.

First, SF = 8 nodes C of _8,0 - reserved for the seven C DPDCH of _8,6 and these all-allocates C _256,255 for the DPCCH-in does not SF = 256 to node node C _256,249. Of course, the nodes of the node allocated for the DPDCH and not the parent node of the node allocated for the DPCCH may also be allocated for the DPDCH. When the OVSF code is assigned to the DPDCH as one of the nodes, the OVSF code is assigned to the DPCCH according to the following <rule 16>.

Rule 16

F 16 (C _{data, 8, k} ) = C _{control, 256,255-k} . (Where 0≤k≤ [7 * SF / 8-1])

If p satisfying (p * SF, p * k) = (8, n) for SF ≤ 8, C _{SF, k} and C _{8, n} are nodes in the same group. In addition, when the SF 16, the SF 64, the SF 128, and the SF 256 are allocated, they can be allocated to the DPCCH as in the second embodiment of the present invention described above.

In the fourth embodiment of the present invention, a node having a large code number on the OVSF code tree is allocated to a control part, that is, a DPCCH. However, a code number assigned to the DPCCH on the OVSF code tree is not limited. In addition, although the fourth embodiment assumes that SF 4 is the minimum SF that can be allocated, the minimum SF that can be allocated is SF 8 or SF 16 or SF 32 or SF 64 or SF 128 or SF 256 instead of SF 4. Can be. In this case, a correspondence relationship can be obtained using the fourth embodiment. For example, when the minimum SF is 8, 8≤SF≤32 using the case of 4≤SF≤32 described in the fourth embodiment. It is possible to obtain a correspondence relationship.

It is possible for one UE to use multiple DPDCHs even in USTS that separates each UE by using OVSF code, which is a channelization code, while multiple UEs share the same scrambling code. In this case, multiple OVSF Code can be assigned to one UE.

However, in terms of efficient OVSF code allocation, it may be more preferable that SF allocates the same OVSF code separately by dividing the DPDCH, which is twice the DPDCH, into I and Q channels without assigning only one DPDCH to one UE. When not using the Q channel, twice SF OVSF codes can be allocated and used for each DPDCH. When several DPDCHs used by one UE use different SFs, an OVSF code of each SF is allocated. Even if a UE uses multiple DPDCHs, only one DPCCH is used. The allocation of the OVSF code for the DPCCH, in consideration of the application of the second embodiment, allocates the OVSF code of the DPCCH to which the fastest DPDCH corresponds among the DPDCHs used by the UE.

Fifth Embodiment

The following fifth embodiment describes an OVSF code allocation method when a UE of USTS uses two or more DPDCHs.

For example, instead of allocating an OVSF code of SF = 4 to a UE that wants to use a service with a transmission rate of 960 kbps, assign an OVSF code of SF = 8 to assign a DPDCH of SF = 8 to the I and Q channels. It is divided into two. If there is no margin of OVSF code of SF = 8 and there is a margin of SF = 16 with different parent node (SF = 8) or OVSF code of SF = 32, two OVSF codes of SF = 16 are again set to I, Q. A total of four DPDCHs can be allocated to the channel or eight DPDCHs assigned four SF = 32 OVSF codes can be used in the same manner as the above method. According to this method, a given OVSF code can be allocated to more UEs.

In the fifth embodiment of the present invention, the OVSF code can be allocated according to the following <Rule 17>, <Rule 18>, <Rule 19>, and <Rule 20>.

Rule 17

In case of a UE that wants to use a DPDCH having SF = 256, one SF = 256 OVSF code is allocated.

Rule 18

For a UE that wants to use a DPDCH with SF = k (4 = k ≦ 128), when there is an OVSF code of SF = k * 2 that can be allocated, the UE sends two DPDCHs of SF = k * 2 to an I channel. In this case, the OVSF code is used in the same manner. If the Q channel is not used, it is used if the OVSF code of SF = k remains.

Rule 19

If there is no margin of the OVSF code with SF = k * 2 in Rule 18, the UE searches for the maximum m value of 2 ^m-1 remaining OVSF codes with SF = 2 ^m (SF = 2). 2 ^m DPDCHs of * m are divided into I and Q channels to use the same OVSF code. If the channel is separated using only the I channel, that is, if the Q channel is not used, the OVSF code with SF = k * 2 ^m-1 (SF = 2) find the maximum value of the m remaining 2 ^m-1 gae the UE using each of the OVSF code in the DPDCH 2 ^m-1 out of SF = k * m. If there is no OVSF code that meets the above rules, the current USTS group will be denied participation.

Rule 20

For the DPCCH of SF = 256, an OVSF code for the DPCCH corresponding to the OVSF code that is the fastest among the OVSF codes allocated to the DPDCH, that is, the OVSF code located on the OVSF code tree as shown in FIG. The DPCCH may be allocated using the allocation method described in the second DPCH.

For example, C _4,0 , C _8,2 , C _8,5 and C _16,6 , C _{, 16,9 shown} in FIG. 2 are allocated in USTS capable of using I and Q channels. In this case, one UE wants to use a DPDCH of 960kbps. According to Rule 18, one SF = 8 OVSF code is required, but there are no remaining nodes. According to Rule 19, if SF = 16 OVSF code is found, C _16,7 , C _{, 16} , _{and 8} can be found as a margin, and these two codes are used for DPDCH of two I and Q channels, respectively. That is, four DPDCHs are used. For DPCCH, C _256,7 , which is an OVSF code for DPCCH corresponding to C _16,7 , is allocated in the second embodiment.

Sixth embodiment

Meanwhile, a sixth embodiment of the present invention will be described with reference to the second embodiment described above. In the second embodiment of the present invention, an OVSF code of SF = 256 is assigned to the control portion, and SF is SF = 4, SF = 8, SF = 16, SF = 32, SF = 64, SF = 128 in the data portion. In this case, an OVSF code is allocated in the case of having a value of SF = 256, and a sub-tree of one of the nodes having SF = 4 is used for the control part. The sixth embodiment of the present invention will be described on the assumption that two SF = 8 nodes are allocated to the control portion instead of the node having SF = 4 as the control portion, as described in the second embodiment. do. Here, for convenience of the eight nodes having the SF = 8 in the described node C _8,3, C _8,7 it is assumed to assign to the control part. Here, in the case of allocating two of the nodes having SF = 8 as a control part, up to two nodes having SF = 4 can be allocated as compared to the case of allocating one SF = 4 node, but the highest average power factor It has an effect in terms of Peak to Average Power Ratio. In other words, by separating two upper SF4 node trees and two lower SF4 node trees in the OVSF code tree, the data and control parts can be allocated in the upper or lower nodes respectively, thereby reducing the PAPRPeak to Average Power Ratio. Will be. Therefore, when two of the eight SF 8 nodes are selected and used as control parts, selecting one from the upper and lower node trees, respectively, has an effect from the viewpoint of the PAPP.

The sixth embodiment uses a basic mapping concept such as the following equation. A method of receiving from the base station an SF node C _{SF, k} of 2 ^m −1 (where m is an integer of 3 or more) SF nodes arranged in trees having mononodes and child nodes. Equation 6 below is a process of finding a group including the received SF node C _{SF, k} . Equation (7) is a formula representing a basic concept of a method for determining an orthogonal code corresponding to an SF node by the received SF node.

only, being.

Here, the sixth embodiment in which two SF = 8 nodes are allocated as a control part is basically applied by changing the second embodiment in which one SF = 4 node is allocated. One-to-one mapping for 64 nodes and 48 nodes with SF = 256 follows Rule 21.

Rule 21

F21-1 (C _{data, 64, k} ) = C _{control, 256,127-k} .

F21-2 (C _{data, 64,32 + k} ) = C _{control, 256,255-k} .

Where k is 0,1,2,3, ...., 23

Rule 21 is a modification of the above-described rule 5 and determines a node of a control part for a data part corresponding to 48 SF = 64 nodes according to the mapping rule. Nodes that will use the same control part as the 48 SF = 64 nodes are grouped according to the following <rule 22>. Rule 22 below is identical to Rule 6 described above.

In <rule 21>, according to the mapping rule of F21-1 (C _{data, 64, k} ) = C _{control, 256,127-k} (where k is 0,1,2,3, ...., 23) The nodes of and nodes of the control part are shown in Table 5 below, and F21-2 (C _{data, 64,32 + k} ) = C _{control, 256,255-k} (where k is 0,1,2,3, The nodes of the data portion and the nodes of the control portion according to the mapping rule of ...., 23) are shown in Table 6 below.

Data part Control part (SF = 256) SF = 4 SF = 8 SF = 16 SF = 32 SF = 64 C _4,0 C _8,0 C _16,0 C _32,0 C _64,0 C _256,127 C _64,1 C _256,126 C _32,1 C _64,2 C _256,125 C _64,3 C _256,124 C _16,1 C _32,2 C _64,4 C _256,123 C _64,5 C _256,122 C _32,3 C _64,6 C _256,121 C _64,7 C _256,120 C _8,1 C _16,2 C _32,4 C _64,8 C _256,119 C _64,9 C _256,118 C _32,5 C _64,10 C _256,117 C _64,11 C _256,116 C _16,3 C _32,6 C _64,12 C _256,115 C _64,13 C _256,114 C _32,7 C _64,14 C _256,113 C _64,15 C _256,112 C _4,1 C _8,2 C _16,4 C _32,8 C _64,16 C _256,111 C _64,17 C _256,110 C _32,9 C _64,18 C _256,109 C _64,19 C _256,108 C _16,5 C _32,10 C _64,20 C _256,107 C _64,21 C _256,106 C _32,11 C _64,22 C _256,105 C _64,23 C _256,104

Data part Control part (SF = 256) SF = 4 SF = 8 SF = 16 SF = 32 SF = 64 C _4,2 C _8,4 C _16,8 C _32,16 C _64,32 C _256,255 C _64,33 C _256,254 C _32,17 C _64,34 C _256,253 C _64,35 C _256,252 C _16,9 C _32,18 C _64,36 C _256,251 C _64,37 C _256,250 C _32,19 C _64,38 C _256,249 C _64,39 C _256,248 C _8,5 C _16,10 C _32,20 C _64,40 C _256,247 C _64,41 C _256,246 C _32,21 C _64,42 C _256,245 C _64,43 C _256,244 C _16,11 C _32,22 C _64,44 C _256,243 C _64,45 C _256,242 C _32,23 C _64,46 C _256,241 C _64,47 C _256,240 C _4,3 C _8,6 C _16,12 C _32,24 C _64,48 C _256,239 C _64,49 C _256,238 C _32,25 C _64,50 C _256,237 C _64,51 C _256,236 C _16,13 C _32,26 C _64,52 C _256,235 C _64,53 C _256,234 C _32,27 C _64,54 C _256,233 C _64,55 C _256,232

Here, the nodes allocated to the control part in Tables 5 and 6 are F (C _{data, 64, k} ) = C _{control, 256,127-k} and F (C _{data, 64,32 + k} ) = C _{control The following} example shows an allocation of _256,255-k . However, when the nodes allocated to the control portion are assigned F (C _{data, 64, k} ) = C _{control, 256,96 + k} and F (C _{data, 64,32 + k} ) = C _{control, 256,224 + k} there may be sequentially assigned to C in C _{256,96 256,239} to _256,111, respectively and sequentially C C _265,224. This is expressed as follows.

F (C _{data, 64, k} ) = C _{control, 256,96 + k} .

F (C _{data, 64,32 + k} ) = C _{control, 256,224 + k} .

Where k is 0,1,2,3, ...., 23

In addition, the node assigned to the control portion has the same effect even if properly set so that it can be mapped one-to-one with the node allocated to the data portion.

Rule 22

F ₂₂ (C _{data, 64, k} ) = C _{control, 256,255-k} .

If (p * SF, p * k) = (64, n) for SF≤64, or (p * 64, p * n) = (SF, k) for SF> 64, 0≤n≤23 If p is present, C _{SF, k} and C _{64, n} are one group. At this time, 0≤k≤3 * SF / 8-1.

If (p * SF, p * k) = (64, n) for SF≤64, or (p * 64, p * n) = (SF, k) for SF> 64, 32≤n≤55 If p is present, C _{SF, k} and C _{64, n} are one group. At this time, SF / 2≤k≤7 * SF / 8-1.

Here, when p satisfying (p * SF, p * k) = (64, n) for SF ≤ 64, or (p * 64, p * n) = (SF, k) for SF> 64, C _{SF, k} and C _{64, n} are nodes existing in the same group.

Using the mapping scheme according to Rule 22, when 4 <SF ≤ 64, nodes of the control part for nodes allocated to the data part are determined, and at this time, 3 * SF / 4 data part nodes per SF. Can be assigned at the same time. In Rule 22, a mapping scheme is necessary for k being odd in C _{128, k} when SF = 128 _{and k} being not multiple of 4 in C _{256, k} when SF = 256. An example thereof will be described below as (1) when SF is 128 and (2) when SF is 256. FIG.

(1) If SF is 128

In the OVSF code tree shown in FIG. 4, eight nodes corresponding to one-fourth of the nodes corresponding to SF = 256 in the C _8,3 and C _8,7 sub-trees, that is, C _256,96 , C _256,97 , C _256,98 , C _256,99 , C _256,100 , C _256,101 , C _256,102 , C _256,103 , and C _256,200 , C _256,201 , C _256,202 , C _256,203 , C _256,204 , C _256,205 , C _256,206, C _256,207 is not used. Thus, these nodes are assignable to the control portion of nodes where SF = 128 and k is odd at C _{128, k} . For example, many-to-one function mapping schemes such as Rule 23 and Rule 24 below may be applied between 48 SF = 128 nodes and 16 SF = 256 nodes.

Rule 23

F23 (C _{data, 128,2n + 1} ) = F23 (C _{data, 128,2 (n + 8) +1} ) = F23 (C _{data, 128,2 (n + 16) +1} ) = C _{control, 256,103 -n} (where 0 ≦ _n ≦ 7).

F23 (C _{data, 128,64 + 2n + 1} ) = F23 (C _{data, 128,64 + 2 (n + 8) +1} ) = F23 (C _{data, 128,64 + 2 (n + 16) +1} ) = C _{control, 256,207-n, where 0 ≦ n} ≦ 7.

Therefore, when an additional mapping rule such as <rule 23> is used, when SF = 128, k is odd among C _{data, 128, k} nodes of the data portion as shown in Table 7 and Table 8 below. Nodes that are not assigned to the control portion C _256,96 , C _256,97 , C _256,98 , C _256,99 , C _256,100 , C _256,101 , C _256,102 , C _256,103 and C _256,200 , C _256,201 , C _256,202 , _C256,203 , _C256,204 , _C256,205 , _{C256,206, C256,207} .

n Data part Control part F7 (C _{data, 128,2n + 1} ) F7 (C _{data, 128,2 (n + 8) +1} ) F7 (C _{data, 128,2 (n + 16) +1} ) C _{control, 256,103-n} n = 0 C _128,1 C _128,17 C _128,33 C _256,103 n = 1 C _128,3 C _128,19 C _128,35 C _256,102 n = 2 C _128,5 C _128,21 C _128,37 C _256,101 n = 3 C _128,7 C _128,23 C _128,39 C _256,100 n = 4 C _128,9 C _128,25 C _128,41 C _256,99 n = 5 C _128,11 C _128,27 C _128,43 C _256,98 n = 6 C _128,13 C _128,29 C _128,45 C _256,97 n = 7 C _128,15 C _128,31 C _128,47 C _256,96

n Data part Control part F7 (C _{data, 128,64 + 2n + 1} ) F7 (C _{data, 128,64 + 2 (n + 8) +1} ) F7 (C _{data, 128,64 + 2 (n + 16) +1} ) C _{control, 256,207-n} n = 0 C _128,65 C _128,81 C _128,97 C _256,207 n = 1 C _128,67 C _128,83 C _128,99 C _256,206 n = 2 C _128,69 C _128,85 C _128,101 C _256,205 n = 3 C _128,71 C _128,87 C _128,103 C _256,204 n = 4 C _128,73 C _128,89 C _128,105 C _256,203 n = 5 C _128,75 C _128,91 C _128,107 C _256,202 n = 6 C _128,77 C _128,93 C _128,109 C _256,201 n = 7 C _128,79 C _128,95 C _128,111 C _256,200

Rule 24

F24 (C _{data, 256,4n + 2} ) = C _{contorl, 256,4n + 3} (where 0≤n≤47)

In addition, if k is divided by 4 and the remainder is 1 (that is, k = 4n + 1), there are 48, and the method of allocating the 48 nodes to the data portion and the control portion is in accordance with Rule 25 below.

Rule 25

F25-1 (C _{data, 256,4n + 1} ) = C _{control, 256,207-n} ( _where 0≤n≤15)

F25-2 (C _{data, 256,4 (n + 16) +1} ) = C _{control, 256,4n + 1} ), where 0≤n≤15

(2) If SF is 256

In the case of SF = 256, the following two cases will be described according to the remainder obtained by dividing k by 4 in C _{256, k} . In the first case, when k is a multiple of 4 in C _{256, k} , this node is determined as the node of the control part according to <rule 21>, and in the second case, when k is divided by 4 and the remainder is 2 In other words, when k = 4n + 2 and when k is divided by 4, the remainder is 3, that is, when k = 4n + 3, the node where k is divided by 4 is 2 as shown in Rule 24. Set to and control the node if k is divided by 4 and the remainder is 3. Here, if the above <Rule 24> and <Rule 25> are changed and applied, the remaining nodes may correspond to the control part in the case of SF 256. As a result, when the mapping rules are used, two nodes may be allocated when SF = 4, and when 4 <SF≤64, three quarters of the total nodes may be allocated as data parts for each SF, and SF = 256. In this case, as in the prior art, one half of the total nodes can be simultaneously allocated to the data portion for each SF.

Therefore, in the sixth embodiment of the present invention, the base station may allocate one of the OVSF code nodes C _{data, SF and k} to the UE as shown in Equation 8 below in one scrambling code.

C _{data, SF, k}

only,

In Equation 8, the SF value selectively determines one of 4, 8, 16, 32, 64, 128, and 256 values, and a UE assigned an OVSF code node from a base station according to Equation 8 The higher branch nodes may be used in the sub code tree with the larger SF value. For example, a UE assigned C _{data, 8,1} has an SF value greater than 8 in a sub code tree and has higher branch nodes, that is, C _{data, 16,2,} C _{data, 32,4,} C _{data, 64, 8,} C _{data, 128, 16,} C _{data, 256, 32} code is available. The UE that is assigned the code C _{data, SF, k} for the DPDCH has a DPCCH. If the DPDCH code belongs to an upper node tree according to the mapping rule, the C _{control, 256,127-n} node belongs to a lower node tree. Is transmitted using a C _{control, 256,255-n} node. The value of _{n in} the C _{control, 256, 255-n} node is determined by Equation 9 below.

n = k * 64 / SF

The mapping of nodes when SF excluding 128 in Equation 9 and nodes when SF is 256 is performed according to the rules, and the sixth embodiment controls two SF 8 nodes. The case of assigning to parts is described as an example.

Therefore, adapting the second and sixth embodiments of the present invention enables mapping of the case of allocating four SF 16 nodes to the control portion and the case of allocating eight SF32 nodes to the control portion. .

Assuming a case where two SF = 8 nodes are allocated to the control part based on the above rules, the channelization code allocation method in the situation where the scrambling code range of the DPDCH is defined is referred to the fifth embodiment of the present invention. This will be described with reference to the eighth embodiment.

The maximum number of OVSF nodes that can be allocated by one OVSF code tree for SF of a predetermined DPDCH can be found in the following <Rule 26>.

Rule 26

Is the maximum number of OVSF nodes to which DPDCH in SF and DPCCH of SF 256 can be allocated in case of assigning two SF = 8 nodes as control parts. According to Rule 26, the maximum number of nodes that can be allocated when the SF of the DPDCH is 4 is 1 for each subtree, 3 if the SF is 8, 7 if the SF is 16, 14 if the SF is 32, and SF. OVSF code nodes can be assigned to 64 DPDCHs and DPCCHs if 25 is 64, 42 if SF = 128, and finally 64 if SF is 256.

Each of the rules in the fifth embodiment will be explained with the following rules changed under the circumstances of the eighth embodiment. The following rule numbers are used by appending '-1' to the corresponding rule numbers used in the fifth embodiment.

Rule 27 is a method of allocating codes based on SF 256.

Rule 27

F ₂₇ (C _{data, 256, k} ) = C _{control, 256,127-k} . (Where 0≤k≤SF / 4-1)

F ₂₇ (C _{data, 256, k} ) = C _{control, 256,255-k} . (Where SF / 2≤k≤SF * 3 / 4-1)

Rule 28 is a method of allocating codes based on SF 128.

Rule 28

F ₂₈ (C _{data, 128, k} ) = C _{control, 256,127-k} . (Where 0≤k≤ [42 * SF / 128-1])

F ₂₈ (C _{data, 128, k} ) = C _{control, 256,255-k} . (Where SF / 2≤k≤ [106 * SF / 128-1])

Rule 29 is a method of allocating codes based on SF64.

Rule 29

F29 (C _{data, 64, k} ) = C _{control, 256,127-k} . (Where 0≤k≤ [25 * SF / 64-1])

F29 (C _{data, 64, k} ) = C _{control, 256,255-k} . (Where SF / 2≤k≤ [57 * SF / 64-1])

Rule 30 is a method of allocating codes based on SF 32.

Rule 30

F ₃₀ (C _{data, 32, k} ) = C _{control, 256,127-k} . (Where 0≤k≤ [14 * SF / 32-1])

F ₃₀ (C _{data, 32, k} ) = C _{control, 256,255-k} . (Where SF / 2≤k≤ [30 * SF / 32-1])

Rule 31 is a method of allocating codes based on SF16.

Rule 31

F31 (C _{data, 16, k} ) = C _{control, 256,127-k} . (Where 0≤k≤ [7 * SF / 16-1])

F31 (C _{data, 16, k} ) = C _{control, 256,255-k} . (Where SF / 2≤k≤ [16 * SF / 16-1])

Rule 32 is a method of allocating codes based on SF8.

Rule 32

F ₃₂ (C _{data, 8, k} ) = C _{control, 256,127-k} . (Where 0≤k≤ [3 * SF / 8-1])

F32 (C _{data, 8, k} ) = C _{control, 256,255-k} . (Where SF / 2≤k≤ [7 * SF / 8-1])

As described above, the present invention increases the system capacity by efficiently assigning OVSF codes to a plurality of UEs using USTS by dividing the OVSF codes into data parts used for DPDCH and control parts used for DPCCH. Has the advantage of bringing.

In addition, when the SF having the desired transmission rate does not exist, an SF is allocated to an integer multiple and transmits data through a plurality of channels, thereby effectively increasing the system capacity by using a limited OVSF code. Have

In addition, a fixed SF is fixedly assigned to a control part on a channel having a data part and a control part, and a variable allocation of SF to the data part increases the number of OVSFs that can be allocated while maintaining orthogonality to increase system capacity. Has the advantage of bringing.

It also allows the base station to actively allocate DPCH channels in the USTS group.

In addition, the orthogonal codes assigned to the control part and the orthogonal codes assigned to the control part are grouped on the channel in which the data part and the control part exist in pairs, respectively, so that the orthogonal codes assigned to the control part and the data part belong to different groups. By selecting each of the nodes belonging to it has the advantage of improving the maximum average power factor.

Claims (15)

Receiving, from a base station _, a spreading factor node C _{SF, k} of 2 ^m −1 spreading nodes arranged in trees having a parent node and a child node, wherein m is an integer greater than or equal to 3; A process of finding the group including the received spreading factor node C _{SF, k} by Equation 10 below; Spreading a signal of a dedicated physical data channel with an orthogonal code corresponding to a selected one of the received spreading factor node and its child nodes in the found group; The n of the received spreading factor node 2 ^m-1/4 to is the first half period of the <Equation 11> by, and 2 ^m-1 / second half of the fourth period is to <Equation 12> spreading factor determined by the And spreading a signal of a dedicated physical control channel with an orthogonal code corresponding to the node. In Equation 10 above being. The spreading factor _SF of claim 1, wherein the spreading factor SF is 64 in the spreading factor node C _{SF, k} , and the spreading factor SF256 of the control portion corresponding to the spreading factor node _{SF, k} . C _{control, 256, 127-k} is mapped to the C _{data, 64, k} ), and the diffusion factor (C _{data, 64, 32 + k} ) of the dedicated physical control channel is mapped to the diffusion factor of the dedicated physical control channel. C _{control, 256, 255-k} channel mapping method characterized in that the mapping. F (C _{data, 64, k} ) = C _{control, 256,127-k} . F (C _{data, 64,32 + k} ) = C _{control, 256,255-k} . Where k is 0,1,2,3, ...., 23 The spreading factor SF of the control part corresponding to Equation 14 according to Equation 14, wherein the spreading factor SF is 64 at the spreading factor node C _{SF, k} . C _{control, 256,96 + k,} is mapped to C _{data, 64, k} ), and the diffusion factor (C _{data, 64,32 + k} ) of dedicated physical control channel is mapped to the spreading factor of the dedicated physical control channel. A channel allocation method for a CDMA communication system, characterized by the spreading factor C _{control, 256,224 + k} being mapped. F (C _{data, 64, k} ) = C _{control, 256,96 + k} . F (C _{data, 64,32 + k} ) = C _{control, 256,224 + k} . Where k is 0,1,2,3, ...., 23 2. The method of claim 1, wherein the spreading factor SF is 128 at the spreading factor node C _{SF, k} , and the spreading factor SF256 of the control portion corresponding to the spreading factor SF is set at a spreading factor (C _{data, 128, k} ) of a dedicated physical data channel. If k is an even number, the spreading factor of the dedicated physical control channel is mapped as shown in Equation 15. If k is an odd number, the spreading factor of the dedicated physical control channel is mapped as shown in Equation 16. When the K is an even number in the spreading factor (C _{data, 64, 32 + k} ) of the dedicated physical data channel, the spreading factor of the dedicated physical control channel is mapped as shown in Equation 17, and k is an odd number. The channel allocation method of the CDMA communication system, characterized in that the spreading factor of the dedicated physical control channel is mapped as shown in Equation (18). F (C _{data, 128, k} ) = C _{control, 256,127-k} . F7 (C _{data, 128,2n + 1} ) = F7 (C _{data, 128,2 (n + 8) +1} ) = F7 (C _{data, 128,2 (n + 16) +1} ) = C _{control, 256,103 -n} (where 0 ≦ _n ≦ 7). F (C _{data, 128,64 + k} ) = C _{control, 256,255-k} . F7 (C _{data, 128,64 + 2n + 1} ) = F7 (C _{data, 128,64 + 2 (n + 8) +1} ) = F7 (C _{data, 128,64 + 2 (n + 16) +1} ) = C _{control, 256,207-n} ( _where 0≤n≤7) Where k is 0,1,2,3, ...., 23 A memory for storing 2 ^m -1 spreading factor nodes arranged in trees with parent and child nodes, where m is an integer greater than or equal to 3, An input device for receiving one spreading factor node C _{SF, k} from a base station, The group including the received spreading factor node C _{SF, k} is found by Equation 9 below, and the node of the data portion of the received spreading factor node and one of its self-nodes is selected from the found group. control n determined by the 2 ^m-1/4 to is the first half period of the <equation 20a> to back, and a 2 ^m-1 the second half period of the / 4 by <equation 20b> of the received spreading factor nodes An OVSF code allocator for selecting a partial spreading factor node, An OVSF code generator for generating orthogonal codes of a dedicated physical data channel and a dedicated physical control channel respectively corresponding to the selected data part and the spreading factor node of the control part; A dedicated data channel spreader for spreading a signal of a dedicated physical data channel by an orthogonal code of the generated data portion; And a dedicated control channel spreader for spreading a signal of a dedicated control channel by an orthogonal code of the generated control part. In Equation 19 above being. The method according to claim 5, wherein if the spreading factor SF is 64 at the spreading factor node C _{SF, k} and the spreading factor SF256 of the control part corresponding thereto, the OVSF code allocator is a dedicated physical data channel according to Equation 21 below. Map the spreading factor C _{control 256,127-k} of the dedicated physical control channel to the spreading factor (C _{data, 64, k} ) of C _, and the dedicated physical control of the spreading factor (C _{data, 64,32 + k} ) of the dedicated physical data channel. A reverse channel transmitter of a terminal of a CDMA communication system, characterized by mapping a spreading factor C _{control, 256, 255-k} of a channel. F (C _{data, 64, k} ) = C _{control, 256,127-k} . F (C _{data, 64,32 + k} ) = C _{control, 256,255-k} . Where k is 0,1,2,3, ...., 23 6. The method of claim 5, wherein when the spreading factor SF is 128 and the spreading factor SF256 of the control part corresponding to the spreading factor node C _{SF, k} , the OVSF code allocator has a spreading factor (C _data) of a dedicated physical data channel. _{(128, k} ), if k is an even number, the spreading factor of the dedicated physical control channel is mapped as shown in Equation 22 below, and if k is an odd number, the dedicated physical control channel as shown in Equation 23 is shown below. Mapping the spreading factor of and mapping the spreading factor of the dedicated physical control channel as shown in Equation 24 when K is an even number in the spreading factor (C _{data, 64, 32 + k} ) of the dedicated physical data channel. And, if k is an odd number, the reverse channel transmitter of the terminal of the CDMA communication system, wherein the spreading factor of the dedicated physical control channel is mapped as shown in Equation (25). F (C _{data, 128, k} ) = C _{control, 256,127-k} . F7 (C _{data, 128,2n + 1} ) = F7 (C _{data, 128,2 (n + 8) +1} ) = F7 (C _{data, 128,2 (n + 16) +1} ) = C _{control, 256,103 -n} (where 0 ≦ _n ≦ 7). F (C _{data, 128,64 + k} ) = C _{control, 256,255-k} . F7 (C _{data, 128,64 + 2n + 1} ) = F7 (C _{data, 128,64 + 2 (n + 8) +1} ) = F7 (C _{data, 128,64 + 2 (n + 16) +1} ) = C _{control, 256,207-n} ( _where 0≤n≤7) Where k is 0,1,2,3, ...., 23 A memory for storing 2 ^m -1 spreading factor nodes arranged in trees with parent and child nodes, where m is an integer greater than or equal to 3, An input device for receiving one spreading factor node C _{SF, k} from a base station, Find the group containing the received spreading factor node C _{SF, k} by Equation 26 and select the node of the data portion of the received spreading factor node and one of its self-nodes from the found group. control n determined by the 2 ^m-1/4 to is the first half period of the <equation 27a> to back, and a 2 ^m-1 the second half period of the / 4 by <equation 27b> of the received spreading factor nodes An OVSF code allocator for selecting a partial spreading factor node, An OVSF code generator for generating orthogonal codes of a dedicated physical data channel and a dedicated physical control channel respectively corresponding to the selected data part and the spreading factor node of the control part; A dedicated data channel despreader for spreading a signal of a dedicated physical data channel received with an orthogonal code of the generated data portion; And a dedicated control channel despreader for despreading a signal of a dedicated control channel received by an orthogonal code of the generated control part. In Equation 26, being. First and second half of the first diffusion factor, wherein 2 ^m −1 diffusion factor nodes are arranged in a tree shape in m + 1 rows and bisected first diffusion factor nodes in a column corresponding to the maximum diffusion factor A method for assigning first and second orthogonal codes for spreading a data signal and a control signal of a mobile communication system having an OVSF code divided into a pair of trees having nodes, the method comprising: Each of the pair of trees is a spreading factor node of at least some of the spreading factor nodes in the m + 1th column that are self-nodes of one of the second spreading factor nodes next to the first spreading factor nodes. Assigning an orthogonal code corresponding to one of the signals as a first orthogonal code for spreading control signals, Allocating a second orthogonal code corresponding to one of the remaining nodes maintaining orthogonality with the one of the second spreading factor nodes for data signal spreading. Assigning first and second orthogonal codes for signal spreading. 10. The method of claim 9, wherein the maximum diffusion factor node is C _{4, k} (where K = 0,1,2,3), and the first diffusion factor nodes are C _4,0 and C _4,2 and the second Diffusion factor nodes are C _4,1 and C _4,3 , and the _child nodes of the second diffusion factor nodes C _4,1 and C _4,3 are C _8,2 and C _8,3 and C _8,6 and C _8,7, and C _8,3 and C _8,7 nodes of these children are assigned as the second orthogonal code for spreading the control signal, and the remaining nodes are assigned as the first orthogonal code for spreading the data signal. How to. The method of claim 10, wherein the first orthogonal codes for spreading the data signal and the second orthogonal codes for spreading the control signal are allocated to be mapped by Equation 28. F (C _{data, 64, k} ) = C _{control, 256,127-k} . F (C _{data, 64,32 + k} ) = C _{control, 256,255-k} . Here, the spreading factor of the data signal is 64, the spreading factor of the control signal is 256, and k is 0,1,2,3, ...., 23 The method of claim 10, wherein the first orthogonal codes for data signal spreading and the second orthogonal codes for spreading control signals are mapped by Equations 29 and 31 when K is an even number. If k is odd, the method is characterized in that the allocation to be mapped by the following equation (30) and (32). F (C _{data, 128, k} ) = C _{control, 256,127-k} . F (C _{data, 128,2n + 1} ) = F (C _{data, 128,2 (n + 8) +1} ) = F (C _{data, 128,2 (n + 16) +1} ) = C _{control, 256,103 -n} (where 0 ≦ _n ≦ 7). F (C _{data, 128,64 + k} ) = C _{control, 256,255-k} . F (C _{data, 128,64 + 2n + 1} ) = F (C _{data, 128,64 + 2 (n + 8) +1} ) = F (C _{data, 128,64 + 2 (n + 16) +1} ) = C _{control, 256,207-n} ( _where 0≤n≤7) Here, the spreading factor for the data signal is 128, the spreading factor for the control signal is 256, and k is 0, 1, 2, 3, ...., 23 Method for allocating an orthogonal code in a mobile communication system having an orthogonal code table consisting of 2 ^m -1 spreading factor nodes arranged in trees having parent and child nodes, where m is an integer greater than or equal to 3 To Receiving one spreading factor node C _{SF, k} from a base station, Finding a group including the received spreading factor node C _{SF, k} ; Spreading a signal of a dedicated physical data channel with an orthogonal code corresponding to a selected one of the received spreading factor node and its child nodes in the found group; And spreading a signal of a dedicated physical control channel with an orthogonal code corresponding to the spreading factor node determined by the received spreading factor node. In the reverse channel transmission apparatus of the terminal of the CDMA communication system, A memory for storing 2 ^m -1 spreading factor nodes arranged in trees with parent and child nodes, where m is an integer greater than or equal to 3, An input device for receiving one spreading factor node C _{SF, k} from a base station, Find a group containing the received spreading factor node C _{SF, k} and select a node of the data portion of one of the received spreading factor node and its self-nodes from the found group, and An OVSF code allocator for selecting a spreading factor node of the control portion determined by An OVSF code generator for generating orthogonal codes of a dedicated physical data channel and a dedicated physical control channel respectively corresponding to the selected data part and the spreading factor node of the control part; A dedicated data channel spreader for spreading a signal of a dedicated physical data channel by an orthogonal code of the generated data portion; And a dedicated control channel spreader for spreading a signal of a dedicated control channel by an orthogonal code of the generated control part. In the reverse channel receiver of the base station of the CDMA communication system, A memory for storing 2 ^m -1 spreading factor nodes arranged in trees with parent and child nodes, where m is an integer greater than or equal to 3, An input device for receiving one spreading factor node C _{SF, k} from a base station, Find a group containing the received spreading factor node C _{SF, k} and select a node of the data portion of one of the received spreading factor node and its self-nodes from the found group, and An OVSF code allocator for selecting a spreading factor node of the control portion determined by An OVSF code generator for generating orthogonal codes of a dedicated physical data channel and a dedicated physical control channel respectively corresponding to the selected data part and the spreading factor node of the control part; A dedicated data channel despreader for spreading a signal of a dedicated physical data channel received with an orthogonal code of the generated data portion; And a dedicated control channel despreader for despreading a signal of a dedicated control channel received by an orthogonal code of the generated control part.