WO2011020421A1 - Procédé et dispositif de configuration de préambule - Google Patents

Procédé et dispositif de configuration de préambule Download PDF

Info

Publication number
WO2011020421A1
WO2011020421A1 PCT/CN2010/076041 CN2010076041W WO2011020421A1 WO 2011020421 A1 WO2011020421 A1 WO 2011020421A1 CN 2010076041 W CN2010076041 W CN 2010076041W WO 2011020421 A1 WO2011020421 A1 WO 2011020421A1
Authority
WO
WIPO (PCT)
Prior art keywords
preamble
competitive
cell
identifier
useless
Prior art date
Application number
PCT/CN2010/076041
Other languages
English (en)
Chinese (zh)
Inventor
武春璟
郑勐
Original Assignee
华为技术有限公司
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 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2011020421A1 publication Critical patent/WO2011020421A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/002—Transmission of channel access control information

Definitions

  • the present invention relates to the field of communications technologies, and in particular, to a method and apparatus for configuring a preamble. Background technique
  • the initial non-synchronized random access procedure is part of a user equipment (UE) accessing a cell or performing cell handover.
  • the asynchronous random access signal is usually carried in a random burst, and the content of the random burst is a Physical Random Access Channel preamble.
  • the PRACH preamble is a signal in the time domain. Cyclic shifting of a root sequence can result in a cyclic shift sequence, and a PRACH preamble can be generated based on the cyclic shift sequence.
  • the number of root sequences used by different cells may be different, and each cell needs to support 64 PRACH preambles.
  • the uplink clock of the UE can be adjusted to implement uplink synchronization between the UE and the system.
  • Embodiments of the present invention provide a method and apparatus for configuring a preamble.
  • an embodiment of the present invention provides a method for configuring a preamble, including:
  • the preamble corresponding to the cell includes a competitive preamble and a non-competitive preamble, and the non-competitive preamble includes a useful non-competitive predecessor and a useless non-competitive preamble; Determining a corresponding competitive preamble and a useful non-competitive preamble according to the identification information; acquiring reference root sequence information that generates the competitive preamble and the useful non-competitive preamble; and generating a reference root sequence according to the reference root sequence information .
  • the embodiment of the present invention further provides a preamble configuration apparatus, including: an identifier module, configured to acquire identifier information of a preamble corresponding to a cell, where a preamble corresponding to the cell includes a preamble and a non-contention preamble.
  • the non-competitive predecessor includes useful non-competitive predecessors and useless non-competitive predecessors;
  • a determining module configured to determine, according to the identification information acquired by the identifier module, a corresponding competitive preamble and a useful non-competitive preamble;
  • An obtaining module configured to obtain reference root sequence information that generates a competitive preamble and a useful non-competitive preamble determined by the determining module;
  • a processing module configured to generate a reference root sequence according to the reference root sequence information acquired by the acquiring module.
  • an embodiment of the present invention further provides a base station, including the foregoing preamble configuration apparatus.
  • the physical layer of the base station for example, the base station, may be determined according to the identifier information of the preamble corresponding to the cell, by setting the preamble corresponding to the cell as the contention preamble, the useful non-contention preamble, and the useless non-contention preamble.
  • the competitive preamble and the useful non-competitive predecessor obtain only the reference root sequence information used to generate the competitive preamble and the useful non-competitive preamble, and no longer obtain the reference root sequence information used to generate the useless non-competitive preamble, thereby generating It is only the reference root sequence associated with the competitive leader and the useful non-competitive leader.
  • the embodiment of the invention avoids detecting the reference root sequence corresponding to all the preambles supported by the cell when receiving a preamble signal, saves resources, reduces detection delay, and reduces access delay of the terminal. Switch delay.
  • FIG. 1 is a schematic flowchart of a method for configuring a preamble according to Embodiment 1 of the present invention
  • 2 is a schematic flowchart of a configuration method of a preamble according to Embodiment 2 of the present invention
  • FIG. 3 is a schematic structural diagram of a preamble configuration apparatus according to Embodiment 3 of the present invention.
  • FIG. 1 is a schematic flowchart of a method for configuring a preamble according to Embodiment 1 of the present invention. As shown in FIG. 1 , a method for configuring a preamble in this embodiment may include the following steps:
  • Step 101 Obtain identification information of a preamble corresponding to the cell, where the preamble corresponding to the cell includes a competitive preamble and a non-competitive preamble, and the non-competitive preamble includes a useful non-competitive preamble and a useless non-competitive preamble; Step 102, according to the foregoing identifier The information determines the competition leading and the useful non-competitive predecessor corresponding to the cell;
  • Step 103 Acquire reference root sequence information for generating a competition preamble and a useful non-contention preamble
  • Step 104 Generate a reference root sequence according to the reference root sequence information of the foregoing competition preamble and the useful non-contention preamble.
  • the non-contention access preamble is mainly used for cell handover of the UE, and which preamble used by the UE can be specified by the base station. Therefore, all PRACH preambles corresponding to the cell can be set to three categories: competitive preamble, useful non-competitive predecessor, useless non-competitive predecessor. The base station only needs to select from the useful non-competition predecessor when assigning the non-competitive preamble to the to-be-switched terminal.
  • the physical layer of the base station when receiving the preamble signal sent by the UE in one cell, the physical layer of the base station detects only the root sequence corresponding to the partial preamble supported by the cell, instead of supporting the entire cell.
  • the root sequence corresponding to the preamble is detected, which saves the detection processing resources and reduces the detection delay, thereby reducing the access delay and handover delay of the terminal.
  • the sequence used in the PRACH preamble in the embodiment of the present invention is a ZC (Zadoff-Chu) sequence, and the sequence obtained after cyclic shifting of the ZC sequence is still a ZC sequence. Therefore, the 64 preambles corresponding to each cell can be obtained by cyclic shifting of thousands of ZC 4 ⁇ sequences.
  • Different cell radius and different speed scenarios require different numbers of ZC root sequences. Generally speaking, the cell radius is large. In the high speed scene, the number of ZC root sequences required is large. At most, each cell needs 64 ZC root sequences to generate 64 preambles.
  • Step 201 The physical layer of the base station acquires channel parameter information of the PRACH and the identifier information of the preamble corresponding to the cell, where the preamble corresponding to the cell includes a contention preamble and a non-contention preamble, and the non-competitive preamble includes a useful non-competitive preamble and a useless non-competitive Competing for the lead.
  • the channel parameter information may include: a number of cyclic shifts Ncs, a channel configuration (PRACH Configuration), a root sequence start logical index, a speed scene (high-speed cell or low-speed cell) identifier, and frequency domain location information of the channel.
  • the preamble identification information may include the number of useful non-competitive predecessors, the starting of useful non-competitive predecessors Logical index
  • the preamble identification information may include the identification of the proactive leader, the identification of the useful non-competitive predecessor, and the useless The logo of the predecessor.
  • Method three If the competitive predecessor and the non-competitive predecessor are not consecutively set, and the non-competitive predecessor and the useless non-competitive predecessor are not continuously set, the preamble identification information may include the logo of the proactive leader, the identification of the useful non-competitive predecessor, and uselessness. The logo of the non-competitive predecessor.
  • the logical index of the predecessor and the non-competitive preamble are continuous, for example: the logical index number is 0-n
  • the preamble is the predecessor, and the preamble with the logical index number n+1-63 is the non-competitive preamble.
  • the same method of continuous allocation is also adopted, and the fixed non-competitive predecessor is placed in front, that is, 64 predecessors are continuously assigned to compete. Leading, useful non-competitive predecessors and useless non-competitive predecessors. In this way, the upper layer of the base station can only send the number of useful non-competitive preambles and the starting logical index of the useful non-competitive preamble to the physical layer along with the channel parameter information of the PRACH.
  • the useful non-competitive predecessor and the useless non-competitive predecessor may be discontinuously allocated, that is, the logical index of the useful non-competitive predecessor and the useless non-competitive preamble is discontinuous, for example:
  • the bitmap is used to identify the preamble, and the identifier of the preamble and the identifier of the useful non-competitive preamble may be required to be detected, and set to 1 (or 0), useless non-competitive preamble
  • the identifier may be an unneeded detection flag indicating that detection is not required, and is set to 0 (or 1).
  • a 64-bit length data can be used to identify the preamble and the preamble that need to be detected in the 64 preambles in the cell in a bitmap, as shown below.
  • the number of useless non-competitive preambles can be obtained by combining all the preamble numbers corresponding to the cell.
  • Step 202 The physical layer of the base station determines, according to the foregoing identification information, a corresponding competitive preamble and useful Not competing for the lead.
  • the physical layer can determine the number of the preamble and its starting logical index, the number of useful non-competitive preambles, and its starting logical index according to the preamble identification information. Or based on the prescriptive identification information, it can be determined which is the competition leader and which is the useful non-competition leader;
  • Step 203 The physical layer of the base station obtains reference root sequence information used to generate a contention preamble and a useful non-contention preamble according to the obtained channel parameter information of the PRACH, where the reference root sequence information includes the number of reference root sequences.
  • the physical layer calculates reference root sequence information corresponding to the contention preamble and the useful non-contention preamble according to the obtained channel parameter according to the obtained channel parameter, for example, the reference ZC root sequence information.
  • the reference ZC root sequence information may include: a reference number of ZC root sequences, a number of cyclic shift sequences on each reference ZC root sequence, a position, a length, and a number of search windows corresponding to each cyclic shift sequence, etc. Parameter information.
  • the number of ZC root sequences used to generate all the preambles corresponding to the cell is N
  • the number of reference ZC root sequences is ⁇ '
  • both ⁇ and N' are positive integers greater than or equal to 1
  • the reference ZC root sequence is used.
  • the number N' is less than or equal to 1 ⁇ 1.
  • Step 204 The physical layer of the base station generates a reference root sequence that the physical layer needs to detect according to the number of the reference root sequence and the root sequence start logical index in the channel parameter information of the PRACH.
  • the physical layer In this step, the physical layer generates N' reference ZC root sequences that the physical layer needs to detect according to the number of reference ZC root sequences and the root sequence start logical index in the channel parameter information of the upper layer configuration, and saves them.
  • Step 205 The physical layer of the base station receives a preamble signal sent by the UE in the cell.
  • the number N of reference ZC root sequences in this embodiment is smaller than the number N of generating all preamble ZC root sequences corresponding to the cell, and the physical layer of the base station receives the preamble sent by the UE in the cell.
  • the signal is received, only the root sequence of the partial preamble supported by the cell ( ⁇ ' reference ZC root sequence) is detected, instead of detecting the root sequence of all the preambles supported by the cell, which saves detection processing resources and reduces detection. Delay, thereby reducing the access delay and handover delay of the terminal.
  • the preamble configuration apparatus of this embodiment may include an identification module 31, a determination module 32, and an acquisition module 33. And processing module 34.
  • the identifier module 31 is configured to obtain the identifier information of the preamble corresponding to the cell, where the preamble corresponding to the cell may include a competitive preamble and a non-competitive preamble, and the non-competitive preamble may include a useful non-competitive preamble and a useless non-competitive preamble.
  • the preamble configuration apparatus of this embodiment may be located within the base station, because the non-contention access preamble is mainly used for cell handover of the UE, and which preamble the UE uses may be specified by the upper layer of the base station. Therefore, the upper layer of the base station can set all PRACH preambles corresponding to the cell into three categories: competitive preamble, useful non-competitive predecessor, useless non-competitive predecessor. The base station only needs to select from the useful non-competitive predecessor when assigning the non-competitive preamble to the to-be-switched terminal.
  • the configuration apparatus of the preamble of the embodiment may further include a setting module (not shown), configured to set the preamble corresponding to the cell to be competitive according to the number of UEs in the cell and the switching frequency of the UE.
  • a setting module (not shown), configured to set the preamble corresponding to the cell to be competitive according to the number of UEs in the cell and the switching frequency of the UE.
  • the determining module 32 may determine the corresponding competitive preamble and the useful non-competitive preamble according to the foregoing identification information acquired by the identifying module 31, and the obtaining module 33 only obtains the reference root sequence information for generating the competitive preamble and the useful non-competitive preamble, instead of Then obtain the reference root sequence information for generating the useless non-competitive preamble.
  • Processing module 34 generates a reference root sequence that is only relevant to the competitive
  • the configuration device of the preamble of the embodiment may further include a receiving module 35 and a detecting module 36.
  • the receiving module 35 receives the preamble signal sent by the terminal in the cell
  • the detecting module 36 acquires a cyclic shift sequence according to the reference root sequence generated by the processing module 34, where the cyclic shift sequence is used to generate the preamble signal.
  • the lead The process by which the detection module 36 acquires the cyclic shift sequence can be seen in the description of the above embodiment, such as step 206.
  • the detecting module 36 when the receiving module 35 of the base station receives a preamble signal sent by the UE in the cell, the detecting module 36 only uses the cell.
  • the root sequence of the supported partial preamble is detected, instead of detecting the root sequence of all the preambles supported by the cell, which saves the detection processing resources and reduces the detection delay, thereby reducing the access delay and handover delay of the terminal. .

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

La présente invention se rapporte à un procédé et à un dispositif de configuration de préambule. Le procédé selon l'invention consiste à acquérir les informations d'identification de préambules correspondant à une cellule. Les préambules correspondant à la cellule contiennent des préambules de contention et des préambules de non-contention. Les préambules de non-contention contiennent des préambules de non-contention utiles et des préambules de non-contention inutiles. Sur la base des informations d'identification, les préambules de contention correspondants et les préambules de non-contention utiles sont confirmés. Les informations de séquence racine de référence pour créer les préambules de contention et les préambules de non-contention utiles sont obtenues. Sur la base des informations de séquence racine de référence, des séquences racines de référence sont générées. Le procédé et le dispositif de l'invention permettent d'obtenir seulement les informations de séquence racine de référence qui génèrent les préambules de contention et les préambules de non-contention utiles. De ce fait, ils génèrent les séquences racines de référence qui concernent uniquement les préambules de contention et les préambules de non-contention utiles. Le procédé et le dispositif de l'invention permettent d'éviter la détection des séquences racines de tous les préambules pris en charge par la cellule après la réception d'un signal de préambule. Le procédé et le dispositif de l'invention permettent d'économiser les ressources, de réduire le retard de détection et, partant, de réduire ainsi le retard de connexion d'un terminal et le retard de commutation.
PCT/CN2010/076041 2009-08-18 2010-08-17 Procédé et dispositif de configuration de préambule WO2011020421A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200910091348.5A CN101998637B (zh) 2009-08-18 2009-08-18 前导的配置方法及装置
CN200910091348.5 2009-08-18

Publications (1)

Publication Number Publication Date
WO2011020421A1 true WO2011020421A1 (fr) 2011-02-24

Family

ID=43606646

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2010/076041 WO2011020421A1 (fr) 2009-08-18 2010-08-17 Procédé et dispositif de configuration de préambule

Country Status (2)

Country Link
CN (1) CN101998637B (fr)
WO (1) WO2011020421A1 (fr)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102281542B (zh) * 2011-07-29 2014-04-16 上海华为技术有限公司 Zc根序列索引分配方法和装置
CN109714138B (zh) * 2017-10-26 2024-07-02 北京三星通信技术研究有限公司 一种前导码的生成方法，配置方法和设备
CN110072286A (zh) * 2018-01-23 2019-07-30 株式会社Ntt都科摩 用于生成参考信号序列的方法及相应的用户终端、基站
CN112702774B (zh) * 2020-12-11 2022-09-02 杭州红岭通信息科技有限公司 接入信道的基站侧的处理方法
CN117118579A (zh) * 2022-05-16 2023-11-24 大唐移动通信设备有限公司 元数据传输方法、装置及存储介质

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080095254A1 (en) * 2006-10-24 2008-04-24 Tarik Muharemovic Random Access Channel Design With Hybrid CDM And FDM Multiplexing Of Access
WO2009022878A2 (fr) * 2007-08-15 2009-02-19 Lg Electronics Inc. Signalisation pour préambule utilisé pour un accès aléatoire

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101087469B (zh) * 2006-06-09 2010-06-23 大唐移动通信设备有限公司 一种实现用户设备随机接入的方法
EP2981103B1 (fr) * 2007-10-02 2017-05-10 Nokia Solutions and Networks Oy Attribution de séquences de préambule
DK3145096T3 (en) * 2007-10-31 2018-09-17 Ericsson Telefon Ab L M SELECTION OF SENDING MODE IN A RANDOM ACCESS PROCEDURE

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080095254A1 (en) * 2006-10-24 2008-04-24 Tarik Muharemovic Random Access Channel Design With Hybrid CDM And FDM Multiplexing Of Access
WO2009022878A2 (fr) * 2007-08-15 2009-02-19 Lg Electronics Inc. Signalisation pour préambule utilisé pour un accès aléatoire

Also Published As

Publication number Publication date
CN101998637A (zh) 2011-03-30
CN101998637B (zh) 2014-06-11

Similar Documents

Publication Publication Date Title
WO2018127240A1 (fr) Procédé et appareil de réponse d'accès aléatoire
JP5064569B2 (ja) 無線チャネルを介する通信方法およびデバイス
US9215701B2 (en) Random access channel enhancements for LTE devices
JP5022437B2 (ja) 専用アップリンク・リソース割り当てを用いることによってアップリンク同期をもたらす装置、方法およびコンピュータ・プログラム
WO2019154272A1 (fr) Procédé de reprise sur défaillance de faisceau, et terminal d'utilisateur
US20180160454A1 (en) Data Transmission Method, Device and System
US20100232364A1 (en) Method of handling random access procedure and related communication device
JP5996114B2 (ja) ランダムアクセス応答方法および装置
WO2013107251A1 (fr) Procédé de traitement d'information et procédé pour système d'évolution à long terme à accès aléatoire d'équipement utilisateur de communication de type machine (mtc)
CN108668361B (zh) 一种信息生成方法和设备
RU2016114825A (ru) Способ предварительного определения ресурса при произвольном доступе, пользовательское устройство и базовая станция
WO2011020421A1 (fr) Procédé et dispositif de configuration de préambule
CN109392189B (zh) 一种免竞争随机接入的方法和设备
CN109152042B (zh) 前导码的配置、识别方法及基站、终端、可读存储介质
AU2019247019B2 (en) Transmission method and device, computer readable storage medium
WO2019001326A1 (fr) Procédé d'accès aléatoire, station de base et terminal
CN109792785A (zh) 用于竞争随机接入的方法、网络设备和终端设备
WO2012034410A1 (fr) Procédé et terminal mobile pour éviter un conflit d'accès aléatoire
WO2019178728A1 (fr) Procédé et appareil d'accès aléatoire
WO2020156188A1 (fr) Procédé, dispositif et appareil d'accès aléatoire
CN113411906B (zh) 一种冲突检测的方法及装置
CN114040474B (zh) 一种终端接入方法、装置及设备
CN113543352B (zh) 一种随机接入响应确定方法、装置及系统
CN114245477A (zh) 一种竞争随机接入失败后的快速处理方法

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: 10809554

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 10809554

Country of ref document: EP

Kind code of ref document: A1