WO2009097727A1 - 随机接入信道的zc序列排序方法和装置 - Google Patents

随机接入信道的zc序列排序方法和装置 Download PDF

Info

Publication number
WO2009097727A1
WO2009097727A1 PCT/CN2008/073299 CN2008073299W WO2009097727A1 WO 2009097727 A1 WO2009097727 A1 WO 2009097727A1 CN 2008073299 W CN2008073299 W CN 2008073299W WO 2009097727 A1 WO2009097727 A1 WO 2009097727A1
Authority
WO
WIPO (PCT)
Prior art keywords
sequence
index
physical index
mapping
logical
Prior art date
Application number
PCT/CN2008/073299
Other languages
English (en)
French (fr)
Inventor
Peng Hao
Shuqiang Xia
Bo Dai
Chunli Liang
Bin Yu
Original Assignee
Zte Corporation
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zte Corporation filed Critical Zte Corporation
Priority to US12/864,653 priority Critical patent/US8391229B2/en
Priority to RU2010133955/08A priority patent/RU2482603C2/ru
Priority to EP08872051.1A priority patent/EP2239879A4/en
Priority to BRPI0821864-1A priority patent/BRPI0821864B1/pt
Publication of WO2009097727A1 publication Critical patent/WO2009097727A1/zh

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J13/00Code division multiplex systems
    • H04J13/0007Code type
    • H04J13/0055ZCZ [zero correlation zone]
    • H04J13/0059CAZAC [constant-amplitude and zero auto-correlation]
    • H04J13/0062Zadoff-Chu
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J13/00Code division multiplex systems
    • H04J13/0003Code application, i.e. aspects relating to how codes are applied to form multiplexed channels
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J13/00Code division multiplex systems
    • H04J13/16Code allocation
    • H04J13/22Allocation of codes with a zero correlation zone
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/04Wireless resource allocation
    • H04W72/044Wireless resource allocation based on the type of the allocated resource
    • H04W72/0466Wireless resource allocation based on the type of the allocated resource the resource being a scrambling code
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access
    • H04W74/08Non-scheduled access, e.g. ALOHA

