TW200904090A - Method of generating random access preambles in wireless communication system - Google Patents

Abstract

A method of generating random access preambles includes receiving information on a source logical index and generating random access preambles in the order of increasing cyclic shift from root ZC sequences with the consecutive logical indexes from the beginning of the source logical index until a predetermined number of the random access preambles are found, wherein the consecutive logical indexes are mapped to root indexes of the root ZC sequences.

Description

200904090 IX. Description of the Invention: [Technical Field] The present invention relates to a wireless communication, and more particularly to a method for generating a random access sequence in a wireless communication system. [Prior Art] The third generation partnership project (3GPP, "Third generation partnership project") mobile communication technology of WCDMA ("Wideband c〇de division muitipie access") is used in It is widely used all over the world. A high speed downlink packet access (HSDPA, "High Speed Downlink Packet Access"), which can be defined as the first evaluation phase of WCDM A, provides a highly competitive radio access technology in the near future. However, as radio access technology continues to evolve to meet increasing demands and expectations of users and providers, new technology evolution is needed in 3GPP to ensure future competitiveness. One of the systems considered to be a third-generation system is the Orthogonal Frequency Division Multiplexing (OFDM) system, which reduces inter-symbol interference (ISI, "Inter) -symbol interference"). In OFDM, the data symbols of the sequence input are converted into N parallel data symbols, which are transmitted on n orthogonal subcarriers. The secondary carriers can maintain orthogonality in the frequency domain. Individual orthogonal channels experience independent frequency selective attenuation, and ISI can be cancelled when the spacing between symbols is long enough. A 200904090 Orthogonal Frequency Division Multiple Access (OFDMA) represents a multiple access method using OFDM as a modulation scheme. In OFDMA, the frequency resources, that is, the times The carrier 'is provided to each user. In this example, since each frequency resource is independently provided to a plurality of users, the frequency resources do not overlap each other. That is, the frequency resources are specifically configured for The user needs to transmit the control information in order to transmit or receive a data packet. For example, the uplink control information includes an acknowledgement (ACK, "Acknowledgement") / NACK (Negative-Acknowledgement) signal, which represents success. Transmission downlink data, channel quality indicator (CQI, ''Channel Quality Indicator'), which represents the quality of the chain channel, a precoding matrix index (PMI, "Precoding matrix Index"), a level indicator (RI, " Rank Indicator") and so on. In addition, a random access sequence needs to be transmitted to perform a random access procedure to serially transmit the uplink control information or the random access sequence. The sequence is transmitted via a control channel or a random access channel in the form of a development code, a user equipment identification code or a _ signature. Figure 1 is a diagram showing an example of a method of implementing a random access procedure in a WCDMA system. The random access procedure is implemented to allow a user equipment to obtain synchronization with a network, or to obtain Uplink radio resources for transmitting uplink data. Referring to FIG. 1, a user equipment transmits a sequence via a physical random access channel (PRACH, "Physical Random Access Channel").

200904090 The physical random access channel is an up key physical channel. The preamble is transmitted during the 1.33ms access slot. The preamble is randomly selected from 16 prefaces. Upon receiving the preamble from the user equipment, a base station transmits a response via an AICH ("Acquisition indicator channel") for one of the downlink physical channel. The base station transmits an acknowledgment (ACK) or an unacknowledged (NACK) to the user equipment via the AICH. If the user equipment receives the ACK, the user equipment transmits the message of length i〇ms or 20ms by using an Orthogonal Variable Spreading Factor (OVSF) code corresponding to the preamble. If the user equipment receives the NACK, the user equipment transmits the preamble again at an appropriate time. If the user equipment cannot receive a response corresponding to the previously transmitted preamble, the user equipment is in a After the determined access slot, a new preamble is transmitted, and the power level of the new preamble is higher than the power level of the previous preamble. The user equipment obtains information on 16 preambles (ie, sequences) and uses the self. The preamble selected from the 16 preambles as a preamble in the random access procedure increases the signaling burden if the base station notifies the user equipment about the information of each available sequence J. Therefore, in summary, The base station first month! j refers to the complex sequence, *,, ' and transmits an index of the sequence groups to the 16 preambles. Λ + a 沾 此 this purpose 'this use The equipment and the base station respectively do not store the sequence groups according to the extravagant bows in their buffers. Therefore, in the sequence of the heat sequence monuments belonging to the special sequence group, the number of < Or an increase in the number of sequence sets can lead to an increase in burden. 8 200904090 To improve the performance and increase functionality of data detection in the receiver, the correlation of the sequence or & subcube metric (CM,, 'Cubic Metric") Features must be guaranteed to some degree. + A ^ ^ This represents the sequence of sequence groups belonging to the random access procedure and must be right ^, /, with a certain degree of correlation guaranteed

Or CM characteristics. In particular, the field & ^ L loss is used in a sequence of high-speed environments where the user is moving at a rate of *3〇km/h or faster and is used in a low-speed environment. Used separately to ensure sequence characteristics under consideration of the Doppler effect. Therefore, the search for a party and a vehicle to use a small amount of signaling burden can guarantee the characteristics of the sequence for transmitting the uplink control information. SUMMARY OF THE INVENTION The present invention provides a method for generating a sequence of roots Zadoff-Chu (ZC) sequences to achieve sequence generation. The present invention provides a method for implementing a random access procedure using a logical index of a root ZC sequence in a wireless communication system. The present invention provides a logical index using a root ZC sequence to generate a random access preamble. In the case of a carcinoid, the invention provides a logical side-by-side method for generating a root Zad0ff-Chu(zc) sequence. The method comprises a plurality of root indices of the root ZC sequence according to a predetermined cyclic offset parameter. The region is divided into one or more subgroup subgroups including at least one index of the root zc sequence, and the root index of the root ZC sequence in the group is mapped to a continuous logical index. In addition, the present invention provides a A method for implementing a random access procedure in a wireless communication system 200904090. The method includes selecting a random access sequence from a plurality of random preambles, the plurality of random access sequences being available by a root ZC sequence having a continuous logical index The cyclic offset generates 'where the consecutive logical index is mapped to the root ZC sequence index' to transmit the selected random access preamble and receives the selected random access One of the identifiers of the text randomly accesses the response. In yet another aspect, the present invention provides a method of implementing a random access procedure in a wireless communication, the method comprising transmitting a source index to generate a plurality of random accesses The preamble and a predetermined cyclic partial number are received from a random preamble selected from the plurality of random access preambles, the plurality of random access preambles being at least one consecutive having the source logic and the logical index of the visitor The root ZC sequence of the logical index may be generated by a cyclic offset and transmit a random access response including one of the random access preambles. In yet another aspect thereof, the present invention provides a method of generating a random store. The method includes gradually increasing a cyclic offset by a first zc sequence having a root index mapped to a first logical index to sequentially random access the preamble, and when the predetermined number of random access preambles cannot the first root When the ZC sequence is generated, the cyclic offset is gradually increased by the second zc sequence having the second index of the second logical pair to generate an additional random access preamble. When the index is followed by the first logical index. In yet another aspect, a method for generating a random access sequence receives information on a source logical index and accesses the text from the source logic. Selecting the system logic to shift the access index column to identify the sequence first generated enough to be followed by the sequence. This includes causing 10 200904090 points to gradually increase the cyclic offset of the root ZC sequence (which has a continuous logical index). The random access preamble is generated until a predetermined number of random access preambles are found, wherein the consecutive logical index is mapped to the root index of the root ZC sequence. [Embodiment] FIG. 2 shows a wireless Communication system. The wireless communication system can be widely used to provide a variety of communication services, such as voice and packet data. Referring to FIG. 2, a wireless communication system includes a user equipment (UE, "User equipment',) 1" and a base station (BS, "Base station"). 20 = UE 1 can be fixed or mobile. It can be called other names, such as a mobile station (MS, "Mobile station"), a user terminal (UT, "User terminal''), a subscriber station (SS, "Suscriber station"), a wireless Device, etc. BS 20 is a fixed station that communicates with UE 10 and may also be referred to as Node-B, a base transceiver system (BTS, "Base

Transceiver System"), an access point (AP, "Access Point"), etc. One or more units may exist in the BS 20. Hereinafter, the downlink represents the delivery to the UE 10 by the BS 20, and the upper chain represents The UE 10 is passed to the BS 20. In the downlink, 'a transmitter can be part of the BS 20' and a receiver can be part of the UE 10. In the uplink, a transmitter can be a UE 10 Partially, a receiver can be part of bs20. There are no restrictions on the multiple access technology applied to the wireless communication system. For example, multiple multiple access technologies can be used, for example (CDMA, 11 200904090 "Code Division Multiple Access”), (TDMA, “Time

Division Multiple Access"), (FDMA, "Frequency Division Multiple Access"), (SC-FDMA, "Single Carrier-FDMA,"), and OFDMA (Orthogonal Frequency Division Multiple Access). For the sake of clarity, an OFDMA-based wireless communication system will be described below. OFDM uses a plurality of orthogonal subcarriers. OFDM uses orthogonality between Fast Fourier Transform (IFFT) and Fast Fourier Transform (FFT). A transmitter implements IF FT on the data and transmits the data. A receiver performs an FFT ' on a received signal to recover the original data. The transmitter uses IFFT to combine multiple secondary carriers, and the receiver uses a corresponding FFT to separate the combined multiple secondary carriers. According to OFDM, the receiver complexity can be reduced in a frequency selective attenuation environment in one of the wide frequency channels, and the spectral efficiency can be improved by selectively scheduling in a frequency domain using different channel characteristics of the secondary carrier. OFDMA is a multiple access scheme based on 〇fdM. According to OFDMA, different subcarriers can be configured for a plurality of users' thereby improving the efficiency of radio resources. It can have a variety of control information 'eg an ACK (acknowledgement) / NACK (unacknowledged) signal' represents whether retransmission must be implemented, a CQI (channel quality indicator) represents the quality of the downlink channel, and one for a random access procedure The random access sequence 'and MIM0 control information' such as a PMI (precoding matrix index) and an RI (rating index). An orthogonal sequence can be used to convey control information. The orthogonal sequence representative has 12 200904090 f y

A sequence of well-connected features. The orthogonal sequence may include, for example, a Constant Amplitude Auto-Correction sequence (CAZAC). About a ZC (Zadoff-Chu) sequence, that is, the kth element c of one of the ZZ sequences of the CAZAC sequence ( k), which corresponds to an index can be expressed as follows: [Formula 1] c(k) = exp{-j^k(k + ^}, N is an odd number N Fixed Zero ---Μ,

c(k) = exp{-^^-}, N is even N %

Where N is the length of the root ZC sequence, and the root index is Μ and N. If Ν is a prime number, the number of root indexes of the ZC sequence is Ν-1. The ZC sequence c(k) has the following three characteristics. [Formula 2] |c(k)| = l, for all k, N, M, mutual will be [Equation 3] [Formula 4] RMvMv^=C〇nSt For all M i, Μ 2 Equation 2 represents The size of the ZC sequence is always 1 and Equation 3 represents the automatic phase relationship of the 13 200904090 ZC sequence expressed as a Dirac-delta function. Here, the automatic phase relationship is based on loop correlation. Equation 4 represents that the interaction is always a constant. In a wireless communication system, if it is assumed that the early element is distinguished by the root index of the ZC sequence, the user equipment will need to know an index, or a group of indexes, which can be used within a unit, and The base station must broadcast an available root index or an available root index group to the user equipment. If the length of the ZC sequence is N, the number of root indices will be the number of N prime numbers among the natural numbers less than N. If N is a prime number, the number of root indexes will be N-1. In this example, in order for the base station to inform the user equipment of one of the number of N - 1 root indexes, a ceil (log 2 (N - 1)) bit will be required. Ceil(x) represents the smallest integer greater than X. Each cell can use a variety of root indexes depending on the cell radius. If the cell radius increases, the number of ZC sequences that can maintain orthogonality via the cyclic offset, i.e., due to the effects of transfer delay or round trip delay and/or delay spread, is reduced. That is, if the radius of the cell increases, although the length of the ZC sequence is fixed (conventional, consistent), the number of cyclic offsets available in a corresponding root index can be reduced. Since the sequences generated by the cyclic offset in the root index have orthogonality with each other, they are also referred to as a Zero Related Area (ZCZ, "Zero Correlation Zone") sequence. The minimum number of ZC sequences configured for the user equipment in each unit should be ensured. Therefore, if the cell radius increases, the number of root indices used in each cell increases to ensure the minimum number of ZC sequences. 14 200904090 It is assumed that the group of root ZC indexes available in each early element is R i , and the number of groups of root ZC indexes in all units is set to Μ. This can be expressed as Ri, R2, ..., RM. If Ri=l 0 is set, the setting is

The unit of Ri = 1 0 uses 10 root ZC indexes. The assumption is based on the radius of each unit N = 839, M = 7 ' R1 = 1 ' R2 = 2, R3 = 4 ' R4 = 8 ' R5 = 16, R6 = 32, and R7 = 64. Then, if the cell radius is large, a minimum of 7 bits (ceil(log2(7)) + ceil(log2(838/64)) = 7 bits) are required to transmit the control information, and if the cell radius is small, then A maximum of 13 bits (ceil(log2(7)) + ceil(log2(838/l))=13 bits) are required to transmit control information. When the wireless communication system is more advanced, the demand for a higher transmission rate is increased, and the unit having a smaller radius will increase. Since these cells with small radii use only a single ZC index, they require more bits to transmit control information, which may cause a signal burden. Therefore, there is a need in each unit for a technique that reduces the number of bits required for signaling. In particular, it is important to reduce the number of signaling bits in a cell having a small cell radius. Figure 3 is a flow chart illustrating the procedure for a method of generating a sequence in accordance with an exemplary embodiment of the present invention. Referring to Figure 3, the plurality of root ZC sequences are divided into one or more subgroups according to a predetermined cyclic offset parameter (S 11 0). These subgroups include at least one ZC sequence. If the loop offset parameter is Ncs, a ZC sequence has a zero correlation region of length Ncs-Ι. The loop offset parameter is a parameter used to obtain a cyclic offset unit of the root ZC sequence, and the 15 200904090 subgroups may be ordered according to the loop offset parameter. Because of the high speed in the high-speed environment, the cyclic offset unit uses the cyclic offset 杈 杈 杈 according to each of the second effects: the radii of the element and the Doppler shift of the detection phase. The cyclic offset unit is a unit for cyclically offsetting the root order number to obtain a root shield frequency offset parameter of the root ZC sequence that is less than or equal to the root. The predetermined cyclic offset parameter of the group. The root value of the root zc sequence is greater than the cyclic offset parameter of the root ZC sequence. The number of the root ZC sequences is sorted according to CM in a subgroup (square metric row ordering (S120). The CM characteristics of the zc sequences according to the order of the root zc sequence of the CM characteristics (according to the root ZC index Combine) to order the root ZC sequences "for the root zc sequence metrics sorted in a group, use the correlation correlation, the peak-to-peak power ratio "peak-t0-Average power Rati0"), the Doppler frequency, and R, and so on. The ordering according to the interactive association characteristic represents sorting the roots z according to the /c correlation of the zc sequence (according to the combination of the root ZC indexes): the ordering according to the (10) characteristics represents: according to the zc sequences. (, a combination of equal root ZC indices) to order the roots in order: the ordering of the frequency characteristics represents the ordering of the root zc sequences based on the degree of stability of the root indices to the rate. The Muller class can be obtained by using a ~-moving unit in a relatively high mobility unit or stable DuPont. If one, according to the ":: use the limit of the cyclic offset '... column of the extravagant; sex to sort (or group can support early ... or a maximum supportable loop remake special grouping). The root index of the root ZC sequence can be divided into subgroups by the maximum supportable cyclic offset parameter of the root z C cyclic sequence of the 200904090, and the predetermined cyclic offset parameter, thereby being divided into subgroups in each subgroup. The root ZC sequence can have similar characteristics. The entity root index of the root ZC sequence belonging to a subgroup is mapped to a continuous logical index (S 130). The entity root index represents the root index of the ZC sequence, which is actually used by the base station and/or the user equipment to transmit control information or a random access sequence. These logical indexes represent the logical.root indexes to which the entity root indexes are mapped. As described above, if the root ZC sequences are divided into subgroups according to the predetermined cyclic offset parameter, and the consecutive logical indexes are configured in the subgroups, the base station may notify the user equipment Only at least one logical index is provided to provide information about a plurality of ZC sequences having similar characteristics. For example, it assumes that the root ZC sequences are ordered in a subgroup according to the CM, and a single logical index is notified to the user device. The user equipment then generates the root ZC sequence from the entity root indexes to which the received single logical index is mapped. If the number of ZC sequences generated by the single logical index (eg, the number of available cyclic offsets for the ZC sequences) is insufficient, the user device will be mapped to a logical index adjacent to one of the received logical indices. The entity root index to generate a new root ZC sequence. Because adjacent (continuous) logical indexes have similar CM characteristics, even if only one logical index is given, the user equipment can generate a plurality of ZC sequences having similar CM characteristics. <Sorting Example According to CM Characteristics> 17 200904090 FIG. 4 is a graph showing CM (cubic metric) characteristics and maximum supportable unit radius characteristics according to an entity root index according to an exemplary embodiment of the present invention. Figure 5 is a graph of CM characteristics and maximum supportable cell radius characteristics according to a logical root index in accordance with an exemplary embodiment of the present invention. Figure 6 is a graph showing CM characteristics and maximum supportable cell radius characteristics according to a logical root index in another exemplary embodiment of the present invention. If "N" is the length of a ZC sequence, the entity root index in Figure 4 can be expressed as Up = 1, 2, 3, ..., N-3, N-2, N_1. Figure 5 shows that the entity root index 'is alternately selected one by one from start to finish and reorder them into UL=1, N-1, 2, N-2, 3, N-3, 4,. .. the results obtained. Figure 6 shows the results obtained by sorting the entities in Figure 4 as the CM values corresponding to the logical indices. Table 1 shows examples of CM-based ordering of root indexes and logical indexes for these entities. [Table 1] Logical index entity root index 1 838 2 837 836 3 4 835 834 5 833 6 832 7 8 831 9 830 10 829 828 11 1-50 12 827 826 13 14 825 1 5 824 823 16 822 17 19 820 18 82 1 818 189 21 20 23 817 S16 22 815 26 813 24 25 814 29 812 810 809 27 811 30 2g 808 31 804 33 805 32 34 35 807 806 51-100 799 36 40 803 797 42 798 38 801 41 37 39 802 800 796 790 43 44 49 7 89 795 52 50 788 787 51 793 47 791 46 4S 792 794 786 53 45 64 774 55 775 785 54 65 784 64 776 69 783 773 56 101-150 779 772 769 770 77 1 70 60 67 61 66 59 780 777 68 778 57 62 782 781 71 58 768 93 746 72 767 764 75 104 763 94 76 735 745 105 734 92 7 3 766 103 747 765 736 74 95 737 744 101 102 151~200 748 738 91 99 740 90 749 762 77 98 741 100 755 743 84 96 739 757 82 78 761 83 756 106 733 168 671 754 85 97 753 86 742 89 750 758 81 732 107 88 751 79 80 759 760 670 167 672 169 87 201~250 752 731 108 669 1 70 673 109 166 730 171 674 165 668 172 667 728 111 665 174 186 729 675 1 10 653 164 175 187 666 664 173 652 18 200904090 3 6 ο 6 2 6 0 2 4 3 3 1 6 6 1 6 2 8 12 5 1 7> - 9 8 0 7 12 6 17 9 5 9 0 3 1 2 6 - 6 14 7 2 3 6 7 6 5 4 5 8 0 2 12 7 7 7 6 2 17 5 3 6 6 9 15 3 0 1 6 2 1 8 8 8 0 8 7 2 16 3 0 3 2 8 1 7 6 1 3 5 4 6 6 6 0 4 0 6 8 5 -_*XO 2 3 1 13 6 ο 1 0 8 2 6 4 5 5 0 6 2 207 159 ο 3 ο 5 3 9 9 7 8 2 5 11 -6 n 3 0 7 9 17 1 2 1 7 2 8 7 4 4 6 6 6 8 7 2 9 9 8 2 5 0 0 9 6 2 16 4 2 1 2 9 8 7 11 7 0 2 3 8 8 6 16 6 7 3 5 5 4 6 6 6 6 0 6 2 2 9 6 4 8 3 4 5 6 6 6 4 9 8 9 17 tj 7» 1i 0 9 1 4 7 6 6 16 5 0 8 4 11 6 17 3 7 1 0 4 2 2 6 1 6 2 4 6 6 6 2 11 6 9 νχ 1 9 9 9 4 1 6 3 9 18 5 τ 6 ο 4 5 3 2 717 683 21 1 122 628 685 154 124 715 716 694 140 123 155 699 684 145 700 704 686 141 627 335 701 212 139 134 698 702 138 153 705 714 695 144 142 143 697 696 146 213 693 626 136 133 703 706 401~450 8 7 2 6 2 6 2 9 9 5 8 1 16 2 5 9 2 10 2 3 6 1 ο 1 7 3 6 1 4 3 112 2 9 2 6 8 9 8 0 1 6 9 6 2 3 3 3 1 12 6 6 , 2 -02 12 7 8 7 2 9 1 14 6 6 8 2 9 1 12 6 5 1 2 8 2 6 4 2 2 1 2 4 2 2 6 2 6 2 6 112 7 3 2 3 4 6 1 116 2 2 4 9 8 2 6 0 2 5 8 -n 2 ο 1 7 2 6 451-500 7 6 1 2 0 8 2 6 5 2 3 S 13 5 6 2 2 5 4 3 2 3 6 2 2 2 4 2 6 10 7 6 6 5 15 2 10 8 6 6 5 8 7 9 2 3 9 2 2 5 9 17 2 0 5 2 6 2 0 8 0 1 3 4 6 2 2 0 2 9 3 6 6 2 2 2 9 10 0 6 7 6 2 5 231 608 236 603 607 232 235 604 239 577 578 580 260 579 600 259 256 583 571 575 501~550 2 5 6 4 7 8 2 2 5 4 13 6 7 7 2 2 5 9 4 4 6 7 5 5 5 2 8 6 9 6 7 7 2 2 2 14 0 4 6 6 2 5 5 8 7 9 9 6 1 5 2 4 ο 3 - 7 4 2 2 2 4 4 4 5 4 8 4 2 5 2 4 8 2 7 6 5 2 5 2 7 2 7 6 7 8 5 5 5 2 3 5 7 6 8 6 6 9 6 5 2 3 3 7 5 5 2 6 8 6 7 5 2 5 7 6 7 2 2 5 1 J 9 6 2 5 5 4 5 5 8 6 5 8 5 2 5 7 2 4 9 6 9 551~600 9 3 3 4 7 6 2 3 4 9 5 7 8 10 5 4 4 0 6 0 9 2 1 5 4 4 8 2 2 19 3 4 5 4 0 6 9 5 6 0 14 4 5 1 2 4 2 7 246 417 593 422 416 423 248 280 559 591 247 424 414 425 412 427 41 1 428 281 430 374 558 465 376 467 462 557 429 282 436 403 395 _ 601~650 3 4 9 4 4 3 7 17 7 7 4 3 4 4 4 9 1 6 6 0 4 3 4 5 4 4 7 9 5 3 3 5 7 6 8 3 3 2 3 8 9 8 7 5 2 3 4 2 2 2 0 4 7 4 4 4 4 17 4 6 6 4 4 3 16 8 3 4 3 4 4 4 6 0 2 0 7 9 4 4 3 4 4 0 0 3 8 4 4 3 6 4 1 5 8 4 5 2 4 408 437 443 468 435 396 405 397 555 469 370 393 400 287 651~700 6 3 6 8 7 7 2 4 4 0 2 3 4 0 6 4 3 3 9 6 4 3 6 7 4 3 4 2 9 0 5 4 0 5 5 3 701~750 8 5 0 8 8 8 3 3 4 4 4 9 6 9 0 3 2 3 7 5 9 7 4 5 4 5 3 0 2 0 5 5 3 4 4 5 3 7 5 9 9 8 5 4 3-875 3 4 3 9 0 4 9 5 3 3 5 5 12 6 8 9 4 3 2 5 9 7 8 7 5 3 3 4 5 0 9 9 6 8 3 4 2 5 9 8 0 2 3 3 12 3 5 8 9 5 3 2 8 6 0 5 3 4 4 5 5 8 6 1 8 5 0 2 4 3 8 3 9 4 0 9 4 3 2 4 4 5 4 0 5 9 6 2 3 14 9 0 3 3 7 0 3 9 5 2 0 5 4 1 4 5 3 4 4 8 5 5 4 4 3 2 8 4 8 3 5 4 2 0 7 6 6 5 3 3 3 7 51~800 8 8 8 2 8 1 5 4 3 5 7 6 8 9 1 4 4 3 4 19 8 5 9 4 3 4 6 2 0 5 4 0 801~838

6 4 3 4 3 2 3 3 3 7 9 7 1Λ 4 IX 6 4 ο 1 5 5 8 7 3 4 3 0 3 5 3 1 3-2 9 8 1 12 ο 4 5 515 5 4 8 5 2 2 3 3 5 14 3 3 4 6 9 9 2 2 3 5 3 3 2 4 3 0 3 5 7 6 3 3 5 0- 2 1 2-2 ο 5 5 513 5 5 7 9 D 7 7 7 9 2 1 5 2 9 7 ο 3 3 5 0 5 4 3 3 15 7 5 9 2 4 2 5 8 6 2 9 9 1 2 2 3 7 0 4 3 6 3 1 8 3 3 5 4 1 5 3 4 5 18 6 0 3 3 7 2 8 3 5 7 0 9 8 5 1 4 3 3 6 5 8 8 10 4 3 5 4 4 1 J 9 ο 3 4 5 8 4 4 2 3 3 2 9 9 1 4 5 ο 1 9 2 4 3 3 4 6 2- 4 2 2 0-3 5 3 4 8 4 9 3 4 2 9 5 8 3 4 6 0 9 4 4 3 5 2 9 1 4 5 1« 9 ο 2 4 3 3 8 3 1 3 5 0 2 2 0 6 3 1 3 5 Since the entity root indexes are ordered according to the CM characteristics and then mapped to the logical indexes, the CM characteristics of the ZC sequences corresponding to the consecutive logical indexes can be similarly maintained, It is possible to implement a CM-based unit plan. The base station can plan the CM-based unit in a limited power environment, such as a unit that is not very good in a channel environment or a unit with a larger unit radius, and the like. In addition, the base station can use an index with good CM characteristics as a proprietary preamble for submission or similar. User equipment in a bad channel environment already uses its maximum power, so it can hardly achieve a power boost. The base station can then configure an index with good CM characteristics to the user device to increase the probability of detection. 19 200904090 <Sorting Example According to Maximum Supportable Unit Radius Characteristics> FIG. 7 is a CM (cubic metric) characteristic and a maximum supportable unit according to an entity root index according to another exemplary embodiment of the present invention. Half heart 'characteristic chart. Figure 8 is a graph showing CM characteristics according to a logical root index and maximum supported unit radius characteristics in accordance with another exemplary embodiment of the present invention. Figure 9 is a graph showing C Μ characteristics and maximum supportable cell radius characteristics according to a logical root index in still another exemplary embodiment of the present invention. The reference to Fig. 7 to Fig. 9 is shown in Fig. 7. The ordering of the ZC sequences used in Fig. 4 according to the radius of the maximum supportable unit is shown. If "Ν" is the length of the ZC sequence, the entity root index in Figure 7 is =ρ=^ 2, 3, ·.., N-3, N-2 > N-1 by (1/UP) mod N Sort. In this example 'execution of the zc sequence index generated in the time domain (1/Up) mod N represents mapping the zc sequence index generated in the time domain to the ZC sequence index generated in the frequency domain. In other words, this conversion represents the characteristic of the ZC sequence index generated by reordering in a time domain as the ZC sequence index generated in a frequency domain. Figure 8 shows that these indexes are alternately selected one by one from beginning to end, which has been converted from (i/Up) modN by the voluminous UP and reordered into 1, ν", 2, Ν -2, 3, Ν_3, 4 >... results obtained. Figure 9 shows the results obtained by correctly reordering according to the maximum supportable unit radius corresponding to the index of the entities. Table 2 shows the radius-based ordering of the maximum supportable unit. 20 200904090 Example [Table 2] f / Logical Index Entity Root Index 1 2 837 838 419 429 279 280 559 560 210 629 168 336 503 671 140 699 120 ' 1 to 5 0 240 599 719 105 734 93 373 466 746 84 755 229 305 534 61 0 70 769 129 258 581 710 60 779 56 1 12 727 783 367 472 1 48 296 543 691 233 606 265 309 530 574 42 797 40 80 759 799 267 572 73 146 693 .5 1-100 766 35 804 235 302 537 604 355 484 3 1 404 435 808 30 809 29 405 434 810 28 811 27 406 433 812 236 603 1 78 356 483 66 1 74 765 24 48 791 8 1 5 303 536 68 136 703 771 287 552 43 86 753 796 21 101-150 818 266 307 532 573 20 819 39 78 76 1 800 286 553 261 317 522 578 383 456 125 357 482 714 402 437 137 274 565 702 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 546 586 118 721 142 284 555 697 89 750 263 288 551 576 37 802 231 304 535 608 1 2 827 1 s s s 91 374 465 748 10 829 227 306 533 612 400 439 135 270 569 704 143 696 66 132 707 773 25 1 to 300 289 550 83 378 461 756 228 611 9 41 5 424 830 241 598 53 106 733 786 201 638 173 346 493 666 351 488 161 339 500 678 344 495 108 216 623 731 255 584 57 391 448 782 121 718 8 16 823 831 372 467 149 3 0 1 ~ 3 5 0 345 494 690 101 738 254 331 508 585 389 450 257 325 514 582 412 427 245 297 542 594 184 655 197 321 518 642 3 1 1 528 251 294 545 588 64 775 141 282 557 698 7 832 104 208 631 735 392 447 191 382 3 5 1 ~ 400 457 648 318 521 47 396 443 792 273 566 21 8 403 436 621 59 780 13 26 813 826 71 768 269 301 538 570 375 464 82 164 675 757 144 695 87 174 665 752 401 438 49 98 741 790 152 687 169 338 501 670 6 40 1 ~ 45 0 833 119 238 601 720 65 7 74 88 176 663 751 134 705 81 162 677 758 408 431 234 371 4 68 605 17 822 107 366 473 732 330 509 50 100 739 789 138 701 170 340 499 669 1 58 681 249 341 498 590 199 640 451-500 171 342 497 668 154 685 248 343 496 591 215 624 99 370 469 740 347 492 175 350 489 664 353 486 239 300 539 600 1 87 652 21 1 417 422 628 5 834 139 278 561 700 1 53 686 157 314 525 682 200 639 97 194 501 550 645 742 352 487 163 326 513 676 348 491 237 365 474 602 33 S06 75 1 50 689 764 275 564 51 394 445 788 1 89 650 243 298 541 596 114 725 195 322 517 644 212 627 166 332 507 673 299 540 182 364 475 657 5 5 1 -600 393 446 123 246 593 716 319 520 213 313 526 626 333 254 185 327 512 654 244 595 115 362 477 724 250 589 156 3 12 527 683 172 667 601~650 96 192 647 743 54 785 62 124 715 777 292 547 221 397 442 618 224 615 77 381 458 762 359 480 277 281 558 562 4 835 167 334 505 672 186 653 193 323 516 646 247 592 160 320 519 679 369 470 58 1 16 651~700 8 6 2 7 7 8 9 5 2 5 2 7 4 4 7 6 9 2 0 5 2 2 4 6 4 - :7 7 3 6 3 ο 5 2 8 8 •1 4 8 1 6 5 6 5 7 5 5 1 2 7 4 2 2 6 2 7 9 6 10 6 7 7 ο 4 4 4 5 4 5 4 5 9 9 9 5 2 3 8 3 2 0 7 2 9 2 2 6 2 3 0 13 8 7 6 5 3 6 5 7 2 701 ～750 7 6 4 4 12 9 2 1 6 4 5 2 6 0 7 5 4 7 3 3 6 3 3 5 3 6 1 I* 1 0 3 9 4 4 6 9 6 4 9 3 1 2 6 6 5 6 6 5 1 8 1 4 5 4 4 8 6 5 2 3 3 < 7 3 1 7 8 1 4 8 7 7 6 0 8 8 7 - - 2 2' 3 5 4 5 2 14 6 8 7 5 12 3 5 4 4 6 7 8 1 0 8 4 4 1 4 5 4 1 2 9 2 1 17 361 478 722 283 556 63 388 451 776 109 730 102 204 635 737 390 449 751 ~ 800 11 1 222 61 7 728 413 426 230 379 460 609 384 455 45 90 749 794 285 554 67 386 453 772 607 19 38 801 820 41 798 22 44 • 801 ~ 838 9 8 2 7 5 4

The method of reordering according to the maximum supportable unit radius can be applied when a restricted cyclic offset is used in a high speed unit environment. When using the limited loop offset of 200904090, a supportable loop offset parameter N c s value can be changed according to the index. If the entity root index as shown in Figure 4 is used as such, it is difficult to use a contiguous entity index in a single unit. Therefore, indexes that are not repeated for each unit must be configured in the overall network, but this 'causes a problem: a sequence of reuse factors is reduced. Unit planning becomes difficult. This problem can be solved by using a logical index sorted according to the maximum supportable unit radius characteristic, but this sorting according to the maximum supportable unit radius characteristic cannot achieve a <a gain in the CM characteristic. <Sorting Example According to CM Characteristics and Maximum Supportable Unit Radius Characteristics> The sorting according to the CM characteristics and the sorting according to the radius of the maximum supportable unit may have opposite characteristics. A method for simultaneously achieving the gain of the CM characteristic and the maximum supportable unit radius characteristic will now be described. The method of sorting by combining a plurality of characteristics is in accordance with the following procedure. Step 1: The entire index is sorted according to specific (special) characteristics. Step 2 • The entire index is divided into sections (or groups) based on the associated values (grouping). Step 3: The index of the segments is sorted according to the different characteristics in each segment (or group). Step 4: Repeat steps 2 and 3. In this example, when the index is distinguished as a segment, a subsequent segment may be associated with a previous segment, or the subsequent segment may have no relationship with the previous segment, and 22 200904090 may be applied. The rules to the subsequent section. Figure 10 is a graph showing CM characteristics and maximum supportable cell radius characteristics according to a logical root index in accordance with yet another exemplary embodiment of the present invention. That is, Fig. 10 shows the sorting based on the maximum allowable unit radius characteristic 区段 the maximum supportable unit radius group based on the specific value Ncs (predetermined cyclic offset parameter). Figure 11 is a diagram showing the ordering according to the CM characteristics in the grouped segments in Figure 10. Please refer to the first and second diagrams. First, the entire index is sorted according to the radius of the maximum supportable unit, and is divided into sections according to the loop offset parameter Ncs or the maximum supportable unit radius value. The cyclic offset parameter Ncs is to obtain a cyclic offset unit that is supported by each ZC sequence. Table 3 shows an example of the cyclic offset parameter Ncs. [Table 3] Configuration number Number of ZC sequences per unit (no cyclic offset limit) Number of cyclic offsets per ZC sequence (no cyclic offset limit) Cyclic offset [sample] Maximum supportable unit radius [km] Unprotected sample 2 protective samples 1 1 64 13 1.1 0.8 2 2 32 26 2.9 2.6 3 3 22 38 4.5 4.2 4 4 16 52 6.5 6.2 5 5 13 64 8.1 7.8 6 6 11 76 9.8 9.5 7 7 10 83 10.8 10.5 8 8 8 104 13.7 13.4 9 10 7 119 15.8 15.5 10 11 6 139 18.6 18.3 11 13 5 167 22.4 22.1 12 16 4 209 28.3 28.0 23 200904090 13 22 ] 3 279 38.0 37.7 14 32 2 419 57.4 57.1 15 64 1 0 115.8 115.5 16 Reserved\Reserved Reserved Reserved If the Entity Index has these characteristics as shown in Figure 4, the entire index can be sorted according to the maximum supported unit radius as shown in Figure 9. When the segments are distinguished by the maximum supportable unit radius value for the cyclic offset parameters Ncs, the result as shown in Fig. 1 can be obtained. Here, the value "unprotected sample" is used. (,: When the root indexes are sorted according to the CM characteristics in each of the divided sections, the result as shown in Fig. 1 can be obtained. In this example, both the CM and the maximum support are considered. The compound ordering of cell radii is applied to the logical indexes indexed by the entity indexes, as shown in Table 4. [Table 4] / Logical index 9 2 5 8 13 6 0 4 V -2 9 2 9 59, 40_ Entity Root Index 6 9 2 6 6 94 2 6 3 7 5 ο 0 3 ο · 4 ο ο -31 f 5 9 7 7 2 2 7 1 4 3 9 7 8 5 6 0 6 6 0 3 6 4 4 2 3 6 5 3 9 6 4 7 5 3 0 4 0 0 7 6 8 2 3 8 4 6 2 4 0 99'_ 6 2 3 3 9 4 6 5 8 6 3 5 , 2 3 0 9 1 1 ο , 7 3 8 0 | 4 3 0 4 · 6 2 0415i 6 8 6 52 6 2 9 ο 88 5 2 0 11 8 8 5 2 1 18 6 3 3 2 9 2 2 -2 ο 73 4 3 3 4 3 4 5 _ 7 I 5 2 3 ο 4 141 6 8 8 2 81 5 12 ο 5 4 6 6 8 3 5_ 51_ 3 12 8 31 4 -5 61.2_ 5 o_ - 4 4716| 00 5 4 41 2 2 9 2 3 4 2 ο 2 8 482 329 5 1 0 3 1 7 522 14 825 1 5 824 55 784 6 1 778 1 03 736 95 744 729 1 10 151~200 202 63 7 636 203 190 649 717 J22 128 7 1 1 622 2 1 7 256 583 597 253 47 1 368 12 827 23 816 805 34 37 802 793 46 89 750 721 201-250 15 6 15 5 7 5 5 4 6110 7 4 5 9 6 0 3 3 - 6 2 2 3 6 9 9 7 3 >02 2 5 6 16 2 9 1 3 8 1 0 8 1 6 4 3 5 1 8 3 5 8 2 3 0 3 0 3 9 3 9 4 2 5 9 6 0 0 4 9 7 5 2 7 5 1 9 3 4 6 5 4 2 4 8 4 0 9 13 3 ο $ 9 6 8 0 6 2 4 9 10 7 5 3 15 4 4 8 6 2 1 6 6 8 3 5 2 2 6 7 6 2 0 7 8 6 3 ί 3 829 786 53 773 66 57 782 748 83 756 106 733 73 1 1 08 666 1 73 201 638 16 1 251 ～3 0 0 678 121 704 135 143 696 132 707 623 21 6 227 6 12 61 1 228 270 598 241 569 584 255 424 415 374 465 461 378 400 439 448 391 289 30 Bu 350 6 4 7 o S 6 3 14 5 2 5 5 7 5 6 3 3 2 0 3 4 5 5 6 4 5 7 9 9 9 8 4 13 4 14 3 7 5 8 0 2 8 9 4 4 6 5 n H 4· 5 4 9 3 12 6 4 5 4 5 4 3 2 3 3 7 8 9 5 2 4 2 5 9 2 1 3 8 1 3 5 3 0 9 7 0 4 9 8 -5 4 9 3 5 2 5 8 4 ο 12 5 3 6 42 -35 1 ~400 14 5 3 0 9 3 16 6 2 7 8 oo ) 9 6 7 9 2 6 2 18 3 1 8 2 2 8 8 < 17 2 5 5 6 7 1 7 2 18 3 4 6 - 4 2 18 5 5 9 1 5 5 4 2 3 4 790SV nm3 827 5 266666 5 ο 7 3 2 1 5 49182 36 .4 6 403 464 375 443 396 401 447 392 438 457 382 538 301 318 521 833 6 822 401 ~ 4 5 0 17 789 50 774 65 99 740 100 739 758 81 732 107 88 75 1 670 669 170 171 668 175 1 87 664 652 68 1 663 1 19 720 158 176 677 640 451~500 5 3 0 17 3 2 4 3 4 6 2 2 6 9 6 3 41 5 0 8 0 7 3 7 3 3 8 9 1 3 6 0 14 5 4 8 1 3 6 4 14 3 -8 9 0 0 9 7 4 4 4 18 5 7 9 13 4 5 19 8 3 8 6 4 4 1 1 ο 19 4 2 5 3 9 8 0 9 4 5 12 3 2 2 2 9 9 4 15 3 13 4 0 5 3 6 3 8 5 9 9 0 3 0 6 5 5 4 0 7 3 0 4 2 3 3 9 7 4 9 2 4 0 6 0 9 6 4 9 3 3 4 2 3 8 6 3 8 2 4 24 200904090 5 33 806 788 51 785 54 777 62 764 75 762 77 743 96 97 742 673 166 172 501-5 50 667 163 676 185 639 654 200 1 14 725 650 1 15 1 89 724 194 645 195 192 657 644 647 157 182 682 156 683 628 124 71 5 716 123 5 5 5 9 4 7 5 4 4 4 2 2 4 4 6 2 4 3 6 1 3 4 4 2 4 5 2 4 4 0 9 6 6 3 3 4 5 7 2 4 7 2 4 4 5 2 9 12 9 6 4 2 8 3 0 19 4 6 5 5 17 4 2 17 2 4 4 9 6 5 8 4 6 6 2 3 0 0 2 5 5 9 12 2 6 9 7 2 8 4 6 5 5 3 8 8 17 5 2 2 4 3 7 1 5 7 8 2 3 9 13 3 6 9 15 3 2 5 7 17 9 2 2 3 7 4 2 2 6 4 6 5 4 6 3 6 8 4 4 6 2 4 0 6 4 0 9 9 7 5 3 298 359 480 527 3 12 3 1 3 526 525 3 14 487 3 52 327 5 12 5 1 3 3 19 326 506 332 601 650 650 348 491 520 333 322 5 1 7 836 3 4 835 828 1 1 19 820 1 8 821 817 22 25 814 32 807 36 803 798 38 801 41 44 795 52 787 794 45 63 776 69 772 770 67 781 58 72 767 763 94 76 745 92 747 737 65 1 to 700 102 90 749 754 85 79 760 167 672 1 09 730 674 1 65 728 111 186 653 209 679 1 16 630 160 723 206 635 722 204 1 1 7 633 65 1 P The complex sequence is divided into a plurality of sub-groups according to a predetermined cyclic offset parameter Ncs, and sorted according to the CM characteristics in each sub-group. The plurality of subgroups can be ordered according to each corresponding cyclic offset parameter. The largest spike (or smallest spike) that appears in the upper half of the graph as shown in Figure 11 represents the root index with a maximum CM (or a minimum CM) in each subgroup. Each unit may use the continuous logical index sorted by a composite order according to the cyclic offset parameters and the CM characteristic of not considering a unit size' and according to the characteristics of each unit, the unit plan based on C Μ may be I can. The base station can use the minimum logical index assigned to the base station itself for the user equipment in a particular power limited environment per unit. For example, the base station can use the minimum logical index as a dedicated preamble of the user equipment. In the smallest unit size interval, a supportable unit size is very small, and there will be an index smaller than the value of 〇km. This index represents an index that cannot use this restricted loop offset. In addition, the segments can be further distinguished for a simple index assignment. In Fig. 11, the first segment is divided into 〇~l.lkm, but the region is 701~750 0 3 2 8 4 2 6 6 2 8 5 3 8 5 1 116 5 4 6 0 8 2 2 6 2 5 4 5 1 2 4 2 3 6 6 2 4 3 4 3 11 6 7 6 9 1 16 9 7 1 16 9 0 5 2 6 2 2 0 6 2 6 6 0 9 5 8 17 12 5 3 19 8 3 5 1 1 < 6 8 0 4 0 8 6 7 5 6 7 - 5 2 7 6 15 6 2 2 2 7 7 7 2 -7 2 9 4 3 112 3 2 7 9 9 0 -6 6 3 6 9 12 0 -1 6 75 1 ~800 4 14 6 15 2 4 5 2 8 9 7 2 5 2 4 4 7 15 6 8 8 5 2 2 18 0 7 5 8 2 5 3 8 6 0 6 7 4 5 3 4 2 7 0 6 0 6 5 4 4 7 3 9 8 6 7 5 4 3 2 2 9 5 3 9 2 4 3 1 1 2 19 4 4 2 8 2 8 16 4 4 4 5 6 9 9 12 4 4 4 4 3 5 0 2 9 9 4 3 3 7 7 3 4 7 6 2 3 3 592 426 413 414 425 444 283 556 369 470 476 801-838 8 5 6 00 00 1 3 4 5 5 4 3 5 5 2 4 3 3 4 1 00 1 3 5 1 1 00 15 2 -4 3 453 386 478 387 361 454 452 385 479 544 360 295 310 529 315 524 337 490 502 349 334 505 504 335 519 324 515 320 25 200904090 Segments can be divided into smaller ones Partially, and sorted based on the CM. For example, the first segment can be divided into two portions 0~500m and 500m~l.lkm, and can be sorted based on the CM. Table 5 shows the entity index of the section according to Ncs-configuration. [Table 5] No.

NC Logical Index Real Root Index 13 1 26 1 838 2 837 769 70 93 746 105 734 755 84 168 671 629 210 120 719 140 699 129 229 610 599 240 420 419 560 279 280 559 373 466 534 305 336 503 804 35 799 40 797 42 783 56 779 60 73 766 80 759 727 112 146 693 691 148 710 235 604 606 233 581 258 265 267 574 572 367 472 537 302 543 296 530 30ί 355

38 78 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 I 1 7 - 9 34 7 0 2 2 2 2 14 2 2 2 5 6 79: < ο 80 S - • ο 4 02 64 156~187 14 825 15 824 55 784 61 778 103 736 95 744 729 1 10 202 637 636 203 190 649 717 122 128 71 1 622 217 256 583 597 253 471 368____ 76 188-227 12 827 23 816 805 34 37 802 793 46 89 750 721 1 18 179 660 142 697 709 130 231 608 260 579 263 576 571 268 276 586 284 555 551 288 304 535 546 293 358 4S1 83 228~247 104 248-311 119 312~355 91 207 632 694 145 133 706 223 523 9 830 10 829 786 53 773 66 57 638 161 678 121 704 135 143 696 569 584 255 424 415 374 465 461 351 488 500 339 493 346 8 831 823 16 64 775 101 738 655 585 245 594 588 251 412 427 372 508 33 1 325 5 14 32 1 5 18 9 139 356-415 5 5 6 6 5 2 6 - 3 2 7 5 2 7 2 6 1 3 7 6 2 8 8 5 5 1 6 8 5 3 7 4 6 6 2 2 4 8 7 2 4 0 6 4 929144 5 8 7 One ο 3 2 4 4 16 3 4 6 Β 9 . 43 -9 ο -6 3 2 8 -8 3 • 1 5 2 - 2 1 8 -2 3 6 8 7 9 7 5 8 4 -6 3 8 • 2 3 5 4 4 1 0 2 -4 9 4 3 - 1 6 7 5 4 9 4 16 9 0 1 6 7 3 10 11 12 167 209 2 7'9 416-501 833 170 154 408 341 >802 3 7 9 -1 3 4 7 18 4 9 8 6 3 6 3 2 6 14 3 2 δ 1 1 8 11 7 0 6 0 -1 7 4 5 75; 14 9 9 8 3 3 9 6 2 5 -2 5 ο 9 -5 1 ο ο 6 2 3 5 ^4437 6 2 7 4 6 6 4 3 507 5 6 ο 8 0 6 3 17 3 3 9 8 · 3 5 3 , 605 • 663 8 7 9 6 3 4 9 6 118 6 13 9 2 4 4 7 9 19 6 9 9 8 15 4 5 2 8 0 7 6 4 4 12 3 8 8 0 0 0 4 9 5 6 5 3 ο -7 9 2 7 4 4 16 2 3 6 0 7 7 0 9 116 4 δ 8 9 6 8 5 3 9 5 12 4 0 8 3 9 2 3 4 -7 2 3 9 16 -1 ο 8 ,16 4 500~625 6 4 6 4 6 2 8 6 6 12 3 3 4 7 7 0' 3 6 4 5. ,447273 1 2 3 4 2 3 • 1 1 2 4 5 3.082600 -020482 2 6 6 4 4 5 854 3 4 4 9 1 5 8 2 9 5 9 6 6 2 3 3 4 -9 6 5 5 8 8 3 5 14 9 4 6 16 4 2 3 > 8 7 5 2 8 2 5 7 8 8 12 7 0 16 6 4 4 5 16 2 13 2 2 7 8 2 9 6 3 6 12 5 3 3 3 3 3 7 9 7 16 6 5 8 14 0 5 116 4 5 5 5 4 7 2 2 2 14 9 1 5 7 7 2 3 3 2 2 >337 -675335 5 3 6 16 12 9 8 2 -115 3 5 90385 8 0 4 5 2 17 2 4 5 4 6 0 7 9 14 2 5 7 1 6 6 2 4 3 7 3 9 9 3 6 5 H 8 9 1 6 6 2 5 2 5 2 3 8 0 2 19 5 7 4 1 -1 1 2 5 5 5 9 7 4 7 9 3 7 7 2 4 112 4 3 5 2 15 2 7 4 16 6 5 9 6 2 5 3 3 6 4 7 5 2 7 9 9 2 7 9 8 16 2 2 4 4 4 6 4 7 4 7 2 8 6 4 1 7 6 5 5 3 31254204485 84966162 4 8 4 4 8 5 4 3 3 5 3 9 7 7 7 4 4 4 7 9 3 2 2 2 3 5-01939851 2 16 2 5 2 4 5 3 8 2 2 5 93726648 7 9 4 6 11- 6 2 5 8 2 -24533 68273915 2 n 9 n 7 11 1- -7 5 4 3 4 3 7 8 9 ) 1 9 -4 4 10706 7 04034 32281752 5 4 4 4 5 5 4 0 6 7 1 9 06895467 65052583 -16724533 7 86,50021019 9738278864 1 6 61622333 2 9 86763948 8772 12 2 4 1 5 8 3 36151980 06 24371579 2 476154444 2 2 08162880 2 3 5 622078044 2126265453 7 76255443 77787954 ^171607000 ' 7 11654335 6 2 > 749916025 20605177650 7 26623445 09 8 >0 4 6 2 -3 3 -«^13372149 •654183941 66654255 - -336223995 2 7 39266973 3 丨61254343 6 0 5 6 2 0 8--18 5 2 5 14-61224533 45937653 32027782 5 66643443 14 0 7 6 I 8 893065396 -51319621 6 17243355 8 7 3 1 54489000 4 11 ο 1 1 1 2 9 1 2 8 9 22644333 9 3^84512955 6788226491 37 1624442- 26 200904090 Table 5 shows a plurality of entity root index root pants. The predetermined cyclic offset number N c s is divided into a plurality of subgroups, and a logical index is configured in each subgroup. With this logical index set, a sequence can be easily selected based on a unit size in a high mobility element. Furthermore, if a unit requires CM characteristics, it can select the front index only among the indexes available for its unit size, thereby using an index with a low CM characteristic. Table 5 does not list only the index values (entity index or logical index) for the Ncs. The index of the CM characteristics applicable to a unit can be selectively used while considering the unit size in a low/medium mobility unit. In addition, an N c s section table in the low/medium mobility unit can be separately set. In this example, a table may be selected by using a difference signal between the unit having the low/medium mobility unit and a unit having the high mobility unit. Figure 12 is a graph showing CM characteristics and maximum supportable unit radii according to a logical root index in accordance with yet another exemplary embodiment of the present invention. That is, Figure 12 shows the ordering based on the complex characteristics and allocations. Referring to Figure 12, the ZC sequence has complex symmetry characteristics. Based on this characteristic, the index with the complex conjugate symmetry can be configured continuously. The complex conjugate symmetry of the ZC sequences can be expressed as follows. [Equation 5] ^«=<2 (left) (left) The singularity of the singularity of the singularity of the singularity of the singularity of the singularity of the singularity of the singularity of the singularity of the singularity of the singularity of the singularity. The sum of the two root indices of the two zc sequences with complex conjugate symmetry is equal to the length of a ZC sequence. If a single characteristic, but as a receiver, the symmetrical characteristic of the unit is based on the set. When the index is indexed, and only the use of the root index of the complex with the detector is used, the index of the radius is matched to the user index. A single root complex conjugate pair can be reduced. When the basis and the composite configuration are applied, the device naturally dictates that the complex number is not half. The CM sorting order isochronous base station can only obtain such a root index by using the pairing index, and has an odd number of the total number, the maximum can be continuously distributed, a single logic, and an index group as needed, and in order to form an index. A lower group can be used in Table 5 above, each group including the complex conjugate symmetry characteristic, and a higher group. This can be expressed as shown in Table 6. [Table 6] No. S Logical Index Real Roots 1 0 13 Bu 37 1 838 2 837 769 70 93 746 105 734 755 84 168 671 629 210 120 719 140 69 129 710 229 610 599 240 420 419 560 279 280 559 373 466 534 305 336 503 1 26 38-77 804 35 799 40 797 42 783 56 779 60 73 766 80 759 727 112 146 693 691 14: 235 604 606 233 581 258 265 574 267 572 367 472 537 302 543 296 530 309 355 484 2 38 78-113 815 24 29 810 812 27 809 30 81 1 28 808 3 1 791 48 771 68 765 74 178 661 136 703 236 603 433 406 404 435 434 405 287 552 536 303 356 483 3 52 114~155 818 21 819 20 39 800 796 43 78 761 753 86 181 658 137 702 714 125 151 688 261 578 242 597 274 565 266 573 402 437 286 553 383 456 307 532 357 482 329 510 3 1 7 522 4 64 156-187 14 825 15 824 55 784 61 778 103 736 95 744 729 1 10 202 637 636 203 190 649 717 122 128 711 622 217 256 583 253 586 471 368 5 76 18S-227 12 827 23 816 805 34 37 802 793 46 89 750 721 1 18 179 660 142 697 709 130 231 608 260 579 263 576 571 268 276 563 284 555 551 288 304 535 546 29 3 358 481 6 · 83 228-247 748 91 207 632 694 145 133 706 223 616 430 409 398 441 290 549 308 531 316 523 7 . 104 248-311 9 830 10 829 786 53 773 66 57 782 83 756 106 733 731 108 666 173 201 63 161 678 718 121 704 135 143 696 132 707 623 21 6 227 612 61 1 228 270 569 241 598 584 255 424 41 5 374 465 461 378 400 439 448 391 289 550 306 533 495 344 351 488 500 339 493 346 8 119 312-355 8 831 823 16 64 775 101 738 655 1 84 642 197 141 698 690 149 582 257 254 585 245 594 588 251 412 427 372 467 450 389 545 294 542 297 31 1 528 345 494 508 331 325 514 321 518 9 139 356 415 415 832 7 826 13 26 813 790 49 47 792 59 780 71 768 104 735 98 741 757 82 670 169 87 752 665 174 675 164 631 208 191 648 695 144 152 687 621 218 269 570 ^66 273 557 282 436 403 464 375 443 396 401 438 392 447 457 382 28 200904090 6 4 12 0 6 6 0 9 2 16 4 3 7 7 9 3 7 3 4 16 2 3 δ 6 8 6 58172348 7 3 13 9 6 0 5 3 6 6 3 7 0 5 9 9 0 2 0 3 0 0 7 6 5 5 9 4 0 0 0 13 0 4 12 3 7 8 5 3 9 5 17 4 9 12 4 3 5 14 6 2 6 8 2 6 9 6 6 3 4 7 42 5 ο 8 5 0 7 3 6 7 3 3 ο 5 7 4 9 1 8 3 6 0 114 5 9 784 8 8 1 6 3 6 4 6 14 3 7 15 118 7 0 7 9 2 17 3 4 2 8 8 4 8 9 6 5 0 9 6 6 14 4 -1 ο -3 4 >43 3 15 10 3 7 8 s 1 6 -097 4 4 9 6 2 4 7 8 19 12 9 8 6 5 4 9 6 18 0 6 14 5 2 2 3 • 9 ο 2 9 9 4 15 3 9 ο 2 1· 1 ο ο 2 6 4 2 7 3 15 7 3 7 4 16 6 8 8 1 6 2 5 3 4 4 3 7 2 4 6 4 5 7 9 1 6 6 12 2 3 5 6 2 7 5 3 9 8 6 4 2 7 16 5 5 5 6 5 2 5 8 6 7 2 4 17 5 2 1 4 6 2 2 4 5 5 7 4 7 4 13 2 7 9 2 6 8 12 9 16 5 3 3 3 6 4 9 3 2 2 3 9 2 3 4 4 13 7 12 4 3 3 3 4 5 0 6 7 7 6 7 10 9 9 2 0 17 5 3 5 5 7 7 9 3 5 3 0 1 8 2 9 9 8 9 2 115 3 4 6 7 0 6 4 6 9 8 5 14 4 5 4 5 6 7 2 4 3 3 7 5 5 7 4 8 7 4 2 13 9 9 0 6 7 7 2 3 2 7 4 4 2 5 12 2 12 0 4 4 3 6 116 4 5 3 7 0 3 4 2 4 0 7 0 8 2 2 6 2 7 2 6 2 4 3 5 4 9 6 5 7 5 9 5 3 5 117 1 6 16 4 4 3 854 2 8 3 2 6 • 5 8 1 9 6 2 6 6 6 5 3 3 15 7 16 7 3 8 5 2 4 7 1 112 2 4 5 - ^629092 7 8 8 5 9 1 6 16 2 2 5 6 ο 8 3 7 0 9 0 7 6 5 5 8 4 2 16 15 5 3 7 2 6 8 4 2 6 9 2 7 7 5 5 6 16 2 4 3 6 2 6 9 7 2 2 1 913062949 041316441 267244455 9 4 7 345489805 2532112463 349666644533 4 6 5654510194 384801221970 837122244245 ο 8 4 7^16716070 665917 7489 67 61623434 3 2357978012 77737165860 ο 61655335 889 5042021987 2 106278573 31 26222443 8 2 47779048564 1 615262882 8 7 16624235 1C672 0 9 5 14 3 5 22128171551 7 71 254 254 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 -7392027992 3611643323 2 ->5 G 1 8 194622055 158253680 4 16224435 19 205377944 6785180753 8 7 61654343 9 3^83283929 5 I ' 2 6 6 τ ί L— 2 5 4- 6184266954 -7 16254343 The appearance of the appearance The characteristics of the knot are called the number of yokes in total, and they can be used to make the order ki in the middle figure of the LF formula. The sexuality of the special case is fixed, and the other is clear that the lower base will show that it is not obvious, and the match is matched with the number of aids with a total of 3 11 Reconciliation is greater than the most basic and the characteristic is shown in Figure 1. The bow of Figure C 3 is the root of the series. The logical table according to the order of the root of the map • ε—the number of the 酉 酉 在 在 在 在 在 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉 酉The 1st is as wide as the usual example. Please use the district to make the district to the half-time and the second-half reduction section 2 1Χ and 11 1Λ the first appearance of the display > 0 to the reflection of the body 1 is the actual 7-segment table area

TJ 7 Table rL No. Nc Logical Index 0 13 1-37 1 26 38 ~ 77 4 5 5 0 3 5 8 2 3 9 2 2 20 8 7 9 2 1* 1 4 4 5 0 8 3 6 4 ο 2 4 6 9 0 9 6 2 6 6 9 4 2 6 3 7 13 7 6 9 7 5 ο 9 6 6 9 6 ο 9 ο 29 200904090 / 2 38 78~113 815 136 24 703 29 8 1 0 812 27 236 603 433 809 30 406 404 811 435 28 434 808 405 31 287 791 552 48 77 1 68 765 74 536 303 356 483 178 661 818 21 8 19 20 39 800 796 43 78 761 753 86 181 658 137 702 714 125 151 3 52 114~155 688 261 578 242 597 274 565 266 573 402 437 286 553 456 307 532 357 482 329 510 317 522 14 825 15 824 55 784 61 778 103 736 95 744 729 110 202 63 7 636 203 J90 4 64 1 5 6 〜1 8 7 649 717 122 128 711 622 217 256 583 253 586 471 368 12 827 23 816 805 34 37 802 793 46 89 750 721 118 179 660 142 697 709 5 76 188~227 130 231 608 260 579 263 576 571 268 276 563 284 555 551 288 304 535 546 293 358 481 748 91 207 632 694 145 133 706 223 616 430 409 398 441 290 549 308 531 6 83 228~247 316 523 * 9 830 10 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 465 461 378 400 439 448 391 289 550 306 533 495 344 351 488 500 339 493 346 8 83 1 823 16 64 775 101 738 655 184 642 197 14 698 690 149 582 257 254 8 119 312-355 585 245 594 588 251 412 427 372 467 450 389 545 294 542 297 3] 1 528 345 494 508 331 325 514 321 518 832 7 826 13 26 813 790 49 47 792 59 780 71 768 104 735 98 741 757 82 139 356~415 670 169 87 752 665 174 675 164 631 208 191 648 695 144 158 621 621 218 9 269 570 566 273 557 282 436 403 464 375 443 396 401 438 392 447 457 382 538 301 318 521 167 416~501 500~563 3 11 5 n ο 3 7 8 3 4 8 16 4 3 8 4 8 9 6 5 0 9 -6144 5 118 7 0 7-117 3· 7 6 3 6 6 14 4 5 9 0 2 >994 I 5 3 8 8 0 9 7 4 4 9 • 6 2 4 ο -206 6 0 9 116 4- • 7 9 3 7 3 4 16 2 3- 6 8 6 7 3 8 -1 2 4 3 13 9 6 0 5 3 6 6 3 0 5 9 9 0 2 0 3 0 0(7 6 5 5 9 4 0 0 0 13 0 3 .12 3 3 8 5 3 7 9 5 17 4 9 12 4 3 -1 4 6 2 -8 2 6 9 6 6 3 4 742 5 ο 8 7 5 0 7 3 6 7 3 3 507 4 9 1 8 3 6 0 H 11 - 4 5 2 3 ο 7 8 19 2 9 8 6 5 4 9 6 18 0 6 1 11 209 564-625 626~731 4 9 3 2 3 8 4 5 8 12 3 5 2 2 1 7 8 2 9 6 4 4 -7 7 8 • 5 1 4 14 3 514 8 7 4 7 0 6 2 5 - -5 1 2 9 6 3 15 3 15 5 6 4 7 2 6 2 3 - -4 4 3 9 6 1 -1 5 5 18 0 2 3 5 7 7 3 2 2 2 2 2 2 14 5 6 7 6 7 9 1 9 I 2 7 3 3 6 5 3 2 7 11 0✓ H 7 7 3 5 7 4 6 7 4 2 4 2 5 14 5 3 3 6 8 8 9 2 7 6 5 5 966 8 3 2 5 3 6 4 - 。 。 。 。 。 。 244 595 562 277 5S9 250 246 547 292 477 362 364 475 359 480 527 312 313 12 279 732-838 5 0 0 1 0 8 11 4 7 2 5 4 5 4 • 7 H6 7 5 3 8,2 6 2 4 3 7 6 I 3 7 0 9 2;8 6 7 4 2 7 15 4 3 6 116 2 9 0 | 5 7 6 9 0 6 2 3 4 6 8 7 186 4 7 2 4 6 7 0 9 6 2 3 5 1 7 _ 3 5 2 7 5 9 7 6 3 8 15 4 3 4 4 9 9 8 5 3 5 2 2 7 6 2 4 3 6 6 4 3 3 8 16 6 0 9 9 tl 4 n 5 14 4 5 16 17 8 0 5 7 6 8 0 -41535 3 9 0 2 9 2 3 6 2 2 5 5 6 9 -6 7 16 4 9 1 0 14 2 8 4 7 3 2 2 5 2 0 7 7 5 5 7 2 2 8 6 14 3 1 9 12 4 4 6 115 0 7 4 4 6 1 7 2 8 3 4 9 4 2 9 15 5 3 3 9 3 6 9 8 5 8 1 -5 6 6-o12, -59 -5 2 5 7 5 2 0 8 4 3 2 4 4 > 1 5 4 2 4 13 5 6 4 3 8 2 8 9 1 P 4 7 9 9 7 8 7 7 2 9 6 5 3 5 ο H 235 2 0 0 5 6 6 1 9 12 4 3 7 4 —i 7» 8 9 2 5 0 5 3 8 6 0 6 2 2 3 ο 9 820 7 4 9 2 8 0 5 7 0 16 5 4 9 1 6 9 6 2 7 2 0 5 5 -3 7 6 5 -7 6 3 0 3 1 3 6 13 8 8 8 7 12 2 3 1 4 7 9 5 4 18 4 1 0 2 5 4 3 9>3 7 6 5 0 9 3 7 6 439 420 2 3 13 4 8 12 6 0 3 17 4 3 5 115 2 0 4 ο 2 5 9 2 J 8 6 2 3 5 3 15--14 4- 8 6 8 4 0 2 8 2 7 4 3 3 6 8 6 5 2 17-14 4- 2 4 6 7 12 4 3 764 6 3 5s 19 7 2 9 6 3 4 7 5 12 3 6 7 2 6 8 6 0 2 4 3 8 2 6 7 6 3 17 5 7 6 3 4 1» 6 10 8 5 2 2 5 2 6 4 4 2 3 7 9 14 6 118 4 2 4 3 5 0 4 2 13 1- The maximum unit radius can be increased from 29.14km to 34.15km, which can be used by the application table 7. Here, the specific sections are halved and reordered, but they are only an example. That is, the size of a particular section can be distinguished in a number of ways. For example, to support a particular maximum cell radius, a segment can be distinguished based on the particular maximum cell radius. In addition, the segments can be differentiated such that the number of indexes used in a particular segment is doubled. A segment with a small number of indexes can be grouped into a segment and a second order can be applied to it. In addition, 30 200904090 A segment with a larger number of indices can be divided into two (or more) segments, and the second order can be applied to it. Figure 14 is a graph showing CM characteristics and maximum supportable cell radius characteristics according to a logical root index in accordance with another exemplary embodiment of the present invention. That is, as shown in Fig. 13, the index is divided into groups based on the Cm characteristics, and sorted according to the size of a maximum supportable unit in each group. Referring to Figure 14 'first of all', these indexes can be sorted according to the characteristics of c ' 'divided into a group' whose CM is higher than 1.2 dB, that is, a QPSKCM, and a group with a lower C ' 'and then according to The maximum supported unit radius in each group is sorted. The indexes in the group having the CM lower than QPSK may be sorted according to the order in which the maximum supportable unit size is reduced, and the index in the group having the CM higher than QPSK may be increased by the maximum supportable unit size Order of sorting ί ' Table 8 is the mapping table of the entity indexes of each section, where the indexes are sorted according to the C Μ characteristics, divided into groups based on ί · 2 dB, a single C Μ value And then sort by the maximum supported radius size in each group. [Table 8] No. Logical Index Entity Root Index 0 Bu 50 3 836 209 630 76 763 180 659 126 713 219 620 226 613 131 708 262 577 72 767 22 817 44 795 41 798 19 820 38 801 232 607 67 772 45 794 90 749 230 609 111 728 222 617 102 737 204 635 109 730 1 51~100 7 4 7 7 3 4 8 6 9 5 2 5 2 7 6 9 8 7 6 8 8 9 5 2 3 9 11 6 4 2 ( 8 6 6 6 0 2 5 7 2 5 7 n 1 4 5 147 4 7 6 6 5 8 8 5 9 6 7 114 8 206 633 79 760 205 634 225 614 127 712 58 781 1 16 723 160 679 193 646 186 653 2 101 -150 167 672 4 835 77 762 224 615 221 618 62 777 124 71 5 54 785 96 743 192 647 17 667 156 683 1 15 724 185 654 213 626_ 123 716 1S2 657 166 673 212 627 195 644 1 14 725 1 89 650 5 1 788 75 764 150 689 3 151 -200 33 806 237 602 163 676 97 742 194 645 200 639 1 57 682 1 53 686 139 700 5 834 211 628 187 652 239 600 175 664 99 740 4 201 ~ 250 215 624 154 685 171 668 199 640 1 58 68 1 170 669 1 38 70 1 50 789 100 739 1 07 73 31 200904090 17 822 234 605 81 758 162 677 134 705 833 169 670 152 687 49 790 98 741 88 75 1 1 76 663 65 77 4 1 1 1 1 1 1 1 1 1 1 1 738 149 690 8 831 16 823 121 718 57 782 _ 108 731 216 623 161 678 173 666 201 638 53 6 301-350 66 773 132 707 143 696 135 704 227 612 10 207 632 1 79 660 34 805 23 81 6 46 793 9 3 3 1 3 3 7 8 4 6 7 ο n 1m 9 6 8 9 7 2 8 0 6 3 0 8 7 8 5 2 4 2 1 14 19 6 6 3 3 2 S 2 6 6 1 5 6 35 1- 400 130 709 260 579 12 827 23 1 608 37 802 263 576 89 750 142 697 1 18 721 203 636 55 784 1 10 729 14 825 128 71 1 21 7 622 1 03 736 1 5 824 61 778 122 7 17 202 637 95 744 190 649 1 8 1 658 1 5 1 688 137 702_ 401~450 125 714 26 1 578 39 800 78 761 20 819 21 S1 8 43 796 86 753 68 771 136 703 24 815 48 791 74 765 1 78 661 236 603 27 812 28 8 1 1 29 8 10 30 809 3 1 808 235 604 35 804 73 766 146 693 40 799 451 ~ 500 80 759 42 797 233 606 148 691 56 783 1 12 727 60 779 129 7 1 0 258 581 70 769 229 610 84 755 93 746 105 734 120 719 140 699 168 671 210 629 1 838 2 837 4Π 420 279 560 280 559 336 503 240 599 373 10 501-550 435 383 2 6 -7 5 3 4 3 4 3 2 6 3 0 3 4 4 4 6 2 3 0 8 5 4 4 5 4 7 0 3 5 3 4 3 6 5 6 6 0 5 4 4 4 4 2 0 2 4 5 4 7 8 1 4 3 5 3 5 5 3 5 7 6 3 8 5 2 2 2 0 3 3 5 2 7 7 0 5 3 7 3 6 7 2 5 0 6 7 3 6 9 5 2 5 9 2 2 0 5 4 3 5 2 4 7 0 7 8 1 5 2 5 5 6 9 6 3 2 2 5 3 3 3 5 4 0 6 5 3 5 6 3 4 9 8 7 ο ο 6 9 3 4 2 5 2 6 8 4 8 0 2 5 3 4 3 15 5 4 1 2 4 4 3 8 1 8 9 6 5 3 4 6 3 8 5 2 7 2 5 3 16 0 7 15 4 3 5 8 3 9 6 6 8 3 5 2 6 9 7 6 2 5 Ιο 8 7 4 2 8 9 5 3 3 4 ο 7 0 5 4 8 3 6 3 2 5 5 6 Ιο -3 4 5 0 6 3 4 n 4 S 5 7 8 5 3 4 8 9 1 8 4 5 2 5 3 5 0 3 5 9 9 5 2 4 4 0 6 8 3 4 2 4 3 6 9 8 。 。 。 。 。 。 。 。 。 。 。 。 。 392 447 382 457 318 521 396 443 273 566 403 436 269 570 13 651 ~700 499 249 300 539 10 7 0 9 1 3 5 4 8 12 3 4 2 5 3 4 5 8 8 7 9 7 3 4 2 4 2 1 6 4 6 4 3 5 17 4 0 9 1 4 4 3 8 8 5 3 4 2 4 2 5 8 12 3 9 5 3 5 3 -13 7 0 4 8 5 3 4 -8 6 6 0 9 2 4 4 3 10 3 3 7 1 4 3 5 T 9 17 6 13 4 8 7 6 4 4 3 6 2 6 9 3 4 3 0 7 5 4 3 ο 9 ;3 00 1 3 4 9 3 ο 5 5 3 0 6 -4 8 13 4 14 701-750 8 5 2 4 7 1 3 4 3 13 7 9 9 2 4 3 5 5 6 2 6 4 9 3 4 2 4 6 7 7 4 4 4 2 5 5 3 7 7 9 9 2 5 3 4 9 2 6 14 5 3 4 4 0 1 9 2 8 3 5 3 5 3 8 4 15 4 3 4 3 6 9 4 2 5 2 5 31 -6 3 0 !9 3 8 5 3 4 8 6 7 9 0 7 2 5 2 17 2 4 2 6 5 3 5 2 2 2 1 3 5 2 5 3 9 3 5 -7 4 1 4 5 2 7 2:o 6 5 3 9 7 9 7 2 4 ο ο 4 5 5 2 4 9 6 8 -3 5 15 751~800 16 801 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 <Comparing a re-use factor in a large unit> A loop of the limit in the body embodiment. An exemplary Ncs chart can be mapped. 17 is based on the number of composite loop offsets. Figure 15 is a graph showing the number of Ncs available for each CM index offset for CM mapping according to an exemplary embodiment of the present invention. Figure 16 is a diagram showing the number of cyclic offsets according to the limits for the maximum supportable unit size for each logical index in accordance with an embodiment of the present invention for displaying an embodiment of the present invention in accordance with an exemplary embodiment of the present invention. Ncs can be used for the chart of the limits of each logical index. CM mapping, which can be used in the maximum speed unit. Please refer to pictures 15 to 17, compared to the support unit size mapping and the composite mapping in the high-level 200904090 continuous index. For example, it assumes that there are 20 units, the cyclic offset parameter Ncs of the first unit is 13, and the Ncs of the subsequent two units (ie, the second and third units) is 2 6, and the subsequent three units are 3, 8, The four units are 3, the next four units are 5 2, and the next four units are 64. In this case, the paired index assignment is applied to each pair. This Ncs represents the number of cyclic offsets according to the size of the unit. Referring to Figure 13, it can be noted that a middle portion is 0 and no limit cycle offset is available. Conversely, please refer to Figures 15 and 16, which do not show any available restricted cyclic offsets. This means that these consecutive indexes cannot be used in the CM mapping, but can be used to support the largest unit size mapping and complex mapping. Figure 18 is a diagram showing an example of a logical root index assigned to a unit on a CM mapping in accordance with an exemplary embodiment of the present invention. Figure 19 is a diagram showing an example of a logical root index configured to a unit of the largest supported unit size mapping in accordance with an exemplary embodiment of the present invention. Figure 20 is a diagram showing an example of a logical root index assigned to a unit of the largest supported unit size mapping in accordance with an exemplary embodiment of the present invention. That is, the 18th to 20th graphs show that those indexes are configurable to the unit based on the assumptions in Figures 15 to 17. Please refer to Figures 18 to 0 0, which assumes that each unit has high speed mobility. Referring to Figure 18, it can be noted that a continuous index is not used in a large unit. In comparison, please refer to Figures 19 and 20, which can be noted that continuous indexing can be used in a large unit. In Figs. 19 and 20, if the Ncs of a cell is 209 (Ncs = 209), four cells having Ncs of 167 (Ncs = 167) can be constructed. The reason is because continuous indexing cannot be used in the 18 33 200904090 diagram. More importantly, in Fig. 18, it can be noted that if the Ncs of a unit is 209 and the Ncs of the three units is 167, it is impossible to construct any unit having Ncs=139, Ncs=104, Ncs=83. And Ncs = 76. In contrast, in the 19th and 20th drawings, units of various sizes can be constructed. Meanwhile, in Fig. 18, it can be noted that the plurality of indices have a value of 0 at the y-axis and cannot be used for a high mobility unit. If those indexes can be used when only high mobility units are mixed with one low-motion unit, these indexes will greatly reduce the unit's construction capabilities. Therefore, when there are multiple large units, the inability to use consecutive indexes can greatly reduce the reuse factor. That is, by using these consecutive indices, a different unit can use an extra space. Using these consecutive indexes does not make much difference in a network that includes only small cells, but for networks that include multiple large cells, supporting the use of consecutive indexes can increase the reuse factor. The 18th to the 20th figures consider an example in which each unit has high-speed mobility, but even in the case where there is a unit having low-speed mobility or medium-speed mobility, the reuse factor is for the same reason. Restricted when no consecutive indexes are used. At the same time, if continuous indexing is used in a unit with low-speed mobility or medium-speed mobility, the reuse factor for units with high-speed mobility is further limited. The exact index of each mapping used in this way is shown in Table 9, Table 10, and Table 11. Table 9 shows the indexes for the CM mapping, Table 10 shows the indexes for the maximum supportable unit size mapping, and Table 11 shows the indexes for the complex mapping. In Tables 9 and 10, the entity root indexes on the logical indexes 1 to 8 3 8 are sequentially configured. 34 200904090 TJ 9 Table Logic Index 1-838 引根根实 2 2 18 2 3 7 8476778861616. 6262525243- -442434343535 4 5 58 835870301290020311626590449065176176 0978333067553244058216776567505976718104 205161696608918938313756 396779551626171616162525 7 7 7 7 567139194- 660891893- -6 7 4 3 8 6 7 6 3 1 2 604 796 161 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 --6171 6 1 6 n 6 1 6 2 - 79167015441189153 60277864119203767 62716161726262525 652842668426024 428685678419423 2 4 2 4 2 5 3- -9 4 2 - -43534353 1063491445986014332745630167499 1306952942413047591505870592491 5 7 2 1 09580067 5 4 9 4 3 9 3 2 5 9 2 8 2 7 4 8 8 2 7 5 7 6 7 3 5 7 6467377776 1 1 3 8 6 7 7 -6261616- 3 0 4- 61626252545452434253435 80 345085560230856777503298355106 263149139292069781273759394594-59716161716162625254434352525 8 6 3 4 3 2 3 5 3 6 6 2 8 8 2C>C17 776 49453964239729449212699731641823 48285 7 5 7 77020450412137667216969494085930 3 4016272617171625252444343525343435 -8 2 ->70 28629877525162397804795706833109663 6136388392120576612040484831- 17262525444444253534353 29 - 4 8 5 8 9 -388 --61616. -8875 -8103 18 9 8 10 8 3103976«. 7 038030126 1331232944 12858610423138765576 2 0 9 8 7 1 5 17161627191625252534 8 3 7 4 7 7 71 6 203473362909776 3648965085 3921391147 51284713972205678857 8 114 9 6 8 8 61716171646262525253 8 7 7 8 1 7 7 0 II 2 7 3 4191677897203 655002431 27968874 8217952041113877528 8 2 7 1-75 7 1716161711262525242 6 7 -9 ; - 9 ' • 5 8 I— 9 2 8 0 7 6 3 9 8 2 8 4 7 9 3 8 6989053782174 3637505024230 4343534353535 471718858038 948507082031 343434343535 3648965085020241247921 796836359302 3 5 3 434353534- 4706951867823 8763717856558387161664 7 5 28595721920206678460485038351102 285957219202066 7846048503835- 71616162637262525244424353535353 441102473 72462851 650416521711374649 162626162026252525 -63848692935385 -73658395084241 34352524343535 1 <(·;< :: 9 18 9 4 2 0 353464 7 83029829321139465903979464522 2 0 4 9 6 6 16271616112625252544343435353435! 8 7 77378307 9 ο 2 5 7^400527513 1820571708178004040602 140575272 608145140 7 2204672430664959811492 *'8384770 3 62616171726262524244435342435343 0 8 9 6 7 7 -203866 18 7 7 - 8 2 9 110 3 7 2 -8 3 8 5 7 7 _ _ - 1 Ϊ 7 2 ο 6 2 13 9 6 4- 6588391536 2557754535181305 -8 70312985252205959169795848 05 62616161616262 '07i62 0 3 4 6 10 3 19 2 9 2 25443435353534343 8 1519678466 847244S494811694969399 4 7 73529428341138781204749585522141 4 9 0 16171616122625254444342434353535 7 3 11 IX 6 6 3 4 6 159470^7 616261717562625 283767110511 1 8717795452383 271721925857357 9 2 1 244246686 0919589323208570132843 58304913002206978738484676851212 25342434343435353 35 200904090

Table rL ο 引根根实实 35 79 66118782 8 6 8 7 3 2 6 2 5 3 8 0 9 4465440310651588331694 6 8 3 2 7 19 170076361526343725314534341835161 7 4 4 2 7 8 7 3 7 2 9 3 4 3 3 132831018 1 2 19 8 7 337432940322339 9078881989721792554608346 81712257159122560 856904171585263 4·1426248734545635262644172442 3 7 8 8 8 o 1 6 5465817668981654700224662262059378663 4821512455642544829267097256621481284412876 12543321725242734351867153435163417233617337 7945617260 6966261323 5321736226 15 5 3 693674226135248 5 9 4 7 5 8 2 8 2 2 8 3 8 8 2 4 7 805360328 2 7 0 ✓ Oo (. I 5 i < & . .y << - ) ϊ 5 8 8 κ. 5 3 ) 6 -584 508 VI» 6·°635 ) 6 5(ί>7" 5 7 6 3 9 ο 2 1 76 19 2 2 2 5 36 3 99 2 7 9 3 18 5 8 7 05 8 5 ο 896 9 15 1 2 ο 114 64 ο 290315371 2 8 7 6 4 8 2 8 4 7 2 0 1 4 7 2 9 13 2 16 6 2 7 3 9 7 7 8 1 96 13 8 2 5 6 97 73621225·))1»Τ3Π3 83 5ί411 γ9!963>>56·9>i0 6 3 0 9 5 4 5 9 7 2 2 8 2 1 7 18 6 9 6 2 0 8 6 4 5 6 7 2 2 2 68 5 3 9 28562 0 13 5 1 5 8 5 9 4 0 3 9 7 -2496428 5 155 61 255 12149 2 357 0 2 5 7 ^ 6 10 1 3 ι· 8 >« 3 9 0 4 i4 1 2 7 5 7 3 _ 5 ) 4 1 2 6 3 I1073 6Μ5^6 62 > 15527 , , , 3i02 6 ) 2 7 ο;ρ 1 0 3 4 3 1 4 7 8 4 6 7 9 15 2 9 5 Ιο 1 15 15 5 3 2 5 7 1 70 5 6 3 19 2 6 4 2 5 2 8 8 6 3 3 5 3 6 9 6 12 0 2 3 7 1 4 8 4 4 7 4 7 6 3 7 7 7 3 5 5 6 8 1 362 28J2733 ο 5 r ο 4 9 3 > r 9 7 ► 4 6 2 7 6 2 I 507043355572916822529231η 098 4 47751 8 ο 480844 780 6 6 4 3 18 4 3 2 1 ο 544195424 56 3 6 0 9 6 1 ο ο 7 17 7 7 13 δ 545 ο 3 376 25 7 4 8 247 6 7 6 7 1 >> 4 12 0 3 3 3 7 3 6 ί > 6 .丨9 3 I 12 1 7 3 5 6 8 6 8 82 !7-3757 63 ;*3'9>6>228 ?0ί43 5u 3 3 0 2 2 5 1 3 2 5 1 8 9 4 3 6 5 16 7 9 5 7 2 4 432^ 686 9 7 6 6 2 463500973 4 7 71307:4 3 3 6 4 2 3 7 6 1 4 6 4 3 6 0 8 1 5 4 8 2 8 7 9 15 2 3 3 3516 丨ο -> ο —h ο 6 6 2 丨2 __- 1 ____2 3 7 I 7 4 2 0 5 1 56 16 14 1 1 l103 4 7 9 8 8 4 ο 5 5 6 o 7 5 8 ο 6 1 8 8 0 9 0 3 5 2 2 8 6 4 8 2 4 9 9 5 3 8 8 16 3 5 7 6 2 1 1 1175353217 5 3 5 2 6 0 9 7 3 4 3 9 3 6 6 4 227031 2 7 4 5 17 5 17 6 6 丨7 2 5 7 >8 9,3 554 I 5 L. * 2 I 1 o 573008 236714,28 7 80 4 6 5 1 91 4 9 47 3 2 12 8 3 9 3 4 6 14 0 7 4 4 1 119 15 0 5 4 8 o 6 6 3 6 4 1 6 7 5 6 8802644141 8 5 2 7 5 13 4 5 19 0 8 0 1 3 5 752307 1 1 7 2 4 4 6 7 9 6 2 3 111 15 3 8)丨5 l> 4 r 834 丨3 1 7 kr kr 7 1 7 2 9 17 6 1 4 9 3 8 3 7 59 5 3 5 7 09 8 8 5 12 6 68 7 75 4 4 o 973 883 6199 2 2 2 8 2 9 5 8 5 9 1 14 3 8 5 18 1 25740736223435 6 3 4 2 8 4 0 4 21 29 2508 9 0 526771 8 5 25 951 1 2 0266888- 8265))5 -)9li 4 6 6 IT ) 6 , 丨6 ) ) 2 L, 1 4 2 6 7 5 309564 4 6 2 5 4 90 14 2 1 6 9 6 9 9 2 3 9 5 8 0 8 7 4 7 7 12 5 118 58 5561 2514 584592314769425764624453 54 4 6 0 13 3 0 4 9 2 4 7 6 6 7 5 2 8 2 4 9 7 9716330 626 2Li4·) 3 11 2 9 11 7 7 25 3 48 935279904 2 16 7 2 4912183434463455253427316-2 17 0 5 8 7 5 2 63 70 7 oo 4 7 3 1 1 8 8 8 0 5 9 3 2 80 8 24 74 6 5 9 9 4 1 33 3 157 5065 408528415 1130 Lo 74010563135169526864566825 7747 66 14 3 3 9 7 6 2 4 13 8 2 5 7 5 7 2 7 9 9 8 8 4 1 9 。 。 。 。 。 。 。 I 1 2 丨2 >.7r loll 558 005 6 96 341 7636 7 4 3 0 16 2 4 1 0 3 3 4 7 2590622478378298 2 - 7 0 3 6 046576546-5 5 4 3 - 7 7 0 17 0 5 3 2 7 9 8 2 715. -8 · 14 4 6 2 0 11 o 3 7 19 8 6 5 8 7 I 0 4 5 0 7 6 7 7 —97 4 4 8 6 0 9 5 3 6 6 1 0 6 3 7 4 2 8 6 2 i · 4 2 . 2 13 2 6 2 4 3 299878043629354816779684 16 87 539 7009 2 7 633851 8 5 54 34 3 1 3 o 4 3 0 0 3». 287.)1-4)67 567 - ) 6 ? IT·1__r > 4 丨8 8 7 4 3 2 15 4 0 4 7 2 9 1 7 7 25 3 4 9 o 8 36 0 5 2 2 ο 14 9 3 9 3 4 4 4 5 2 2 6 2 3 6 6 1 8 3 ' ~7:189828638 7 3 2 2 7 5 7 6 7 5 16 9 12 7 2 7 9 8 6 ο » 4 1 2 1 2 »42 ) > 9 ο 941 ► 7 8 6 3 4 5 1 0 4 6 5 9 14 93 9 0 4 7 0 2 4 0 o 2 1 ▲ 7 2 9 7 17 5 5 4 . 12 3 5 -4^5 5 5 8 0 0 5 6 96 3 4 1 0 3 3 4 7 259062247 -963610342596352 0 4 7 2 4 1 3 5 3 8 6 7 2 4 7 8 9 5 9 6 5 2 4 14 7 4 7 -16 3 9 2 6 7 3 7 650 799 7403 67494 4149695367624 3 3 8 3 7 8 2 9 13 4 2 4 1 54383735 77671011 56344663 2 3 5 7 3 7 4 2 79; 4 2 2 5 4 2 3 3 3 1 8 0 5I37748.-I411 7 6 36 200904090 [Table 11] number

Nc s logical reference entity root index 13 1-36 1 838 2 837 70 769 93 746 105 734 84 755 168 67 1 2 10 629 120 719 140 699 229 610 240 599 419 420 279 560 280 559 373 466 305 534 336 503 26 37 〜 76 8 2 5 4 0 3 13 804 40 799 42 797 56 783 60 779 73 766 80 759 1 12 727 146 693 691 129 710 235 604 233 606 258 581 265 574 267 572 367 472 537 296 543 309 530 38 77~112 2 } 3 ο 0 7 8 » 6 3 9 1 2 11-5 6 8 16 4 $ 8 6 4 7 5 2 13 ο 3 : 809 28 81 1 31 80$ 48 791 68 771 74 765 406 433 404 435 405 434 303 536 355 484 21 818 20 819 39 800 43 796 78 76 1 86 753 1 8 1 658 137 702 125 52 113~1 54 714 1 5 1 688 261 578 274 565 266 573 402 437 287 552 286 553 383 456 307 532 357 482 329 5 10 3 17 522_;_ 14~825~~Π~824~55~~784~61 ~ΤΠΓ〇3~~736~95~744~ΓΤ0~729~202~~637~203 ~~ 64 155-190 636 190 649 122 7 1 7 128 7 1 1 2 1 7 622 256 583 242 597 253 586 368 47 1 293 546_ 12~827 23~ΪΪ6~34~805~ 3 7~~8CI2~46 ~~793~~89~750~"1 8 72 1~ΤΪ9~660~142~ 76 191-226 697 130 709 23 1 608 260 579 263 576 268 57 1 284 555 288 55 1 304 535 358 481 83 227~246 207 308 632 145 694 133 706 223 616 276 563 409 430 398 441 290 549 53 1 3 16 523 8 119 0 4 8 2 2 2 ο 6 1! 6 14 >664 > 3 8 7 2-\ 1 2 - 3 9 5 6 5 5 3 2 9 r I 3 6 4 - 0 7 0 12 0 2 4 - -3 1 3 2 6 9 6 4 4 - 0 6 8 6 117 4 2 3 3 6 5 7 5 0 7 0 6 0 7 4 5 3 8 2 4 9 3 7 3 8 13 3 4 7 6 4 8 9 2 8 16 4 4 9 3 5 1 2 4 1 5 8 14 3 4 4 5 , ο 8 9 1 7 5 4 -5 5 4 3 5 4 • 1 2 3 6 8 9 3 6 7 6 3 6 5- 6 8 10 6 7 6 7 0 12 3 119 311~354 8 83 1 16 823 64 775 10 1 738 1 84 655 1 97 642 1 2 1 7 1 8 149 690 257 582 254 585 245 594 251 588 412 427 372 467 389 450 294 545 297 542 3 1 1 528 345 494 33 1 508 325 5 14 321 518 139 355~414 7 832 13 826 26 8 13 49 790 47 792 59 780 71 768 104 735 98 741 82 757 87 752 174 665 164 675 208 631 191 648 141 698 144 695 Ϊ52 687 218 621 269 570 273 566 282 557 403 436 375 464 396 443 401 438 392 447 382 457 30 1 538 3 18 52 1 10 167 415~498 9 2 9 3 0 6 6 3 5 3 112 3 3 2 82ο 9 9 3 7 9 4 4 112 3 7 10 7 0 6 9 7 7 0 8 0 3 6 6 6 4 5 ο 5 9 0 0 6 6 4 9 9 6 6 5 4 5 8 5 17 5 6 8 9 9 6 6 5 4 9 8 14 8 2 7 5 4 4 112 3 7 4 10 0 8 3 7 4 4 113 3 7 4 I 1 9 9 6 0 3 8 ? 6 7 4 4 4 5 8 8 0 7 3 0 5 114 3 2 5 8 9 5 0 6 9 -6744 14 9 8 8 2 6 9 -6 6 4 4 8 5 0 1 9 5 17 4 3 12 3 3 -9 1 -12 3 3 4 6 8 3 6 3 5 3 19 2 7 6 0 3 9 6 6 5 4 8 8 6 8 0 7 7 3 0 4 12 3 3 0 5 3 1 2 0 7 0 7 6 4 5 9 4 0 7 3 8 2 3 8 70517914 72122233 4 7 6 4 8 7 6 25586520 66665455 5 2 3 5 12 3 18 8 5 7 8 13 1 1 11 2 3 3 3 6 7 7 6 6 0 7 7 4 2 9 4 8 0 6 6 6 5 4 4 5 883223392 6 9 14 9 5 3 112 2 3 3 3 517405210 6 4 0 9 4 4 2 6 6 7 5 4 5 5 6 ο 82594789 7 9 3 4 9 9 1 1112 3 2 3 3 3 3 5 6 2 5 5 3 7 4 10 4 7 1 6 6 7 6 4 4 5 -6 4 3 7 4 4 6 6 9 2 3 9 6 2 -11 1J n 2 3 3 3 9 2 6 17 6 1 3 8 2 6 4 2 9 6 6 6 5 5 5 4 4 6 0 0 5 4 2 15 5 5 6 12 -1112 3 3 3 5 4 4 7 2 7 7 12 2 16 2 9 112 4 3 3 , 3o 8 8 3 ο 7 ! 5 2 19 4 8 6 6 6 5 5 4 -9 1 1 6 9 2 9 8 12 4 9 5 12 2 2 2 3 I 65399457 72888721 7 6 6 5 4 5 5 4 5 5 2 7 2 2 2 112 7 1 4 7 7 6 4 4 5 2 tl 12 0 8 4 2 3 4 7 2 63776 67644445 3 8 879437287915 960082310961 7 7 1 2 112 4 4 3 3 3 8 6 3 3 5 10--37- 8136183611783 061111244333 8 7 4 0 5 6 2 7 3 5 7 0 12 6 0 9 7 1 117 8- 7 0 9 4 3 6 2 112 3634284159 2211655581 ^267776555445 7 6365715840 2 91122788852 3771112222333 6 4 4915388059. 1057421627521 8776666544455 7 5 50846119404 2986912716812 6 1122243333 7 9 1640447756644 8773381625740 7 6666545455 2 ο 2399552243355 6 ο ο 5 2 7 1 S 6 9 3 1 2212242323 2 7 894733039564995 7 5841724470 6666544445 51802 45106960435004 ο 8592619963 1112243333 7 7 78748120022840 9 2562896459 7666554544 2 2 5 9 8 1879977159 2 1871547984 551112223233 9 4 7 7 , 4298739022 - 7250722650 446767544445 4 9 8 1 5 3 6 3 4 6 3 7 0 2 6 0 6 8 3 5 7 8 8 2 2 2 3 3 3 3 3 - 3629739316 23490865511 76666544455 <Supportable unit size sorting and CM classification> 37

200904090

Fig. 2 is a view for explaining a method of searching for a logical root index according to a CM characteristic according to an exemplary embodiment of the present invention. A view for searching a logical root index according to another exemplary embodiment of the present invention. A viewing view of a method according to a CM index in yet another exemplary embodiment. Please refer to Figures 21 to 23 for the ordering of these entity support units. The latter method of assigning a method based on a single transmitted index can be implemented according to a logical index + Ncs. In one method, each unit uses only one single shot (Fig. 20). It can be divided into a low CM index and if the CM characteristic of a transmitted logical index SC-KDMA CM (1.2 dB), the most attractive CM characteristics of the QPSK CM with SC-FDMA are searched and used sequentially. If the transmission is more exhaustive than the QPSK CM of the SC-FDMA, the nearest neighbors of the CM characteristics of the QPSK CM are used in sequence. In another method, a single unit can use low CM or higher CM) (see Sections 2 and 21, lower CM index, a higher cm index, and -, θ if a logical index of transmission CM characteristics: the roots of the specific embodiment, see the figure. Figure 22 is 'based on the characteristics of C Μ to illustrate the root of the search according to the present invention: the introduction is changed according to the available cable L in an available L element. Logic cable. It can be indexed by the following two sequences (please refer to a high CM index. The CM below or the same as the adjacent or adjacent Logic I index is higher than the SC-FDMA Ϊ The index is searched for any sequence category (compared to the figure). It can be distinguished into a CM index. Below or the same as the 38 200904090 SC-FDMA QPSK CM (1.2 dB), with less than or the same SC - The nearest neighbor logical index of the CM characteristic of the QPSK CM of FDMA is searched and used sequentially. In this example, when it reaches the end of a Ncs section, the index is reset to have a next Ncs. The index of a first higher CM of the segment. If the CM characteristic of a transmitted logical index is higher than The QPSK CM (1.2 dB) of the SC-FDMA, the closest adjacent logical index having a CM characteristic higher than the QPSK CM of the SC-FDMA is searched and used sequentially. In this example, when it arrives at a At the end of the Ncs section, the index is reset to an index of a first lower CM with the next Ncs section. Used to search for the direction of the index with the same characteristics ( + /-, ie index increase/decrease The directions may be the same or different. The direction used to search for the index does not affect the proposed technique, similar to the ordering direction of the index described above (increment/decrement). Figure 24 is a diagram showing an exemplary embodiment in accordance with the present invention. A chart based on the CM characteristics of the entity root index. Please refer to Figure 24, the sequence categories can be defined according to the entity index. The entity root indexes can be classified by setting a CM classification threshold. The classification of the entity root indexes can be checked. Whether a selected entity index belongs to a high CM region or a low CM region is simply implemented. For example, it can be noted that if a CM classification threshold is 1.2 dB', a high CM region can be determined as [2 38, Nz C-238]. Using this method allows indexing to be generated via a simple numerical formula and sorting the indexes (or index mappings) without the need for a complex table. 39 200904090 Logic response based on this maximum supportable One of the unit sizes (or Ncs) is indexed by U|0g and the mapping to an entity index Uphy(Ui〇g) can be expressed as follows [Equation 6] uphy (6-(/-1) + 2-7-1) = ] '(a,,), 7 = 1,2,3, i = 1,2,...,139 {,ahj+i) > 7 = 2, / = 140

^P^.i) = Nzc-uphy(2-i-\), /=1,2,...,(Wzc-l)/2 where ai,i = (Nzc+1), ai,2 = 2i-l, aj, 3 = 2i and u (-1/r) mod Nzc 0 An example of selecting an adjacent available reference when using a plurality of indexes in a unit can be expressed as follows. [Formula 7] % (%++), κ^Κ++)' where U丨og + + represents an index on ulog and It = 23 8 (eg U|〇g+l, ui〇g + 2 ' ui〇g + 3, ...). In this case, some indexes are searched in a positive (+) direction (that is, on an index increase). If a mixed CM index is not allowed, a search program is single. When a low CM sequence arrives at the boundary Nzc-1 via the ui〇g++ program it is set with the first logical index ulog++. However, if the CM index is allowed to be mixed, certain conditions are required. If ui 〇 g + + reaches the boundary of an Ncs , it is reset with a first logic in a ulog + + Ncs section. If U|〇g + + reaches the boundary of a higher CM ui〇g + + program Ncs section, U|cig + + utilizes the first logic of the next Ncs section '(1)= When the direction is very simple, the sequence index in the sequence index 40 200904090 leads to reset. In this example, for the CM characteristics when ulog + + is reset, if the mixed CM index is not allowed, ulog + + can be reset with the first index having the same characteristics as a transmitted index, and if Allowing a mixed CM index, ui〇g++ can be reset using a higher CM or a lower CM that was previously determined based on the characteristics of a transmitted index. Another example of selecting an adjacent available index when using a plurality of indexes in a unit can be expressed as follows. [Formula 8]

