KR100672559B1 - Method for generating optimal cell identification code, and for transmitting the code - Google Patents

Abstract

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to the next generation mobile communication, and more particularly, to the generation of a cell identification code for identifying a cell (= base station) in a mobile communication system of a wideband code division multiple access (hereinafter referred to as W-CDMA) scheme. It relates to a method of transmitting a code.

On the other hand, in the present invention, in order to satisfy the cell identification of the optimal performance and to exhibit the optimal diversity effect in the soft handover mode, the minimum hamming distance in consideration of active allocation according to the size of the active group ( Provides a method for creating an optimal Site Selection Diversity Transmit (SSDT) cell identification code having a maximum Minimum Hamming Distance (Maximum Hamming Distance) and transmitting it more effectively through an uplink channel.

Feedback identifier (FBI), Hadamard code, Bi-orthogonal code

Description

Method for generating optimal cell identification code, and for transmitting the code

1 is a diagram illustrating an uplink dedicated physical channel (DPCH) structure according to 3GPP standard;

2 is a diagram illustrating a detailed structure of a feedback identifier (FBI) field in an uplink dedicated physical channel (DPCH) according to the 3GPP standard;

FIG. 3 is a view for explaining transmission examples of a cell identification code allocated by the user side (UE) when 1 bit is inserted into the FBI field for each slot in the present invention. FIG.

FIG. 4 is a view for explaining transmission examples of a cell identification code allocated by the user side (UE) when 2 bits are inserted into the FBI field for each slot in the present invention. FIG.

The present invention relates to the next generation mobile communication, and more particularly, to a cell identification code for identifying a cell (= base station) in a W-CDMA mobile communication system and a method of transmitting the generated code.

In general, the Radio Access Network (RAN) specification of the Third Generation Partnership Project (3GPP) describes the Site Selection Diversity Transmit (hereinafter abbreviated as SSDT). . Site, base station and cell have the same meaning as each other.

SSDT is a selective macro diversity scheme in soft handover mode. The SSDT operation determines whether the service is determined by the system side (UTRAN: UMTS Terrestrial Radio Access Network). (UE: User Equipment) selects one cell called "Primary cell" among the cells in the active set. All other cells not selected at this time become "Non-primary cell".

The purpose of the SSDT is to reduce the interference caused by multiple transmissions in the soft handover mode by performing information transmission in downlink in a first rank cell (hereinafter referred to as a primary cell).

However, in order to select a primary cell, temporary identifications are assigned to respective valid cells having a transmission level greater than or equal to a predetermined level, and the UE (UE) informs the connected cells of an identifier code corresponding to the primary cell.

At this time, the UE selects the primary cell by periodically measuring and comparing the reception level of the common pilot transmitted by the active cells, and the cell having the largest pilot power is selected as the primary cell. Thereafter, the transmission power of the cells selected as a subordinate (hereinafter, referred to as non-primary) by the user side (UE) is disconnected.

The identifier code of the primary cell is a feed-back indicator among several fields of a control channel such as an uplink dedicated physical control channel (DPCCH) in the uplink dedicated physical channel (DPCH) shown in FIG. 1. (Hereinafter abbreviated as FBI) field is periodically transmitted to the cells belonging to the active group. As shown in Table 2, FBI transmits 1 bit or 2 bits in one slot. If 1 bit is used for FBI, 15 bits are transmitted in one radio frame, and 1 bit is used for 2 bits in FBI. 30 bits are transmitted. When the UE transmits the identifier code to the selected primary cell, the UE determines whether to transmit by inserting 1 bit or inserting 2 bits into the FBI field for each slot.

For reference, in FIG. 1, k is related to a spreading factor (SF) in an uplink dedicated physical channel (DPCH), and a spreading factor (SF) having a value from 256 to 4 is given as 256/2 ^k . In addition, the number of bits of fields in each slot in the uplink dedicated physical data channel (DPDCH) and dedicated physical control channel (DPCCH) is determined as shown in Tables 1 and 2 below.

Slot Format Number (Slot Format #I) Channel Bit Rate (kbps) Channel Symbol Rate (ksps) Diffusion factor (SF) Bits per Frame (Bits / Frame) Bits per Slot (Bits / Slot) N _data bits 0 15 15 256 150 10 10 One 30 30 128 300 20 20 2 60 60 64 600 40 40 3 120 120 32 1200 80 80 4 240 240 16 2400 160 160 5 480 480 8 4800 320 320 6 960 960 4 9600 640 640

Slot Format Number (Slot Format #I) Channel Bit Rate (kbps) Channel Symbol Rate (ksps) Diffusion factor (SF) Bits per Frame (Bits / Frame) Bits per Slot (Bits / Slot) N _pilot bit number N _{TFCI Bits} N _{FBI Bits} N _{TPC Bits} 0 15 15 256 150 10 6 2 0 2 One 15 15 256 150 10 8 0 0 2 2 15 15 256 150 10 5 2 One 2 3 15 15 256 150 10 7 0 One 2 4 15 15 256 150 10 6 0 2 2 5 15 15 256 150 10 5 2 2 One

In Table 2, N _FBI, which represents the number of bits per slot inserted into the FBI field, is a closed loop mode transmission diversity requiring feedback between an access point of a user side (UE) and a system side (UTRAN). loop mode transmit diversity) or SSDT.

In addition, the N _FBI is divided into an S field and a D field, as shown in FIG. 2. The S field is used for SSDT signal processing and the D field is used for transmit diversity signal processing in the feedback mode.

In FIG. 2, the lengths of the S field and the D field may be 0, 1, and 2, respectively. If the power control by SSDT and the transmission diversity in the feedback mode are used at the same time, one bit is used for each of the S field and the D field.

Hereinafter, the SSDT operation to reduce the interference caused by the multiplex transmission in the soft handover mode will be described in more detail.

The SSDT is initially operated by the system side (UTRAN) based on the cells of the active group in the soft handover mode, and then the system side (UTRAN) of the SSDT option activated during the current soft handover period is Notify the cell and UE. At this time, the temporary identifier is allocated based on the order of the active groups, and is transmitted to various effective cells and UEs which are activated.

A particular cell that has received an active list can know its entry position in the list from which it can determine its identifier code, while at the same time the UE (UE) receiving a valid list is a cell in that list. Each identifier code of valid cells according to the registration order can be determined.

Therefore, the system side (UTRAN) and the user side (UE) have the same combination between the identifier code and the cells. At this time, the valid list is updated every time, and the updated valid list is transmitted to all valid cells and the UE.

After activation of SSDT and UE-side authentication, UE starts sending the identifier code of primary cell. Upon successful activation of SSDT and acceptance of UE-side authentication, valid cells detect Primary cell identifier information. To start.

Next, the setting of the temporary cell identifier will be described. A temporary identifier is assigned to each cell during the SSDT, and this identifier is used as a site selection signal.

If it is determined that the upper layer is to transmit between the UE and the cell in the SSDT mode, the UE determines the most appropriate one cell among the valid cells as the primary cell and informs the system side (UTRAN) through the FBI field.

The temporary cell identifier is given as a binary bit sequence having a specific bit length, which is shown in Tables 3 and 4 below.

Table 3 shows a temporary identifier code when the FBI is 1 bit per slot, and Table 4 shows a temporary identifier code when the FBI is 2 bits per slot.

In Tables 3 and 4 below, temporary identifier codes have the form of "long", "medium", and "short", and there are eight codes for each type.

The temporary identifier code must be transmitted within one frame. If the temporary identifier code cannot be inserted and transmitted in each FBI field of one frame and is inserted and transmitted in two frames, the last bit of the temporary identifier code is punctured. )do.

Identifier label Identifier code long medium short a 000000000000000 0000000 (0) 00000 b 111111111111111 1111111 (1) 11111 c 000000001111111 0000111 (1) 00011 d 111111110000000 1111000 (0) 11100 e 000011111111000 0011110 (0) 00110 f 111100000000111 1100001 (1) 11001 g 001111000011110 0110011 (0) 01010 h 110000111100001 1001100 (1) 10101

Identifier label Identifier code long medium short a 0000000 (0) 0000000 (0) 000 (0) 000 (0) 000 000 b 1111111 (1) 1111111 (1) 111 (1) 111 (1) 111 111 c 0000000 (0) 1111111 (1) 000 (0) 111 (1) 000 111 d 1111111 (1) 0000000 (0) 111 (1) 000 (0) 111 000 e 0000111 (1) 1111000 (0) 001 (1) 110 (0) 001 100 f 1111000 (0) 0000111 (1) 110 (0) 001 (1) 110 011 g 0011110 (0) 0011110 (0) 011 (0) 011 (0) 010 010 h 1100001 (1) 1100001 (1) 100 (1) 100 (1) 101 101

Table 5 below shows the number of site selections for selecting a primary cell per frame for each identifier code type according to the characteristics of the temporary identifier codes shown in Tables 3 and 4.

Cord length Number of FBI bits per slot allocated for SSDT One 2 "long" Select site once per frame 2 site selections per frame "medium" 2 site selections per frame 4 site selections per frame "short" 3 site selections per frame 5 site selections per frame

Referring to Table 5 above, first, when the FBI per slot is 1 bit, the long identifier code is transmitted 15 bits per frame, one bit in each slot, so that site selection is performed once per frame. If the FBI is 2 bits, the long identifier code is transmitted 30 bits per frame, 2 bits in each slot, thus making two site selections per frame.

Also, if the FBI per slot is 1 bit, the medium identifier code is transmitted 15 bits per frame, so two site selections per frame are made. If the FBI is 2 bits per slot, the medium identifier code is 30 per frame. Because the bits are transmitted, four site selections are made per frame.

Finally, if the FBI per slot is 1 bit, the short identifier code is transmitted 15 bits per frame, so three site selections per frame are made. Since 30 bits are transmitted, five site selections are made per frame.

As mentioned above, when the user side (UE) determines one of the temporary identifier codes as the primary cell identifier codes after the activation of the SSDT and the UE side (UE) acknowledgment, periodically through the FBI field of the uplink control channel. To pass.

If the following three conditions are met simultaneously, this cell becomes a non-primary cell.

보다 작은 수의 심볼이 펑쳐링된 경우이다. First, if a cell receives a primary cell identifier code that does not match its own identifier code, the second cell satisfies the threshold defined by the system side (UTRAN) and the quality of the uplink signal received by the system side (UTRAN). In uplink compressed mode

This is the case when a smaller number of symbols are punctured.

However, if any one of the three conditions listed above is not satisfied, it is maintained as a primary cell.

The end of the next SSDT is determined by the system side (UTRAN). The system side (UTRAN) terminates SSDT in the same manner as the soft handover termination procedure and informs all cells and the user side (UE) of this fact.

In the conventional SSDT, the performance of the cell identification code used to identify each cell is determined by the maximum cross-correlation function value or the minimum hamming distance (d _min ). There is a current demand for an optimal cell identification code with a maximum hamming distance (d _min ).

SUMMARY OF THE INVENTION The present invention has been made in view of the above point, and is active in accordance with the size of an active group in order to satisfy cell identification of optimal performance and to exhibit optimal diversity effect in soft handover mode. In consideration of the allocation, an optimal SSDT cell identification code having a maximum minimum Hamming Distance is created, and a method of more efficiently transmitting the same through an uplink channel is provided.

The characteristics of the optimal cell identification code generation and its transmission method according to the present invention for achieving the above object is, the site-side diversity transmission (SSDT) to the user side (UE) to the effective cells belonging to the active group of a plurality of cells In assigning an identifier code, at a time when the UE operates in a soft handover mode, a temporary identifier code based on Hadamard code and a vertical orthogonal code based on the number of valid cells belonging to the active group Selectively assigning one or more selected ones of the temporary identifier codes based on the codes to the valid cells, respectively, and assigning the corresponding identifier codes assigned by the user side (UE) to respective valid cells during site selection diversity transmission (SSDT). Send to.

Preferably, when the number of valid cells belonging to the active group is 2 or less, one or more codes of two temporary identifier codes generated based on the orthogonal codes are selectively assigned to the valid cells, respectively. In the case where the number of valid cells belonging to the active group is less than or equal to two, two temporary identifier codes based on a quadrature code are orthogonal to each other.

In addition, when the number of valid cells in the active group is 3 or more, a plurality of codes among the plurality of temporary identifier codes generated based on the Hadamard code are selectively assigned to the valid cells, respectively.

Finally, when the number of valid cells belonging to the active group is increased to three or more after the assignment of the identifier code, a plurality of codes selected from the temporary identifier codes based on the Hadamard code are selectively assigned to the corresponding valid cells, respectively. When the number of valid cells belonging to the active group is reduced to 2 or less after the assignment of the identifier code, one or two codes selected from the temporary identifier codes based on the orthogonal codes are selectively assigned to the corresponding valid cells, respectively. .

Hereinafter, an exemplary embodiment of an optimal cell identification code generation and transmission method thereof according to the present invention will be described with reference to the accompanying drawings.

The temporary cell identifier is given as a binary bit sequence having a specific bit length, and the SSDT temporary identifier code proposed in the present invention when the FBI is 1 bit per slot is shown in Table 6 below. In addition, the SSDT temporary identifier code proposed in the present invention when the FBI for each slot is 2 bits is shown in Table 7 below.

As shown in Table 6 and Table 7, the temporary identifier code of the present invention has three types of "Long", "Medium", and "Short", and there are eight codes for each of these types. These temporary identifier codes must be transmitted within one frame. If the temporary identifier codes are not inserted into each FBI field of one frame and transmitted, the temporary identifier codes are inserted into two frames. use.

Identifier label Identifier code Long Medium Short A 000000000000000 (0) 0000000 00000 B1 111111111111111 (1) 1111111 11111 B2 101010101010101 (0) 1010101 01001 C 011001100110011 (0) 0110011 11011 D 110011001100110 (0) 1100110 10010 E 000111100001111 (0) 0001111 00111 F 101101001011010 (0) 1011010 01110 G 011110000111100 (0) 0111100 11100 H 110100101101001 (0) 1101001 10101

 Identifier label Identifier code (columns and rows represent slot positions and FBI bit positions) long medium short A (0) 0000000 (0) 0000000 (0) 000 (0) 000 000 000 B1 (1) 1111111 (1) 1111111 (1) 111 (1) 111 111 111 B2 (0) 0000000 (1) 1111111 (0) 000 (1) 111 000 111 C (0) 1010101 (0) 1010101 (0) 101 (0) 101 101 101 D (0) 1010101 (1) 0101010 (0) 101 (1) 010 101 010 E (0) 0110011 (0) 0110011 (0) 011 (0) 011 011 011 F (0) 0110011 (1) 1001100 (0) 011 (1) 100 011 100 G (0) 1100110 (0) 1100110 (0) 110 (0) 110 110 110 H (0) 1100110 (1) 0011001 (0) 110 (1) 001 110 001

In Tables 6 and 7, above, the minimum hamming distance d _min for the identifier code of each code length will be described later.

Among the temporary identifier codes of the present invention shown in Table 6 and Table 7 above, those having A, B2, C, D, E, F, G, and H, respectively, have lengths of 8 and 16 shown in Table 8, respectively. Generated based on Hadamard code.

Hadamard code of length 8 Hadamard code of length 16 H _3,0 = 0000 0000 H _3,1 = 0101 0101 H _3,2 = 0011 0011 H _3,3 = 0110 0110 H _3,4 = 0000 1111 H _3,5 = 0101 1010 H _3,6 = 0011 1100 H _3,7 = 0110 1001 H _4,0 = 0000 0000 0000 0000 H _4,1 = 0101 0101 0101 0101 H _4,2 = 0011 0011 0011 0011 H _4,3 = 0110 0110 0110 0110 H _4,4 = 0000 1111 0000 1111 H _4,5 = 0101 1010 0101 1010 H _4,6 = 0011 1100 0011 1100 H _4,7 = 0110 1001 0110 1001 H _4,8 = 0000 0000 1111 1111 H _4,9 = 0101 0101 1010 1010 H _4,10 = 0011 0011 1100 1100 H _{4,11 = 0110 0110 1001 1001 H 4,12} = 0000 1111 1111 0000 H 4,13 = 0101 1010 1010 0101 H 4,14 = 0011 1100 1100 0011 H 4,15 = 0110 1001 1001 0110

In Table 8, the Hadamard code of length 8 and the Hadamard code of length 16 have a bit value of 0 because the first bit has a bit value of 0, so puncturing the first bit does not affect the minimum hamming distance. Does not have the property.

In particular, in the present invention, since eight SSDT identifier codes are used for each identifier code type, eight Hadamard codes of length 8 are used, and the top 8 of 16 are used for 16 Hadamard codes of length.

A long identifier code of length 14 is generated by puncturing the first and second bits of the long identifier code of the 2-bit FBI of length 16.

Further, among the temporary identifier codes of the present invention shown in Tables 6 and 7, the identifier labels A and B1, respectively, are selectively generated based on a part of the orthogonal codes having lengths of 8 and 16 shown below.

B _3,0 = 0000 0000

B _3,1 = 1111 1111

B _4,0 = 0000 0000 0000 0000

B _4,1 = 1111 1111 1111 1111

In the present invention, each temporary identifier code of Table 6 and Table 7 is generated as follows.

First, the temporary identifier codes of the identifier labels A, B2, C, D, E, F, G, and H generated based on the Hadamard code will be described.

As will be described later, the temporary identifier codes of the identifier labels A, B2, C, D, E, F, G, and H are the number of cells belonging to the active set, that is, the active set size is 3 In the case of 8 or less, the user side (UE) is allocated to each valid cell belonging to the active group.

In Table 6, temporary identifier codes allocated when the FBI is 1 bit per slot and the active set size is 3 or more and 8 or less are generated as follows.

First, eight long identifier codes with a code length of 15 are generated by puncturing the first bit of the Hadamard code with a code length of 16.

The following eight medium identifier codes with a code length of 8 use the Hadamard code with a code length of 8, and the code length of 7 transmitted with the 8 medium identifier codes of this code length of 8 inserted in one radio frame. The identifier code is generated by puncturing the first bit of eight Hadamard codes that are eight bits long.

The next 8 short identifier codes with a code length of 5 preferentially puncture the first bit in the Hadamard code with a code length of 8, and the remaining two bits as shown in the 21 patterns shown in Tables 9, 10 and 11 below. It is generated by puncturing more.

The short identifier codes of 5-bit code length shown in Table 9 are (1,2,3), (1,2,4), (1,2,5) in order of eight Hadamard codes of code length 8, respectively. , (1,2,6), (1,2,7), (1,2,8), (1,3,4) are generated by puncturing each three bits of the position pattern.

The short identifier codes of 5 bits of code length shown in Table 10 are (1,3,5), (1,3,6), (1,3,7) in order of 8 Hadamard codes having 8 bits of code length, respectively. ), (1,3,8), (1,4,5), (1,4,6), and (1,4,7) are generated by puncturing each three bits of the position pattern.

