CN115801213A - Planning method for random access sequence - Google Patents

Planning method for random access sequence Download PDF

Info

Publication number
CN115801213A
CN115801213A CN202310023791.9A CN202310023791A CN115801213A CN 115801213 A CN115801213 A CN 115801213A CN 202310023791 A CN202310023791 A CN 202310023791A CN 115801213 A CN115801213 A CN 115801213A
Authority
CN
China
Prior art keywords
prach
sequence
list
sequences
random access
Prior art date
Legal status (The legal status 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 status listed.)
Granted
Application number
CN202310023791.9A
Other languages
Chinese (zh)
Other versions
CN115801213B (en
Inventor
吕磊
赵海鹏
殷春
杜广湘
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sichuan Innogence Technology Co Ltd
Original Assignee
Sichuan Innogence Technology Co Ltd
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 Sichuan Innogence Technology Co Ltd filed Critical Sichuan Innogence Technology Co Ltd
Priority to CN202310023791.9A priority Critical patent/CN115801213B/en
Publication of CN115801213A publication Critical patent/CN115801213A/en
Application granted granted Critical
Publication of CN115801213B publication Critical patent/CN115801213B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a planning method of a random access sequence, which comprises the steps of determining system parameters; calculating the minimum interval D (u) of adjacent correlation peaks of different u-value PRACH sequences; obtaining a sequencing logic root sequence list T; constructing a list of available ordered logical root sequences
Figure DEST_PATH_IMAGE002
To generate
Figure DEST_PATH_IMAGE004
Delivery in post-system broadcast messages
Figure DEST_PATH_IMAGE006
The sequence number of the first PRACH logic root sequence available for the cell is used; in PRACH detection, the base station uses

Description

Planning method for random access sequence
Technical Field
The invention relates to the technical field of wireless communication, in particular to a planning method of a random access sequence.
Background
In the current mobile communication technology represented by LTE (long term evolution, i.e., fourth generation mobile communication technology) and NR (new air interface, i.e., fifth generation mobile communication technology), a system completes uplink initial access synchronization of a terminal through a Physical Random Access Channel (PRACH). According to the protocol (the protocols in the invention refer to 3GPP TS38.211Realease16 edition protocol), in the transmitting process of PRACH, UE uses ZC sequence as PRACH root sequence to generate PRACH transmitting signal according to the protocol, base station transmits PRACH logical root sequence set which can be used by current cell through broadcast channel (different PRACH logical root sequences correspond to PRACH physical root sequences with same length and different u values (the physical root sequence of a certain u value represents ZC sequence generated by using the u value according to the protocol), the corresponding relation between the two is designed according to a certain rule, the introduction will be given below), different terminals randomly select 1 PRACH logical root sequence from PRACH logical root sequence set which can be used by current cell to generate PRACH transmitting signal. Because users in the cell all adopt the random access strategy, PRACH emission signals of different users at the same time-frequency position are possibly superposed in a base station receiving signal, and if different users select different PRACH logic root sequences in the PRACH detection process, the base station generates certain interference among the different users. Although the ZC sequence still has good cross-correlation characteristics (the interference between different physical root sequences is small) after Fourier transformation, in order to minimize the interference between different users in the process of detecting the PRACH of the base station and reduce the system signaling overhead, the protocol firstly carries out sequencing optimization on the ZC sequences with different u values according to the cross-correlation (the physical root sequences with small correlation are sequenced close to each other, and the sequencing is widened to the contrary), a PRACH logical root sequence list is obtained after sequencing, then the base station only needs to broadcast the available initial PRACH logical root sequence number of the current cell, and the terminal takes the initial PRACH logical root sequence number as the continuous starting point
Figure 178953DEST_PATH_IMAGE001
And randomly selecting 1 PRACH logical root sequence to generate the PRACH transmitting signal.
In the prior art, when detecting the PRACH, the base station generally uses the size and position of the time domain correlation peak between the received signal and the PRACH logical root sequence to detect whether there is a user access request, and calculates the uplink time frequency offset of the user. In a large-delay large-frequency-offset scene (such as a low-orbit satellite communication system), a single user has multiple time-domain correlation peaks in a base station detection process, the base station estimates frequency offset through large-scale offset (the large-scale offset is defined as a part where the offset of a correlation peak exceeds the minimum interval of adjacent correlation peaks) of the correlation peaks, estimates time offset through small-scale offset (the small-scale offset is defined as a part where the offset of a correlation peak does not exceed the minimum interval of adjacent correlation peaks) of the correlation peaks, and in the process, the minimum interval of the adjacent correlation peaks is required to be not smaller than the maximum time offset of the system, otherwise, the base station cannot distinguish the large-scale offset from the small-scale offset. According to the existing theoretical analysis, it can be proved that the interval between adjacent correlation peaks depends on u values corresponding to the logical root sequence of the PRACH (a one-to-one correspondence relationship is formed between the two u values), so that the minimum interval between adjacent correlation peaks for the logical root sequence of the PRACH with some u values is smaller than the maximum time offset of the system, and the PRACH time frequency offset estimation cannot be completed by the base station.
Disclosure of Invention
Based on the defects in the prior art, the invention provides a planning method of a random access sequence, which has the following specific technical scheme:
a planning method of a random access sequence comprises the following steps:
s1, determining parameters based on a 3GPP TS38.211Realease16 version protocol system;
s2, calculating the minimum interval D (u) of adjacent correlation peaks of different u-value PRACH sequences;
wherein u is a PRACH serial number described in a 3GPPTS38.211Realease16 version protocol;
s3, obtaining a sequencing logic root sequence list T;
s4, forming a list of available sequencing logic root sequences
Figure 891694DEST_PATH_IMAGE002
S5, during PRACH detection, the base station uses
Figure 612526DEST_PATH_IMAGE002
The PRACH logic root sequence in the PRACH detection and time frequency offset estimation is carried out.
Specifically, the system parameter in step S1 includes a length of a PRACH sequence configured by the system
Figure 43507DEST_PATH_IMAGE003
And the number of PRACH logical root sequences which can be used by the current cell
Figure 937514DEST_PATH_IMAGE001
Specifically, the minimum interval between adjacent correlation peaks in step S2
Figure 770341DEST_PATH_IMAGE004
The calculation formula of (A) is as follows:
Figure 662073DEST_PATH_IMAGE005
wherein,
Figure 314771DEST_PATH_IMAGE006
indicating the cyclic shift interval of adjacent correlation peaks,
Figure 215731DEST_PATH_IMAGE007
to meet the need
Figure 637485DEST_PATH_IMAGE008
And
Figure 965699DEST_PATH_IMAGE009
is the smallest non-negative integer.
Specifically, the sorting logic root sequence list T in step S3 is
Figure 105693DEST_PATH_IMAGE004
And sorting u from large to small.
Specifically, the list of the available logical root sequences in the step S4
Figure 810344DEST_PATH_IMAGE010
Selecting available ones in T for the base station according to the system configuration
Figure 148921DEST_PATH_IMAGE011
Serial numbers of the continuous logic root sequences;
wherein,
Figure 650965DEST_PATH_IMAGE012
sorting logical root sequence lists for availability
Figure 278256DEST_PATH_IMAGE013
The first item of (a) is,
Figure 521018DEST_PATH_IMAGE014
sorting a list of logical root sequences for availability
Figure 917365DEST_PATH_IMAGE013
The last item in (a) is,
Figure 587380DEST_PATH_IMAGE015
the number of logical root sequences of PRACH which can be used by the current cell.
Specifically, the method also comprises the step of sending down in the system broadcast message
Figure 436388DEST_PATH_IMAGE016
And the sequence number of the first PRACH logical root sequence available for the cell.
The invention firstly provides a calculation method of the minimum interval of adjacent correlation peaks of different u-value PRACH physical root sequence time domains, then uses the calculation result of the method to sequence and optimize the PRACH sequence of a protocol to generate a sequenced PRACH logical root sequence list, uses the sequenced PRACH logical root sequence list to replace the PRACH logical root sequence list of the existing protocol, and finally a base station selects and broadcasts the sequence number of a first logical root sequence in a cell.
The invention can achieve the following beneficial effects:
1) The invention maximizes the minimum interval of the correlation peaks of the PRACH logic root sequence selectable by the cell terminal, thereby remarkably improving the time-frequency offset estimation performance of the PRACH in a large time-frequency offset scene;
2) The invention only needs to replace the PRACH logic root sequence list in the protocol, and does not need to modify other communication behaviors of the base station and the terminal.
Detailed Description
In order to more clearly understand the technical features, objects, and effects of the present invention, specific embodiments of the present invention will now be described.
Example 1
In this embodiment, the number of OFDM points of the system is assumed to be
Figure 217262DEST_PATH_IMAGE017
Each time slot has 14 OFDM symbols (index is 0, …, 13), the CP length of the first OFDM symbol is 352, and the cyclic prefix length of the non-first symbol
Figure 530431DEST_PATH_IMAGE018
The time domain signal length of the whole time slot is 61440 noted as
Figure 371349DEST_PATH_IMAGE019
The 2 pilot symbols for frequency offset estimation are respectively located at symbol 2 and symbol 11, the number of pilot subcarriers configured for each symbol is M =1638 (the pilot subcarrier indexes are 410,412, …,3682,3684), the system subcarrier interval is f =30kHz, and the maximum possible frequency offset of the system is
Figure 973231DEST_PATH_IMAGE020
Then, the embodiment mainly includes:
(1) Determining system parameters: the length of PRACH sequence configured by the system is
Figure 557796DEST_PATH_IMAGE021
The number of logical root sequences of the PRACH that can be used by the current cell is 64;
(2) Calculating the minimum interval of adjacent correlation peaks of PRACH sequences with different u values
Figure 928735DEST_PATH_IMAGE004
:
Figure 940553DEST_PATH_IMAGE005
Wherein
Figure 764153DEST_PATH_IMAGE022
To satisfy
Figure 886829DEST_PATH_IMAGE023
The smallest non-negative integer of (c);
(3) According to
Figure 126923DEST_PATH_IMAGE004
Ordering u from large to small (if different values of u are used)
Figure 309642DEST_PATH_IMAGE004
Same, they can be sorted arbitrarily), a sorted logical root sequence list is obtained
Figure 886117DEST_PATH_IMAGE024
As shown in table 1;
(4) Assuming that other PRACH logical root sequences except for {0,1,136,137} of the current cell configured by the high layer can be used, the base station generates
Figure 609223DEST_PATH_IMAGE025
Then is sent down in the system broadcast message
Figure 689174DEST_PATH_IMAGE026
The sequence number is used as the first PRACH logical root sequence number available for the cell;
(5) In PRACH detection, the base station uses
Figure 42795DEST_PATH_IMAGE027
The PRACH logic root sequence in the PRACH detection and time frequency offset estimation is carried out.
The logical root sequence of the sequenced PRACH in this embodiment is shown in table 1:
table 1 ordered PRACH logical root sequence list
Figure 840987DEST_PATH_IMAGE029
The foregoing shows and describes the general principles and broad features of the present invention and advantages thereof. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, which are described in the specification and illustrated only to illustrate the principle of the present invention, but that various changes and modifications may be made therein without departing from the spirit and scope of the present invention, which fall within the scope of the invention as claimed.