Definitions

  • a random access channel uses a cyclic shift sequence of a Zadoff-Chu (ZC) sequence as a preamble.
  • ZC Zadoff-Chu
  • ZCZ Zero Correlation Zones
  • the user equipment User Equipment, UE for short
  • the example port the mobile phone, the personal digital assistant, etc.
  • BCH broadcast channel
  • the base station passes the BCH. Notifying the Logical root sequence number of the first ZC sequence that can be used by the RACH of the mobile phone and the step size of the cyclic shift, the mobile phone uses the certain mapping rule to calculate the physicality of the corresponding ZC sequence according to the logical index. The physical root sequence number is then generated according to the cyclic shift step size ( ⁇ in the high-speed environment, but also according to a certain "cyclic shift limit rule") to generate an available ZCZ sequence. If the ZCZ sequence If the number is less than the preset threshold P, the mobile phone automatically increments the sequence logical index, and continues to generate the ZCZ sequence by using the next ZC sequence until the total number of ZCZ sequences is greater than or equal to P.
  • the shooting process is the process of reordering the ZC sequence.
  • the ZC sequence is generated by the following formula (1), where N is the sequence length, M is the physical index of the sequence, and the physical index of the ZC sequence refers to the generation of each The index used in the ZC sequence, (n) represents the 4 unordered values of the "sample" of the physical index.
  • Sequences? I refers to each ZC sequence after sorting the ZC sequences according to a criterion. The number in the queue after sorting. FIG.
  • FIG. 1 is a schematic diagram of a frame structure of a Time Division Duplex (TDD) mode in an LTE system.
  • TDD Time Division Duplex
  • the slots form a subframe of length lms, one radio frame contains 10 subframes (numbered from 0 to 9), and one radio frame contains 20 slots (numbered from 0 to 19).
  • a time slot contains seven uplink/downlink symbols of length 66.7us, wherein the first symbol cyclic prefix length is 5.21us.
  • the cyclic prefix length of the remaining 6 symbols is 4.69us; for an extended cyclic prefix of length 16.67us, one slot contains 6 up/down symbols.
  • subframe 0 and subframe 5 are fixed for downlink transmission; support uplink/downlink conversion with periods of 5 ms and 10 ms; subframe 1 and subframe 6 are The special subframe is used to transmit three special time slots, that is, Downlink Pilot Time Slot (DwPTS for short). Guard Period (GP) and Uplink Pilot (Uplink Pilot) Time Slot, referred to as UpPTS;), where
  • DwPTS is used for downlink transmission
  • GP is the protection time and does not transmit any data
  • the UpPTS is used for uplink transmission, and includes at least two uplink single carrier-frequency division multiple access (SC-FDMA) symbols for transmitting a physical random access channel (Physical Random Access CHannel, referred to as PRACH) 0
  • SC-FDMA Physical Random Access CHannel
  • PRACH Physical Random Access CHannel
  • subframe 2 and subframe 6 are fixed for uplink transmission; in the uplink and downlink handover of 10 ms period, DwPTS exists in two fields, and GP and UpPTS exist in the first field. , the length of DwPTS in the second field is lms, and the length of subframe 2 is ⁇ . Line transmission, subframe 7 to subframe 9 are used for downlink transmission.
  • the TDD mode of the LTE system has two types of PRACH.
  • the first type is transmitted in non-special uplink subframes (subframes containing special time slots are called special subframes); the second type is transmitted in UpPTS.
  • the first type of PRACH is sorted by dividing the sequence into two groups according to the cubic metric with a threshold of 1.2 dB, and then the maximum cyclic shift amount supported by the sequence under the cyclic shift constraint will be The sequence is divided into subgroups, which are then sorted according to the cubic metrics of the sequence within each subgroup.
  • Cubic Metric (CM) is a measure of the peak-to-average ratio of transmitted data. The larger the CM is, the higher the peak-to-average ratio is.
  • the calculation method is as shown in the following formula (2).
  • the second type of PRACH subcarriers are wider, and the anti-multiple-Puller frequency offset is stronger, and the cyclic shift problem is not required to solve the frequency offset problem, so the second type of PRACH cannot be used.
  • a sorting method for PRACH is higher.
  • W monotonically decreases; below the symmetry axis, the monotony increase of W specifically includes: establishing a mapping between the logical index and the physical index by the function W + 1 modN
  • it includes: establishing a mapping between a logical index and a physical index by using the function w 1 mod N
  • w is symmetrically mapped up and down and above the axis of symmetry, w monotonically decreases or increases; below the axis of symmetry, ⁇ monotonically increases or decreases.
  • the building module establishes a logical index and a physical cable with a function W 1 mod N
  • the building module establishes a logical index and physics with a function w mod N
  • N 139
  • CM value of the sequence approximates the sequence.
  • the physical index increases and increases, and when the physical index of the sequence is greater than or equal to
  • the ZC sequence sorting method and apparatus provided by the present invention are equivalent to appropriately sorting the ZC sequence according to the CM value, so that the network planner can select the ZC sequence with similar CM values. Allocating to the same cell ensures that the PRACHs of UEs with different sequences in the same area have similar coverage, which solves the lack of ZC sequence ordering in the prior art, and causes UEs using different ZC sequences in the same cell to have Different coverage issues increase the flexibility of cell planning.
  • FIG. 1 is a schematic diagram of a frame structure of a TDD mode of an LTE system in the related art
  • FIG. 2 is a flowchart of a ZC sequence ordering method according to an embodiment of the present invention
  • CM value correspondence N is 139
  • Fig. 4 is a block diagram showing a ZC sequence sorting apparatus according to an embodiment of the present invention.
  • DETAILED DESCRIPTION OF THE INVENTION The functional phase is based on the fact that when the physical index of the sequence is less than or equal to
  • the physical index increases and increases when the physical index of the sequence is greater than or equal to
  • the CM value of the sequence is approximately reduced as the physical index of the sequence increases.
  • the ZC sequence is properly sorted according to the CM value, and the CM value is obtained.
  • the similar ZC sequences are allocated to the same cell, which ensures that the PRACHs of UEs with different sequences in the same area have similar coverage, thereby improving the flexibility of cell planning.
  • Step S10 setting ⁇ as a logical index of each ZC sequence, and w is each ZC. a physical index of the sequence, where l ⁇ w ⁇ N - l, 0 ⁇ ⁇ N - 2 , N is the length of each ZC sequence;
  • M maps ⁇ symmetrically up and down, and above the axis of symmetry, monotony decreases or increases; below the axis of symmetry, w monotonically increases or decreases.
  • is the horizontal axis and w is the secondary axis.
  • w is above the axis of symmetry, ie "greater than or equal to 1% I; ⁇ below the axis of symmetry, ie less than or equal to
  • Figure 3 is the correspondence between the physical index of the sequence and the CM value (N is 139). As shown in Figure 3, when the physical index of the sequence is less than or equal to the value, it increases approximately as the physical index of the sequence increases. , when the physics of the sequence, the CM value of the sequence is similar,
  • the sorting method of this embodiment utilizes the properties shown in FIG. 3 above, and the ZC sequence is appropriately sorted according to the CM value, and the ZC sequences with similar CM values are allocated to the same cell, and It is proved that the PRACH of the same mobile phone with different sequences in the same area has similar coverage, thereby improving the flexibility of cell planning.
  • the length of the ZC sequence used by N -, ⁇ for the odd machine access channel is 139, and the number of available sequences is 138.
  • the mapped w is: 1 138 2 137 3 136 4 135 5... 69 70.
  • is the odd-number machine access channel used ZC sequence length ⁇ 139, the available sequence number is 138.
  • the mapped w is: 69 70 68 71 67 72 66 73 ... 1 138.
  • 4 is a side view of a ZC sequence 4 unordered device according to an embodiment of the present invention. As shown in FIG. 4, the method includes: a setting module 10 and an establishing module 20. The two modules are described in detail below.
  • the setting module 10 is configured to set ⁇ as a logical index of each ZC sequence, where M is a physical index of each ZC sequence, where l ⁇ u ⁇ N ⁇ l, Q ⁇ c ⁇ N _ 2 , N is each ZC
  • the length of the sequence; the establishing module 20 is connected to the setting module 10, and is configured to establish a mapping relationship between the logical index and the physical index according to the logical index and the physical index set by the setting module 10: using ⁇ as the symmetry axis, “up and down symmetry
  • the ground maps ⁇ , and above the axis of symmetry, w monotonically decreases or increases; below the axis of symmetry, ⁇ monotonically increases or decreases.
  • the setup module 20 establishes a logical index with the function w + 1 mod N
  • the setup module 20 establishes a mapping relationship between the logical index and the physical index with the function w 1 mod N .
  • JU reflects the mapping relationship of the embodiment shown in FIG. 2, and uses the formula to calculate, so that the mapping table is not saved in the base station and the mobile phone, which saves storage space and reduces design cost. .
  • the reason why it is possible to establish a simple calculation formula to establish a mapping relationship is that, in the embodiment of the present invention, it is found that when the physical index of the sequence is less than or equal, the CM value of the sequence increases approximately as the physical index of the sequence increases.
  • the CM value of the sequence increases approximately as the physical index of the sequence increases.
  • the CM value of the sequence is approximately
  • the ZC sequence sorting apparatus performs appropriate sorting of the ZC sequence according to the CM value, and the C ⁇ sequence is reduced according to the increase of the physical index of the sequence.
  • the similar ZC sequences are allocated to the same cell, which ensures that the PRACHs of UEs with different sequences in the same area have similar coverage, thereby improving the flexibility of cell planning.
  • the sorting result obtained by the sorting method and the device may enable the operator to perform sequence planning and allocation according to the CM characteristics of the sequence, and allocate sequences with similar CM values to the same cell.
  • the sequence u and the Nu have exactly the same CM value, so the sorting result obtained by using the method and the apparatus provided by the embodiment of the present invention can assign the sequence u and Nu to the same cell, because the sequence u and Nu are in the sequence structure. There is a symmetrical nature, so the detection complexity of the base station receiver can be reduced.
  • the above modules or steps of the present invention can be implemented by a general-purpose computing device, which can be concentrated on a single computing device or distributed over a network composed of multiple computing devices.
  • the invention is not limited to any specific combination of hardware and software.
  • the above is only the preferred embodiment of the present invention, and is not intended to limit the present invention.
  • the present invention can be variously modified and modified. Any modifications, equivalent substitutions, improvements, etc. made therein are intended to be included within the scope of the present invention.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Power Engineering (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Measuring Or Testing Involving Enzymes Or Micro-Organisms (AREA)
  • Storage Device Security (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Description

随机接入信道的 ZC序列排序方法和装置 技术领域 本发明涉及通信领域, 具体来说, 涉及一种随机接入信道的 zc序列排 序方法和装置。 背景技术 在长期演进(Long Term Evolution, 简称为 LTE ) 系统中, 随机接入信 道 ( Random Access Channel , 简称为 RACH )使用 Zadoff-Chu (简称为 ZC ) 序列的循环移位序列作为前导 ( preamble ) , 这些循环移位序列又可以称为零 目关区 i或 ( Zero Correlation Zone , 简称为 ZCZ ) 序歹' J。 在实际系统中, 用户设备(User Equipment , 简称为 UE ) , 例 口, 手机, 个人数字助理等; 手机开机之后首先进行下行同步, 然后开始检测广播信道 ( Broadcast Channel , 简称 BCH )„ 基站通过 BCH通知手机本小区的 RACH 可以使用的第一条 ZC序列的逻辑索引 ( Logical root sequence number ) 以及 循环移位的步长, 手机才艮据逻辑索引利用一定的映射规则计算出相应的 ZC 序列的物理索引 ( Physical root sequence number ),然后才艮据循环移位步长( ^口 果在高速环境下, 还要才艮据一定的 "循环移位限制规则 ") 生成可用的 ZCZ 序列。如果 ZCZ序列的数量少于预设门限 P,则手机自动递增序列逻辑索引, 利用下一条 ZC序列继续生成 ZCZ序列,直到 ZCZ序列的总数大于或等于 P 为止。 最后, 手机在所有生成的可用 ZCZ序列中随机选择一条作为 preamble 发送。 在实际中, ZC序列逻辑索 I与物理索 I之间的映射过程就是对 ZC序 列进行重新排序的过程。 其中, ZC 序列的生成式如下式(1)所示, 其中, N 为序列长度, M为序列的物理索引, ZC序列的物理索引是指产生每条 ZC序 列时所用到的索引, (n)表示物理索引为 的第《个样点的 4非序值。 序列索 ? I指才艮据某一准则对 ZC序列进行排序之后, 每条 ZC序列在排序之后的队 列中的编号。
Figure imgf000004_0001
图 1为 LTE系统时分双工 ( Time Division Duplex , 简称为 TDD )模式 的帧结构示意图。 如图 1所示, 在这种帧结构中, 一个 10ms ( 307200Ts , lms = 30720 Ts )的无线帧分成两个半帧,每个半帧分成 10个长度为 0.5ms时隙, 每两个时隙组成一个长度为 lms的子帧, 一个无线帧中包含 10个子帧 (编 号从 0到 9 ) , 一个无线帧中包含 20个时隙 (编号从 0到 19 )。 对于长度为 5.21us及 4.69us的常规循环前缀 ( Cyclic Prefix , 简称为 CP ) , 一个时隙包含 7个长度为 66.7us的上 /下行符号,其中,第一个符号循环前缀长度为 5.21us , 其余 6个符号的循环前缀长度为 4.69us; 对于长度为 16.67us的扩展循环前 缀, 一个时隙包含 6个上 /下行符号。 另外, 在这种帧结构中, 子帧的配置具 有 口下特点: 子帧 0和子帧 5固定用于下行传输; 支持以 5ms和 10ms为周期的上 /下行转换; 子帧 1和子帧 6为特殊子帧, 用于传输 3个特殊时隙, 即, 下行导频时 隙 ( Downlink Pilot Time Slot , 简称为 DwPTS ). 保护间隔 ( Guard Period, 简称为 GP )及上行导频时隙( Uplink Pilot Time Slot, 简称为 UpPTS;), 其中,
DwPTS用于下行传输;
GP为保护时间, 不传输任何数据;
UpPTS 用于上行传输, 至少包含 2 个上行单载波频分多址 ( Single Carrier-Frequency Division Multiple Access , 简称为 SC-FDMA ) 符号, 用于 传输物理随机接入信道 ( Physical Random Access CHannel , 简称为 PRACH )0 对于 5ms的上 /下行转换周期, UpPTS及子帧 2和子帧 7始终用于上行传输。 而对于 10ms的转换周期, 子帧 6的 UpPTS长度为 0 , 子帧 1的 UpPTS可以 为 0也可以大于 0。 在 5ms周期的上下行切换时, 子帧 2和子帧 6固定用于上行传输; 在 10ms周期的上下行切换时, DwPTS存在于两个半帧中, GP和 UpPTS 存在于第一个半帧中, 第二个半帧中的 DwPTS时长为 lms , 子帧 2用 μ 行传输, 子帧 7到子帧 9用于下行传输。
LTE 系统的 TDD模式有两大类 PRACH, 第一类放在非特殊的上行子 帧(包含特殊时隙的子帧被称为特殊子帧) 内传输; 第二类放在 UpPTS内传 输。 第一类 PRACH的排序方法是先根据立方度量以 1.2dB为门限将所有序 列分成两组, 再在每一组内才艮据序列在循环移位限制条件下所支持的最大循 环移位量将序列分成若干子组, 然后再在每个子组内才艮据序列的立方度量值 进行排序。 立方度量 (Cubic Metric, 简称为 CM)是一种衡量发射数据峰均 比的标准, CM越大表示峰均比越高, 其计算方法如下式 (2) 所示,
CM = 20 log 10{rm, [vlm ( ]}- 1.52 dB
1.56
其中, vno t)= 1 j , τ , rms(x) = ^, 为时域信号的幅值, 通过 rms\v\t)\ V M 在 m=0, 1, ..., Μ-1时刻对 η=0, 1, ..., Ν-1的时 i或信号 gH (w)进行釆样, 得到一串离散的时域样点 v(m)以模拟 ν( ) , Μ为向量; c的维度, M〉N。 显然,向量; c的维度 M越大,即,釆样点越多,那么离散的时域样点 m) 模拟 V ( )得到的曲线就会越平滑, 模拟精度会越高, 求得的 CM值精度也就 越高。 与第一类 PRACH相比, 第二类 PRACH子载波较宽, 抗多 i普勒频偏的 能力较强, 不需要通过循环移位限制来解决频偏问题, 因此第二类 PRACH 不能使用第一类 PRACH 的排序方法。 但是, 由于现有技术没有第二类 PRACH的合适的 ZC序列排序方法,导致不能将 CM值相近的序列分配给同 一个小区, 使得同一小区中使用不同 ZC序列的各个 UE有不同的覆盖范围, 限制了小区规划的灵活性。 发明内容 针对上述现有技术中缺乏 ZC序列排序, 导致同一' j、区中使用不同 ZC 序列的各个 UE有不同的覆盖范围的问题而提出本发明, 本发明旨在提供一 种改进的 ZC序列 4非序方案, 以解决上述问题。 根据本发明的一方面, 提供了一种 机接入信道的 zc序列排序方法, 包括以下步骤: 设置 α为每条 ZC序列的逻辑索引, w为每条 ZC序列的物理 索引, 其中, l≤u≤N _ l,Q≤a≤N _ 2 , N为每条 ZC序列的长度; 以及建立 逻辑索引与物理索引的映射关系为:以½= ^^为对称轴, ¾上下对称地映射 α , 且在对称轴的上方, w单调减小或增大; 在对称轴的下方, w单调增大或减 小。 尤选地, 在对称轴的上方, W单调减小; 在对称轴的下方, W单调增大 具体包括: 以函数 W + 1 modN建立逻辑索引与物理索引的映射关
优选地, N=139 ,对于 α = 0,1,2,...,137 , 映射到的 w是: 1 138 2 37 3
136 4 135 5 ... 69 70。 尤选地, 在对称轴的上方, w单调增大; 在对称轴的下方, w单调减小
N - a
具体包括: 以函数 w 1 mod N建立逻辑索引与物理索引的映射关
2
系。 优选地,N=139 ,对于α = 0,l,2,...,137 ,映射到的M是:69 70 68 71 67
72 66 73 ... 1 138。 才艮据本发明的另一方面,提供了一种随机接入信道的 ZC序列排序装置, 包括: 设置模块, 用于设置 α为每条 ZC序列的逻辑索引, w为每条 ZC序列 的物理索引, 其中, l≤w≤N - l,0≤ ≤N - 2 , N为每条 ZC序列的长度; 以 及建立模块, 用于建立逻辑索引与物理索引的映射关系为: 以《= ^^为对称 轴, w上下对称地映射 且在对称轴的上方, w单调减小或增大; 在对称轴 的下方, Μ单调增大或减小。 优选地,建立模块以函数 W 1 mod N建立逻辑索引与物理索
Figure imgf000006_0001
引的映射关系。 优选地, N=139 ,对于 α = 0,1,2,...,137 ,映射到的 w是: 1 138 2 137 3 136 4 135 5... 69 70。 优选地, 建立模块以函数 w mod N建立逻辑索引与物理
Figure imgf000007_0001
索引的映射关系。 优选地,N=139 ,对于α = 0,l,2,...,137 ,映射到的w是:69 70 68 71 67 72 66 73 ... 1 138。 因为当序列的物理索引小于等于 时, 序列的 CM值近似地随序列
2」
物理索引的增加而增加, 而当序列的物理索引大于等于 | I时, 序列的 CM
'2」
值近似地随序列物理索引的增加而减小, 所以本发明提供的 ZC序列排序方 法和装置相当于根据 CM值对 ZC序列进行了合适的排序, 使得网络规划人 员可以将 CM值相近的 ZC序列分配给同一个小区, 保证了同一' j、区内使用 不同序列的 UE的 PRACH具有相近的覆盖范围, 解决了现有技术中缺乏 ZC 序列排序, 导致同一小区中使用不同 ZC序列的各个 UE有不同的覆盖范围 的问题, 从而提高了小区规划的灵活性。 附图说明 此处所说明的附图用来提供对本发明的进一步理解,构成本申请的一部 分, 本发明的示意性实施例及其说明用于解释本发明, 并不构成对本发明的 不当限定。 在附图中: 图 1是相关技术中的 LTE系统 TDD模式的帧结构的示意图; 图 2是根据本发明实施例的 ZC序列排序方法的流程图; 图 3是排序前才艮序列物理索引与 CM值对应关系 ( N为 139 ); 图 4是才艮据本发明实施例的 ZC序列排序装置的方框图。 具体实施方式 功能相无述 基于当序列的物理索引小于等于 | ^% I时, 序列的 CM值近似地随序列
2」
物理索引的增加而增加以及当序列的物理索引大于等于|
'2」 I时, 序列的 CM 值近似地随序列物理索引的增加而减小,在本发明实施例提供的技术方案中, 才艮据 CM值对 ZC序列进行了合适的排序, 将 CM值相近的 ZC序列分配给 同一个小区, 保证了同一' j、区内使用不同序列的 UE的 PRACH具有相近的 覆盖范围, 从而提高了小区规划的灵活性。 下面将参考附图并结合实施例, 来详细说明本发明。 需要说明的是, 如 果不冲突, 本申请中的实施例以及实施例中的特征可以相互组合。 下面以 LTE的 FDD模式为例, 许细说明本发明的具体实施方式。 图 2是才艮据本发明实施例的 ZC序列 4非序方法的流程图, 如图 2所示, 包括以下步骤: 步骤 S10,设置 α为每条 ZC序列的逻辑索引, w为每条 ZC序列的物理 索引, 其中, l≤w≤N -l,0≤ ≤N - 2 , N为每条 ZC序列的长度; 步骤 S20,建立逻辑索引与物理索引的映射关系为: 以《= ^^为对称轴,
M上下对称地映射 α , 且在对称轴的上方, Μ单调减小或增大; 在对称轴的下 方, w单调增大或减小。 显然, 这里以 α为横轴, 以 w为从轴。 w在对称轴的 上方即《大于等于 1% I; Μ在对称轴的下方即《小于等于
'2」 图 3是 4非序前才艮序列物理索引与 CM值对应关系 (N为 139 ), 如图 3 所示, 当序列的物理索引小于等于 值近似地随序列物理 索引的增加而增加, 当序列的物理 , 序列的 CM值近似、
Figure imgf000008_0001
地随序列物理索引的增力口而减小。 因此, 本实施例的排序方法利用上述图 3所示的性质, 根据 CM值对 ZC序列进行了合适的排序, 将 CM值相近的 ZC序列分配给同一个小区, 保 证了同一' j、区内使用不同序列的手机的 PRACH具有相近的覆盖范围, 从而 提高了小区规划的灵活性。 实施例一 在对称轴的上方, M单调减小以及在对称轴的下方, i单调增大的情况 下, 以函数 w = (-1)" « 2 + 1 modN建立逻辑索引与物理索引的映射关系, 这 个公式等价于如下公式:
«/ + 1,«为偶数
a + 1
N -, α为奇数 机接入信道使用的 ZC序列长度 Ν为 139 , 可用序列数为 138。 对于 « = 0,1,2,...,137 , 映射到的 w是: 1 138 2 137 3 136 4 135 5... 69 70。 实施例二 在对称轴的上方, i单调增大和在对称轴的下方, Μ单调减小的情况下,
Ν - α
以函数 w 1 mod N建立逻辑索引与物理索引的映射关系,该公式 等价于如下公式:
N a
,α为偶数
N
+ ,α为奇数 机接入信道使用的 ZC序列长度 Ν为 139 , 可用序列数为 138。 对于 « = 0,1,2,...,137 , 映射到的 w是: 69 70 68 71 67 72 66 73 ... 1 138。 图 4是才艮据本发明实施例的 ZC序列 4非序装置的方 *1图, 如图 4所示, 包括: 设置模块 10、 建立模块 20, 以下对这两个模块进行详细说明。 设置模块 10 , 用于设置 α为每条 ZC序列的逻辑索引, M为每条 ZC序 列的物理索引, 其中, l≤u≤N— l,Q≤c ≤N _ 2 , N为每条 ZC序列的长度; 建立模块 20 , 连接至设置模块 10 , 用于才艮据设置模块 10设置的逻辑索 引和物理索引建立逻辑索引与物理索引的映射关系: 以 = ^^为对称轴, 《上 下对称地映射 α , 且在对称轴的上方, w单调减小或增大; 在对称轴的下方, Μ单调增大或减小。 优选地, 建立模块 20以函数 w + 1 mod N建立逻辑索引与物
Figure imgf000010_0001
理索引的映射关系。 N=139 , 对于 α = 0,1,2,...,137 , 映射到的 Μ是: 1 138 2 137 3 136 4 135 5 ... 69 70。
Ν - α
优选地, 建立模块 20以函数 w 1 mod N建立逻辑索引与物 理索引的映射关系。 N=139 , 对于 = 0,1,2,...,137 , 映射到的 w是: 69 70 68
71 67 72 66 73 ... 1 1 38。 上述的公式计算简单, 并 JU艮好地反映了图 2 所示的实施例的映射关 系, 利用公式进行计算, 从而不需要在基站及手机中保存映射表格, 节省了 存储空间, 降低了设计成本。 之所以能够建立计算如此简单的公式来建立映 射关系, 是因为在本发明实施例中, 发现了当序列的物理索引小于等于 时, 序列的 CM值近似地随序列物理索引的增加而增加, 当序列的物理索引 大于等于 」时, 序列的 CM值近似地随序列物理索引的增加而减小, 由此 建立了一种简单地映射关系, 即以 w= ^^为对称轴, M上下对称地映射 α , 且 在对称轴的上方, Μ单调减小或增大; 在对称轴的下方, Μ单调增大或减小。 由上描述可以看出, 当序列的物理索引小于等于 | W I时, 序列的 CM 值近似地随序列物理索引的增加而增加, 当序列的物理索引大于等于 N/ 时, 序列的 CM值近似地随序列物理索引的增加而减小, 本发明实施例提供 的 ZC序列排序装置, 根据 CM值对 ZC序列进行了合适的排序, 将 C ^ 相近的 ZC序列分配给同一个小区, 保证了同一' j、区内使用不同序列的 UE 的 PRACH具有相近的覆盖范围, 从而提高了小区规划的灵活性。 综上所述, 在本发明实施例提供的技术方案中, 排序方法和装置得到的 排序结果可以使运营商根据序列的 CM特性进行序列规划和分配, 将 CM值 相近的序列分配给同一个小区, 保证了同一'』、区内使用不同序列的手机的 PRACH信道具有相近的覆盖范围。 另夕卜,序列 u与 N-u具有完全相同的 CM 值, 因此使用本发明实施例提供的方法和装置得到的排序结果能够使序列 u 与 N-u分配给同一个小区, 由于序列 u与 N-u在序列结构上有对称性质, 所 以可以降低基站接收机的检测复杂度。 显然, 本领域的技术人员应该明白, 上述的本发明的各模块或各步骤可 以用通用的计算装置来实现, 它们可以集中在单个的计算装置上, 或者分布 在多个计算装置所组成的网络上, 可选地, 它们可以用计算装置可执行的程 序代码来实现, 从而, 可以将它们存储在存储装置中由计算装置来执行, 或 者将它们分别制作成各个集成电路模块, 或者将它们中的多个模块或步骤制 作成单个集成电路模块来实现。 这样, 本发明不限制于任何特定的硬件和软 件结合。 以上所述仅为本发明的优选实施例而已, 并不用于限制本发明, 对于本 领域的技术人员来说, 本发明可以有各种更改和变^^ 凡在本发明的^^申和 原则之内, 所作的任何修改、 等同替换、 改进等, 均应包含在本发明的保护 范围之内。