The short identifier code of 5 bits of code length shown in the last table 11 is (1,4,8), (1,5,6), (1,5,7) in order of 8 Hadamard codes with 8 bits of code length, respectively. ), (1,5,8), (1,6,7), (1,6,8), (1,7,8) are generated by puncturing each three bits of the position pattern.

In the present invention, all of the above 21 patterns are selectively used. However, as in the above-mentioned short identifier codes of Table 9, the first and second bits of the Hadamard code, which are commonly 8 bits in length, are punctured, and then the remaining 1 bits are punctured in 6 patterns ( 1,2,3), (1,2,4), (1,2,5), (1,2,6), (1,2,7), (1,2,8) position patterns preferentially Used as

Therefore, the first and second bits of the Hadamard code and 8 bits of arbitrary length are punctured to generate identifier codes having a code length of 5 bits.

The 21 generated short identifier codes of 5 bits in length have the same minimum hamming distance.

However, these 21 short identifier codes have different performances according to the Doppler frequency. Accordingly, in the present invention, as shown in Table 6, the first and second of the 21-bit short identifier codes of Hadamard codes having 8-bit code length are shown in Table 6. And a short identifier code of the (1, 2, 6) position pattern generated by puncturing the sixth bit is selected and used first.

Next, in Table 7, the FBI for each slot is 2 bits, and the temporary identifier codes allocated when the active set size is 3 or more and 8 or less are generated as follows.