Claims (6)

1. A method for planning a random access sequence is characterized by comprising the following steps:
s1, determining parameters based on a 3GPP TS38.211Realease16 version protocol system;
s2, calculating the minimum interval D (u) of adjacent correlation peaks of different u-value PRACH sequences;
wherein u is a PRACH serial number described in a 3GPPTS38.211Realease16 version protocol;
s3, obtaining a sequencing logic root sequence list T;
s4, forming a list of available sequencing logic root sequences
Figure 303234DEST_PATH_IMAGE001
S5, during PRACH detection, the base station uses
Figure 299003DEST_PATH_IMAGE001
The PRACH logic root sequence in the PRACH detection and time frequency offset estimation is carried out.
2. The method for planning a random access sequence of claim 1, wherein the system parameters in step S1 include a length of a PRACH sequence configured by a system
Figure 485265DEST_PATH_IMAGE002
And the number of PRACH logical root sequences which can be used by the current cell
Figure 818157DEST_PATH_IMAGE003
3. The method for planning a random access sequence of claim 2, wherein the minimum interval between adjacent correlation peaks in step S2
Figure 304634DEST_PATH_IMAGE004
The calculation formula of (A) is as follows:
Figure 64779DEST_PATH_IMAGE005
wherein,
Figure 66233DEST_PATH_IMAGE006
representing the cyclic shift interval of adjacent correlation peaks,
Figure 682110DEST_PATH_IMAGE006
to meet the need
Figure 429618DEST_PATH_IMAGE007
And
Figure 360664DEST_PATH_IMAGE008
is the smallest non-negative integer.
4. A method for random access sequence planning as claimed in claim 2, characterized in thatThe sorting logic root sequence list T in the step S3 is
Figure 255939DEST_PATH_IMAGE004
And sorting u from large to small.
5. The method for planning random access sequence of claim 2, wherein the list of available logical root sequences of the ordering in step S4
Figure 930634DEST_PATH_IMAGE009
Selecting available ones in T for the base station according to the system configuration
Figure 594965DEST_PATH_IMAGE010
Serial numbers of continuous logic root sequences;
wherein,
Figure 696913DEST_PATH_IMAGE011
sorting a list of logical root sequences for availability
Figure 876222DEST_PATH_IMAGE012
The first item of (a) is,
Figure 26711DEST_PATH_IMAGE013
sorting a list of logical root sequences for availability
Figure 607866DEST_PATH_IMAGE012
The last item in (2) is,
Figure 474190DEST_PATH_IMAGE010
the number of logical root sequences of PRACH which can be used by the current cell.
6. The method of claim 5, further comprising down-sending in a system broadcast message
Figure 423952DEST_PATH_IMAGE014
And the sequence number of the first PRACH logical root sequence available for the cell.
CN202310023791.9A 2023-01-09 2023-01-09 Planning method for random access sequence Active CN115801213B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310023791.9A CN115801213B (en) 2023-01-09 2023-01-09 Planning method for random access sequence

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310023791.9A CN115801213B (en) 2023-01-09 2023-01-09 Planning method for random access sequence