P^y (%—), if) <ΛΓ-7, and [μΛ ++)=^ [«λ {u!〇e + +)^1, ^ + +) > JV - /, ] - A- [uph> (uhg )<I, or uph (uhg ) > /,] where ui〇g + + represents a logical index under ui〇g and It = 238 (eg ui〇g+l , ui〇g + 2 ' ui〇g + 3 ' ...). In this example, the index is searched in a positive (+) direction and a negative (-) direction (i.e., in the direction in which the index is increased or decreased).

V If it is difficult to represent the ordering of the index by a numerical formula, each base station and each user equipment must have a large sorting table 8 3 8 * 1 0 bits (1 to 838) = 8,380 bits. However, given Equation 6, each base station and each user device does not have this sort table to use the maximum supportable unit size ordering. Table 12 shows the mapping from the entity index to the logical index based on the maximum supportable unit size using Equation 6. 41 200904090 [Table 12] Numbered Logical Index Entity Root Index 0 1~50 2 837 838 1 419 420 560 279 559 280 629 210 336 503 671 168 699 140 240 599 719 120 734 105 746 93 466 373 755 84 229 610 305 534 769 70 581 258 129 7 10 7 79 60 1 12 727 783 56 367 472 543 296 1 51~100 148 691 233 606 530 309 574 265 797 42 80 759 799 40 572 267 146 693 766 73 804 35 235 604 302 537 484 355 808 31 435 404 809 30 29 810 405 434 811 28 812 27 433 406 603 236 356 483 661 178 1 101~150 74 765 48 791 815 24 536 303 703 136 68 771 287 552 753 86 43 796 818 21 307 532 266 573 819 20 761 7S 39 800 286 553 317 522 261 578 383 456 125 714 357 482 402 437 274 565 702 137 151 688 181 658 329 510 242 151~200 103 471 368 622 217 546 293 721 118 284 7 6 9 5 5 5 0 3 7 9 8 9 ο 2 9 6 2 7 7 5 7 4 3 3 16 6 2 5 5 2 9 9 $ 8 4 8 0 4 2 5 7 17 9 12 4 14 6 7 1 2 0 8 2 8 6 7 3 201~250 288 551 37 802 608 231 535 304 827 12 260 579 709 130 268 571 46 793 816 23 34 805 358 481 660 1 79 563 276 632 207 523 316 441 398 616 223 531 308 f 409 430 549 290 145 694 133 706 91 748 374 465 829 10 612 227 533 306 439 400 569 270 135 704 143 696 132 707 773 66 550 5 251 ~; 300 289 83 756 378 461 611 228 830 。 。 。 。 。 。 。 。 101 331 508 254 585 450 389 514 325 582 257 412 427 594 245 542 297 655 184 197 642 321 518 311 528 251 588 294 545 775 64 557 282 141 698 832 7 631 208 104 735 447 392 382 457 648 7 351~400 191 318 521 47 792 396 443 273 566 403 426 218 621 780 59 813 26 13 826 768 71 538 301 570 269 375 464 675 164 82 757 144 695 665 174 87 752 438 401 98 741 790 49 687 52 501 338 169 670 833 6 8 401 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 590 249 640 199 497 9 451~500 342 171 668 685 154 343 496 248 591 624 215 740 99 469 370 492 347 489 350 175 664 486 353 239 600 300 539 187 652 417 422 211 628 834 5 561 278 139 700 686 153 525 314 157 682 639 200 194 645 742 10 501~550 97 487 352 513 326 163 676 491 348 365 474 237 602 806 33 150 689 764 75 275 564 51 788 394 445 189 650 243 596 298 541 12 601 ~ 650 647 77 5 16 192 458 323 96 381 592 743 480 247 785 359 320 54 277 519 124 715 777 62 292 547 397 442 221 562 28 1 558 835 4 505 334 1 67 672 679 160 369 470 1 16 723 518 186 224 615 653 646 762 193 781 58 127 712 295 544 272 567 225 61 4 429 41 0 205 634 291 548 760 79 459 13 651 ~700 380 206 633 399 440 220 619 27 1 568 754 85 462 377 747 92 11 828 414 425 580 259 770 69 454 385 575 264 803 36 1 8 821 147 692 25 814 407 432 807 32 485 354 1 77 662 490 349 165 674 337 502 416 14 701 ~ 750 423 188 651 745 94 52 787 83 656 328 5 1 1 643 1 96 726 113 476 363 324 515 L· 428 411 625 214 1 59 680 310 529 684 1 55 198 641 117 722 361 478 556 283 776 63 45 1 388 1 09 730 204 635 737 102 390 449 222 15 751 -800 617 728 111 426 413 460 379 609 230 384 455 749 90 45 794 285 554 67 772 3S6 453 607 232 38 801 820 19 41 798 44 795 16 801 838 838 817 22 72 767 262 577 708 3 1 463 376 387 452 226 613 219 620 587 252 126 713 395 444 479 360 180 659 763 76 209 630 3 1 5 524 504 335 421 418 836 3 In all of the above-described exemplary embodiments, when indexes are ordered based on certain characteristics, the order of values having the same characteristics does not affect the order of sorting. At the same time, the order of the paired indexes does not affect the order of the sorting. In the sorting (enantiomeration) method according to all exemplary embodiments, when the cord 12 5 5 12 5 6 7 9 17 17 4 4 3 2 4 9 6 6 5 3 4 6 4 14 2 2 7 6 5 2 4 1 7 4- 2 0 9 2 2 8 2 9 2 n 1 1 7 6 7 2 2 2 7 3 7 6 3 1 6 3 7 6 16 13 6 2 6 6 3 2 5 3 5 1 7 3 3 0 18 9 9 ο 5 5 5 7 8 4 1 0 4 4 5 5 6 9 4 3 2 7 5 5 9 6 5 2 7 8 2 42 200904090 When increasing, they are in increasing order of the size of the CM or the maximum supportable unit Sorting 'but it's just an example. That is, when the quote is incremented, 'they can be sorted in ascending order of the size of the C or the maximum supportable unit size, or in descending order in which the CM or the maximum supportable unit is reduced in each group. . In addition, the cables are sorted by the shape of a hill or by the shape of a valley (v). At the same time, the directionality of the CM or the maximum supportable unit size can be determined to be different in the group. Figure 25 is a graph showing the c Μ characteristic of the logical root 5 及 and the maximum supported unit radius according to another exemplary embodiment of the present invention. As the logical indexes increase, they can be sorted in ascending order of increasing the maximum unit size, and sorted in the order in which the C Μ is reduced. Figure 26 is a graph showing C Μ characteristics and maximum supportable radius characteristics according to a logical root index in accordance with another exemplary embodiment of the present invention. Individual C Μ groups have been grouped based on the cyclic offset parameters. As the logical indices increase, they are sorted in increasing order of increasing the radius of the most supported unit, sorted in decreasing order of decreasing CM number groups, and sorted in increasing order of increasing C Μ ,. Referring to Figures 25 and 26, the directionality of the CM or the maximum supportable size can be determined to be different in each group. The results are sorted in descending order of decreasing CM after sorting in the ascending order of increasing the maximum supportable unit size, and the result is as shown in the figure. When the odd group is sorted by the descending order of CM reduction, the size of the addition is increased, and in each of the examples, the characteristic support decremental unit, N cs, the odd group unit, etc., when 5 25 The 43 200904090 even groups are sorted in ascending order of increasing CM, and the results are as shown in Figure 26. By making the ordering of adjacent (continuous) groups different, a larger number of adjacent (continuous) indices with a lower C 即可 can be used in a low mobility unit regardless of the maximum supportable unit radius.