Claims

权 利 要 求 书 一种随机接入信道的 ZC序列排序方法, 其特征在于, 包括:
设置 α为每条 ZC序列的逻辑索引, Μ为所述每条 ZC序列的物理 索引, 其中, l≤u≤N _ W≤ x≤N _ 2 , N为所述每条 ZC序列的长度; 建立所述逻辑索引和物理索引的映射关系:以 = ^^为对称轴, u上 下对称地映射 α , 并且, 在所述对称轴的上方, w单调减小或增大, 在 所述对称轴的下方, w单调增大或减小。
2. 根据权利要求 1所述的 ZC序列排序方法, 其特征在于, 如果在所述对 称轴的上方, w单调减小; 在所述对称轴的下方, w单调增大, 则所述建 立所述逻辑索 I和物理索引的映射关系具体包括: modN建立所述逻辑索引与物理索引的映
Figure imgf000012_0001
射关系 根据权利要求 2所述的 ZC序列排序方法, 其特征在于, N=139 , 对于 = 0,1,2,... ,137 , 映射到的 是:
1 138 2 137 3 136 4 135 5 . 69 70。
4. 根据权利要求 1所述的 ZC序列排序方法, 其特征在于, 如果在所述对 称轴的上方, w单调增大, 在所述对称轴的下方, w单调减小, 则所述建 立所述逻辑索 I和物理索引的映射关系具体包括: 以函数 w mod N建立所述逻辑索引与物理索引的映
Figure imgf000012_0002
射关系 根据权利要求 4所述的 ZC序列排序方法, 其特征在于, N=139 , 对于 = 0,1,2,... ,137 , 映射到的 w是:
69 70 68 71 67 72 66 73 1 138, 一种随机接入信道的 ZC序列排序装置, 其特征在于, 包括: 设置模块, 用于设置 a为每条 ZC序列的逻辑索引, u为所述每条 ZC序列的物理索引, 其中, l≤u≤N _ l,Q≤a≤N _ 2 , N为所述每条 ZC 序列的长度; 以及
建立模块, 用于建立所述逻辑索引与物理索引的映射关系为: 以 w= ^^为对称轴, 《上下对称地映射 α , 且在所述对称轴的上方, Μ单调 减小或增大; 在所述对称轴的下方, Μ单调增大或减小。 根据权利要求 6所述的 ZC序列排序装置, 其特征在于, 所述建立模块 modN建立所述逻辑索引与物理索引的映射关
Figure imgf000013_0001
根据权利要求 7所述的 ZC序列排序装置, 其特征在于, N=139 , 对于 a = 0,1,2,...,137 , 映射到的 u是:
1 138 2 137 3 136 4 135 5 . 69 70。
9. 根据权利要求 7所述的 ZC序列排序装置, 其特征在于, 所述建立模块
N - a
以函数 w 1 modN建立所述逻辑索引与物理索引的映射关 系 根据权利要求 9所述的 ZC序列排序装置, 其特征在于, N=139 , 对于 a = 0,1,2,...,137 , 映射到的 u是:
69 70 68 71 67 72 66 73 1 138,
PCT/CN2008/073299 2008-01-30 2008-12-02 随机接入信道的zc序列排序方法和装置 WO2009097727A1 (zh)

Priority Applications (4)

Application Number Priority Date Filing Date Title
US12/864,653 US8391229B2 (en) 2008-01-30 2008-12-02 Method and apparatus for sequencing ZC sequences of a random access channel
RU2010133955/08A RU2482603C2 (ru) 2008-01-30 2008-12-02 Способ и устройство для упорядочения последовательностей задова-чу в канале произвольного доступа
EP08872051.1A EP2239879A4 (en) 2008-01-30 2008-12-02 METHOD AND APPARATUS FOR ORDERING RANDOM ACCESS CHANNEL SEQUENCE ZC SEQUENCES
BRPI0821864-1A BRPI0821864B1 (pt) 2008-01-30 2008-12-02 Um método e dispositivo para sequenciar sequências zc de um canal de acesso aleatório

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200810008443XA CN101227735B (zh) 2008-01-30 2008-01-30 随机接入信道的zc序列排序方法和装置
CN200810008443.X 2008-01-30

Publications (1)

Publication Number Publication Date
WO2009097727A1 true WO2009097727A1 (zh) 2009-08-13

Family

ID=39859437

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2008/073299 WO2009097727A1 (zh) 2008-01-30 2008-12-02 随机接入信道的zc序列排序方法和装置

Country Status (6)

Country Link
US (1) US8391229B2 (zh)
EP (1) EP2239879A4 (zh)
CN (1) CN101227735B (zh)
BR (1) BRPI0821864B1 (zh)
RU (1) RU2482603C2 (zh)
WO (1) WO2009097727A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
RU2727155C1 (ru) * 2017-03-20 2020-07-21 ЭлДжи ЭЛЕКТРОНИКС ИНК. Способ и пользовательское оборудование для передачи преамбулы произвольного доступа, способ и базовая станция для приема преамбулы произвольного доступа

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101179860B (zh) * 2007-12-05 2011-03-16 中兴通讯股份有限公司 随机接入信道的zc序列排序方法和装置
CN101227735B (zh) * 2008-01-30 2012-11-28 中兴通讯股份有限公司 随机接入信道的zc序列排序方法和装置
CN102014442B (zh) * 2009-09-29 2014-01-08 电信科学技术研究院 发送上行资源调度请求的方法和用户设备
CN102136856A (zh) * 2010-01-21 2011-07-27 中兴通讯股份有限公司 一种确定立方量度和最大回退功率的方法和装置
PE20131090A1 (es) 2010-12-10 2013-10-16 Panasonic Ip Corp America Metodo y dispositivo de generacion de senales
BR112016020990B1 (pt) * 2014-03-25 2023-02-07 Telefonaktiebolaget Lm Ericsson (Publ) Receptor de preâmbulo, método para receber um sinal de rádio e detectar uma sequência de preâmbulo, e, mídia de armazenamento legível por máquina
TR201808081T4 (tr) 2014-03-25 2018-07-23 Ericsson Telefon Ab L M Geliştirilmiş PRACH başlangıç eki formatı.
CN109792618B (zh) 2016-09-22 2022-07-29 瑞典爱立信有限公司 具有定时未对准的有效上行链路测量信号接收和传输窗口分配

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101090281A (zh) * 2007-06-19 2007-12-19 中兴通讯股份有限公司 一种上行随机接入前导序列选择方法
CN101094529A (zh) * 2007-08-10 2007-12-26 中兴通讯股份有限公司 随机接入信道的zc序列排序方法及装置
CN101227735A (zh) * 2008-01-30 2008-07-23 中兴通讯股份有限公司 随机接入信道的zc序列排序方法和装置

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8000305B2 (en) * 2006-01-17 2011-08-16 Motorola Mobility, Inc. Preamble sequencing for random access channel in a communication system
US8098745B2 (en) * 2006-03-27 2012-01-17 Texas Instruments Incorporated Random access structure for wireless networks
JP4736934B2 (ja) * 2006-04-28 2011-07-27 日本電気株式会社 無線通信システム、パイロット系列割り当て装置及びそれらに用いるパイロット系列割り当て方法
WO2008114967A1 (en) * 2007-03-16 2008-09-25 Lg Electronics Inc. Method of generating random access preambles in wireless communication system
KR100940730B1 (ko) * 2007-09-07 2010-02-04 엘지전자 주식회사 무선통신 시스템에서 기준 신호 생성 방법

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101090281A (zh) * 2007-06-19 2007-12-19 中兴通讯股份有限公司 一种上行随机接入前导序列选择方法
CN101094529A (zh) * 2007-08-10 2007-12-26 中兴通讯股份有限公司 随机接入信道的zc序列排序方法及装置
CN101227735A (zh) * 2008-01-30 2008-07-23 中兴通讯股份有限公司 随机接入信道的zc序列排序方法和装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP2239879A4 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
RU2727155C1 (ru) * 2017-03-20 2020-07-21 ЭлДжи ЭЛЕКТРОНИКС ИНК. Способ и пользовательское оборудование для передачи преамбулы произвольного доступа, способ и базовая станция для приема преамбулы произвольного доступа
US11184210B2 (en) 2017-03-20 2021-11-23 Lg Electronics Inc. Method and user equipment for transmitting random access preamble, and method and base station for receiving random access preamble

Also Published As

Publication number Publication date
US8391229B2 (en) 2013-03-05
EP2239879A4 (en) 2013-09-04
RU2482603C2 (ru) 2013-05-20
CN101227735B (zh) 2012-11-28
EP2239879A1 (en) 2010-10-13
RU2010133955A (ru) 2012-03-10
CN101227735A (zh) 2008-07-23
US20100309993A1 (en) 2010-12-09
BRPI0821864A2 (pt) 2019-02-26
BRPI0821864B1 (pt) 2020-06-16

Similar Documents

Publication Publication Date Title
WO2009097727A1 (zh) 随机接入信道的zc序列排序方法和装置
CN110192426B (zh) 终端装置、基站装置、通信方法以及集成电路
US8265119B2 (en) Method and apparatus for frequency assignment in a frequency hopping mode of a wireless communication system
WO2016119446A1 (zh) 一种实现上行控制信息的传输方法及装置
WO2017028273A1 (zh) 支持多种传输时间间隔的随机接入方法、装置以及通信系统
US20090207793A1 (en) ACKNAK Repetition Schemes in Wireless Networks
US10554357B2 (en) Data transmission method, network device, and terminal device
JP2020047963A (ja) 端末装置、基地局装置、通信方法、および、集積回路
JP2020047964A (ja) 端末装置、基地局装置、通信方法、および、集積回路
WO2017124433A1 (zh) 随机接入与数据传输的装置、方法以及通信系统
TW200816746A (en) Method for performing random access procedure in wireless communication system
EP3734924A1 (en) Terminal equipment, base station device, and communication method
WO2012019414A1 (zh) 一种移动通信系统的无线帧及测量参考信号的发送方法
EP3343969B1 (en) Data transmission method and apparatus
EP3113561A1 (en) Terminal device, integrated circuit, and wireless communication method
TW200904090A (en) Method of generating random access preambles in wireless communication system
JP2014531167A (ja) 無線通信システムにおける制御情報の送信方法及び装置
CN110035528B (zh) 一种通信方法、装置以及系统
WO2021013021A1 (zh) 一种物理上行控制信道的资源配置方法及装置
US11973578B2 (en) Reference signal configuration method and apparatus, and sequence configuration method and apparatus
TWI762531B (zh) 資源映射的方法和通訊設備
EP3852462A1 (en) Reference signal and sequence configuration method and apparatus
EP3451769A1 (en) Terminal device, base station device, communication method, and integrated circuit
EP3337258B1 (en) Data transmission method, terminal device, and base station
WO2022181597A1 (ja) 端末装置、基地局装置、および、通信方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 08872051

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 12864653

Country of ref document: US

NENP Non-entry into the national phase

Ref country code: DE

REEP Request for entry into the european phase

Ref document number: 2008872051

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2008872051

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 5059/CHENP/2010

Country of ref document: IN

WWE Wipo information: entry into national phase

Ref document number: 2010133955

Country of ref document: RU

ENP Entry into the national phase

Ref document number: PI0821864

Country of ref document: BR

Kind code of ref document: A2

Effective date: 20100730