Publications (2)

Publication Number Publication Date
CN115801213A true CN115801213A (en) 2023-03-14
CN115801213B CN115801213B (en) 2023-04-11

Family

ID=85428772

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310023791.9A Active CN115801213B (en) 2023-01-09 2023-01-09 Planning method for random access sequence

Country Status (1)

Country Link
CN (1) CN115801213B (en)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101094529A (en) * 2007-08-10 2007-12-26 中兴通讯股份有限公司 Method and device for sorting ZC sequence of random access channel
CN102316601A (en) * 2011-09-28 2012-01-11 北京北方烽火科技有限公司 Leader sequence detection method and device for random access channel
CN102447532A (en) * 2012-01-19 2012-05-09 大唐移动通信设备有限公司 Preamble detection method and device for same
CN114630438A (en) * 2022-04-12 2022-06-14 四川创智联恒科技有限公司 Prach detection method in NR5G
US20220224404A1 (en) * 2019-09-30 2022-07-14 Huawei Technologies Co., Ltd. Satellite communication method and related communication device
CN115426721A (en) * 2022-07-31 2022-12-02 无锡格跃科技有限公司 Random access processing method

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101094529A (en) * 2007-08-10 2007-12-26 中兴通讯股份有限公司 Method and device for sorting ZC sequence of random access channel
CN102316601A (en) * 2011-09-28 2012-01-11 北京北方烽火科技有限公司 Leader sequence detection method and device for random access channel
CN102447532A (en) * 2012-01-19 2012-05-09 大唐移动通信设备有限公司 Preamble detection method and device for same
US20220224404A1 (en) * 2019-09-30 2022-07-14 Huawei Technologies Co., Ltd. Satellite communication method and related communication device
CN114630438A (en) * 2022-04-12 2022-06-14 四川创智联恒科技有限公司 Prach detection method in NR5G
CN115426721A (en) * 2022-07-31 2022-12-02 无锡格跃科技有限公司 Random access processing method

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
3GPP: "\"3GPP TR36.878v13.0.0\"" *
HUAWEI: "R1-081029 \"Root Zadoff-Chu sequence order for PRACH format 4 in FS2 TDD\"" *
HUAWEI: "R1-1704132 \"Correction to PRACH resource configuration for high speed scenario in TS 36.211\"" *
李天浩: "\"TD-LTE系统PRACH检测技术研究与实现\"" *