i In all of the above-described exemplary embodiments, if a single index is configured in each unit in the ordering (encoding) method, each user equipment can be incremented by 1 from an index transmitted. The index is used minus 1 to increase or decrease the number of random access preambles for each unit as needed. If the index is used by incrementing by one, when the maximum index 83 8 is used, it can return to the minimum index of 1 and continue to use. If the index is used by decrementing by one at a time, when the smallest large index 1 is used, it can return to the maximum index 83 8 and continue to use. In addition, the incremental direction ( + /-) can be used differently depending on each characteristic (e.g., a lower CM / - higher CM). When the indexes are ordered in increasing increments in which the size of the maximum supportable unit increases as the indices increase, since the available index is limited to a large unit, it is preferable to configure an index starting from a large unit. In this case, the easiest way to plan a cell is to configure the largest index to the largest cell and then use the index by one stage of one decrement. <Specific embodiment of composite sorting > Figure 27 is a diagram showing a procedure for sorting a grouped CM into two groups. Figure 28 is a diagram showing a grouped index sorted to N c s groups in each group according to the maximum supported Ncs characteristics. Figure 29 is a diagram showing a program of 2009 2009090 sorting the index based on the CM characteristics in each Ncs group. Please refer to Figures 27 to 29, (1) The indexes are sorted according to the characteristics. The indices are divided into a group of QPSK CMs of a group of SC-FDMAs higher than 1.2 dB, and groups below 1.2 dB, as shown in Figure 27. (2) After the entire index is sorted according to the maximum unit radius, the Ncs value (or the maximum supportable unit radius value) is divided into one of the largest Ncs after the individual groups are sorted according to the maximum supportable unit radius. Unit radius values can be supported and segments. In this example, the groups may be grouped according to the Ncs value, and the plurality of specific N c s values may be grouped separately to distinguish a specific N c s value. Here, an instance using a group corresponding to each is used, and the divided sections are as shown in Fig. 28. (3) The indices are sorted according to the CM in each of the differentiated segments, as shown in Figure 29. Here, 13, 15, 18, 22, 26, 32, 38, 46, 59 119, 167, 237, 279, and 419 are used for the Ncs sample values. Table 13 shows the root; the relationship between the entity index and the logical index of the result of the graph. Wait for the CM group, the group, and their segments. , they are divided into no or another N cs value, system, 76, like 29 45 200904090 [Table 13] number logic 51 entity index 0 1~24 1 838 2 129 710 837 70 769 93 229 610 746 105 734 84 755 168 671 210 629 120 719 140 699 1 to 28 60 779 56 783 2 -34 112 727 148 691 233 606 3 to 42 80 759 73 766 42 797 40 799 4 -50 31 808 35 804 146 693 235 604 5 to 60 236 603 28 811 30 809 27 812 29 810 6 to 74 24 815 43 796 48 791 68 771 74 765 178 661 136 703 7 -86 125 714 86 753 78 761 39 800 20 819 21 818 Q 15 824 61 778 1 03 736 95 744 202 637 190 649 181 658 122 717 137 702 151 688 128 71 1 217 622 -142 23 1 608 130 709 142 697 1 79 660 203 636 1 1 8 721 207 632- 1 1 0__729 89 7 5 0""IT 784 46 793 37 802 34 805 23 8 1 6 14 825 12 827 9 830 10 829 66 773 91 707 223 616 227 612 228 5 4 4 9 5 3 4 ο 6 9 6 3 3 6 ο 216 623 149 690 141 698 121 718 197 642 161 678 201 638 184 655 173 666 1 0 8 73 1 106 733 丨01 738 57 782 64 775 53 786 16 823 8 83 1 f 12 '288 8 9 4 6 7 14 6 7 8 11 4 9 1 17 12 4 1 7 7 4 8 7 2 K 8 6 6 6 9 6 6 2 5 2 0 16 1 8^712 139 963s 9 6 6 6 6 15 6 2 -3075-7 7 1 II 4 ο 5 0 2 2 9 -1 5 7 6 Γ 8 .42 6 6 6 811 _ 5 1 7 2 -7 1 5 -7 8 5 5 4 0 7 6 6 49826 i 4 1 4 4 9 3 3 9 6 12 8 7 ο 1 5 4 2 6 0 6 6 6 ϊ ο 6 4 1-17 5 4 8 1 9' 8 7 ο 6 -3 ο 1 6 2 2 273285 9 5 6 8 8 4753 one 6 7 9 4 6 £ 8 3 15 1 : 8170 13 ~ 400 0 4 5 3 2 7 2 2 16 6 0 2 1117 8 8 6 6 9 7 2 617164677 3 丨—36 13 3 0 4 0 2 2 9 6^8 2 111 5305 39633 10 4 2 6 7 6 7 4 3 4 9 4 67580 2 3 9 1 5 6 474483 12 4 5 6 6 6 6 2 8 4 8 7 7 5 2 5 5 2 19 8 2 2 117 1 9 5 2 6 7 9 8 8 4 3 0 5 6 6 6 6 6 8 7 7 7 3 2 0 3 5 9 0 9 4 2 112 7 5 5 5 8 8 7 4 11114 1 7 8 9 5 4 6 617172679225 8 6 3 ο 3 _ 8 5 5 2 2 5 7 18 2 6 7 6 7 6 7 7 4 2 2 5 17 1 S 〇0 2 7 8 00 1 5 1 4 1 6 2 6 7 3 2 2 5 3 7 0 6 6 6 6 7 7 3 3 3 2 6 7 8 18 0 6 9 2 12 16 4 2 2 4 3 7 9 6 3 7 7 4 6 6 6 6 7 3 8 7 7 5 6 2 4 7 0 6 6 5 112 1 -474 7 7 4 6 11 -712 6 3 1 9 ' 8 5 3 5 11 4 2 7 2 1 5 1 4 6 7 0 9 2 8 8 6 3 8 2 6 11 9 7 2 5 6 2 2 7 7 6 1 ο 4 8 0 2 6 7 9 9 1 7 7 12 3 7 3 7 ' 2 1 4 7 6 409 13 2 1 12 809 741 ο 8 4 2 3 6 6 5 9 - 7 . 8 1 5 11 6 6 13 6 8 2 1 2 f ο ο 8 3 1 2 3209632 6 12 94725909 7 6 6 664307 7 S 6 774 70. 2 . 262 577 252 15 ～ 528 285 554 379 360 479 3 10 16 2 4 3 3 19 5 2 4 8 4 4 4 8 0 4 19 5 4 3 3 7 0 9 8 6 2 5 4 5 3 3 0 6 5 9 4 4 4 6 6 9 7 8 4 3 3 3 8 12 2 5 0 4 4 5 1 8 -18 3 4 3 3 6 5 4 2 5 2 4 4 5 3 4 5 n 00 II 4 3 3 3 6 1 2 7 1 4 4 5 5 15 9 6 3 3 3 3 4 8 4 4 7 0 4 4 5 6 2 5 5 5 1 5 4 5 3 7 4 8 8 2 2 3 3 323 5 1 6 322 5 1 7 320 327 5 12 352 487 3 14 364 475 362 477 299 393 446 397 442 394 247 592 417 422 246 244 595 272 567 264 9 5 0 5 3 5 12 4 4 9 7 5 5 5 4 5 5 3 9 10 7 3 5 9 17 3 3 2 4 2 17 7 2 1 9 2 4 6 6 4 5 5 4 5 8 2 2 7 8 4 19 7 7 3 3 2 3 2 5 6 4 0 9 0 0 2 7 7 8 8 5 5 4 4 5 5 4 3 5 9 0 9 3 16 6 5 5 3 3 3 3 2 2 6 0 8 9 2 0 8 4 2 6 5 4 5 4 5 2 5 17 1 3 9 8 0 7 3 2 3 4 2 8 2 8 5 3 6 5 5 4 4 5 7 4 _ 0 4 _ 9 5 9 15 18 9 8 7 3 3 3 2 2 0 4 0 8 4 2 5 4 5 6 5 4 4 5 5 6 8 0 4 3 -9 8 I 4 -2 3 4 2 3 19 5 6 14 5 2 9 5 5 4 4 5 -684 0 8 6 9 0 6 8 0 6 4 4 5 9 13 0 3 7 5 3 2 3 3 3 118 2 0 3 3 9 6 4 5 4 -8 1 7 3 0 0 4 2 4 3 3 9 6 3 6 9 4 2 3 3 3 0 2 7 7 4 2 3 3 0 3 6 7 4 9 5 4 4 6 9 7 6 6 9 5 4 4 17 9 9 4 9 5 4 4 8 2 0 4 9 4 2 3 3 0 8 9 9 3 8 5 4 4 9 10 4 0 5 2 6 1 8 6 4 2 3 3 5 7 9 5 4 4 6 7 1 3 5 2 4 4 5 3 2 8 0 8 1 4 3 3 4 9 1 6 3 0 4 5 5 5 0 8 7 0 3 18 '728 5 4 5 2 9 5 3 2 2 8 2 5 14 8 5 5 5 17 4 2 9 5 3 2 2 4 5 4 14 8 1 ο » «I 3 8 4 3 3 2 2 s ο 8 0 5 9 5 4 5 5 1 3 4 4 7 9 2 4 4 5 2 4 1 3 4 7 7 ο 6 5 4 9 2 3 7 3 3 3 8 2 9 4 8 4 4 5 6 17 4 9 5 8 2 4 4 4 1 4 5 3 2 5 8 9 -4 - 9 8 5 15 14 3 2 8 4 2 9 5 5 19 ο 6 7 ο 2 3 569 276 563 374 465 409 430 378 461 398 441 400 439 290 549 289 550 533 308 53 1 316 523 20 772 358 260 481 579 293 546 304 535 288 551 284 555 253 586 268 571 256 583 263 576 21 ～ 786 242 597 274 565 402 437 368 471 383 456 357 482 329 510 22 -798 317 522 307 532 286 553 287 552 266 573 261 578 23 -802 303 536 356 483 24 to 810 355 484 405 434 404 435 406 433 25 to 814 267 572 302 537 26 to 816 265 574 27 -822 367 472 296 543 309 530 28 to 824 258 581 29 ~ 838 240 599 419 420 279 560 280 559 373 466 305 534 336 503 46 200904090 In Table 13, a group with only a small number of indexes. These groups with only a small number of indexes can be integrated into a single group to form a single group. In all of the exemplary embodiments described above, with respect to pairing assignments, the relative positions of the two adjacent pairing indices do not affect the proposed technique. In addition, when the indexes are sorted according to certain characteristics (such as the CM, the maximum supportable unit size (or N c s, etc.)), the order of indexes with similar characteristics does not affect the proposed technique. f', (in the above method, the user equipment and the base station must have a pair of mapping tables showing the relationship between the entity indexes and the logical indexes in each memory. In the example, the entire 8 3 8 indexes can be stored in each memory ten, or only half of them can be stored according to the pairing allocation. If only half is stored, it can be assumed that there is a number after the ith index (Ni The index is to be processed. When the indexes are sorted using the above method, and the index available in a unit is notified to the base station, the method of using the number f of the Ncs configuration and a single logical index can be used. In this example, a single logic, index can be signaled using logical indices 1 through 8 3 8 using 10 bits. Additionally, indices 1 through 4 1 9 can be signaled using only one 9-bit paired assigned value. In this example, to use the pairing assignment alone, an additional 1 'bit' can be used to represent the index used in the pairing assignment as the first index 1 to .419 or the back index 420 to 83 8. When the index is only When notified by 9 bits They can be processed after assuming that the (Ni)th index is after the ith index. Fig. 30 is a flow chart of the program for random access 47 200904090 according to an exemplary embodiment of the present invention. a user equipment (UE) receives random access information from the base station (S310). The random access information includes information about the offset parameter Ncs, and about generating a plurality of random access sequence information. The parameter Ncs can be used to obtain the value of a ZC sequence ring offset. The information about generating a random access sequence is the information of the logical index. The logical index is an index to which a real index of a ZC sequence is mapped. The logical index becomes a source index that generates a set of outgoing texts. Information about the cyclic offset parameter Ncs and the logical index can be broadcasted as part of the system information, or transmitted on the chain control channel. The offset parameter Ncs or the method or format of the logical index is determined. The user equipment obtains the mapped entity root by the logical index (S3 20). There are 64 available preambles in each unit. The 64 sequence sequences in the unit can be found by including all available loops of the Zadoff-chu sequence of one of the logical indexes in order to increase the cyclic offset. If the 64 random access preambles cannot be made by a single Zadoff- When the Chu sequence is generated, an additional sequence of sequences can be obtained from the root sequence with such consecutive logical indexes until all 64 columns are found. The sequence of the logical root sequence is cyclic: when Nzc = 83 8 , the logic is 0 after That is, it continues to 8 3 7. Therefore, the user equipment can find each available random access preamble via a logical index. Even if the base station notifies the user equipment that it is only about a single logical (BS) loop Follow the root machine and save it. Passing an infinite index, the group has a sequence of ones that are transferred to the single series. 200904090, the user device can find out the available 64 random access sequences, corresponding to the roots of the consecutive logical indexes. ZC sequences are classy and all sequences produced have substantially similar properties. At the same time, the root ZC sequence of the consecutive logical indexes may have a complex commonality 'which represents the sum of the root index of the root ZC sequence corresponding to two consecutive logical lines 5 等于 equal to the length of one ZC sequence. The sequence is mapped to the actual reference of the root zc sequence, and the root index of the entity is after the subgroup according to the c M. These subgroups have been derived from the predetermined cyclic offset parameters and the group ZC sequence. Even if a fast logical index is selected to have a root zc sequence with similar characteristics to the existing logical index. The user device can obtain the 64 sequence sequences required to select the access sequence. As described above, the logical index is an index of the index of the entities, and the state is that the zc sequences have been grouped into subgroups according to the number of miles of the preview, and the C is in each subgroup. Therefore, the logical sequences belonging to a single subgroup have the same parameters. Although the base station takes into account the logical sequence of the user equipment's mobility, the user equipment can obtain a plurality of zc sequences having the same number of cycles N c S and similar C Μ characteristics. The user equipment transmits a selected random access sequence to the station (S3 30) on a random access channel (RACH, Access Channel). That is, the user equipment randomly selects 64 random access preambles. First, and transmitting the selected random access sequence text. This i-like special: the two body roots corresponding to the yoke symmetry 'sort. The grouping is still available, therefore, the random to the cable offset Parameter sorting. Ring offset and only offset parameter Random. The base is available 49 200904090 The base station transmits a random access response, that is, a response to the random access sequence (S340). The random access response can be A MAC message configured in a MAC is a higher layer of a physical layer. The random access response is transmitted on a downlink shared channel (DL-SCH, "Downlink Shared Channel"). The random access response is a random access radio network temporary identification code (RA-RNTI, "Rand〇m Access-Radio Network Temporary" transmitted on a physical downlink control channel (PDCCH, "Physical Downlink Control Channel"). Identifier") is addressed. The RA-RNTI is an identification code for identifying time/frequency resources used by random access. The random access response may include time alignment information, initial keying, and a temporary unit-radio network temporary identification code (C-RNTI,

Cell-Radio Network Temporary Identifier"). The time alignment information is timing correction information for uplink transmission. The initial uplink is given as ACK/NACK information about uplink transmission. The temporary C-RNTI refers to a user equipment. The identification code, which is not permanent until the collision is resolved. The user equipment performs a scheduled uplink transmission on a UL-SCH (S3 50). If there is additional data to be transmitted as needed, the user The device performs a chain transfer to the base station and performs a collision resolution procedure. If an error occurs in the transmission of the random access sequence, the random access procedure is delayed because the random access procedure is in an initial access. The delay to the random access procedure may result in an access delay or a service delay to the base station or upon delivery to the base station. The user equipment may pass the "preamble" applicable to the high speed environment. The sequence, whereby the user, by the month b, is able to transmit the downtime access preamble in the high speed. 50

200904090 By using a continuous logical index, a random access preamble of characteristics can be generated. Control the letter to produce the product @, the seat is randomly reduced. Random access failures can reduce efficiency in cell planning in high-speed environments. Figure 31 is a block diagram showing the architecture of an element of the exemplary specific implementation. A user equipment 50 can include a processor-RF unit 53, a display unit 54, and a generation and mapping of processing sequences that can be processed by the MAT-based user processor 51. Features, as described above. Remember the processor 51 and store an operating system, application and slot

It can display a variety of information and use known 亓A components such as (LCD, “Liquid Crystal Display”), Organic Light Emitting Diode (Organic Light Emitting Diode). Ignorance. The user's keyboard, _ 'and each of the above functions can be implemented by a processor that handles these functions, such as a microprocessor, _ 码 code, etc., a microcontroller, a specific application Asm Specific lntegrated Circuits or similar plans, these codes are based on the present invention by those skilled in the art; although preferred embodiments of the present invention have been disclosed for purposes of illustration, those skilled in the art will understand It is possible that there are many similar entities F can be used to read the most and can be implemented with & user set memory 5 2, surface unit 55. ! In a variety of examples 'to connect to the display unit 5 4 LCD Polar body (OLED, interface unit 5 5 • touch screen or l or receive wireless, such as software-based controller, “Application development and implementation are clear. The purpose of the display is modified, added by the combined user interface Formed, for example, similar. RF unit 53 is coupled to the processor electrical signal. 51 200904090 Additions and substitutions, without departing from the scope of the present invention. The examples are not limited to the specific embodiments described above, but are defined by the scope of the following claims and the full scope of their equivalents. [Simplified Schematic] FIG. 1 is a diagram showing the implementation of a random access procedure in a WCDMA system. An example of a method is shown in the figure. Fig. 2 is a view showing a wireless communication system. Fig. 3 is a flow chart showing a procedure for generating a sequence according to an exemplary embodiment of the present invention. A graph of CM (cubic metric) characteristics and maximum supportable unit radius characteristics according to an entity root index in an exemplary embodiment of the present invention. FIG. 5 is a diagram showing a logical root index according to an exemplary embodiment of the present invention. Graph of CM characteristics and maximum supportable unit radius characteristics. Fig. 6 is a graph showing CM characteristics and maximum supportable unit radius characteristics according to a logical root index according to another exemplary embodiment of the present invention. Figure 14 shows a CM characteristic and a maximum supportable list according to a logical root index in still another exemplary embodiment of the present invention. Graph of Radius Characteristics. Figure 15 is a graph showing the number of loops of 200904090 loop offsets according to the limits of Ncs available for each CM index for CM mapping in accordance with an exemplary embodiment of the present invention. Figure 6 is a graph showing the number of cyclic offsets that Ncs can use for each logical root index according to the maximum supported unit size, in accordance with an exemplary embodiment of the present invention. A graph of the number of cyclic offsets that can be used for each logical root index limit according to N cs for composite mapping, in accordance with an exemplary embodiment of the present invention. Figure 18 is a diagram showing an example of a logical root index configured to a unit for C Μ mapping in accordance with an exemplary embodiment of the present invention. Figure 19 is a diagram showing an example of a logical root index configured to a unit of the largest supported unit size mapping in accordance with an exemplary embodiment of the present invention. Figure 20 is a diagram showing an example of a logical root index configured to a unit of the largest supported unit size mapping in accordance with an exemplary embodiment of the present invention. Figure 21 is a view for explaining a method of searching for a logical root index based on CM characteristics in accordance with an exemplary embodiment of the present invention. Figure 22 is a view for explaining a method of searching for a logical root index according to a CM characteristic in accordance with another exemplary embodiment of the present invention. Fig. 23 is a view for explaining a method of searching for a logical root index according to CM characteristics in still another exemplary embodiment of the present invention. Figure 24 is a graph showing CM characteristics according to an entity root index in accordance with an exemplary embodiment of the present invention. FIG. 25 is a diagram showing a CM characteristic according to a logical root index and a maximum supportable unit radius characteristic according to another exemplary embodiment of the present invention. FIG. 2 6 is a diagram showing another according to the present invention. In the exemplary embodiment, according to the CM characteristics of the logical root index and the graph of the most supportable unit radius characteristics, FIG. 27 is a graph showing the --grouping CM, the sequence to the two groups. Figure 28 is a diagram showing a grouping of the index sorted according to the maximum supportable Ncs characteristics to the N cs group in each group; Figure 29 is a display - based on the parent Ncs group FIG. 30 is a flowchart illustrating a random access procedure according to an exemplary embodiment of the present invention. FIG. 31 is a diagram of an embodiment of the exemplary embodiment of the present invention. Architecture block diagram of the components of the user equipment 〇 [Main component symbol description] 10 User Equipment 52 Memory 20 Base Floor 53 RF Unit 50 User Equipment 54 Display Unit 5 1 Processor 55 User Interface 〇〇 —' Early 兀 54

Claims (1)

200904090 X. Patent application scope: 1. A method for generating a logical index of a root Zadoff-Chu (ZC) sequence, the method comprising the steps of: dividing a plurality of root indexes of a root z C sequence into one according to a predetermined cyclic offset parameter Or a plurality of subgroups, a subgroup comprising at least one index of a ZC sequence; and a root index of the root ZC sequences in the subgroup being mapped to a continuous logical index. 2. The method of claim 1, wherein one of the ZC sequences has a zero-interconnect region of length (the cyclic offset parameter value of the root ZC sequence is -1). 3. The method of claim 1, further comprising the step of: prior to mapping to the logical indexes, sorting the root indices of the root ZC sequences in a subgroup according to a metric. 4. The method of claim 3, wherein the measure is a cubic metric (CM). 5. The method of claim 1, further comprising the step of: performing a cyclic offset of a ZC sequence using a cyclic offset value, wherein the cyclic offset value is obtained by using the root ZC sequence A cyclic offset parameter and a Doppler shift of a detection phase are obtained. The method of claim 5, wherein the cyclic offset parameter of the root ZC sequence is less than or equal to a predetermined cyclic offset parameter of a subgroup of the root ZC sequence. 7. The method of claim 5, wherein the cyclic offset value of the root ZC sequence is greater than the cyclic offset parameter of the root ZC sequence. 8. The method of claim 1, wherein the kth element c(k) of a ZC sequence is defined by the following formula: |, for N odd C〇)=exp for N even where N is the length of the root ZC sequence, and Μ is an entity root index and is mutually prime. 9. The method of claim 1, further comprising the step of: sorting the subgroups according to a predetermined cyclic offset parameter. 10. The method of claim 1, wherein a last logical index of a first subgroup is followed by a first logical index of a second subgroup, and the second subgroup is followed by a subsequent Go to the first subgroup. 56 200904090 1 1. A method for performing random access in a wireless communication system comprises the steps of: selecting one of a plurality of random access preambles from the plurality of random access preambles by having a continuous sequence of ZC sequences An offset is generated, wherein the root index of the mapping to the root ZC sequence transmits the selected random access sequence; and f'.' x receives a random access response including the identification code of the preamble. 1 2. The method of claim 11, wherein two of the root ZC sequences of the continuous logical index are rooted in the length of one ZC sequence. 1 3. As described in the patent application scope item 11, (the downlink shard channel (DL-access response is addressed to a chain control channel, PDCCH). 1 4. For example, the method described in claim 11: receiving a logical index and a program from a base station, randomly accessing the preamble, continuing the root of the logical index, and selecting the random access of the continuous logical cable. The random channel (physical-random access identification on the lower-chain common SCH), and the following step-cycle offset parameter to generate the random access preamble at 57 200904090, where the sum of the two indexes is The cyclic offset parameter is used to obtain a cyclic offset value. 15. A method for performing a random access procedure in a wireless communication system, the method comprising the steps of: transmitting a source logical index to generate a plurality of random accesses a preamble and a predetermined cyclic offset parameter; receiving a random access sequence selected from the plurality of random access preambles, the plurality of random numbers The access sequence is generated by a root ZC sequence having at least one consecutive logical index of the source logical index and the source logical index; and transmitting a random access response including the identification of the random access sequence 1. The method of claim 15, wherein the source logical index is transmitted as part of system information. 1 7. The method of claim 15, wherein the method of claim 15 The sum of the two root indices of the root ZC sequence corresponding to two consecutive logical indexes is equal to the length of one ZC sequence. 1 8. The method of claim 15, further comprising the steps of: receiving A cyclic offset parameter, wherein the cyclic offset value is obtained using the 58 200904090 cyclic offset parameter. 19. A method of generating a random access sequence, the method comprising the steps of: 'gradually increasing the first ZC sequence a cyclic offset (which has a pair of first index to a first logical index), sequentially generating a random access preamble; and when a predetermined number of random stores The preamble cannot gradually increase the cyclic offset of the second ZC sequence (which has a pair of second index to a second logical index) when the first root '' ZC sequence is generated, An additional random access sequence is generated in sequence, and the second logical index is followed by the first logical index. The method according to claim 19, further comprising the following steps: The first logical index is received. t X 2 1 The method of claim 19, wherein the predetermined number of random access preambles is 64. 22. The method of claim 19, further comprising the step of: - receiving information on a cyclic offset parameter, wherein the cyclic offset value is obtained using the cyclic offset parameter. 59 200904090 23. The method of claim 19, further comprising the steps of: selecting a random access preamble from the random access preambles and the additional random access preambles; and transmitting the selected Random access preamble. 24. A method of generating a random access preamble, the method comprising the steps of: receiving information on a source logical index; and incrementally increasing a root ZC sequence from the source logical index start point (which has a continuous logical index) The cyclic offset, sequentially generating random access preambles until a predetermined number of random access preambles are found, wherein the consecutive logical indexes are mapped to the root indices of the root ZC sequences. 25. r i The method of claim 24, wherein the random access preamble is generated in a manner that increases the cyclic offset of a ZC sequence. 26. The method of claim 25, further comprising the step of: receiving information on a cyclic offset parameter, wherein the cyclic offset value is obtained using the cyclic offset parameter. 60