First, the 8 long identifier codes of 16 code lengths use the Hadamard codes of 16 code lengths, and the 14 code lengths transmitted by being inserted into one radio frame together with the 8 long identifier codes of 16 code lengths. The identifier code is generated by puncturing the first and second bits of eight Hadamard codes that are 16 bits long.

The following 8 medium identifier codes with a code length of 8 use the Hadamard codes with a code length of 8, and the code length of 6 transmitted with the 8 medium identifier codes of this code length of 8 is inserted in one radio frame. The identifier code is generated by puncturing the first and second bits of eight Hadamard codes that are eight bits long. The next 8 short identifier codes of length 6 are also generated by puncturing the first and second bits of the 8 Hadamard codes, which are 8 bits long.

The UE determines one of the generated SSDT identifier codes as the primary cell identifier code and periodically transmits the identifier code to the cells belonging to the active group. In this case, the user terminal UE transmits the identifier code to the cells belonging to the active group. To pass.

The following describes the temporary identifier codes of identifier labels A and B1 generated based on the orthogonal codes having orthogonality to each other.

 The temporary identifier codes of the identifier labels A and B1 may include two or less UEs belonging to the active group when the number of cells belonging to the active set, that is, the active set size is 2 or less. Assign to each valid cell.

In Table 6, temporary identifier codes allocated when the FBI for each slot is 1 bit and the active set size is 2 or less are generated as follows.

First, two long identifier codes with a code length of 15 are generated by puncturing the first bit of a quadrature code having a code length of 16. In this case, since all bit values of each code are equal to 0 or 1, any bit can be punctured. However, when the first bit is punctured, it has commonality with the puncturing algorithm used when puncturing the Hadamard code described above. There is an implementation advantage. The identifier code with identifier label B1 is orthogonal code for A.

The following two medium identifier codes with a code length of 8 use the same orthogonal codes with a code length of 8, and the code length of 7 is inserted into one radio frame with two medium identifier codes of this code length of 8 and transmitted. The identifier code is generated by puncturing the first bit of two Hadamard codes that are eight bits long. In this case, since all bit values of each code are equal to 0 or 1, any bit can be punctured. However, when the first bit is punctured, it has commonality with the puncturing algorithm used when puncturing the Hadamard code described above. There is an implementation advantage.

The next two short identifier codes with a code length of 5 preferentially puncture the first bit in a quadrature code with a code length of 8, and then add the remaining two bits as in the 21 patterns in Hadamard code described above. Created by puncturing. In this case, the first, second, and sixth bits of the 8-bit orthogonal code of the code length among the 21 short identifier codes are punctured to have commonality with the puncturing algorithm used when puncturing the Hadamard code. The short identifier code of the (1,2,6) position pattern generated by the filtering is selected first and used.

Next, in Table 7, the temporary identifier codes allocated to each slot when the FBI is 2 bits and the active set size is 2 or less are generated as follows. In this case, consider the commonality with the case of puncturing Hadamard code.

First, two long identifier codes with a code length of 16 use the same orthogonal codes with a code length of 16, and two long identifier codes with a code length of 16 have a code length of 14 which is inserted into a radio frame and transmitted. The identifier code is generated by puncturing the first and second bits of two orthogonal codes that are 16 bits long.

The following two medium identifier codes with a code length of 8 use the same orthogonal codes with a code length of 8, and the code length of 6 with the two medium identifier codes of this code length of 8 is inserted into one radio frame and transmitted. The identifier code is generated by puncturing the first bit and the second bit of two orthogonal codes, which are eight bits long. The next two short identifier codes of length 6 are also generated by puncturing the first and second bits of the two orthogonal codes of length 8 bits.

The UE determines one of the generated SSDT identifier codes as the primary cell identifier code and periodically transmits the identifier code to two cells belonging to the active group. In this case, the FBI field of the uplink control channel Pass through.

The following describes the transmission operation of the generated SSDT identifier code.

Prior to the description of the SSDT service, the UE is initially operated by the system side (UTRAN) based on the cells of the active group at the time when the UE (UE) operates in the soft handover mode. Thereafter, the system side (UTRAN) of the SSDT option that is active during the current soft handover period informs the cell and the user side (UE).

Accordingly, the UE allocates the identifier code generated to the valid cells according to the active set size of the neighbor, and the soft handover mode operation of the UE is terminated. At that point, the SSDT identifier code is deallocated.

The allocation scheme of the identifier code includes a static allocation technique and a dynamic allocation technique.

Referring to the fixed allocation scheme as an example, an identifier code (eg, a table that is fixed in advance to cells belonging to the active group among neighboring cells at the time when the UE operates in a soft handover mode) is described. 6 or A, B2, C) in Table 7. Then, when the cell belonging to the active group is changed, the user side (UE) assigns a different identifier code (for example, D in Table 6 or Table 7) to the cell entering the active group, and the identifier code assigned to the cell exiting the active group. (E.g., B2) is reserved as a spare code so that it can later be allocated to another cell.

However, in the active allocation scheme, an identifier code (for example, A of Table 6 or Table 7) is previously assigned to cells belonging to an active group among neighboring cells at the time when the UE (UE) operates in soft handover mode. , B2, C), if the cell belonging to the active group is changed afterwards, the user side (UE) assigns the identifier code that was assigned to the cell exiting from the active group to the new cell.

According to the present invention, optimal performance can be obtained not only in the active allocation scheme but also in the fixed allocation scheme.

In addition, the present invention allocates an identifier code generated based on the Hadamard code according to the number of cells belonging to the active group, that is, the size of the active group (when the active group size is 3 or more and 8 or less), or based on the orthogonal code. Assign two identifier codes generated (if the active group size is 2 or less).

FIG. 3 is a diagram for describing transmission examples of a cell identification code allocated by the user side (UE) when 1 bit is inserted into the FBI field for each slot in the present invention.

3A illustrates a case in which a long identifier code having a code length of 15 is transmitted in one frame, and the UE (UE) has eight identifier codes having a code length of 15 based on the Hadamard code (identifier label) according to the size of the active group. One of A, B2, C, D, E, F, G, H) or two identifier codes of code length 15 based on the orthogonal code (identifier labels A and B1) into the FBI field of each slot. Insert by 1 bit and send. Therefore, in this case, the number of site selections for selecting a primary cell per frame is once.

Next, FIG. 3B illustrates a case in which a medium identifier code having a code length of 8 and a medium identifier code having a code length of 7 are transmitted together in one frame. The UE (UE) is a code based on the Hadamard code shown in Table 6 according to the size of an active group. One of eight identifier codes of length 8 (identifier labels A, B2, C, D, E, F, G, H) or two identifier codes of code length 8 based on orthogonal codes (identifier labels A, B1) One selected one is inserted into the FBI field of the first 8 slots by 1 bit, and the remaining 7 slots have 8 identifier codes of code length 7 based on the Hadamard code shown in Table 6 (identifier labels A, B2, C, and D). One of two identifier codes (identifier labels A and B1) having a code length of 7 based on the orthogonal code selected from E, F, G, and H) is inserted into each FBI field and transmitted. Therefore, in this case, the number of site selections for selecting a primary cell per frame is twice.

Next, FIG. 3C illustrates a case in which a short identifier code having a code length of 5 is transmitted three times in one frame, and according to the size of the active group, the UE (UE) has eight identifier codes having a code length of 5 based on the Hadamard code shown in Table 6. (Identifier labels A, B2, C, D, E, F, G, H) or two identifier codes (identifier labels A and B1) of code length 5 based on the orthogonal code, each of 5 slot units Transmit by repeatedly inserting one bit into the FBI field. Therefore, in this case, the number of site selections for selecting a primary cell per frame is three times.

FIG. 4 is a diagram for describing transmission examples of a cell identification code allocated by the user side (UE) when 2 bits are inserted into the FBI field for each slot in the present invention.

4A illustrates a case in which a long identifier code having a code length of 16 and a long identifier code having a code length of 15 are transmitted together in one frame. According to the size of an active group, the UE (UE) has a code length based on the Hadamard code shown in Table 7. Select one of eight identifier codes of 16 or code length based on two orthogonal codes Insert one of the two identifier codes of length 16 into the FBI field of the first eight slots with 2 bits for each column and the remaining seven In the slot, one selected from eight identifier codes of code length 14 based on Hadamard codes shown in Table 7 or one selected from two identifier codes of code length 14 based on orthogonal codes is inserted into each FBI field by two bits for each column. To transmit. Therefore, in this case, the number of site selections for selecting a primary cell per frame is twice.

4B illustrates a case in which a medium identifier code having a code length of 8 and a medium identifier code having a code length of 6 are transmitted together in one frame, and according to the size of the active group, the UE (UE) is based on the Hadamard code shown in Table 7 below. One selected from eight identifier codes of code length 8 or two identifier codes of code length 8 based on the orthogonal code, repeated three times, two bits per column, in each FBI field in four slots of the first 12 slots In the remaining three slots, one selected from eight identifier codes having a code length of 6 based on the Hadamard code shown in Table 7 or one selected from two identifier codes having a code length of 6 based on the orthogonal code is inserted into each FBI field. Insert by 2 bits and send. In this case, therefore, the number of site selections for selecting a primary cell per frame is four times.

4C shows a case in which a short identifier code having a code length of 6 is transmitted five times in one frame, and according to the size of the active group, the UE (UE) has eight identifier codes having a code length of 6 based on the Hadamard code shown in Table 7 below. One selected from two identifier codes having a code length of 6 based on the one selected from or the orthogonal codes is repeatedly inserted by two bits in each FBI field of three slot units and transmitted. In this case, therefore, the number of site selections for selecting a primary cell per frame is five times.

The transmission of the cell identification code allocated by the above UE side obtains the maximum minimum Hamming Distance based on the active allocation scheme.

The following describes the optimal SSDT identifier code allocation examples of the present invention, using the active allocation technique described above.

First, when the UE is operating in soft handover mode, when the number of cells belonging to the active group is 2, that is, when the active group size is 2, the identifier in Table 6 or Table 7 above. An identifier code based on the orthogonal codes corresponding to labels A and B1 is assigned to each valid cell in the active group. After that, if the number of effective cells of the active group increases and the size of the active group becomes 3, the identifier codes based on the Hadamard codes corresponding to the identifier labels A, B2, and C in Table 6 or Table 7 above are used. Each of the valid cells is allocated.

Second, if the active group size is 2 at the time when the UE operates in the soft handover mode, the orthogonal codes corresponding to the identifier labels A and B1 in Table 6 or Table 7 above are applied. Based on the identifier code is assigned to the two valid cells in the active group, respectively. Thereafter, if the number of effective cells of the active group is not increased and the cells of the active group are changed, the UE (UE) assigns the identifier code, which was assigned to the cell exiting from the active group, to the cell newly entering the active group. This is an assignment procedure based on an active assignment scheme. Of course, in the case of a fixed assignment scheme, one of the identifier codes based on the Hadamard code is assigned to a new cell in the active group.

Third, when the UE is operating in the soft handover mode, when the number of cells belonging to the active group is 2, that is, when the active group size is 2, the identifier in Table 6 or Table 7 above. An identifier code based on the orthogonal codes corresponding to labels A and B1 is assigned to each valid cell in the active group. After that, if the number of effective cells of the active group increases and the size of the active group becomes 3, the identifier codes based on the Hadamard codes corresponding to the identifier labels A, B2, and C in Table 6 or Table 7 above are assigned to the three active members. Each of the valid cells is allocated. If the number of active cells in the active group is increased again, an unassigned identifier code among the identifier codes based on the Hadamard code in Table 6 or Table 7 is allocated to the new valid cells in the active group, whereas active If the number of effective cells in the group decreases and the size of the active group becomes 2 again, the identifier code based on the orthogonal codes corresponding to the identifier labels A and B1 in Table 6 or Table 7 above is applied to the two valid cells in the active group. Assign each one.

The following Table 12 shows the code form of the present invention according to the active group size of the UE when the SSDT cell identification code is allocated by the active allocation scheme.

Active group size 2 or less 3 to 8 Code form Orthogonal mode Ortho code (Hadamard code)

The following Table 13 shows the minimum hamming distance of the SSDT temporary identifier code according to the active group size proposed in the present invention when the FBI is 1 bit per slot, and the following Table 14 is the case where the FBI is 2 bits per slot The minimum Hamming distance of the SSDT temporary identifier code according to the size of the active group proposed in the present invention is shown. In Table 13 and Table 14, the numbers in parentheses indicate the minimum Hamming distance when identifier codes are generated by puncturing.

Active group size Identifier code Long Medium Short 2 or less 15 8 (7) 5 3 to 8 8 4 2

Active group size Identifier code Long Medium Short 2 or less 16 (14) 8 (6) 6 3 to 8 8 (7) 4 (3) 3

In addition to the SSDT, the identifier code proposed in the present invention can be used when UE transmits its own cell information to the system side (UTRAN) in addition to SSDT. Can be.

In particular, the SSDT identifier code generated by using the Hadamard code, as in the present invention, is applied to both the compressed mode and the normal mode, and in particular, performs better in the compressed mode. .

In the compressed mode, a part of the data is deleted and transmitted. In this case, the hamming distance characteristic of each code is more sensitively reflected to the performance, and thus the present invention is more useful.

As described above, according to the optimal cell identification code generation and transmission method thereof according to the present invention, in identifying each cell in the SSDT, a cell identification code based on the Hadamard code or the orthogonal code is generated according to the size of the active group. By selectively assigning to active cells of the active group, it is possible to maximize the use of the fast cycle identifier code to maximize system performance in the padding channel and the AWGN channel.

In addition, in the present invention, by assigning the Hadamard code or the orthogonal code selectively according to the size of the active group, the absolute value of the maximum cross-correlation function is small and the minimum Hamming distance is maximum. Accordingly, optimal diversity performance can be exhibited in soft handover mode.

Those skilled in the art will appreciate that various changes and modifications can be made without departing from the spirit of the present invention.

Therefore, the technical scope of the present invention should not be limited to the contents described in the embodiments, but should be defined by the claims.

Claims (24)

Selecting a priority cell among the cells based on the levels of common pilot signals received from the cells; Generating, as a cell identification code of the selected priority cell, a code puncturing at least one bit of a selected one of the Hadamard codes; Inserting the cell identification code of the priority cell once or repeatedly two or more times into a feedback identifier field of each slot of one radio frame; And Transmitting the cell identification code of the priority cell inserted into the radio frame to the cells via an uplink control channel; But When the length of the cell identification code repeatedly inserted two or more times is longer than the length of the feedback identifier included in the one radio frame, Puncturing and inserting the first bit of any one of the cell identification codes repeatedly inserted two or more times And transmitting the cell identification code for the priority cell in the user device. The method of claim 1, When the length of the cell identification code repeatedly inserted two or more times is longer than the length of the feedback identifier included in the one radio frame, The cell identification code in which the first bit is punctured is the cell identification code inserted last. Transmitting a cell identification code for priority cells in a user device delete The method of claim 1, And a length of a feedback identifier included in the one radio frame is 15 bits. delete The method of claim 1, A pair of bits of the selected Hadamard code are punctured to generate the cell identification code of the priority cell Characterized by, Wherein the pair of bits are the first bit of the first half of the selected Hadamard code and the first bit of the second half of the selected Hadamard code And generating and transmitting a cell identification code for the priority cell in the user device. The method of claim 1, And a first bit of the selected Hadamard code is punctured to generate the cell identification code of the priority cell. The method of claim 1, At least one other bit from the first bit of the selected Hadamard code is punctured to generate the cell identification code of the priority cell. . The method of claim 8, Wherein said at least one other bit is a second bit of said selected Hadamard code. The method of claim 8, Wherein said at least one other bit is a second bit and a sixth bit of said selected Hadamard code. The method of claim 1, The cell identification code of the priority cell is inserted into each feedback identifier (FBI) field of each slot in the radio frame by 1 bit or 2 bits to generate and transmit the cell identification code for the priority cell. How to. The method of claim 1, And wherein said selected Hadamard codes have a code length of 8 bits or 16 bits, respectively. The method of claim 1, And wherein the first bit value of the selected Hadamard codes has all zeros. Selecting one of at least one bit punctured Hadamard codes and a quadrature code, depending on the number of cells, to generate as cell identification codes of the cells; Periodically measuring levels of common pilot signals received from the cells to periodically select a priority cell among the cells; And And periodically transmitting the generated cell identification code of the priority cell to the cells. The method of claim 14, A pair of bits of each Hadamard code are punctured to generate a cell identification code of the corresponding cell, Wherein the pair of bits are the first bit of the first half of each of the Hadamard codes and the first bit of the second half of the Hadamard codes. And how to transfer. 15. The method of claim 14, wherein the first bit of each Hadamard code is punctured to generate a cell identification code of the corresponding cell. 15. The cell identification code of claim 14, wherein the first bit of each Hadamard code and at least one other bit are punctured to generate a cell identification code of the corresponding cell. And how to transfer. 18. The method of claim 17, wherein the at least one other bit is a second bit of each Hadamard code. 18. The method of claim 17, wherein the at least one other bit is a second bit and a sixth bit of each Hadamard code. 15. The cell identification code of claim 14, wherein each cell identification code is inserted into each feedback identifier (FBI) field of each slot in one radio frame by 1 bit or 2 bits. How to create and send. The method of claim 14, Wherein said Hadamard codes have a code length of 8 bits or 16 bits, respectively. 15. The method of claim 14, wherein the first column of Hadamard codes has all zero bit values. 15. The method of claim 14, wherein the orthogonal codes are used to generate cell identification codes of the cells when the number of cells is two or less than two. Way. 15. The cell of claim 14, wherein the at least one bit punctured Hadamard codes, respectively, when the number of cells is greater than 3 or greater than 3 are used to generate cell identification codes of the cells. How to generate and send an identification code.

Images