Also Published As

Publication number Publication date
CN115801213B (en) 2023-04-11

Similar Documents

Publication Publication Date Title
CN103748942B (en) Accidental access method, base station and terminal
US11917621B2 (en) Method, device, and apparatus for transporting common control information
JP6145137B2 (en) Processing method, base station and mobile station
CN111132366B (en) User equipment, network node and method therein for handling preamble transmission on a random access channel in a radio communication network
US8873488B2 (en) Method and apparatus for transmitting synchronization signals in an OFDM based cellular communications system
TWI376128B (en) System and method for adapting a cyclic prefix in an orthogonal frequency division multiplexing (ofdm) system
KR102241066B1 (en) Random access transmission method, receiving method and apparatus, transmitting end and receiving end
CN106797660A (en) Ascending transmission method and device in a kind of Stochastic accessing
CN103095637A (en) Demodulation reference signal transmission method and system
CN112087812B (en) Power back-off-based mMTC non-orthogonal random access method
WO2015176517A1 (en) Device-to-device resource configuration method, network device, and user equipment
CN101772148A (en) Auxiliary synchronizing channel configuring method and device, and subcarrier mapping method and device
CN102143574A (en) Timing synchronization method suitable for IEEE (Institute of Electrical and Electronic Engineers) 802.16m preamble structure
WO2005022792A2 (en) Method of constructing wireless network for orthogonal frequency division multiplex and terminal employing ofdma method
CN111107562B (en) Detection method and detection device
Mostafa et al. Aggregate preamble sequence design for massive machine-type communications in 5G networks
CN115801213B (en) Planning method for random access sequence
WO2010093028A1 (en) Non-coherent detection method of the number of transmit antenna ports for ofdma
CN112385169B (en) Frequency domain position determining method, device and equipment
CN109121227B (en) 5G terminal physical layer state and task design method thereof
CN110418422B (en) Method, system and device for reporting cluster user equipment capacity
Zhang et al. Exploiting propagation delay difference in collided preambles for efficient random access in NB-IoT
Milyutin et al. Methods for improving the accuracy of frequency shift estimation in 5G NR
Yang et al. An Efficient ToA Estimation Technique Based on Phase Correction for 5G mMTC system
CN113645692B (en) Efficient competition consensus method based on multiple carriers in Internet of things scenario

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant