CN111629445A

CN111629445A - Random access method and device

Info

Publication number: CN111629445A
Application number: CN201910146198.7A
Authority: CN
Inventors: 廖树日; 丁梦颖; 胡远洲; 汪凡
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2019-02-27
Filing date: 2019-02-27
Publication date: 2020-09-04
Anticipated expiration: 2039-02-27
Also published as: WO2020173282A1; CN111629445B

Abstract

The embodiment of the application provides a random access method and a random access device, which can increase the number of random access leader sequences of a cell, thereby reducing the probability of collision of random access. The method comprises the following steps: the network equipment sends first information to the terminal equipment, wherein the first information is used for indicating a target logical root serial number of a cell, the target logical root serial number is used for indicating K target physical root serial numbers and J-1 target cyclic shift difference values, and J and K are integers larger than 1; the terminal device receives the first information and sends a random access leader sequence to the network device, wherein the random access leader sequence is determined according to the K target physical root sequence numbers and the J-1 target cyclic shift difference values, and the network device receives the random access leader sequence.

Description

Random access method and device

Technical Field

The present application relates to the field of communications, and in particular, to a random access method and apparatus in the field of communications.

Background

In order to cope with the explosive mobile data traffic increase, the connection of massive mobile communication devices, and various new services and application scenarios which are continuously emerging in the future, a fifth generation (5th generation, 5G) communication system which can support multiple services is produced. Compared with a random access scenario in a Long Term Evolution (LTE) communication system, a random access scenario in a 5G communication system requires that the number of users in a serving cell can reach 10-100 times of the number of users in the serving cell in the LTE communication system, and therefore a Random Access Channel (RACH) is required to support a stronger function, for example, the spectral efficiency of the RACH can be increased by 4 times in a scenario lower than 6GHz, and increased by 64 times in a scenario higher than 6 GHz. The random access channel is used for the terminal device to access the network device during an access process, for example, the terminal device may send a random access preamble sequence (preamble, which may also be referred to as a random access preamble or an access preamble) to the network device on a Physical Random Access Channel (PRACH). After the terminal equipment is accessed to the network equipment, the terminal equipment can carry out data transmission with the network equipment. For example, the terminal device may perform downlink data transmission with the network device, that is, the network device sends data to the terminal device; for another example, the terminal device may perform uplink data transmission with the network device, that is, the terminal device sends data to the network device.

The random access preamble sequence transmitted by the terminal device may be randomly selected from a set of random access preamble sequences configured for the cell, wherein the set of random access preamble sequences includes one or more random access preamble sequences. Because the number of the random access leader sequences included in the random access leader sequence set is limited, with the increasing number of the terminal devices, the situation that a plurality of terminal devices adopt the same random access leader sequence to request to access the same cell easily occurs, that is, the random access collides, and the access of the plurality of terminal devices to the cell fails.

Disclosure of Invention

The application provides a random access method and a random access device, which can increase the number of random access leader sequences of a cell, thereby reducing the probability of collision of random access.

In a first aspect, a random access method is provided, including: receiving first information, wherein the first information is used for indicating a target logical root sequence number of a cell, the target logical root sequence number is used for indicating K target physical root sequence numbers and J-1 target cyclic shift difference values, and K and J are integers greater than 1; and sending a random access leader sequence, wherein the random access leader sequence is determined according to the K target physical root sequence numbers and the J-1 target cyclic shift difference values.

According to the random access method, the network equipment sends the first information to the terminal equipment to indicate the target logic root serial number, the terminal equipment determines K target physical root serial numbers and J-1 target cyclic shift difference values according to the target logic root serial number, then obtains the random access sequence and sends the random access sequence to the network equipment, and signaling overhead when the logic root serial number is configured can be reduced while the collision probability of random access is reduced.

In this embodiment, the J-1 target cyclic shift difference values are obtained according to K target cyclic shift values, or it is described that the J-1 target cyclic shift difference values can determine K target cyclic shift values, and the K target cyclic shift values are in one-to-one correspondence with the K target physical root sequences indicated by the K target physical root sequence numbers. In other words, the J-1 target cyclic shift difference values are obtained from or described as K target cyclic shift values for determining K target cyclic shift values, and the J-1 target cyclic shift difference values may be the difference between two target cyclic shift values of the K target cyclic shift values. For a specific set of J-1 target cyclic shift differences, different target cyclic shift values can obtain the same target cyclic shift difference, e.g., a cyclic shift difference of 1 can be obtained from both cyclic shift value combination (1,2) and cyclic shift value combination (3, 4), i.e., 2-1 equals 1 and 4-3 equals 1. I.e., J-1 target cyclic shift differences may correspond to a plurality of different combinations of target cyclic shift values. As a random access leader sequence can be generated according to a target cyclic shift value combination, more random access leader sequences can be obtained according to K target physical root sequence numbers and J-1 target cyclic shift difference values, and the random access leader sequences are used for randomly selecting one random access leader sequence for access by the terminal equipment.

Optionally, the K target physical root sequence numbers are the same. For example, K is 3, and 3 target physical root sequence numbers may be 1,1, and 1, respectively, or 3 target physical root sequence numbers may be 2,2, and 2, respectively. The J-1 target cyclic shift difference values are not all 0, namely at least 2 target cyclic shift values in K target cyclic shift values determined by the J-1 target cyclic shift difference values are different.

Optionally, there are at least 2 target physical root sequence numbers in the K target physical root sequence numbers that are different, for example, K is 3, and 3 target physical root sequence numbers may be 1,1, and 2, or 3 target physical root sequence numbers may be 1,2, and 3, respectively. The J-1 target cyclic shift differences may be completely the same, may not be completely the same, and may not be completely the same, which is not limited in this application. For example, when J-1 is greater than 1, any two target cyclic shift differences of the J-1 target cyclic shift differences may be the same or different. A value of one target cyclic shift difference may be an integer greater than 0, equal to 0, or less than 0. For example, in the embodiment of the present application, the J-1 target cyclic shift difference values may include one or more target cyclic shift difference values with a value of 0, in which case, target cyclic shift values corresponding to at least two target physical root sequences among the K target physical root sequences are equal.

Further, in the embodiment of the present application, a specific (physical root sequence number, cyclic shift difference) combination is configured for one cell, so that one cell can correspond to a greater number of cyclic shift value combinations, and compared with a logical root sequence number and a (physical root sequence number, cyclic shift value) combination, the signaling overhead of configuring a logical root sequence number by a network device is smaller.

In some implementations of the first aspect, the terminal device may determine the K target physical root sequence numbers and the J-1 target cyclic shift difference values according to the first mapping relationship and the target logical root sequence number. The first mapping relationship is used for representing a one-to-one correspondence relationship between a plurality of logical root sequence numbers and a plurality of (K target physical root sequence numbers, J-1 target cyclic shift difference values) combinations. In the embodiment of the present application, one target logical root sequence number corresponds to one combination of K target physical root sequence numbers and J-1 target cyclic shift difference values. For example, the first mapping relationship may be embodied in a form of a table or a formula, and the like, which is not limited in this embodiment of the application.

For the terminal device, sending a random access preamble sequence according to the target physical root sequence number and the J-1 target cyclic shift difference values, there may be multiple implementation manners.

In a possible implementation manner, the terminal device may generate M random access preamble sequences according to the K target physical root sequence numbers and the J-1 target cyclic shift difference values. When the terminal device performs random access, it may randomly select one sequence from the M random access preamble sequences and send it to the network device. Alternatively, the terminal device may store the M random access preamble sequences before random access.

In a possible implementation manner, the terminal device may determine, according to the J-1 target cyclic shift difference values, combinations of M target cyclic shift values, where the combinations of M target cyclic shift values may be used to generate M random access sequences. Each target cyclic shift value combination of the M target cyclic shift value combinations comprises K target cyclic shift values. The K target cyclic shift values comprised by different combinations of target cyclic shift values may be all different or partly different. When the terminal device performs random access, a cyclic shift value combination can be selected from the M target cyclic shift value combinations, the target physical root sequences indicated by the corresponding K target physical root sequence numbers are respectively cyclically shifted according to K cyclic shift values in the cyclic shift value combination to obtain K target sequences, and a random access preamble sequence is generated according to the K target sequences. The terminal device may transmit the random access preamble sequence to a network device. Alternatively, the terminal device may store the M target cyclic shift values in combination before the random access.

In certain implementations of the first aspect, K ═ J, the random access preamble sequence is determined according to the K target physical root sequence numbers and J target cyclic shift values, a jth target cyclic shift difference value of the J-1 target cyclic shift difference values is a difference between a jth +1 target cyclic shift value and a 1 st target cyclic shift value of the J target cyclic shift values, the J target cyclic shift values are in one-to-one correspondence with the K target physical root sequence numbers, a value range of J is from 1 to J-1, and J is an integer; and sending the random access leader sequence, wherein the random access leader sequence is determined according to the K target physical root sequence numbers and the J target cyclic shift values.

In certain implementations of the first aspect, K equals J, the J-1 target cyclic shift difference values are derived from J target cyclic shift values, a jth target cyclic shift difference value of the J-1 target cyclic shift difference values is a difference between a jth +1 target cyclic shift value and a jth target cyclic shift value of the J target cyclic shift values, J ranges from 1 to J-1, and J is an integer.

Specifically, J target cyclic shift values may be determined according to the J-1 target cyclic shift difference values, and according to one possible combination of the J target cyclic shift values, J target physical root sequences corresponding to the J-1 target cyclic shift difference values are respectively cyclically shifted, so that J target sequences may be obtained. And superposing the J target sequences to obtain a random access leader sequence which is finally adopted by the terminal equipment to access the cell. According to multiple possible combinations of the J target cyclic shift values, multiple random access preamble sequences available to the terminal device can be generated, and the terminal device can randomly select one sequence from the multiple random access preamble sequences to access the cell.

In certain implementations of the first aspect, the random access preamble sequence is obtained by stacking J target sequences, and the J target sequences respectively correspond to the J target cyclic shift values.

In certain implementations of the first aspect, the J-1 target cyclic shift difference values are derived from other numbers of target cyclic shift values or target cyclic shift numbers. I.e., K is not equal to J. Optionally, K is 2 (J-1), the number of target cyclic shift values is 2 (J-1), that is, J-1 target cyclic shift differences are obtained from 2 (J-1) target cyclic shift values, a jth target cyclic shift difference of the J-1 target cyclic shift differences is a difference between a 2 jth target cyclic shift value and a 2J-1 target cyclic shift value of the 2 (J-1) target cyclic shift values, J ranges from 1 to J-1, and J is an integer.

Specifically, 2 × J-1 target cyclic shift values may be determined according to the J-1 target cyclic shift difference values, and according to one possible combination of the 2 × J-1 target cyclic shift values, 2 × J-1 target physical root sequences corresponding to the 2 × J-1 target cyclic shift values are cyclically shifted, respectively, so as to obtain 2 × J-1 target sequences. And superposing the 2x (J-1) target sequences to obtain a random access leader sequence which is finally adopted by the terminal equipment to access the cell. According to multiple possible combinations of the J target cyclic shift values, multiple random access preamble sequences available to the terminal device can be generated, and the terminal device can randomly select one sequence from the multiple random access preamble sequences to access the cell.

It should be understood that the above-mentioned superimposing multiple target sequences is only one possible implementation manner of generating the random access preamble sequence, and the random access preamble sequence may also be determined in a dot-product manner or other manners, which is not limited in this embodiment of the present application.

In certain implementations of the first aspect, the random access preamble sequence is one of M random access preamble sequences determined according to the K target physical root sequence numbers and the J-1 target cyclic shift difference values, where M is MAX (((M ═ MAX))

-target cyclic shift difference 1/Ncs), (c) and (d)

Target cyclic shift difference 2/Ncs), …, (Ncs)

Target cyclic shift difference (J-1)/Ncs)), where Nzc is the length of the target physical root sequence and Ncs is the target zero correlation value,

indicating that a rounding down is performed on x and MAX indicates the maximum value.

In certain implementations of the first aspect, a Cubic Metric (CM) value of the random access preamble sequence is less than a preset CM threshold. The network device can screen the random access leader sequence according to the CM threshold value, and ensure that the CM value of the random access leader sequence adopted by the terminal device is smaller than the CM threshold value, thereby reducing the requirement on the power amplifier.

In certain implementations of the first aspect, a peak to average power ratio (PAPR) value of the random access preamble sequence is less than a preset PAPR threshold. The network device can screen the random access leader sequence according to the PAPR threshold value, and ensure that the PAPR value of the random access leader sequence adopted by the terminal device is smaller than the PAPR threshold value, thereby reducing the requirement on the power amplifier.

In certain implementations of the first aspect, the J-1 target cyclic shift differences are cyclic shift differences at a target zero correlation value Ncs-2.

In certain implementations of the first aspect, the J-1 target cyclic shift differences are

And a cyclic shift difference of the J-1 target cyclic shift differences is less than or equal to a maximum value of cyclic shift differences when Ncs is 2, where X is a positive integer.

In certain implementations of the first aspect, the method further comprises: receiving second information, where the second information is used to indicate a target zero correlation value of the cell from a candidate zero correlation value set, and a zero correlation value in the candidate zero correlation value set is an integer multiple of 2.

Specifically, the network device may send second information to the terminal device, where the second information is used to configure a target zero correlation value, where the target zero correlation value is selected from a candidate zero correlation value set, and a zero correlation value included in the candidate zero correlation value set is an integer multiple of 2. In this way, the correspondence relationship between the logical root sequence number and the combination of (physical root sequence number, J-1 cyclic shift difference values) can be configured only for the cyclic shift difference value corresponding to Ncs ═ 2. For cyclic shift difference corresponding to Ncs 2 × X, the cyclic shift difference can be expressed by formula

And determining, thereby saving signaling overhead of configuring the logical root sequence number by the network equipment.

In a second aspect, another random access method is provided, including: sending first information, wherein the first information is used for indicating a target logical root sequence number of a cell, the target logical root sequence number is used for indicating K target physical root sequence numbers and J-1 target cyclic shift difference values, and K and J are integers greater than 1; receiving a random access preamble sequence, wherein the random access preamble sequence is determined according to the K target physical root sequence numbers and the J-1 target cyclic shift difference values.

In certain implementations of the second aspect, K ═ J, the random access preamble sequence is determined according to the K target physical root sequence numbers and J target cyclic shift values, the J target cyclic shift values are determined according to the J-1 target cyclic shift difference values, a jth target cyclic shift difference value of the J-1 target cyclic shift difference values is a difference value between a jth +1 target cyclic shift value and a 1 st target cyclic shift value of the J target cyclic shift values, the J target cyclic shift values correspond to the K target physical root sequence numbers one to one, a value of J ranges from 1 to J-1, and J is an integer.

In certain implementations of the second aspect, the random access preamble sequence is obtained by superimposing J target sequences, and the J target sequences respectively correspond to the J target cyclic shift values.

In certain implementations of the second aspect, the random access preamble is one of M random access preamble sequences determined according to the K target physical root sequence numbers and the J-1 target cyclic shift difference values, M ═ MAX (((MAX) ((M ═ M — (M —)

-target cyclic shift difference 1/Ncs), (c) and (d)

Target cyclic shift difference 2/Ncs), …, (Ncs)

In certain implementations of the second aspect, the cubic metric CM value of the random access preamble sequence is less than a preset CM threshold.

In certain implementations of the second aspect, a peak-to-average power ratio, PAPR, value of the random access preamble sequence is less than a preset PAPR threshold.

In certain implementations of the second aspect, the J-1 target cyclic shift differences are cyclic shift differences at a target zero correlation value Ncs of 2.

In certain implementations of the second aspect, the J-1 target cyclic shift differences are

And a cyclic shift difference of the J-1 target cyclic shift differences is less than or equal to a maximum cyclic shift difference when Ncs-2, where X is positiveAn integer number.

In certain implementations of the second aspect, the method further comprises: and sending second information, wherein the second information is used for indicating the target zero correlation value of the cell from a candidate zero correlation value set, and the zero correlation value in the candidate zero correlation value set is an integral multiple of 2.

In a third aspect, another random access method is provided, including: and sending a random access sequence, wherein the random access sequence is included in a candidate random access sequence set, the candidate random access sequence set comprises one or more candidate random access sequences, and the CM value of the random access sequence in the candidate random access sequence set is smaller than the CM threshold value.

In certain implementations of the third aspect, each random access sequence in the set of candidate random access sequences is determined according to K physical root sequence numbers and K target cyclic shift values, K being an integer greater than 1. Illustratively, each random access sequence in the candidate random access sequence set is obtained by superposition according to K target sequences. The K target sequences correspond one-to-one to the K physical root sequence numbers and the K target cyclic shift values. And one target sequence in the K target sequences is obtained by circularly shifting the physical root sequence corresponding to the target cyclic shift value according to the target cyclic shift value corresponding to the target cyclic shift value. The physical root sequence corresponds to the physical root sequence number.

In certain implementations of the third aspect, prior to the sending the random access sequence, the method further comprises: receiving first information, wherein the first information is used for indicating a target logical root sequence number of a cell, the target logical root sequence number is used for indicating K target physical root sequence numbers and J-1 target cyclic shift difference values, and K and J are integers greater than 1; and sending a random access leader sequence, wherein the random access leader sequence is determined according to the K target physical root sequence numbers and the J-1 target cyclic shift difference values. For the description of the J-1 target cyclic shift differences, reference may be made to the first aspect, which is not described herein again.

In certain implementations of the third aspect, the method further comprises: and receiving second information, wherein the second information is used for configuring a target zero correlation value of the cell for the terminal equipment from a candidate zero correlation value set, and the zero correlation value in the candidate zero correlation value set is an integral multiple of 2.

In a fourth aspect, another random access method is provided, including: receiving a random access sequence, wherein the random access sequence is included in a candidate random access sequence set, the candidate random access sequence set includes one or more candidate random access sequences, and a CM value of a random access sequence in the candidate random access sequence set is smaller than a CM threshold.

In certain implementations of the fourth aspect, each random access sequence in the set of candidate random access sequences is determined according to K physical root sequence numbers and K target cyclic shift values, K being an integer greater than 1. Illustratively, each random access sequence in the candidate random access sequence set is obtained by superposition according to K target sequences. The K target sequences correspond one-to-one to the K physical root sequence numbers and the K target cyclic shift values. And one target sequence in the K target sequences is obtained by circularly shifting the physical root sequence corresponding to the target cyclic shift value according to the target cyclic shift value corresponding to the target cyclic shift value. The physical root sequence corresponds to the physical root sequence number.

In certain implementations of the fourth aspect, prior to the receiving the random access sequence, the method further comprises: sending first information, wherein the first information is used for indicating a target logical root sequence number of a cell, the target logical root sequence number is used for indicating K target physical root sequence numbers and J-1 target cyclic shift difference values, and K and J are integers greater than 1; receiving a random access preamble sequence, wherein the random access preamble sequence is determined according to the K target physical root sequence numbers and the J-1 target cyclic shift difference values. For the description of the J-1 target cyclic shift differences, reference may be made to the second aspect, which is not described herein again.

In certain implementations of the fourth aspect, the method further comprises: and sending second information, wherein the second information is used for configuring a target zero correlation value of the cell for the terminal equipment from a candidate zero correlation value set, and the zero correlation value in the candidate zero correlation value set is an integral multiple of 2.

In a fifth aspect, another random access method is provided, including: receiving first information, wherein the first information is used for indicating a target logic root serial number of a cell, and the target logic root serial number is used for indicating K target physical root serial numbers; and sending a random access leader sequence, wherein the random access leader sequence is determined according to the K target physical root sequence numbers and J-1 target cyclic shift difference values, and K and J are integers greater than 1.

Specifically, one target logical root sequence number corresponds to K target physical root sequence numbers, that is, a logical root sequence number (or referred to as a logical root sequence index) and K corresponding physical root sequence numbers (RootNumber) are defined. In the embodiment of the present application, J-1 target cyclic shift differences may be configured for different cells, and the J-1 target cyclic shift differences of different cells may be completely the same or not completely the same (i.e., partially the same or completely different), and are not limited herein. That is, for a cell, the J-1 target cyclic shift difference value of the cell may be a fixed value, a value determined by some predefined rule (e.g., a positive integer pre-configured by the cell ID mod), or a value indicated by the network device for the terminal device through the third information.

It should be understood that, after determining the J-1 target cyclic shift differences of the cell, the description in the first aspect above may be referred to for a method for determining a random access preamble sequence according to the K target physical root sequence numbers and the J-1 target cyclic shift differences, and the description on the J-1 target cyclic shift differences may also refer to the first aspect above, which is not repeated herein.

In a sixth aspect, another random access method is provided, including: sending first information, wherein the first information is used for indicating a target logic root serial number of a cell, and the target logic root serial number is used for indicating K target physical root serial numbers; receiving a random access preamble sequence, wherein the random access preamble sequence is determined according to the K target physical root sequence numbers and J-1 target cyclic shift difference values, and K and J are integers greater than 1.

It should be understood that, after determining the J-1 target cyclic shift differences of the cell, reference may be made to the description in the second aspect above for a method for determining a random access preamble sequence according to the K target physical root sequence numbers and the J-1 target cyclic shift differences, and further, reference may also be made to the description in the second aspect above for a related description of the J-1 target cyclic shift differences, which is not described herein again.

In a seventh aspect, an apparatus is provided for performing the method of the above aspects or any possible implementation manner of the aspects. In particular, the apparatus comprises means for performing the method in the above aspects or any possible implementation of the aspects. In one design, the apparatus may include a module corresponding to one or more of the methods/operations/steps/actions described in the foregoing aspects, and the module may be a hardware circuit, a software circuit, or a combination of a hardware circuit and a software circuit.

In an eighth aspect, there is provided an apparatus comprising: a communication interface, a memory, and a processor. Wherein the processor is configured to implement the method of the above aspects or any possible implementation of the aspects, and the memory is coupled to the processor. Optionally, the communication interface, the memory and the processor are in communication with each other via an internal connection, the memory is configured to store instructions, and the processor is configured to execute the instructions stored by the memory to implement the method in the above aspects or any possible implementation manner of the aspects.

In a ninth aspect, there is provided a system comprising means for implementing the method of the first aspect or any one of the possible implementations of the first aspect, and means for implementing the method of the second aspect or any one of the possible implementations of the second aspect; or the system comprises means for implementing the method of any possible implementation of the third aspect or the third aspect described above, and means for implementing the method of any possible implementation of the fourth aspect or the fourth aspect described above; or the system comprises means for implementing the method of any possible implementation of the fifth aspect or the fifth aspect described above, and means for implementing the method of any possible implementation of the sixth aspect or the sixth aspect described above. In one design, the system includes means for implementing the method performed by the terminal device and means for implementing the method performed by the network device.

In a tenth aspect, there is provided a computer program product comprising: computer program code which, when executed by a computing device, causes the computing device to perform the method of any one of the above aspects or possible implementations of the aspects.

In an eleventh aspect, there is provided a computer-readable medium for storing instructions that, when executed on a computer, cause the computer to perform the instructions of the above aspects or the method in any possible implementation of the aspects.

In a twelfth aspect, an embodiment of the present application provides a chip system, where the chip system includes a processor and may further include a memory, and is configured to implement the method in the foregoing aspects or any possible implementation manner of the aspects. The chip system may be formed by a chip, and may also include a chip and other discrete devices.

Drawings

Fig. 1 shows a schematic diagram of an application scenario of an embodiment of the present application;

fig. 2 shows a schematic flow chart of a random access method of an embodiment of the present application;

FIG. 3 shows a schematic block diagram of an apparatus of an embodiment of the present application;

fig. 4 shows a schematic block diagram of another apparatus of an embodiment of the present application.

Detailed Description

The technical solution in the present application will be described below with reference to the accompanying drawings.

The technical scheme of the embodiment of the application can be applied to various communication systems, for example: a global system for mobile communications (GSM) system, a Code Division Multiple Access (CDMA) system, a Wideband Code Division Multiple Access (WCDMA) system, a General Packet Radio Service (GPRS), a long term evolution (long term evolution, LTE) system, a LTE Frequency Division Duplex (FDD) system, a LTE Time Division Duplex (TDD), a universal mobile telecommunications system (universal mobile telecommunications system, UMTS), a Worldwide Interoperability for Microwave Access (WiMAX) communication system, a fifth generation (5G) system, or a New Radio (NR), etc.

The terminal device related to the embodiment of the present application may be simply referred to as a terminal, and may be a device having a wireless transceiving function. The terminal can be deployed on land, including indoors or outdoors, hand-held or vehicle-mounted; can also be deployed on the water surface (such as a ship and the like); and may also be deployed in the air (e.g., airplanes, balloons, satellites, etc.). The terminal device may be a User Equipment (UE). The UE includes a handheld device, an in-vehicle device, a wearable device, or a computing device with wireless communication capabilities. Illustratively, the UE may be a mobile phone (mobile phone), a tablet computer, or a computer with wireless transceiving function. The terminal device may also be a Virtual Reality (VR) terminal device, an Augmented Reality (AR) terminal device, a wireless terminal in industrial control, a wireless terminal in unmanned driving, a wireless terminal in telemedicine, a wireless terminal in smart grid, a wireless terminal in smart city (smart city), a wireless terminal in smart home (smart volume), and so on. In the embodiment of the present application, the apparatus for implementing the function of the terminal may be a terminal; it may also be a device, such as a system-on-chip, capable of supporting the terminal to implement the function, which may be installed in the terminal. In the embodiment of the present application, the chip system may be composed of a chip, and may also include a chip and other discrete devices. In the technical solution provided in the embodiment of the present application, a device for implementing a function of a terminal is taken as an example, and the technical solution provided in the embodiment of the present application is described.

The network device in this embodiment may be a device for communicating with a terminal device, where the network device may be a Base Transceiver Station (BTS) in a global system for mobile communications (GSM) system or a Code Division Multiple Access (CDMA) system, may also be a node B (NodeB, NB) in a Wideband Code Division Multiple Access (WCDMA) system, may also be an evolved node B (evolved NodeB, eNB, or eNodeB) in an LTE system, and may also be a wireless controller in a Cloud Radio Access Network (CRAN) scenario, or the network device may be a relay station, an access point, a vehicle-mounted device, a wearable device, a network device in a future 5G network, a network device in a Public Land Mobile Network (PLMN) for future evolution, or the like, and the embodiment of the present application is not limited. A base station may be a device deployed in a radio access network that is capable of wireless communication with terminals. The base station may have various forms, such as a macro base station, a micro base station, a relay station, an access point, and the like. For example, the base station related to the embodiment of the present application may be a base station in 5G or a base station in LTE, where the base station in 5G may also be referred to as a Transmission Reception Point (TRP) or a gnb (generation nodeb). In the embodiment of the present application, the apparatus for implementing the function of the network device may be a network device; or may be a device, such as a system-on-chip, capable of supporting the network device to implement the function, and the device may be installed in the network device. In the technical solution provided in the embodiment of the present application, a device for implementing a function of a network device is taken as an example of a network device, and the technical solution provided in the embodiment of the present application is described.

The method provided by the embodiment of the present application may be used for communication between a network device and a terminal device, may also be used for communication between a macro base station and a micro base station, and may also be used for communication between a terminal device and a terminal device, which is not limited in the embodiment of the present application.

In the embodiment of the application, the terminal device or the network device includes a hardware layer, an operating system layer running on the hardware layer, and an application layer running on the operating system layer. The hardware layer includes hardware such as a Central Processing Unit (CPU), a Memory Management Unit (MMU), and a memory (also referred to as a main memory). The operating system may be any one or more computer operating systems that implement business processing through processes (processes), such as a Linux operating system, a Unix operating system, an Android operating system, an iOS operating system, or a windows operating system. The application layer comprises applications such as a browser, an address list, word processing software, instant messaging software and the like. Furthermore, the embodiment of the present application does not particularly limit the specific structure of the execution subject of the method provided by the embodiment of the present application as long as communication can be performed according to the method provided by the embodiment of the present application, for example, the execution subject of the method provided by the embodiment of the present application may be a terminal device or a network device, or a functional module capable of executing a program in the terminal device or the network device.

Additionally, various aspects or features of embodiments of the application may be implemented as a method, apparatus, or article of manufacture using standard programming and/or engineering techniques. The term "article of manufacture" as used herein is intended to encompass a computer program accessible from any computer-readable device, carrier, or media. For example, computer-readable media may include, but are not limited to: magnetic storage devices (e.g., hard disk, floppy disk, or magnetic tape), optical disks (e.g., Compact Disk (CD), Digital Versatile Disk (DVD), etc.), smart cards, and flash memory devices (e.g., erasable programmable read-only memory (EPROM), card, stick, or key drive, etc.). In addition, various storage media described herein can represent one or more devices and/or other machine-readable media for storing information. The term "machine-readable medium" can include, without being limited to, various other media capable of storing, containing, and/or carrying instruction(s) and/or data.

Fig. 1 illustrates a communication system 100 to which embodiments of the present application may be applied. The communication system 100 may include at least one network device 110 and one or more terminal devices 120 located within the coverage area of the network device 110. Fig. 1 exemplarily shows one network device and two terminal devices, and optionally, the communication system 100 may include a plurality of network devices and may include other numbers of terminal devices within the coverage of each network device, which is not limited in this embodiment of the present application. In the embodiments of the present application, at least one may be one or more, for example, 1,2,3, or more.

Optionally, the wireless communication system 100 may further include other network entities such as a network controller, a mobility management entity, and the like, which is not limited thereto.

The following first introduces possible application scenarios of the method provided by the embodiment of the present application.

When a terminal device wants to perform data transmission with a network device in a certain cell, the terminal device needs to access the network device. Specifically, the terminal device may randomly select one random access preamble sequence from at least one random access preamble sequence (preamble, which may also be referred to as random access preamble, random access sequence, and the like) included in a random access preamble sequence set configured for the cell, and then send the random access preamble sequence to the network device on a physical random access channel. After the terminal device accesses the network device, data transmission can be performed with the network device. It should be understood that one cell may configure a specific set of random access preamble sequences. Taking the example that the random access preamble sequence set includes a plurality of random access preamble sequences, the terminal device may determine the plurality of random access preamble sequences in various ways.

In a possible implementation manner, the network device may configure a random access preamble sequence set for a cell, so that a terminal device in the coverage of the cell accesses the network device of the cell. The set of random access preamble sequences for each cell may include a positive integer number, e.g., 64, ZC (Zadoff-Chu) sequences, each ZC sequence corresponding to a random access preamble Identification (ID).

When the terminal device accesses a certain cell by adopting a competitive random access mode, the terminal device can randomly select a ZC sequence from a random access leader sequence set of the cell as a random access leader sequence, and the terminal device sends the selected random access leader sequence to the network device of the cell to request to access the cell.

The network device or the terminal device may obtain a random access preamble sequence set of a cell by performing Cyclic Shift (CS) on the ZC root sequence.

For a cell, a network device may allocate a logical root sequence number of a ZC root sequence to the cell, where the logical root sequence number corresponds to a physical root sequence number, the physical root sequence number may be used to generate a physical root sequence, and a random access preamble sequence of the cell is generated according to the physical root sequence. The correspondence between the logical root sequence number and the physical root sequence number may be described in a logical root sequence number schedule table. In this document, Nzc is used to indicate the length of a random access preamble sequence, Ncs is used to indicate a zero correlation value used for determining a cyclic shift value, and both the Nzc and Ncs values may be agreed by a protocol or configured by a network device for a terminal device through signaling. Where Nzc and Ncs are positive integers. In the embodiment of the present application, the positive integer may be an integer of 1,2,3, or more, and the embodiment of the present application is not limited.

In this embodiment of the present application, the zero correlation value Ncs may be used to represent a cyclic shift size of a cell, where the cyclic shift size determines a zero correlation zone of a random access preamble sequence, and the cyclic shift size is related to a radius of the cell, so that orthogonality of the random access preamble sequence used by terminal devices at different positions in the cell may be ensured, and a success rate of access of the terminal device may be ensured.

In the embodiment of the present application, the signaling may be semi-static signaling and/or dynamic signaling.

The semi-static signaling may be Radio Resource Control (RRC) signaling, broadcast messages, system messages, or MAC Control Elements (CEs). The broadcast message may include a Remaining Minimum System Information (RMSI).

The dynamic signaling may be physical layer signaling. The physical layer signaling may be signaling carried by a physical control channel or signaling carried by a physical data channel. The physical data channel may be a downlink channel, such as a Physical Downlink Shared Channel (PDSCH). The physical control channel may be a Physical Downlink Control Channel (PDCCH), an Enhanced Physical Downlink Control Channel (EPDCCH), a Narrowband Physical Downlink Control Channel (NPDCCH), or a machine communication physical downlink control channel (MTC) MPDCCH. The signaling carried by the PDCCH or EPDCCH may also be referred to as Downlink Control Information (DCI). The physical control channel may also be a physical side link control channel (physical side link control channel), and signaling carried by the physical side link control channel may also be referred to as side link control information (SCI).

Taking the length Nzc of the random access leader sequence as 139 as an example, the first table provides a protocol logical root sequence number planning table, which plans the physical root sequence number according to the sequence order according to the symmetry of the ZC sequence and is applicable to all zero correlation values Ncs. In table one, there is a one-to-one correspondence between a logical root sequence number (logical root sequence number) and a physical root sequence number (physical root sequence number).

Watch 1

In order to reduce the collision probability of a plurality of terminal devices accessing the cell, the configuration of the number of preamble sequences of the cell can be increased as much as possible. In one possible implementation, for a particular cell, the number of random access preamble sequences required by the cell may be configured. This number may be predefined or signaled by the network device for the terminal device. Illustratively, the number may be configured to be a positive integer, e.g., 64, 128, 640, etc., and the terminal device needs to select from the positive integer number of random access preamble sequences, so as to reduce the probability of random access collision between the terminal device and other terminal devices accessing the cell simultaneously.

Taking the number of random access preamble sequences required by a cell equal to 64 as an example, after the terminal device determines a logical root sequence number of a cell, 64 random access preamble sequences of the cell may be generated according to the logical root sequence number. The specific generation method of the 64 random access preamble sequences of the cell is as follows:

1) the terminal equipment reads the system parameters of the cell, and acquires a parameter RACH _ ROOT _ SEQUENCE from the system parameters of the cell, wherein the parameter RACH _ ROOT _ SEQUENCE is used for indicating the logical ROOT SEQUENCE number of the cell;

2) the terminal device determines a logical ROOT SEQUENCE number (index) of the cell according to the parameter RACH _ ROOT _ SEQUENCE, obtains a corresponding physical ROOT SEQUENCE number according to the logical ROOT SEQUENCE number (for example, by looking up the table one, if the logical ROOT SEQUENCE number is 1, the corresponding physical ROOT SEQUENCE number is 138), and determines a corresponding ZC ROOT SEQUENCE according to the physical ROOT SEQUENCE number, that is, a physical ROOT SEQUENCE represented by the physical ROOT SEQUENCE number;

3) the terminal device can use all available cyclic shifts of the ZC root sequence to generate a sequence, wherein the larger the cyclic shift is, the larger the number of the sequence is;

for example, for one cell, the random access preamble sequence generated using the cyclic shift of the ZC root sequence can be represented as:

x_u,v(n)＝x_u((n+C_v)mod Nzc)

wherein:

x_uis ZC root sequence, u is physical root sequence number determined according to logical root sequence number, and Nzc is ZC root sequence x_uLength of (C)_vIs a cyclic shift value determined from the zero correlation value Ncs. Wherein, the formula

J in (a) is an imaginary unit whose square is equal to-1.

By way of example, in one possible implementation,

indicating that a rounding down is performed on x and a "/" indicates a division. The terminal equipment can also determine C through a zero correlation value Ncs according to other modes_vAnd are not intended to be limiting herein.

4) If one ZC root sequence is not enough to generate 64 random access preamble sequences, the terminal device may determine a next logical root sequence number according to the logical root sequence number, and continue to generate random access preamble sequences using the ZC root sequence corresponding to the next logical root sequence number until 64 random access preamble sequences are generated.

For example, for a certain cell, the logical root sequence number of the cell is configured to be 0 (the corresponding physical root sequence number is 1), and the number of random access preamble sequence configurations of the cell needs to be 64. When Ncs is 2, since a single root (physical root sequence) passes through cyclic shiftThe number of the generated sequences is

69 is greater than 64, therefore, a physical root sequence can meet the sequence number configuration requirement of the cell, and the number of root sequences required by the cell is 1, the corresponding logical root sequence number is 0, and the corresponding physical root sequence number is 1 according to table one. When Ncs is 69, the number of sequences generated by cyclic shift of a single root (physical root sequence) is 69

2 is less than 64, the configuration of the number of sequences of the single cell is not satisfied, therefore, the terminal device may determine a next logical root sequence number consecutive to the logical root sequence number of the cell in an incremental manner, and continue to generate the sequence with the next logical root sequence number until the number of the generated sequences satisfies the configuration of the cell. In this embodiment, to satisfy the requirement 64 for the random access sequence configuration number of the cell, the number of logical root sequence numbers required by the single cell is 32, the corresponding logical root sequence numbers are 0 to 31, and the corresponding physical root sequence numbers are (1, 138,2, 137, …, 16, 123) according to table one.

In the foregoing implementation manner, the logical root sequence numbers and the physical root sequence numbers correspond to each other one to one, and each logical root sequence number may correspond to all sequences generated by cyclic shift of a physical root sequence corresponding to the logical root sequence number. As described above, if a logical root sequence number is configured for a certain cell, all sequences generated by cyclic shift of a physical root sequence corresponding to the logical root sequence number can only be used in the cell corresponding to the logical root sequence number, but cannot be used in other cells, and the sequence utilization efficiency is low.

In addition, the random access scenario of 5G requires that the number of accessible terminal devices can be 10-100 times that in the LTE system. When the terminal devices in 5G access the cell in a contention random access manner, if the manner of generating the random access preamble sequence in the LTE system is still used, a situation that multiple terminal devices simultaneously use the same random access preamble sequence to request access to the cell (that is, the random access is collided) easily occurs in one cell, resulting in a failure of access to the cell by the multiple terminal devices.

Therefore, in another possible implementation manner, the embodiment of the present application proposes another random access method. The method comprises the following steps: for a cell, the network device configures L random access sequence sets for the terminal device, each random access sequence set comprises J random access sequences, L and J are positive integers, and J is greater than or equal to 2. The L random access sequence sets may correspond to the L random access identifiers one to one, respectively. When initiating random access, the terminal device may determine a first random access identifier from the L random access identifiers, and select a first random access sequence set corresponding to the first random access identifier from the L random access sequence sets. The terminal device may determine a random access sequence from the selected first set of random access sequences. For example, the determined random access sequence is generated from a sum (e.g., direct addition, or direct addition followed by multiplication by a coefficient, or weighted summation) of J random access sequences in the selected first set of random access sequences. And the terminal equipment sends the determined random access sequence to the network equipment. The method can greatly increase the number of candidate random access sequences by corresponding a random access sequence ID to a random access sequence set and obtaining a new random access sequence according to the sum of J random access sequences in the random access sequence set. Therefore, when the terminal device generates the random access sequence requesting to access the cell to be accessed by adopting the above manner, the probability that a plurality of terminal devices simultaneously use the same random access sequence to request to access the cell (namely, the random access collision probability) can be reduced, so that the PRACH capacity of the cell can be improved.

In this embodiment of the present application, a new random access sequence is generated by adding J random access sequences, and the method provided in this embodiment of the present application may also be applied to other methods for determining a new random access sequence according to J random access sequences, for example, multiplying a coefficient after adding, performing weighted summation, or other manners, which is not limited in this embodiment of the present application.

For one random access sequence set of the L random access sequence sets, J random access sequences of the one random access sequence set correspond to a plurality of physical root sequences, the method may also be referred to as generating a new sequence by cyclic shift combination of a plurality of (physical root sequences). For the one set of random access sequences, the plurality of physical root sequences may correspond to a plurality of physical root sequence numbers, which may be the same or may not be identical (i.e., at least two different physical root sequence numbers are included in the plurality of physical root sequence numbers).

When the L random access sequence sets include one or more random access sequence sets, and when J random access sequences in the one or more random access sequence sets correspond to physical root sequences that are not identical, the method may also be referred to as generating a new sequence by cyclic shift combination of different roots (physical root sequences). In the method of generating a new sequence by cyclic shift combination of different roots (physical root sequences), the L sets of random access sequences may further include another one or more sets of random access sequences, where J random access sequences in the another one or more sets of random access sequences correspond to the same physical root sequence, i.e., correspond to the same physical root sequence number. It should be understood that the above-mentioned "cyclic shift combination" may also be referred to as "cyclic shift cross combination" or other names, which are not limited in the embodiments of the present application. Wherein, the J random access sequences corresponding to the physical root sequences that are not identical can be further described as: the J random access sequences include at least 2 random access sequences, and the at least 2 random access sequences respectively correspond to different physical root sequences or respectively correspond to different physical root sequence numbers. In this method, the J random access sequences may correspond to J cyclic shift values one by one, that is, one random access sequence corresponds to one cyclic shift value. The cyclic shift values corresponding to any 2 different random access sequences may be the same or different, and the embodiments of the present application are not limited.

For passing through differentIn the scenario of generating a new sequence by combining cyclic shifts of roots, J is 2, that is, the number of cyclic shifts of different roots generating the new sequence is 2. For a set of random access sequences, a combination of (physical root sequence number1, physical root sequence number2, cyclic shift value 1, cyclic shift value 2) is defined, i.e. (RootNumber1, RootNumber2, C)_v1，C_v2) And (4) combining. Wherein Rootnumber1 represents a sequence number of the physical root sequence 1, Rootnumber2 represents a sequence number of the physical root sequence 2, C_v1Representing the cyclic shift value of the first sequence used to generate the new sequence with respect to the physical root sequence 1, C_v2Indicating the cyclic shift value of the second sequence used to generate the new sequence relative to the physical root sequence 2. Here, the value of RootNumber1 is not equal to RootNumber2, C_v1Value of and C_v2The values of (A) may be the same or different.

Alternatively, the combination (physical root sequence number1, physical root sequence number2, cyclic shift value 1, cyclic shift value 2) may also be replaced by a combination (physical root sequence number1, physical root sequence number2, cyclic shift number1, cyclic shift number2), that is, a combination (RootNumber1, RootNumber2, CS1, CS2), which is not limited in this embodiment of the present application. Wherein RootNumber1 represents a sequence number of the physical root sequence 1, RootNumber2 represents a sequence number of the physical root sequence 2, and CS1 represents a cyclic shift value C of a first sequence for generating a new sequence with respect to the physical root sequence_v1CS2 denotes a cyclic shift value C of the second sequence used for generating the new sequence with respect to the physical root sequence_v2The number of (2).

As an alternative embodiment, the cyclic shift value is equal to the cyclic shift number Ncs, that is, the cyclic shift value 1 is equal to the cyclic shift number1 Ncs, and the cyclic shift value 2 is equal to the cyclic shift number2 Ncs. In this case, CS1 ═ C_v1/Ncs，CS2＝C_v2and/Ncs. It should be understood that there may be other corresponding relationships between the cyclic shift numbers and the cyclic shift values, and this is not limited in this embodiment of the application.

In the embodiment of the present application, since the cyclic shift value and the cyclic shift number may have these relationships, the cyclic shift value may be equivalent to the cyclic shift number without a logical contradiction. For example, the method described with the cyclic shift value as an example may be replaced with the method described with the cyclic shift number as an example. The cyclic shift number may also be referred to as a cyclic shift value number, or other names, which is not limited in this embodiment of the present application.

For convenience of description, the present embodiment is described by taking (physical root sequence number1, physical root sequence number2, cyclic shift number1, cyclic shift number2) combinations, that is, (RootNumber1, RootNumber2, CS1, CS2) combinations as an example.

By way of example, in one possible implementation,

CS1 is v₁CS2 is v₂. I.e. C_v1Exist of

A possible value, C_v2Also exist

A possible value. The terminal equipment can also determine C through a zero correlation value Ncs according to other modes_v1And C_v2And are not intended to be limiting herein.

Once C is determined_v1And C_v2Since CS1 ═ C_v1/Ncs，CS 2＝C_v2/Ncs, i.e., CS1 and CS2 are determined, then each (RootNumber1, RootNumber2, CS1, CS2) can generate a new sequence. The logical root sequence numbers are in one-to-one correspondence with the combinations of (RootNumber1, RootNumber2, CS1, CS2), and the correspondence can be described in a logical root sequence number planning table of the random access new sequence. The logical root sequence number may also be referred to as a logical sequence number or other names, which is not limited in this embodiment.

For example, the ZC sequence length Nzc is 37, and the zero correlation value Nc iss is 2, the number J of cyclic shifts of different roots generating a new sequence is 2, and table two shows the correspondence between the logical root sequence number and the (RootNumber1, RootNumber2, CS1, CS2) combination in this case. Specifically, the number of physical root sequences is 37-1-36, and the number of sequences generated by cyclic shift of a single root is

The number of new sequences generated by cyclic shift combining of two different roots is 18 × 18 — 324, so that all the different physical root sequences generate the total number of new sequences by cyclic shift cross combining is C (36, 2) × 324 — 630 × 324 — 204120.

Watch two

Logical root sequence number	(RootNumber 1,RootNumber 2,CS 1,CS 2)
		0-19999	(1,2,1,1)，(1,2,1,2)，(1,2,1,3)，(1,2,1,4)，(1,2,1,5)…
…	…
		200000-204120	(35,36,1,1),(35,36,1,2),(35,36,1,2)…

For a cell, the network device allocates a logical root sequence number to the cell, and the logical root sequence number corresponds to a combination of (RootNumber1, RootNumber2, CS1, CS 2). After determining the logical root sequence number of a cell, the terminal device may generate a random access preamble sequence required by the cell according to the logical root sequence number. The specific generation method of the random access leader sequence of the cell is as follows:

2) the terminal device may determine a logical ROOT SEQUENCE number (index) of the cell according to the parameter RACH _ ROOT _ SEQUENCE, and obtain a corresponding (RootNumber1, RootNumber2, CS1, CS2) combination according to the logical ROOT SEQUENCE number (for example, by looking up the table two);

3) the terminal equipment generates a random access leader sequence of the cell according to the combination of (RootNumber1, RootNumber2, CS1 and CS 2);

specifically, the combination of (RootNumber1, RootNumber2, CS1, CS2) indicates that the ZC sequence corresponding to the physical root sequence number1 is C-determined according to CS1_v1The value of (2) is circularly shifted to obtain a sequence 1, and the ZC sequence corresponding to the physical root sequence number2 is determined according to C determined by CS2_v2And (4) performing cyclic shift on the value to obtain a sequence 2. The obtained 2 sequences (i.e. sequence 1 and sequence 2) are superimposed to generate a new usable random access preamble sequence. According to a specific value of (RootNumber1, RootNumber2, CS1, CS2), the terminal device may generate a random access preamble sequence.

4) If the number of the new sequences does not meet the requirement of the number of the sequences configured by the cell, the terminal device may increment the logical root sequence number corresponding to the cell, that is, determine a next logical root sequence number consecutive to the logical root sequence number of the cell, and then continue to generate new sequences by using the (RootNumber1, RootNumber2, CS1, CS2) combination corresponding to the next logical root sequence number until the number of the generated new sequences meets the number of the random access preamble sequences configured by the cell.

It should be understood that, in order to reduce the collision probability of multiple terminal devices accessing the cell, the configuration of the number of preamble sequences of the cell should be increased as much as possible, but the configuration of the number of preamble sequences of the cell is not limited in this embodiment.

In the above implementation manner, the logical root sequence numbers correspond to combinations (i.e., (root number1, root number2, cyclic shift number1, cyclic shift number2) of (physical root sequence number1, physical root sequence number2, cyclic shift number1, cyclic shift number2) one to one, and new sequences generated by different roots through cyclic shift cross combination are fully utilized, so that more cell configurations can be supported, but the configuration of the number of the logical root sequence numbers is large, which may cause a large signaling overhead when the network device configures the logical root sequence numbers for the terminal device.

In view of this, the present application provides a new random access method, which can increase the number of random access preamble sequences of a cell, thereby reducing the probability of random access collision and ensuring that the signaling overhead of configuring a logical root sequence number by a network device is small.

Fig. 2 shows a schematic flow chart of a random access method 200 of an embodiment of the present application. The method 200 may be applied to the communication system 100 shown in fig. 1, but the embodiment of the present application is not limited thereto.

S210, a network device sends first information, wherein the first information is used for indicating a target logical root sequence number of a cell, the target logical root sequence number is used for indicating K target physical root sequence numbers and J-1 target cyclic shift difference values, and K and J are integers greater than 1; correspondingly, the terminal device receives the first information.

The cell is the cell where the terminal device is located. The terminal device may receive the first information from the network device in the cell. The first information may also be referred to as first configuration information, first signaling, or other names, which is not limited in this embodiment of the application.

In the embodiment of the present application, the cyclic shift difference may be a difference between cyclic shift values or a difference between cyclic shift numbers. For simplicity of description, the method provided by the embodiment of the present application may be described by taking one of the methods as an example. Illustratively, the cyclic shift value is the cyclic shift number Ncs. The difference between the cyclic shift numbers may also be referred to as a cyclic shift number difference, a cyclic shift difference number, or another name, which is not limited in this embodiment. When it is necessary to distinguish the difference between the cyclic shift values from the difference between the cyclic shift numbers, the difference between the cyclic shift values may be represented by a cyclic shift difference value, and the difference between the cyclic shift numbers may be represented by a cyclic shift difference value number or a cyclic shift number difference value.

S220, the terminal equipment sends a random access leader sequence, wherein the random access leader sequence is determined according to the K target physical root sequence numbers and the J-1 target cyclic shift difference values; the network device correspondingly receives the random access preamble sequence.

Specifically, the network device may send first information to the terminal device, indicating a target logical root sequence number of a cell in which the terminal device is located. And the terminal equipment receives the first information, and determines K target physical root serial numbers and J-1 target cyclic shift difference values corresponding to the target logical root serial number according to the target logical root serial number indicated by the first information. The terminal device may send a random access preamble sequence to the network device according to the K target physical root sequence numbers and the J-1 target cyclic shift difference values, requesting to access the network device.

In this embodiment, the J-1 target cyclic shift difference values may determine K target cyclic shift values, where the K target cyclic shift values are in one-to-one correspondence with the K target physical root sequences indicated by the K target physical root sequence numbers. In other words, the J-1 target cyclic shift difference values are obtained from or described as K target cyclic shift values for determining K target cyclic shift values, and the J-1 target cyclic shift difference values may be the difference between two target cyclic shift values of the K target cyclic shift values. For a specific set of J-1 target cyclic shift differences, two different target cyclic shift values can obtain the same target cyclic shift difference, e.g., a cyclic shift difference of 1 can be obtained from both cyclic shift value combination (1,2) and cyclic shift value combination (3, 4), i.e., 2-1 equals 1 and 4-3 equals 1. I.e., J-1 target cyclic shift differences may correspond to a plurality of different combinations of target cyclic shift values. The number of target cyclic shift value combinations may be greater than J-1. As a random access leader sequence can be generated according to a target cyclic shift value combination, more random access leader sequences can be obtained according to K target physical root sequence numbers and J-1 target cyclic shift difference values, and the random access leader sequences are used for randomly selecting one random access leader sequence for access by the terminal equipment.

The K target physical root sequence numbers may be completely the same, or at least 2 target physical root sequence numbers may be different.

The K target physical root sequence numbers are identical, for example, K is 3, and 3 target physical root sequence numbers may be 1,1, and 1, respectively, or 3 target physical root sequence numbers may be 2,2, and 2, respectively. The J-1 target cyclic shift difference values cannot all be 0, that is, at least 2 target cyclic shift values exist in the K target cyclic shift values determined by the J-1 target cyclic shift difference values.

When there are at least 2 target physical root sequence numbers different from each other among the K target physical root sequence numbers, for example, K is 3, and 3 target physical root sequence numbers may be 1,1, and 2, or 3 target physical root sequence numbers may be 1,2, and 3, respectively. However, the J-1 target cyclic shift differences may or may not be identical or may not be completely different, and this is not limited in this embodiment of the present application. For example, when J-1 is greater than 1, any two target cyclic shift differences of the J-1 target cyclic shift differences may be the same or different. A value of one target cyclic shift difference may be an integer greater than 0, equal to 0, or less than 0. For example, in the embodiment of the present application, the J-1 target cyclic shift difference values may include one or more target cyclic shift difference values with a value of 0, in which case, target cyclic shift values corresponding to at least two target physical root sequences among the K target physical root sequences are equal.

Therefore, in the random access method of the embodiment of the application, the network device sends the first information to the terminal device to indicate the target logical root sequence number, and the terminal device determines the K target physical root sequence numbers and the J-1 target cyclic shift difference values according to the target logical root sequence number, so as to obtain the random access sequence and send the random access sequence to the network device, thereby increasing the number of random access preamble sequences of a cell and reducing the probability of collision of random access. In the embodiment of the application, a specific (physical root sequence number, cyclic shift difference value) combination is configured for one cell, so that one cell can correspond to a greater number of cyclic shift value combinations, and compared with the above logical root sequence number and (physical root sequence number, cyclic shift value) combination, the signaling overhead of configuring the logical root sequence number by the network device is smaller.

Optionally, the first information may be a system parameter of a cell. The system parameter may be transmitted to the terminal device in the form of a broadcast channel, a system message, or a Radio Resource Control (RRC) message.

Optionally, the terminal device may determine the K target physical root sequence numbers and the J-1 target cyclic shift difference values according to the first mapping relationship and the target logical root sequence number. The first mapping is used to represent a one-to-one correspondence between a plurality of logical root sequence numbers and a plurality of (K physical root sequence numbers, J-1 cyclic shift difference) combinations. In the embodiment of the present application, one target logical root sequence number corresponds to one combination of K target physical root sequence numbers and J-1 target cyclic shift difference values. For example, the first mapping relationship may be embodied in a form of a table or a formula, and the like, which is not limited in this embodiment of the application.

It should be further understood that the names of the target logical root sequence number, the K target physical root sequence numbers, and the J-1 target cyclic shift difference values are only for distinguishing from other sequences or difference values, and refer to the names specific to the current terminal device, which may also be referred to as a first logical root sequence number (or a first sequence number, or a first logical sequence number), K first physical root sequence numbers (or K first physical sequence numbers, or K second sequence numbers), J-1 first cyclic shift difference values (or J-1 cyclic shift difference values), or other names, and the embodiments of the present application are not limited thereto.

For the terminal device sending the random access preamble sequence according to the K target physical root sequence numbers and the J-1 target cyclic shift difference values, various implementation manners are possible, and this is not limited in this embodiment of the present application.

In a possible implementation manner, the terminal device may generate M random access preamble sequences according to the K target physical root sequence numbers and the J-1 target cyclic shift difference values. When the terminal device performs random access, it may randomly select one sequence from the M random access preamble sequences and send it to the network device. Alternatively, the terminal device may store the M random access preamble sequences before random access. In the embodiment of the present application, "generating a sequence" may also be described as "determining a sequence", "obtaining a sequence", and the like.

In a possible implementation manner, the terminal device may determine, according to the J-1 target cyclic shift difference values, combinations of M target cyclic shift values, where the combinations of M target cyclic shift values may be used to generate M random access sequences. Each target cyclic shift value combination of the M target cyclic shift value combinations comprises K target cyclic shift values. The K target cyclic shift values comprised by different combinations of target cyclic shift values may be all different or partly different. When the terminal device performs random access, a cyclic shift value combination can be selected from the M target cyclic shift value combinations, the target physical root sequences indicated by the corresponding K target physical root sequence numbers are respectively cyclically shifted according to K cyclic shift values in the cyclic shift value combination to obtain K target sequences, and a random access preamble sequence is generated according to the K target sequences. The terminal device may transmit the random access preamble sequence to a network device. Alternatively, the terminal device may store the M target cyclic shift values in combination before the random access. Optionally, the target cyclic shift value combination may further include the K physical root sequence numbers.

As an optional embodiment, K ═ J, the random access preamble sequence is determined according to the K target physical root sequence numbers and J target cyclic shift values, a jth target cyclic shift difference value of the J-1 target cyclic shift difference values is a difference value between a jth +1 target cyclic shift value and a 1 st target cyclic shift value of the J target cyclic shift values, a value range of J is from 1 to J-1, and J is an integer;

and sending the random access leader sequence, wherein the random access leader sequence is determined according to the K target physical root sequence numbers and the J target cyclic shift values.

In the embodiment of the present application, J-1 target cyclic shift difference values are obtained by J target cyclic shift values, and the number of the target cyclic shift values is equal to the number of the target physical root sequences, so that K equals to J. In the case of K ═ J, for ease of understanding, the K target physical root sequences can be subsequently written as J target physical root sequences.

Specifically, the 1 st target cyclic shift difference value is the difference between the 2 nd target cyclic shift value and the 1 st target cyclic shift value, the 2 nd target cyclic shift difference value is the difference between the 3 rd target cyclic shift value and the 1 st target cyclic shift value, and so on, and the J-1 st target cyclic shift difference value is the difference between the jth target cyclic shift value and the 1 st target cyclic shift value. The terminal device may determine J target cyclic shift values according to the J-1 target cyclic shift difference values, and it should be understood that there may be many possible combinations of the J target cyclic shift values. As described above, assuming that the value of J-1 is 1, for example, the target cyclic shift difference value is 1, the 2 target cyclic shift values corresponding to the target cyclic shift difference value may be (1,2), (2, 3), (3, 4), and other possible combinations; assuming that the value of J-1 is 2, for example, the target cyclic shift difference value is (1,2), the 3 target cyclic shift values corresponding to the target cyclic shift difference value may be (1,2, 3), (2, 3, 4), and other possible combinations.

Or, in this embodiment of the application, the J-1 target cyclic shift difference is obtained from J target cyclic shift numbers, specifically, the 1 st target cyclic shift difference is a difference between the 2 nd target cyclic shift number and the 1 st target cyclic shift number, the 2 nd target cyclic shift difference is a difference between the 3 rd target cyclic shift number and the 1 st target cyclic shift number, and so on, and the J-1 st target cyclic shift difference is a difference between the J th target cyclic shift number and the 1 st target cyclic shift number. The terminal device may determine J target cyclic shift values or J target cyclic shift numbers according to the J-1 target cyclic shift difference values, and it should be understood that there may be many possible combinations of the J target cyclic shift values or the J target cyclic shift numbers. Here, the cyclic shift value is a cyclic shift number Ncs.

After determining J target cyclic shift values according to the J-1 target cyclic shift difference values, the terminal device may obtain a random access preamble sequence according to the J target cyclic shift values and send the random access preamble sequence to the network device. It should be understood that, since there may exist a plurality of combinations of J target cyclic shift values determined according to the J-1 target cyclic shift difference values, the terminal device may select one combination from the plurality of combinations to generate one random access preamble sequence, and transmit the generated random access preamble to the network device; or, the terminal device may also generate a plurality of random access preamble sequences according to all combinations of the J target cyclic shift values, select one random access preamble sequence from the plurality of random access preamble sequences, and send the selected random access preamble to the network device.

In another possible implementation manner, the J-1 target cyclic shift difference values are obtained from J target cyclic shift values, a jth target cyclic shift difference value of the J-1 target cyclic shift difference values is a difference value between a jth +1 target cyclic shift value and a jth target cyclic shift value of the J target cyclic shift values, a value range of J is from 1 to J-1, and J is an integer.

Specifically, the 1 st target cyclic shift difference value is the difference between the 2 nd target cyclic shift value and the 1 st target cyclic shift value, the 2 nd target cyclic shift difference value is the difference between the 3 rd target cyclic shift value and the 2 nd target cyclic shift value, and so on, and the J-1 st target cyclic shift difference value is the difference between the J-th target cyclic shift value and the J-1 st target cyclic shift value. The terminal device may determine J target cyclic shift values according to the J-1 target cyclic shift difference values, and it should be understood that there may be many possible combinations of the J target cyclic shift values. Assuming that the value of J-1 is 2, for example, the target cyclic shift difference value is (1, 1), the 3 target cyclic shift values corresponding to the target cyclic shift difference value may be (1,2, 3), (2, 3, 4), and other possible combinations.

Or, in another possible implementation manner, the J-1 target cyclic shift difference is obtained from J target cyclic shift numbers, a jth target cyclic shift difference of the J-1 target cyclic shift differences is a difference between a jth +1 target cyclic shift number and a jth target cyclic shift number of the J target cyclic shift numbers, a value range of J is from 1 to J-1, and J is an integer. The terminal device may determine J target cyclic shift values or J target cyclic shift numbers according to the J-1 target cyclic shift difference values, and it should be understood that there may be many possible combinations of the J target cyclic shift values or the J target cyclic shift numbers. Here, the cyclic shift value is a cyclic shift number Ncs.

In another possible implementation, the J-1 target cyclic shift difference values are derived from other numbers of target cyclic shift values or target cyclic shift numbers. Optionally, in this embodiment, K is not equal to J.

Optionally, K is 2 (J-1), the number of target cyclic shift values is 2 (J-1), that is, J-1 target cyclic shift differences are obtained from 2 (J-1) target cyclic shift values, a jth target cyclic shift difference of the J-1 target cyclic shift differences is a difference between a 2 jth target cyclic shift value and a 2J-1 target cyclic shift value of the 2 (J-1) target cyclic shift values, J ranges from 1 to J-1, and J is an integer.

Specifically, 2 × target cyclic shift values (J-1) may be determined according to the J-1 target cyclic shift differences, and according to one possible combination of the 2 × target cyclic shift values (J-1), K (K ═ 2 × (J-1)) target physical root sequences corresponding to the J-1 target cyclic shift differences are cyclically shifted, respectively, so as to obtain 2 (J-1) target sequences. And superposing the 2x (J-1) target sequences to obtain a random access leader sequence adopted by the terminal equipment to access the cell. According to the possible combinations of the 2 × J-1 target cyclic shift values, a plurality of random access preamble sequences available to the terminal device may be generated, and the terminal device may randomly select one of the plurality of random access preamble sequences to access the cell. Specifically, the correspondence between the cyclic shift value and the cyclic shift difference value may be: the 1 st target cyclic shift difference value is the difference between a target cyclic shift value 2 and a target cyclic shift value 1; the 2 nd target cyclic shift difference value is the difference between the target cyclic shift value 4 and the target cyclic shift value 3, and so on, the J-1 th target cyclic shift difference value is the difference between the 2x (J-1) th target cyclic shift value and the 2x J-3 th target cyclic shift value. Assuming that the value of J-1 is 2, for example, the target cyclic shift difference value is (1,2), the number of target cyclic shift values corresponding to the target cyclic shift difference value may be 4, and the 4 target cyclic shift values may be (0,1, 2, 4), (0,1, 3, 5), and so on, in various possible combinations.

Optionally, the number of the target cyclic shift numbers is 2 × J-1, that is, J-1 target cyclic shift differences are obtained from 2 × J-1 target cyclic shift numbers, a jth target cyclic shift difference of the J-1 target cyclic shift differences is a difference between a 2 × J target cyclic shift number of the 2 × J (J-1) target cyclic shift numbers and a 2 × J-1 target cyclic shift number, a value of J ranges from 1 to J-1, and J is an integer. Here, the cyclic shift value is a cyclic shift number Ncs.

The above embodiments only show a few possible correspondences between J-1 target cyclic shift difference values and a plurality of target cyclic shift values or a plurality of target cyclic shift numbers. The J-1 target cyclic shift difference values may also be determined in other manners, that is, the J-1 target cyclic shift difference values may also have other corresponding relationships with the target cyclic shift value or the target cyclic shift number, which is not limited in this application. The terminal device can acquire the corresponding relationship by a protocol convention or a network device configuration mode.

For convenience of understanding, in the following embodiments, K is taken as an example for description, J target physical root sequence numbers (or J target physical root sequences) are used for description, and similar cases (for example, K is 2 (J-1)) where K is another value are similar and are not repeated.

As an optional embodiment, the random access preamble sequence sent by the terminal device is obtained by superimposing J target sequences, where the J target sequences respectively correspond to the J target cyclic shift values, or the J target sequences respectively correspond to the J target cyclic shift values corresponding to the J target cyclic shift numbers. Wherein one target sequence corresponds to one target cyclic shift value.

Specifically, J target cyclic shift values may be determined according to the J-1 target cyclic shift difference values, and J target physical root sequences may be obtained by performing cyclic shift on the J target physical root sequences respectively according to one possible combination of the J target cyclic shift values. For example, taking a target physical root sequence J of the J target physical root sequences as an example, the target sequence J of the J target sequences may be calculated according to a target cyclic shift value J of the J target cyclic shift values and the target physical root sequence J by the following formula:

x_uj,vj(n)＝x_uj((n+C_vj)modNzc)

wherein:

x_ujis a target physical root sequence j, u_jThe target physical root sequence number j is determined according to the logical root sequence number, and Nzc is the target physical root sequence x_ujLength of (C)_vjThe target cyclic shift value J is determined according to a zero correlation value Ncs, wherein J is taken from 1 to J, and J is an integer. Formula (II)

I in (a) is an imaginary unit whose square is equal to-1. C_vjSpecifically, the calculation can be obtained by the following formula:

through the above formula, J target sequences can be obtained. And respectively carrying out cyclic shift on the J target physical root sequences according to J target cyclic shift values to obtain J target sequences, and superposing the J target sequences to obtain a random access leader sequence used when the terminal equipment is accessed to the cell. According to a plurality of possible combinations of the J target cyclic shift values, a plurality of random access preamble sequences available to the terminal device in the cell can be generated, and the terminal device can randomly select one sequence from the plurality of random access preamble sequences to access the cell.

It should be understood that the above-mentioned superposition of J target sequences is only one possible implementation manner for generating the random access preamble sequence, and the random access preamble sequence may also be determined in a dot-product manner or other manners, which is not limited in this embodiment of the present application.

As an optional embodiment, the method further comprises:

the terminal equipment determines the value ranges of the J target cyclic shift values according to the length Nzc of the J target physical root sequences and a target zero correlation value Ncs;

the terminal device determines M cyclic shift value combinations according to the value range, the value of J and the J-1 target cyclic shift difference values, wherein the M cyclic shift value combinations respectively comprise J target cyclic shift values, and the J target cyclic shift values in one cyclic shift value combination can be completely the same or not;

and the terminal equipment obtains M random access leader sequences according to the J target physical root sequences and the M cyclic shift value combinations, wherein the M random access leader sequences are respectively obtained by superposing J sequences generated by cyclic shifting the J target physical root sequences respectively according to J cyclic shift values in the M cyclic shift value combinations. And performing cyclic shift on the J target physical root sequences respectively according to the J cyclic shift values to obtain J sequences, and superposing the J sequences to obtain a random access leader sequence.

Specifically, the terminal device may determine a value range of the target cyclic shift value according to the length Nzc of the target physical root sequence and the target zero correlation value Ncs, where the value range is

Indicating that a rounding down is performed on x. The terminal device can determine M cyclic shift value combinations according to the value range, the value of J and the J-1 target cyclic shift difference values. For example, Nzc 139, Ncs 2, J target cyclic shift values range from [0 to (69-1)]2, and the target cyclic shift value is not an integer multiple of 2 when the target cyclic shift value is not 0. Assuming that J is 2 and the target cyclic shift difference is 1 × 2, the M combinations of cyclic shift values include 68 combinations of (0,1) × 2, (1,2) × 2, …, (67,68) × 2. The terminal device may select a first combination of cyclic shift values from the M combinations of cyclic shift values. For a first cyclic shift value combination of the M cyclic shift value combinations, the terminal device performs cyclic shift on J corresponding target physical root sequences respectively according to J cyclic shift values included in the first cyclic shift value combination (the J cyclic shift values correspond to the J target physical root sequences one to one, and one cyclic shift value is used for performing cyclic shift on one corresponding target physical root sequence), so as to generate J sequences, and then superimposes the J sequences, so as to generate a random access preamble sequence corresponding to the first cyclic shift value combination. Thus, M random access preamble sequences can be generated according to the M cyclic shift value combinations, and the terminal device can select one random access preamble sequence from the M random access preamble sequences to perform random access.

As an optional embodiment, the random access preamble sequence sent by the terminal device to the network device is one of M random access preamble sequences determined according to the J target physical root sequences and the J-1 target cyclic shift difference values,

(

target cyclic shift difference 2/Ncs), …, (Ncs)

Specifically, the value of M is the maximum value of the number of combinations of cyclic shift values that can be obtained according to the J-1 target cyclic shift differences.

As an optional embodiment, in various random access methods related to embodiments of the present application, a cubic metric CM value of a random access preamble sequence is smaller than a preset CM threshold. The unit of the CM threshold may be dB, and the value range of the CM threshold may be a real number greater than 0. Illustratively, the CM threshold is less than or equal to 2.5dB, or the CM threshold is less than or equal to 3dB, dB representing a unit of power.

It should be understood that Cubic Metric (CM) is used to characterize the power amplifier power efficiency. If all newly generated sequences are selected as random access preamble sequences, the overall CM characteristics of the uplink access sequences are obviously deteriorated, i.e., the CM is too high, which may reduce the efficiency of the power amplifier. Therefore, the network device can screen the random access leader sequence according to the CM threshold value, and ensure that the CM value of the random access leader sequence adopted by the terminal device is smaller than the CM threshold value.

As an optional embodiment, in various random access methods related to embodiments of the present application, a peak-to-average power ratio, PAPR, of the random access preamble sequence is smaller than a preset PAPR threshold. The unit of the PAPR threshold may be dB, and the range of the PAPR threshold may be a real number greater than 0. Illustratively, the PAPR threshold is less than or equal to 7dB, dB representing a unit of power.

It should be understood that peak to average power ratio (PAPR) is simply referred to as peak-to-average ratio, which may be the ratio of the instantaneous peak power of a continuous signal to the average power of that signal. If all newly generated sequences are selected as random access preamble sequences, the overall PAPR characteristic of the uplink access sequence is significantly deteriorated, i.e., the PAPR is too high, and when uplink data transmission is performed, the efficiency of the power amplifier is reduced due to too high PAPR. Therefore, the network device can screen the random access leader sequence according to the PAPR threshold value, and ensure that the PAPR value of the random access leader sequence adopted by the terminal device is smaller than the PAPR threshold value.

As an alternative embodiment, the J-1 target cyclic shift differences are cyclic shift differences when the target zero correlation value Ncs is 2.

As an alternative embodiment, any one of the J-1 target cyclic shift differences is

And a cyclic shift difference of the J-1 target cyclic shift differences is less than or equal to a maximum value of cyclic shift differences when Ncs-2, where X is a positive integer,

indicating that rounding up is performed on x. Illustratively, any one of the J-1 target cyclic shift differences described above is less than or equal to the maximum value of the cyclic shift difference when Ncs is 2.

Illustratively, the target zero correlation value Ncs is 2 × X, and since the range of the cyclic shift value is related to Ncs, the cyclic shift difference value corresponding to Ncs of 2 has the above-mentioned correlation with the cyclic shift difference value corresponding to Ncs of 2 × X.

As an optional embodiment, the method further comprises:

the network equipment sends second information, wherein the second information is used for indicating a target zero correlation value of the cell from a candidate zero correlation value set, and the zero correlation value in the candidate zero correlation value set is an integral multiple of 2; correspondingly, the terminal device receives the second information. The second information may also be referred to as second configuration information, second signaling, or other names, and the embodiments of the present application are not limited.

Specifically, the network device may send second information to the terminal device, where the second information is used to configure a target zero correlation value, where the target zero correlation value is selected from a candidate zero correlation value set, and a zero correlation value included in the candidate zero correlation value set is an integer multiple of 2. In this way, the correspondence relationship between the logical root sequence number and the combination of (K physical root sequences, J-1 cyclic shift difference values) can be configured only for the cyclic shift difference value corresponding to Ncs ═ 2. For cyclic shift difference corresponding to Ncs 2 × X, the cyclic shift difference can be expressed by formula

And determining so as to save the signaling overhead of configuring the logical root sequence number by the network equipment.

The embodiment of the application also provides another random access method, which comprises the following steps:

the network equipment sends the first information, and correspondingly, the terminal equipment receives the first information; the first information is used for indicating a target logic root serial number of a cell, and the target logic root serial number is used for indicating K target physical root serial numbers;

the terminal equipment sends the random access leader sequence, and correspondingly, the network equipment receives the random access leader sequence; the random access preamble sequence is determined according to the K target physical root sequence numbers and the J-1 target cyclic shift difference values, wherein K and J are integers larger than 1.

Specifically, one target logical root sequence number corresponds to K target physical root sequence numbers, that is, a logical root sequence number (or referred to as a logical root sequence index) and K corresponding physical root sequence numbers (RootNumber) are defined. In the embodiment of the present application, J-1 target cyclic shift differences may be configured for different cells, and the J-1 target cyclic shift differences of different cells may be completely the same or not completely the same (i.e., partially the same or completely different), and are not limited herein. That is, for a cell, the J-1 target cyclic shift difference value of the cell may be a fixed value, a value determined by some predefined rule (e.g., a positive integer pre-configured by the cell ID mod), or a value configured by the network device for the terminal device through the third information. Where mod represents the modulo operation. The third information may also be referred to as third signaling.

It should be understood that the above-mentioned J-1 target cyclic shift difference values are obtained from K target cyclic shift values, or the J-1 target cyclic shift difference values are obtained from K target cyclic shift numbers, which is not limited in this embodiment of the present application. Optionally, K ═ J.

The determination of the J-1 target cyclic shift difference values through some predefined rule may be determined according to a cell Identifier (ID), for example. Taking Nzc 139 and Ncs 2 as an example, the value range of J target cyclic shift values is [0 to (69-1) ] 2, and the value range of corresponding J target cyclic shift values is 0 to (69-1), then the value range of J-1 target cyclic shift differences is [ -68,68], and the value range of J-1 target cyclic shift differences is an integer.

In one possible implementation, a cell may be preconfigured with a total of 137 cyclic shift differences. In another possible implementation manner, for a specific cell, the initial value of the cyclic shift difference of the cell may be preconfigured according to the cell ID of the cell, and at the same time, the number of cyclic shift differences (i.e., J-1) of the cell is configured. Thus, the J-1 cyclic shift difference values for the cell may be determined by sequentially incrementing by 1 the initial value of the cyclic shift difference value for the cell, which may be equal to N mod 137 for a cell with a cell ID of N, N being a positive integer.

It should be understood that the above method for determining J-1 target cyclic shift difference values according to cell IDs is only one possible implementation manner, and the random access method of the embodiment of the present application may also use other rules to determine J-1 target cyclic shift difference values.

It should also be understood that, after determining J-1 target cyclic shift differences of a cell according to the above method, reference may be made to the description in the above method 200 for a method for determining a random access preamble sequence according to K target physical root sequence numbers and the J-1 target cyclic shift differences, and reference may also be made to the foregoing embodiment for a description of the J-1 target cyclic shift differences, which is not described herein again.

The method for generating a random access preamble sequence according to the embodiment of the present application is described in detail below with reference to specific embodiments.

For a new sequence generated by cyclic shift cross combination of different roots, a logical root sequence number (i.e. a logical root sequence index) and a corresponding cyclic shift value combination thereof are defined, namely a (RootNumber1, RootNumber2, Delta _ C) combination thereof is defined, and the (RootNumber1, RootNumber2, Delta _ C) combination is used for generating the new sequence. Wherein, RootNumber1 is a sequence number of a physical root sequence 1 for generating a new sequence, RootNumber2 is a sequence number of a physical root sequence 2 for generating a new sequence, and Delta _ C represents a difference value of cyclic shift values of sequences for generating the new sequence by superposition.

When the method is applied to the random access process of a cell:

2) the terminal equipment determines a logical ROOT SEQUENCE number (index) of the cell according to the parameter RACH _ ROOT _ SEQUENCE, and obtains a corresponding (RootNumber1, RootNumber2, Delta _ C) combination according to the logical ROOT SEQUENCE number;

3) generating a new sequence set of the cell according to the combination of (RootNumber1, RootNumber2, Delta _ C);

4) if the number of sequences generated by one (RootNumber1, RootNumber2, Delta _ C) combination does not satisfy the number of random access preamble sequences configured by the cell, the terminal device may determine a next logical root sequence number consecutive to the logical root sequence number of the cell, and continue to generate a new random access preamble sequence using the (RootNumber1, RootNumber2, Delta _ C) combination corresponding to the next logical root sequence number until the number of generated new sequences satisfies the number of random access preamble sequences configured by the cell.

Optionally, in the method provided in this embodiment of the present application, in the logical root sequence number planning table, for one (RootNumber1, RootNumber2, Delta _ C) combination, RootNumber1 and RootNumber2 may be different or may be the same. The logical root sequence number planning table at least comprises one (RootNumber1, RootNumber2, Delta _ C) combination, and the RootNumber1 and the RootNumber2 in the (RootNumber1, RootNumber2, Delta _ C) combination are different.

Further, the terminal device may randomly select a new sequence from the determined available new sequence set of the cell as the random access preamble sequence. The terminal device may send the selected random access preamble sequence to a network device to which the cell belongs to request access to the cell. The available new sequence set of the cell may also be referred to as a set of candidate new sequences, a set of candidate access preamble sequences, or other names, which is not limited in this embodiment of the present application.

It should be understood that the above description has been made only with two different physical root sequences and one Delta _ C as an example. Optionally, the Delta _ C may further include multiple values, which are not limited in this embodiment of the application. However, the number of physical root sequences in the combination may be equal to the number of cyclic shift values corresponding to Delta _ C, and in this embodiment, the number of cyclic shift values is equal to the number of cyclic shift difference Delta _ C plus 1, so the number of physical root sequence numbers in the combination may be the number of Delta _ C plus 1. For example, Delta _ C may include J-1 values, i.e., Delta _ C ═ Delta _ C1, Delta _ C2, …, Delta _ C (J-1)), where J is greater than or equal to 2, representing the number of cyclic shift values that generate different roots of the new sequence. Then correspondingly, the Delta _ C forms a combination with J different physical root sequence numbers, the J physical root sequence numbers corresponding to the physical root sequence numbersThe root sequences are physical root sequence 1, physical root sequences 2 and …, and physical root sequence J. Here J values of the cyclic shift are denoted as C_v1、C_v2、…、C_vJThe J values can satisfy C_v1≤C_v2≤…≤C_vJOr satisfy other relationships, C_v1Representing the cyclic shift value of the first sequence used to generate the new sequence with respect to the physical root sequence 1, C_v2Representing the cyclic shift value of the second sequence used to generate the new sequence relative to the physical root sequence 2, and so on, C_vJRepresents a cyclic shift value of the jth sequence used to generate the new sequence relative to the physical root sequence J. I.e. C_vjRepresents the cyclic shift value of the jth sequence used to generate the new sequence relative to the physical root sequence J, where J takes 1 through J, J being an integer. The cyclic shift values may be all equal, may be partially equal, and may also be all unequal, which is not limited in the embodiment of the present application.

Alternatively, the (RootNumber1, RootNumber2, Delta _ C) combination may be replaced by a (RootNumber1, RootNumber2, Delta _ CS) combination. Delta _ CS represents a difference value of cyclic shift numbers of sequences for superimposing and generating a new sequence, and this embodiment may be referred to as a cyclic shift difference value, a cyclic shift number difference value, or a cyclic shift difference value number. Illustratively, Delta _ CS may include J-1 values, i.e., Delta _ CS ═ Delta _ CS1, Delta _ CS2, …, Delta _ CS (J-1)). Then, the above-mentioned (physical root sequence number1, physical root sequence number2, …, physical root sequence number J, cyclic shift difference 1, cyclic shift difference 2, …, cyclic shift difference (J-1)) combination, that is, (RootNumber1, RootNumber2, …, RootNumber J, Delta _ C1, Delta _ C2, …, Delta _ C (J-1)) combination may also be replaced by (physical root sequence number1, physical root sequence number2, …, physical root sequence number J, cyclic shift difference number1, cyclic shift difference number2 …, cyclic shift difference number (J-1)) combination, that is, (RootNumber1, RootNumber2, …, RootNumber J, Delta _ CS1, Delta _ CS2, …, Delta _ CS (J-1)) combination, which is not limited in the present embodiment. Where Delta _ CS multiplied by Ncs equals Delta _ C.

J of the above cyclic shiftThe numbers of values are expressed as CS1, CS2, … and CS J, the J cyclic shift value numbers can satisfy CS1 ≤ CS2 ≤ … ≤ CSJ or satisfy other relations, CS1 represents the cyclic shift value C of the first sequence for generating new sequence relative to the physical root sequence 1_v1CS2 denotes a cyclic shift value C of the second sequence for generating the new sequence with respect to the physical root sequence 2_v2CS J represents the cyclic shift value C of the jth sequence used to generate the new sequence relative to the physical root sequence J, and so on_vJThe number of (2).

As an alternative embodiment, the cyclic shift difference is a cyclic shift difference number Ncs, that is, the cyclic shift difference 1 is a cyclic shift difference number1 Ncs, the cyclic shift difference 2 is a cyclic shift difference number2 Ncs, …, and the cyclic shift difference (J-1) is a cyclic shift difference number (J-1) Ncs. In this case, CS1 ═ C_v1/Ncs，CS 2＝C_v2/Ncs，…，CS J＝C_vJand/Ncs. It should be understood that there may be other corresponding relations between the cyclic shift difference numbers and the cyclic shift values, and this is not limited in this embodiment of the application.

For simplicity of description, the present embodiment takes as an example a combination of (RootNumber1, RootNumber2, …, RootNumber J, Delta _ CS1, Delta _ CS2, …, Delta _ CS (J-1)), that is, (physical root sequence number1, physical root sequence number2, …, physical root sequence number J, cyclic shift difference number1, cyclic shift difference number2 …, cyclic shift difference number (J-1)).

By way of example, in one possible implementation,

wherein J is taken from 1 to J, and J is an integer. I.e. C_v1，C_v2，…，C_vJAre respectively present

A possible value. The terminal equipment can also determine C through a zero correlation value Ncs according to other modes_v1，C_v2，…，C_vJAre not limiting herein。

When a new sequence set is generated according to (RootNumber1, RootNumber2, …, RootNumber J, Delta _ CS1, Delta _ CS2, … and Delta _ CS (J-1)) combination, Delta _ CS represents cyclic shift values C of J sequences generating the new sequence_v1，C_v2，…，C_vJThe number of differences between. Due to cyclic shift value C_v1，C_v2，…，C_vJCan have the same or different values, respectively, the Delta _ CS can correspond to a plurality of identical or different cyclic shift value numbers. For example, in the cyclic shift value number combination of different roots generating a new sequence, Delta _ CS1 represents the difference between cyclic shift value number 2(CS 2) and cyclic shift value number 1(CS 1), Delta _ CS2 represents the difference between cyclic shift value number 3(CS 3) and cyclic shift value number 1(CS 1), …, and Delta _ CS (J-1) represents the difference between cyclic shift value number J (CS J) and cyclic shift value number 1(CS 1). Since J cyclic shift value numbers may or may not be identical, the cyclic shift difference number may or may not include 0.

From the above equations, for a given Ncs, a single root may correspond to a cyclic shift value of [ 0-, (b:)

CS1, CS2, …, CS J may represent from 0E

The J independent cyclic shift value numbers are selected from the three groups and are arranged according to an ascending order, namely CS1 is not less than CS2 is not less than … is not less than CSJ. For example, according to the relation Delta _ CS (J-1) ═ CSj-CS1 and J cyclic shift value numbers, the values of Delta _ CS1, Delta _ CS2, … and Delta _ CS (J-1) can be obtained, so as to obtain the above-mentioned (RootNumber1, RootNumber2, …, RootNumber J, Delta _ CS1, Delta _ CS2, … and Delta _ CS (J-1)) combination, J is an integer, and J has a value ranging from 2 to J.

According to the correspondence between the logical root sequence number and the combination of (RootNumber1, RootNumber2, …, RootNumber J, Delta _ CS1, Del ta _ CS2, …, Delta _ CS (J-1)), the terminal device can determine the logical root sequence number of the cell according to the parameters of the cell to be accessed, and further select the combination of (RootNumber1, RootNumber2, …, RootNumber J, Delta _ CS1, Delta _ CS2, …, Delta _ CS (J-1)) corresponding to the logical root sequence number of the cell. Specifically, the terminal device can determine all cases of J cyclic shift value numbers for generating different roots of the new sequence from (RootNumber1, RootNumber2, …, RootNumber J, Delta _ CS1, Delta _ CS2, …, Delta _ CS (J-1)).

Optionally, in the embodiment of the present application, each (RootNumber1, RootNumber2, …, RootNumber J, Delta _ CS1, Delta _ CS2, …, Delta _ CS (J-1)) combination may generate M new sequences, where M is MAX ((J-1))

-Delta_CS1/Ncs)，(

-Delta_CS2/Ncs)，…，(

-Delta _ CS (J-1)/Ncs)), wherein,

indicating that a rounding down is performed on x.

Taking the number J of the cyclic shift value cross combinations for generating different roots of the new sequence as 2 as an example, the number of the cyclic shift values is also 2, and the number of the cyclic shift differences is 1, that is, Delta _ CS is Delta _ CS 1. The logical root sequence numbers in the cells and the (RootNumber1, RootNumber2, Delta _ CS) combinations are in one-to-one correspondence, where Delta _ CS ═ CS 2-CS 1, CS1 denotes a cyclic shift value number1 of a first sequence for generating a new sequence with respect to a physical root sequence 1, and CS2 denotes a cyclic shift value number2 of a second sequence for generating a new sequence with respect to a physical root sequence 2. At this time, the value of Delta _ CS may be an integer greater than 0, equal to 0, or less than 0, and the embodiment of the present application is not limited. Optionally, Delta _ CS ═ CS 2-CS 1|, at which time,the value of Delta _ CS is an integer greater than or equal to 0. Taking sequence length Nzc 139 and Ncs 2 as examples, the cyclic shift values that a single root can obtain are [ 0- (69-1)]And 2, the corresponding cyclic shift values are numbered from 0 to (69-1). Assuming that (RootNumber1, RootNumber2, Delta _ CS) ═ 1,2, 1, the terminal device may determine that the sequence number of the physical root sequence 1 used to generate the new sequence is 1, the sequence number of the physical root sequence 2 is 2, and may determine that the combination of two sequence-relative-to-physical-root-sequence cyclic shift-value numbers used to generate the new sequence (CS 1, CS2) includes 68 cases of (0,1), (1,2), …, (67,68), and the new sequence may be obtained by adding 2 sequences generated respectively from the 2 cyclic shift-value numbers in each combination for the physical root sequence 1 and the physical root sequence 2. Shifting the physical root sequence 1 according to the 1 st cyclic shift value number to obtain a 1 st sequence; and shifting the physical root sequence 2 according to the 2 nd cyclic shift value number to obtain a 2 nd sequence. In other words, Delta _ CS is 1,

this (RootNumber1, RootNumber2, Delta _ CS) combination can generate 68 new sequences.

In one possible implementation, Delta _ CS is CS 2-CS 1, and the correspondence between the above-mentioned logical root sequence number and the (RootNumber1, RootNumber2, Delta _ CS) combination can be represented by a logical root sequence number planning table (e.g., table three) of the new sequence.

A logic root sequence number planning table taking the ZC sequence length Nzc 139, the zero correlation value Ncs 2, and the number J2 of cyclic shift values of different roots used for generating a new sequence as an example is shown in table three below:

watch III

Logical root sequence number	(RootNumber 1,RootNumber 2,Delta_CS)
		0-99999	(1,2,-68),(1,2，-67),(1,2，-66),(1,2，-65),…
…	…
		1200000-1295061	(137,138,-68),(137,138,-67),(137,138,-66),…

The logical sequence root number planning base table may have the following rules:

(1) the logical root serial numbers correspond to the combinations of (RootNumber1, RootNumber2, Delta _ CS) one by one;

(2) the (RootNumber1, RootNumber2, Delta _ CS) combinations are sequentially ordered according to the physical root sequence numbers and the Delta _ CS sequence numbers corresponding to the physical root sequences. Wherein the order may be ascending or descending.

Alternatively, the order may be sorted by physical root sequence number first and then by Delta _ CS: sorting the physical root sequence numbers in an ascending order or a descending order; the Delta _ CS is sorted in ascending or descending order for each of the physical root sequence numbers. Alternatively, the order may be sorted by Delta _ CS first and then by physical root sequence number: sorting the Delta _ CS according to ascending or descending order; the physical root sequence numbers are sorted in ascending or descending order for each Delta _ CS.

Further, optionally, the number of new sequences generated by each (RootNumber1, RootNumber2, Delta _ CS) combination in the table three may be obtained according to a corresponding relationship table (for example, table four) of Delta _ CS and new sequence number.

And the fourth table shows the number M of the new sequences generated by each (RootNumber1, RootNumber2, Delta _ CS) combination, and the values of the number M of the new sequences and the Delta _ CS correspond to each other.

Watch four

Delta_CS	M
		-68*2	1
-67*2	2
		…	…
0	69
		…	…
67*2	2
		68*2	1

It should be understood that after determining the (RootNumber1, RootNumber2, Delta _ CS) combination corresponding to the logical root sequence number of the cell to be accessed, the terminal device may determine the number M of new sequences that can be generated by the (RootNumber1, RootNumber2, Delta _ CS) combination according to table four. Optionally, the terminal device may also be based on M ═ MAX (MAX)

-target cyclic shift difference 1/Ncs), (c) and (d)

Target cyclic shift difference 2/Ncs), …, (Ncs)

-target cyclic shift difference (J-1)/Ncs)), calculating the value of M. Wherein the ellipses represent from 1 to J in order.

In the embodiment, the target cyclic shift difference 1/Ncs is Delta _ CS1, the target cyclic shift difference 2/Ncs is Delta _ CS2, …, and the target cyclic shift difference (J-1)/Ncs is Delta _ CS (J-1). Therefore, M is MAX (, (

Target cyclic shift difference number 1), (b), (c), (d), (

Target cyclic shift difference number2), …, (d)

-target cyclic shift difference number (J-1))). Where the ellipses represent sequential runs from 1 to J, where "/" represents division.

The terminal equipment can judge whether M meets the random access leader sequence number configured by the cell to be accessed, if not, the next logical root serial number continuous with the logical root serial number of the cell is continuously adopted to generate a new sequence. If the number of sequences to be mapped in the cell is 64, in the above example, (RootNumber1, RootNumber2, Delta _ CS) ═ 1,2, 1, 68 new sequences can be generated, and the number of mapping can be satisfied.

It should be understood that the new sequence logic root sequence number plan table obtained in table three is only applicable to a specific scenario where the cyclic shift value Ncs is 2, and the new sequence logic root sequence number plan table when Ncs is 2 is referred to as a logic root sequence number plan base table in this application.

In the embodiment of the application, the logical root serial numbers correspond to the (RootNumber1, RootNumber2, Delta _ CS) combinations one by one, and the number of the (RootNumber1, RootNumber2, Delta _ CS) combinations is far less than the total number of the new sequences, so that the signaling overhead of the logical root serial number configuration is reduced.

In summary, assuming that Nzc is 139 and Ncs is 2, in an embodiment where logical root sequence numbers and physical root sequence numbers are in one-to-one correspondence (i.e., table one), if the number of physical root sequences is Nroot-Nzc-1, 139-1, and 138, the number of corresponding logical root sequence numbers is 138. Assuming Nzc 139, Ncs 2, and the cyclic shift number J2 of a single root for generating a new sequence, for an embodiment where logical root sequence numbers are combined with (RootNumber1, RootNumber2, CS1, CS2) in one-to-one correspondence (i.e., table two), the number of cyclic shifts that can be obtained for a single root is 139/2 69, and the number of cyclic shift cross combinations that can be obtained for two different roots is 69 4761, then the total number of combinations of (RootNumber1, RootNumber2, CS1, CS2) is the number of cyclic shift cross combinations that can be obtained by multiplying the number of physical root sequences by the number of cyclic shift cross combinations that can be obtained for two different roots, that is, C (138,2) > 4761 is 9453 4761 is 45005733, and the number of corresponding logical root sequence numbers is 45005733. For the embodiment where the logical root sequence numbers correspond to the (RootNumber1, RootNumber2, Delta _ CS) combinations one by one (i.e., table three), the number of cyclic shifts that can be achieved for a single root is 139/2 ═ 69, the range of the Delta _ CS that can be achieved for the cyclic shift cross-combinations of two different roots is [ -68,68], that is, the number of Delta _ CS that can be achieved is 68 × 2+1 ═ 137, and then the total number of the (RootNumber1, RootNumber2, Delta _ CS) combinations is the number of the physical root sequence number combinations C (138,2) × 137 ═ 9453 ═ 137 ═ 1295061. Therefore, the present embodiment can prevent the number of the logical root sequence numbers from being too large, and compared with the implementation mode in which the logical root sequence numbers are combined with (RootNumber1, RootNumber2, CS1, CS2) in a one-to-one correspondence manner, signaling overhead during configuration of the logical root sequence numbers is reduced.

The above logical root sequence number mapping table (i.e., table three) is only applicable to the case where Ncs is 2, and if the logical root sequence number mapping table is configured separately for different Ncs, the signaling overhead of the logical root sequence number mapping table configuration is large. In order to reduce signaling overhead, it may be considered to optimize the cyclic shift Ncs value configuration table, and the purpose of the optimization is to make other Ncs values and Ncs be in integer multiple relation of 2. Table five shows a possible Ncs value configuration table.

Watch five

Zero correlation value identification	Ncs
		1	2
2	4
		3	6
4	8
		5	10
6	12
		7	15

As can be seen from table five, when the zero correlation value is identified as 7, the corresponding Ncs is equal to 15 and is not an integer multiple of 2, so that table five can be changed to a form of table six, that is, the Ncs corresponding to the zero correlation value is identified as 7 is changed to 16, so that all Ncs values are integer multiples of 2. It should be understood that 16 is merely an exemplary illustration, and may be configured to be other values such as 14, 18, 20, etc., and it is only necessary to ensure that Ncs is an integer multiple of 2, which is not limited in this embodiment of the present application.

Watch six

Zero correlation value identification	Ncs
		1	2
2	4
		3	6
4	8
		5	10
6	12
		7	16

After the sixth table is configured, the terminal device may determine the relationship between the cyclic shift difference Delta _ C corresponding to other Ncs and Delta _ C corresponding to Ncs-2 according to the multiple relationship between the values of other Ncs and Ncs-2 and the logical root sequence number planning table (i.e., table three) when Ncs-2. For example, Delta _ C corresponding to Ncs ═ N is hereinafter referred to as Delta _ C _ N, and Ncs ═ N is also referred to as Ncs _ N.

Taking the sequence length Nzc 139, Ncs 4, and J2 as an example, the cyclic shift value of a single root may be (0 to 33) × Ncs _4 (0 to 33) × 4, and the cyclic shift value when the cyclic shift value is not 0 is an integer multiple of 4, and assuming that Delta _ C _4 is 1 × 4, and the corresponding cyclic shift value Delta _ C _2 when Ncs 2 is also 4, the relationship between two cyclic shift values is that for the same physical root sequence, the two cyclic shift values have the same relationship

That is, the same physical root sequence has the above-described relationship between Delta _ C corresponding to Ncs 4 and Ncs 2. Similarly, the correspondence between other Ncs values and Delta _ C corresponding to Ncs ═ 2 can be obtained. After determining the corresponding relationship between other Ncs values and Delta _ C corresponding to Ncs-2, the terminal device may further obtain a logic root sequence number planning table of other Ncs values from the logic root sequence number planning base table corresponding to Ncs-2.

To sum up, according to the optimized Ncs value configuration table (i.e., table six), the generation of the new sequence logic root sequence number planning table for a certain Ncs value may have the following rules:

(1) obtaining a logic root serial number planning base table (namely table three) according to Ncs-2;

(2) the logic root sequence number planning table meeting the integer multiple of Ncs value of 2 can be obtained by a logic root sequence number planning base table with Ncs being 2, and the logic root sequence number planning table meeting the integer multiple of Ncs value of 2 is a subset table of the logic root sequence number planning base table with Ncs being 2;

(3) if Ncs is 2X, the target cyclic shift difference when Ncs is 2X is:

indicating that rounding up is performed on x.

Since the cyclic shift difference/Ncs is the cyclic shift difference number, as an alternative embodiment, the terminal device may also determine the relationship between the cyclic shift difference number Delta _ CS that other Ncs can take and the Delta _ CS that Ncs 2 can take. For example, Delta _ CS that Ncs — N may be called Delta _ CS _ N, and Ncs — N is also written as Ncs _ N.

In the above example, Nzc is 139, Ncs is 4, J is 2, and the cyclic shift value number of a single cyclic shift may be 0 to 33. Assuming that the corresponding Delta _ CS _4 is 1, the corresponding cyclic shift value is 1 × Ncs _4 ═ 1 × 4 ═ 2 × 2 ═ 2 × Ncs _2, that is, the cyclic shift value number corresponding to Ncs ═ 2 is 2, that is, for the same physical root sequence, the relationship between the two cyclic shift value numbers is that

That is, the same physical root sequence may have the above-described relationship between Delta _ CS for Ncs 4 and Ncs 2. Similarly, the corresponding relationship between other Ncs values and Delta _ CS that Ncs is 2 can be obtained.

Taking the ZC sequence length Nzc 139, the zero correlation value Ncs 4, and the number J of cyclic shift values for generating different roots of the new sequence 2 as an example, a base table (table three) is planned according to a logical root sequence number corresponding to Ncs 2, and a logical root sequence number planning table corresponding to Ncs 4 can be obtained as shown in the following table seven:

watch seven

Logical root sequence number	(RootNumber 1,RootNumber 2,Delta_CS)
		0-49999	(1,2,-34),(1,2，-33),(1,2，-32),(1,2，-31),…
…	…
		600000-647530	(137,138,-34),(137,138,-33),(137,138,-32),…

Therefore, in the embodiment of the present application, the configuration table of zero correlation value Ncs is optimized, so that a multiple relationship exists between the value of Ncs and Ncs-2, and the basic table is planned according to the logical root serial number corresponding to Ncs-2, so as to determine the logical root serial number planning table corresponding to other values of Ncs. In this way, the system can only need to configure the logic root sequence number planning base table when Ncs is 2, and does not need to configure the logic root sequence number planning table with Ncs equal to other values, thereby reducing the signaling overhead of the configuration of the logic root sequence number planning table.

Another embodiment of the present application is described below. In this embodiment, the terminal device may determine the available new random access sequence according to a Cubic Metric (CM) value of the new random access sequence of a different root. For an available new random access sequence, the CM value of the sequence is lower than the preset CM threshold.

It should be understood that CM represents a cubic metric that characterizes how high the power amplifier power efficiency is. The peak to average power ratio (PAPR) is referred to simply as the peak to average ratio, i.e., the ratio of the instantaneous peak power of a continuous signal to the average power of that signal. The PAPR or CM characteristic curve of the random access preamble sequence generated based on the above methods may be obtained according to a Cumulative Distribution Function (CDF) of the PAPR or CM. If all newly generated sequences are selected as random access preamble sequences, the overall PAPR or CM characteristics of the uplink random access sequence are significantly deteriorated, i.e., the PAPR or CM is too high, which may reduce the efficiency of the power amplifier when uplink data transmission is performed.

For the above embodiment (i.e. table two) in which the logical root sequence numbers correspond to the combinations of (RootNumber1, RootNumber2, CS1, CS2) one by one, and the embodiment (i.e. table three) in which the logical root sequence numbers correspond to the combinations of (RootNumber1, RootNumber2, Delta _ CS) one by one, a new random access sequence is generated by superimposing J sequences, which is equivalent to superimposing and transmitting the J sequences when transmitting the new sequence. Assuming that the equal power allocation principle is adopted when a new random access sequence is transmitted, the power of each of the J sequences is 1/J of that when a single sequence is transmitted, which may cause the PAPR or CM of the new sequence to be high.

The method in the embodiment of the present application may be used in an implementation manner (i.e., table two) in which the logical root serial number corresponds to the combination of (RootNumber1, RootNumber2, CS1, CS2) one by one, or may be used in an implementation manner (i.e., table three) in which the logical root serial number corresponds to the combination of (RootNumber1, RootNumber2, Delta _ CS) one by one, and this is not limited in the embodiment of the present application.

For example, in an embodiment (i.e., table three) in which the logical root sequence numbers correspond to the (RootNumber1, RootNumber2, Delta _ CS) combinations one to one, in order to maintain the low CM characteristic of the new sequences, the (RootNumber1, RootNumber2, Delta _ CS) combinations may be screened by a preset CM threshold value, so that the new sequences determined according to the (RootNumber1, RootNumber2, Delta _ CS) combinations in the logical root sequence number plan table are new sequences whose CM values are smaller than the preset CM threshold value. Alternatively, (RootNumber1, RootNumber2, CS1, CS2) determined according to the combination of (RootNumber1, RootNumber2, Delta _ CS) may be screened by a preset CM threshold, or a new sequence determined according to the combination of (RootNumber1, RootNumber2, Delta _ CS) may be screened by a preset CM threshold, so that the new sequence determined according to the combination of (RootNumber1, RootNumber2, CS1, CS2) is a new sequence having a CM value smaller than the preset CM threshold. Illustratively, 4 new sequences can be determined according to a specific (RootNumber1, RootNumber2, Delta _ CS) combination in the logical root sequence number planning table, wherein the CM value of 1 new sequence is smaller than the CM threshold value, and the CM value of the other 3 new sequences is larger than the CM threshold value. The terminal device does not select these 3 new sequences in the selection of the random access sequence or these 3 new sequences are not included in the candidate random access sequences of the cell.

According to the distribution rule of new sequences generated by ZC sequence characteristics and cyclic shift combination of different roots after CM value screening, the following conclusion exists:

(1) for any two new sequences generated by different root sequences through cyclic shift cross combination, if the cyclic shift difference Delta _ CS of the cyclic shift combination for generating the two new sequences is the same, the CM values of the two new sequences are similar;

(2) according to the symmetry of the distribution of the root sequences CM of the ZC sequences, namely, the physical root sequences with the serial numbers of RootNumbers and the physical root sequences with the serial numbers of Nzc-RootNumbers have symmetry in the value of CM, namely, (RootNumbers 1, RootNumbers 2, Delta _ CS) have the same value of CM for generating new sequences as that of (Nzc-RootNumbers 1, Nzc-RootNumbers 2, Delta _ CS), wherein Nzc represents the sequence length of the ZC sequences, and wherein "-" in the Nzc-RootNumbers represents a minus number.

The embodiment of the application can screen the newly generated random access leader sequence by presetting the CM threshold value, and selects the new sequence with part of CM value lower than the CM threshold value, thereby ensuring the low CM characteristic of the new sequence.

Illustratively, when designing the logical root sequence number planning table, the screened (RootNumber1, RootNumber2, Delta _ CS) combinations may be further sorted in an ascending order (or a descending order) according to the value size of CM. Similarly, a plurality of (RootNumber1, RootNumber2, Delta _ CS) combinations may be grouped according to the number of (RootNumber1, RootNumber2, Delta _ CS) combinations, but this embodiment is not limited thereto. After grouping, the logical root sequence numbers correspond to the (RootNumber1, RootNumber2, Delta _ CS) combinations one by one.

Illustratively, in the screening process, the physical root sequences can be equally divided according to the CM values according to the characteristic that the CM performances of new sequences generated by cyclic shift combination of the physical root sequences with the similar CM values are similar. For example, the CM values of 138 physical root sequences of Nzc 139 satisfy: CM _ Max 3.1572, CM _ Min 0.2017. According to CM _ Max-CM _ Min-3.1572-0.2017-2.9555, 138 physical root sequences may be sorted in ascending order or descending order according to the value of CM, and the 138 physical root sequences are divided into integer groups according to the value size of CM, where 10 groups are assumed, the value of CM between adjacent groups differs from 2.9555/10-0.29555, and therefore, in the present embodiment, the step Delta _ CM-0.29555. And the CM value of the j-th group of physical root sequences meets the condition that the CM value is greater than or equal to CM _ Min + (j-1) Delta _ CM and less than CM _ Min + j Delta _ CM, wherein the value of j is an integer ranging from 1 to 10. For example, assuming that the CM of the physical root sequence in the j-th group has a minimum value of CMj _ Min and the CM of the physical root sequence in the j + 1-th group has a minimum value of CM (j +1) _ Min, CM (j +1) _ Min-CMj _ Min is 0.29555. Thus, a physical root Number Grouping (GN) table as shown in table eight can be obtained. In the embodiment of the present application, the physical root sequence number packet may also be referred to as a physical root sequence packet.

Table eight

GN	RootNumber
		1	(1 2 3 4 5 6 7)
2	(8 9 10 11 12 13 14 15 16 17 18 27 28 29 31)
		3	(19 20 21 22 23 24 25 26 30 32 33 34 35 36 37)
4	(38 39 40 41 42 43 44 45 46 62 67 68 69)
		5	(47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 63 64 65 66)
6	(73 74 75 76 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92)
		7	(70 71 72 77 93 94 95 96 97 98 99 100 101)
8	(102 103 104 105 106 107 109 113 114 115 116 117 118 119 120)
		9	(108 110 111 112 121 122 123 124 125 126 127 128 129 130 131)
10	(132 133 134 135 136 137 138)

The physical root sequence grouping table has the following rules:

(1) according to the symmetry of the value of CM of ZC physical root sequence, the physical root sequence groups have symmetry, wherein GN (m) and GN (11-m) have symmetry, the number of the physical root sequences of two symmetrical groups is the same, m is an integer, and m is more than or equal to 1 and less than or equal to 10;

(2) of the two symmetric physical root sequence groups, CM of the physical root sequences symmetric according to Nzc takes the same value, for example, CM (RootNumber1 ═ n) ═ CM (RootNumber2 ═ (139-n)), n is an integer, and 1 ≦ n ≦ 138 for group 1 and group 10;

(3) CM-valued distribution characteristics of physical root sequence packets: CM (GN (1)) < CM (GN (2)) < CM (GN (3)) < CM (GN (4)) < CM (GN (5)).

In combination with the physical root sequence grouping table, in order to reduce the complexity of new sequence planning, a screening principle of designing a new sequence by taking the combination of the physical root sequence grouping as an object can be used, and a selection principle that different physical root sequences generate a new sequence through cyclic shift cross combination is obtained. Specifically, a CM threshold is set, and an available Delta _ CS value is screened out, so that the value meets the following conditions: and for any physical root sequence number combination obtained according to the two physical root sequence groups, the CM value of the new sequence generated according to the available Delta _ CS value is smaller than a preset CM threshold value. Wherein a first physical root sequence number in the combination of physical root sequence numbers is from a first group of the two physical root sequence groups, and a second physical root sequence number in the combination of physical root sequence numbers is from a second group of the two physical root sequence groups; or the first physical root sequence number and the second physical root sequence number in the combination of physical root sequence numbers are from different physical root sequence numbers in the same physical root sequence packet.

In the following, assuming that Nzc is 139, Ncs is 2, and J is 2, two physical root sequence groupings GNx and GNy are exemplified, where x and y are integers taken through [1,10 ]. For example, the root sequence combination RootNumber1 ═ 1(x ═ 1, selected from GN1, and the corresponding physical root sequence is referred to as physical root sequence 1) and RootNumber2 ═ 8(y ═ 2, selected from GN2, and the corresponding physical root sequence is referred to as physical root sequence 8) are selected and analyzed. The Number of cyclic shifts that each root sequence can take is Number _ CS 139/2 69, i.e., the Number of new sequences that each root sequence can generate through cyclic shifts is 69. Assuming that the cyclic shift value of the physical root sequence 1 for generating the new sequence is CS1, the value range of CS1 is [0, 68], the cyclic shift value of the physical root sequence 8 is CS2, the value range of CS2 is [0, 68], the difference between the cyclic shift value numbers of the physical root sequence 1 and the physical root sequence 8 is Delta _ CS1-CS2, and the value range of Delta _ CS is [ -68,68 ]. The specific method for screening the new sequence is as follows:

(1) for Delta _ CS ═ N1(N1 represents some integer between [ -68,68 ]), for all (RootNumber1, RootNumber2, CS1, CS2) combinations of (RootNumber1 ═ 1, RootNumber2 ═ 8, Delta _ CS ═ N1), the CM value of the new sequence generated by each (RootNumber1, RootNumber2, CS1, CS2) combination is calculated, taking the maximum value of CM therein as CM _ Max 1.

(2) For Delta _ CS ═ N1, the value of CM _ Max1 for all combinations of physical root sequence numbers of GN1 and GN2 is calculated, and for example, the procedure in (1) above is performed for all combinations (RootNumber1, RootNumber2, CS1, CS2) of other combinations (RootNumber1, RootNumber2, Delta _ CS ═ N1), to obtain CM _ Max1 corresponding to each combination (RootNumber1, RootNumber2, Delta _ CS ═ N1). Wherein, RootNumber1 is from GN1, and can be, for example, 1,2,3, 4, 5, 6, or 7; RootNumber2 is from GN2 and can be, for example, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 27, 28, 29, or 31. The maximum value in each CM _ Max1 is taken as CM _ Max 2.

(3) If CM _ Max2 satisfies less than the set CM threshold for Delta _ CS-N1, Delta _ CS-N1 takes the value Delta _ CS as a selectable physical root sequence combination (RootNumber1, RootNumber2), where RootNumber1 is from GN1, which may be, for example, 1,2,3, 4, 5, 6, or 7; RootNumber2 is from GN2 and can be, for example, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 27, 28, 29, or 31.

(4) Traversing all possible values of Delta _ CS, i.e. Delta _ CS takes all integers between [ -68,68], traversing all combinations of root sequence groups, i.e. GNx and GNy take all groups between GN1-GN10 shown in Table eight, where GNx and GNy may take the same group, i.e. x and y may be equal. Finally, all selectable Delta _ CS values of any two physical root sequence grouping combinations can be obtained.

It should be understood that when the value of Nzc is larger, the number of new sequences generated by cyclic shift cross combination of different root sequences is larger. For the convenience of analysis, a logical root sequence number planning table of new sequences generated by cyclic shift combination of different root sequences is given below when Nzc is 139, Ncs is 2, and J is 2. In this case, the number of sequences generated by cyclic shift of a single root is 139/2 ═ 69, and the number of new sequences generated by random cross combination of sequences generated by cyclic shift of two different roots is 69 × 69 ═ 4761, and a layout table of a combination of physical root sequence numbers and Delta _ CS can be generated as shown in table nine below, based on the grouping principle of the physical root sequences and the above screening method.

Watch nine

In conjunction with the grouping of physical root sequence numbers shown in table eight, (GNx, GNy) in table nine means that one physical root sequence number is arbitrarily selected from GNx shown in table eight and one physical root sequence number is arbitrarily selected from GNy shown in table eight, thereby constituting a combination of physical root sequence numbers, otherwise referred to as a (RootNumber1, RootNumber 2). Each physical root sequence grouping combination shown in the first column of table nine is the combination of the physical root sequence number grouping which meets the condition after being screened by the new sequence screening method. Delta _ CS represents the (GNx, GNy) combination corresponding to the available cyclic shift difference. For example, the cyclic shift difference available to (GN1, GN2) may be-67, -66, -65, -62, …, -58, -56, …, -46, -44, -43, -41, …, -36, -34, …, -32, -30, -27, …, -15, -13, …, -9, -7, -4, -3, -1, 3, 4, 7, 8, …, 15, 18, …, 27, 29, …, 41, 43, 44, 46, …, 56, 58, …, 62, 65, or 67. Since GN1 may be 1,2,3, 4, 5, 6 or 7, and GN2 may be 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 27, 28, 29 or 31, a plurality of (RootNumber1, RootNumber2, Delta _ CS) combinations, such as (1,8, -67), (1,9, -66), etc., may be formed, respectively, and are not listed here. The CM values of the new sequences generated by the combination of the above (RootNumber1, RootNumber2, Delta _ CS) are all smaller than a preset CM threshold value.

The above-described physical root sequence grouping combination and Delta _ CS plan table may have the following rules:

(1) any two physical root sequence combinations in the physical root sequence grouping combinations can generate new sequences according to available Delta _ CS, and the CM value of the new sequences is less than a set CM threshold;

(2) for each group of physical root sequence grouping combinations shown in the first column of table nine, such as (GN1, GN2), any two physical root sequence number combinations obtained according to the physical root sequence grouping combinations, such as physical root sequence number combinations of (1,8), (1,9), (2,8), and the like, the desirable Delta _ CS values are the same, as shown in the second column of table nine;

(3) according to the grouping principle of the physical root sequences, the physical root sequence grouping combination has symmetry due to the symmetry of the physical root sequence grouping, and the symmetric physical root sequence grouping combination has the same Delta _ CS value, for example, GN1 is symmetric with GN10, GN2 is symmetric with GN9, (GN1, GN2) and (GN9, GN10) have the same desirable Delta _ CS;

in order to fully utilize the new sequences generated by cyclic shift cross combination of different physical root sequences, each group of physical root sequence grouping combinations shown in the first column of the table nine is expanded according to the physical root sequence grouping combination and the Delta _ CS planning table, namely the table nine, so as to generate a logical root sequence number planning table shown in the table ten. The logical root sequence numbers and the physical root sequence number combinations are in one-to-one correspondence, that is, the logical root sequence numbers and the (RootNumber1, RootNumber2) combinations are in one-to-one correspondence, and the available Delta _ CS of each physical root sequence number combination is shown in the third column of table ten.

Watch ten

In table ten above, one logical root sequence number corresponds to one (RootNumber1, RootNumber2) combination, and one (RootNumber1, RootNumber2) has one or more available Delta _ CSs. For example, the combination (1,8) can be determined (RootNumber1, RootNumber2) from the logical root sequence number 0. The cyclic shift difference available for (1,8) may be-67, -66, -65, -62, …, -58, -56, …, -46, -44, -43, -41, …, -36, -34, …, -32, -30, -27, …, -15, -13, …, -9, -7, -4, -3, -1, 3, 4, 7, 8, …, 15, 18, …, 27, 29, …, 41, 43, 44, 46, …, 56, 58, …, 62, 65, or 67. Thus, a plurality of (RootNumber1, RootNumber2, Delta _ CS) combinations, such as (1,8, -67), (1,8, -66), (1,8, -62), etc., may be formed, which are not listed here.

The logical root sequence number schedule (table ten) for the new sequence may have at least one of the following rules:

(1) dividing the logical root sequence numbers into integer groups according to the number of physical root sequence grouping combinations (namely, the row number of table nine) shown in table nine, wherein the number of the logical root sequence number grouping (namely, the row number of table ten) is the same as the number of the physical root sequence grouping combinations, each group in the logical root sequence number grouping comprises the logical root sequence number, the logical root sequence number grouping corresponds to all (RootNumber1, RootNumber2) combinations in the physical root sequence grouping combinations, and the Delta _ CS value of the logical root sequence number grouping is desirable;

(2) the logical root serial number and the physical root serial number are in one-to-one correspondence, namely the logical root serial number and the physical root serial number are in one-to-one correspondence with the (Rootnumber1, Rootnumber2) combination;

(3) the number of new sequences generated by each (RootNumber1, RootNumber2) combination can be derived from its preferred Delta _ CS. In particular, it can be based on a formula

The calculation result can be obtained according to a Delta _ CS and a new sequence number corresponding relation table (for example, table four).

In another possible implementation manner, a new sequence generated by cyclic shift cross-combining through further fully utilizing different physical root sequences is designed to have one-to-one correspondence between logical root sequence numbers and (RootNumber1, RootNumber2) combinations in table ten on the basis of one-to-one correspondence between the logical root sequence numbers and the (RootNumber1, RootNumber2, Delta _ CS) combinations, so as to obtain a logical root sequence number planning table of the new sequence, where Delta _ CS correspondence (RootNumber1, RootNumber2) takes values of selectable Delta _ CS, and the logical root sequence number planning table of the new sequence is shown in table eleven below.

Watch eleven

The logical root sequence number schedule (table eleven) for the new sequence may have at least one of the following rules:

(1) the logical root sequence numbers are divided into integer groups according to the total number of (RootNumber1, RootNumber2, Delta _ CS) combinations, the number of the integer groups is not limited in this embodiment, and table eleven shows one of the grouping implementation manners. Wherein, the combinations (RootNumber1, RootNumber2, Delta _ CS) in each group are subjected to ascending sequencing according to the value of CM generating a new sequence;

(2) the logical root serial numbers correspond to the combinations of (RootNumber1, RootNumber2, Delta _ CS) one by one;

(3) the number of new sequences generated by each (RootNumber1, RootNumber2, Delta _ CS) combination can be according to the formula

It should be understood that the logical root sequence number plan tables shown in table ten and table eleven above may be applicable to a specific scenario where the cyclic shift value Ncs is 2. Similarly, the zero correlation value Ncs configuration table may be optimized, so that a multiple relationship exists between the value of Ncs and Ncs 2, and then the logic root sequence number planning table corresponding to other Ncs values is determined according to the logic root sequence number planning table corresponding to Ncs 2, thereby reducing signaling overhead for configuring the logic root sequence number planning table, which is not described herein again.

According to the method and the device, the combinations (RootNumber1, RootNumber2, Delta _ CS) are screened according to the PAPR or the CM threshold value, and meanwhile, the screened combinations (RootNumber1, RootNumber2, Delta _ CS) are subjected to new sequence planning, so that the low PAPR or the CM characteristic of the new sequence is ensured, and the signaling overhead of the configuration of the logic root sequence number planning table is reduced. In addition, the scheme of performing new sequence planning on PAPR or CM values according to the (RootNumber1, RootNumber2, Delta _ CS) combination in ascending order is beneficial to keeping continuity of the PAPR/CM values of the new sequence selected in the same cell, thereby reducing the requirement on the power amplifier. It should be understood that, in order to ensure that the PAPR or CM value of the new sequence selected in the same cell maintains continuity, the new sequence may also be planned according to the descending order of the PAPR or CM value, which is not limited in this embodiment. It should also be understood that, because Delta _ CS and Delta _ C have a certain corresponding relationship, the combinations may also be screened according to PAPR or CM threshold value (RootNumber1, RootNumber2, Delta _ CS), and the embodiments of the present application are not limited thereto.

It should be understood that the sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present application.

The random access method according to the embodiment of the present application is described in detail above with reference to fig. 1 to 2, and the apparatus of the random access method according to the embodiment of the present application is described in detail below with reference to fig. 3 to 4.

Fig. 3 illustrates an apparatus 300 provided by an embodiment of the present application. The apparatus 300 may be a terminal device, or may be an apparatus capable of supporting the terminal device to implement its function, for example, a chip or a chip system that may be used in the terminal device. Alternatively, the apparatus 300 may be a network device, or may be an apparatus capable of supporting the network device to implement its function, for example, a chip or a system-on-chip that may be used in the network device. The apparatus 300 comprises: a receiving unit 310 and a transmitting unit 320.

In a possible implementation manner, the apparatus 300 is configured to execute various flows and steps corresponding to the terminal device in the method provided in the embodiment of the present application.

For example, the receiving unit 310 is configured to: receiving first information, wherein the first information is used for indicating a target logical root sequence number of a cell, the target logical root sequence number is used for indicating K target physical root sequence numbers and J-1 target cyclic shift difference values, and K and J are integers greater than 1;

for example, the sending unit 320 is configured to: and sending a random access leader sequence, wherein the random access leader sequence is determined according to the K target physical root sequence numbers and the J-1 target cyclic shift difference values.

According to the device, the network equipment sends the first configuration information to the terminal equipment to indicate the target logic root serial number, the terminal equipment determines K target physical root serial numbers and J-1 target cyclic shift difference values according to the target logic root serial number, then obtains the random access sequence and sends the random access sequence to the network equipment, the number of random access leader sequences of a cell can be increased, and therefore the probability of collision of random access is reduced.

Optionally, K is J, the random access preamble sequence is determined according to the K target physical root sequence numbers and J target cyclic shift values, a jth target cyclic shift difference value of the J-1 target cyclic shift difference values is a difference value between a jth +1 target cyclic shift value and a 1 st target cyclic shift value of the J target cyclic shift values, the J target cyclic shift values are in one-to-one correspondence with the K target physical root sequence numbers, a value range of J is from 1 to J-1, and J is an integer.

Optionally, the random access preamble sequence is obtained by superimposing J target sequences, where the J target sequences respectively correspond to the J target cyclic shift values. Each target sequence is obtained by circularly shifting the corresponding physical root sequence according to the corresponding target cyclic shift value. The physical root sequence is a sequence derived from a physical root sequence number.

Optionally, the random access preamble sequence is one of M random access preamble sequences determined according to the K target physical root sequence numbers and the J-1 target cyclic shift difference values, where M is MAX (((M ═ MAX) ((M is M

-target cyclic shift difference 1/Ncs), (c) and (d)

Target cyclic shift difference 2/Ncs), …, (Ncs)

Optionally, the CM value of the random access preamble sequence is smaller than a preset CM threshold.

Optionally, the J-1 target cyclic shift difference values are cyclic shift difference values when the target zero correlation value Ncs is 2.

Optionally, the J-1 target cyclic shift difference is

indicating that rounding up is performed on x.

Optionally, the receiving unit 310 is further configured to: receiving second information, where the second information is used to indicate a target zero correlation value of the cell from a candidate zero correlation value set, and a zero correlation value in the candidate zero correlation value set is an integer multiple of 2.

In a possible implementation manner, the apparatus 300 is configured to execute various flows and steps corresponding to network devices in the method provided in the embodiment of the present application.

For example, the sending unit 320 is configured to: sending first information, wherein the first information is used for indicating a target logical root sequence number of a cell, the target logical root sequence number is used for indicating K target physical root sequence numbers and J-1 target cyclic shift difference values, and K and J are integers greater than 1;

for example, the receiving unit 310 is configured to: receiving a random access preamble sequence, wherein the random access preamble sequence is determined according to the K target physical root sequence numbers and the J-1 target cyclic shift difference values.

Optionally, K is J, the random access preamble sequence is determined according to the K target physical root sequence numbers and J target cyclic shift values, the J target cyclic shift values are determined according to the K target physical root sequence numbers and the J-1 target cyclic shift difference values, a jth target cyclic shift difference value of the J-1 target cyclic shift difference values is a difference value between a jth +1 target cyclic shift value and a 1st target cyclic shift value of the J target cyclic shift values, the J target cyclic shift values correspond to the K target physical root sequence numbers one to one, a value range of J is 1 to J-1, and J is an integer.

Optionally, the random access preamble is one of M random access preamble sequences determined according to the K target physical root sequence numbers and the J-1 target cyclic shift difference values,

(

target cyclic shift difference 2/Ncs), …, (Ncs)

Optionally, the cubic metric CM value of the random access preamble sequence is smaller than a preset CM threshold.

Optionally, the J-1 target cyclic shift difference is

indicating that rounding up is performed on x.

Optionally, the sending unit 320 is further configured to: and sending second information, wherein the second information is used for indicating the target zero correlation value of the cell from a candidate zero correlation value set, and the zero correlation value in the candidate zero correlation value set is an integral multiple of 2.

It should be understood that the apparatus 300 herein is embodied in the form of a functional unit. The term "unit" herein may refer to an Application Specific Integrated Circuit (ASIC), an electronic circuit, a processor (e.g., a shared, dedicated, or group processor) and memory that execute one or more software or firmware programs, a combinational logic circuit, and/or other suitable components that support the described functionality. In an optional example, it may be understood by those skilled in the art that the apparatus 300 may be specifically a terminal device or a network device in the foregoing embodiment, and the apparatus 300 may be configured to execute each procedure and/or step corresponding to the terminal device or the network device in the foregoing method embodiment, and in order to avoid repetition, details are not described here again.

The apparatus 300 of each of the above schemes has a function of implementing corresponding steps executed by the terminal device or the network device in the above method; the functions can be realized by hardware, and the functions can also be realized by executing corresponding software by hardware. The hardware or software comprises one or more modules corresponding to the functions; for example, the transmitting unit and the receiving unit may be replaced by a communication interface, and other units, such as the determining unit, may be replaced by a processor, to perform the transceiving operation and the related processing operation in each method embodiment, respectively. In the embodiment of the present application, the communication interface may be a circuit, a module, a bus interface, a transceiver, or the like, which may implement a communication function.

In the embodiment of the present application, the apparatus in fig. 3 may also be a chip or a chip system, for example: system on chip (SoC). Correspondingly, the receiving unit and the transmitting unit may be a transceiver circuit of the chip, and are not limited herein.

Fig. 4 illustrates another apparatus 400 provided by an embodiment of the present application. The apparatus 400 includes a processor 410, a communication interface 420. Optionally, the apparatus 400 may further comprise a memory 430. Optionally, the memory 430 may be included in the processor 410. The processor 410, the communication interface 420 and the memory 430 are in communication with each other through an internal connection path, the memory 430 is used for storing instructions, and the processor 410 is used for executing the instructions stored in the memory 430 to implement the method provided by the embodiment of the present application.

In a possible implementation manner, the apparatus 400 is configured to execute various flows and steps corresponding to terminal devices in the method provided in the embodiment of the present application.

Wherein the processor 410 is configured to: receiving first information through the communication interface 420, where the first information is used to indicate a target logical root sequence number of a cell, and the target logical root sequence number is used to indicate K target physical root sequence numbers and J-1 target cyclic shift difference values, where K and J are integers greater than 1; and sending a random access leader sequence, wherein the random access leader sequence is determined according to the K target physical root sequence numbers and the J-1 target cyclic shift difference values.

In a possible implementation manner, the apparatus 400 is configured to execute various flows and steps corresponding to network devices in the method provided in the embodiment of the present application.

Wherein the processor 410 is configured to: sending first information through the communication interface 420, where the first information is used to indicate a target logical root sequence number of a cell, and the target logical root sequence number is used to indicate K target physical root sequence numbers and J-1 target cyclic shift difference values, where K and J are integers greater than 1; receiving a random access preamble sequence, wherein the random access preamble sequence is determined according to the K target physical root sequence numbers and the J-1 target cyclic shift difference values.

It should be understood that the apparatus 400 may be embodied as a terminal device or a network device in the foregoing embodiments, and may be configured to perform each step and/or flow corresponding to the terminal device or the network device in the foregoing method embodiments. Memory 430 may alternatively comprise read-only memory and random access memory, and provides instructions and data to the processor. The portion of memory may also include non-volatile random access memory. For example, the memory may also store device type information. The processor 410 may be configured to execute the instructions stored in the memory, and when the processor 410 executes the instructions stored in the memory, the processor 410 is configured to perform the various steps and/or procedures of the method embodiments described above corresponding to the terminal device or the network device.

It should be understood that in the embodiment of the present application, the processor of the above apparatus may be a Central Processing Unit (CPU), and the processor may also be other general processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, and the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.

In implementation, the steps of the above method may be performed by integrated logic circuits of hardware in a processor or instructions in the form of software. The steps of a method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware processor, or may be implemented by a combination of hardware and software elements in a processor. The software elements may be located in ram, flash, rom, prom, or eprom, registers, among other storage media that are well known in the art. The storage medium is located in a memory, and a processor executes instructions in the memory, in combination with hardware thereof, to perform the steps of the above-described method. To avoid repetition, it is not described in detail here.

In the present application, "at least one" means one or more, "a plurality" means two or more. "and/or" describes the association relationship of the associated objects, meaning that there may be three relationships, e.g., a and/or B, which may mean: a alone, both A and B, and B alone, where A, B may be singular or plural. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship. "at least one of the following" or similar expressions refer to any combination of these items, including any combination of the singular or plural items. For example, at least one (one) of a, b, or c, may represent: a, b, c, a-b, a-c, b-c or a-b-c, wherein a, b and c can be single or multiple.

Those of ordinary skill in the art will appreciate that the various method steps and elements described in connection with the embodiments disclosed herein can be implemented as electronic hardware, computer software, or combinations of both, and that the steps and elements of the various embodiments have been described above generally in terms of their functionality in order to clearly illustrate the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again. In the embodiments of the present application, the embodiments may refer to each other, for example, methods and/or terms between the embodiments of the method may refer to each other, for example, functions and/or terms between the embodiments of the apparatus and the embodiments of the method may refer to each other, without logical contradiction.

In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may also be an electric, mechanical or other form of connection.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiments of the present application.

In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.

The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium.

The method provided by the embodiment of the present application may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the application to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, a network appliance, a user device, or other programmable apparatus. The computer instructions may be stored on a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website, computer, server, or data center to another website, computer, server, or data center via wire (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., Digital Video Disk (DVD)), or a semiconductor medium (e.g., SSD), among others.

While the invention has been described with reference to specific embodiments, the scope of the invention is not limited thereto, and those skilled in the art can easily conceive various equivalent modifications or substitutions within the technical scope of the invention. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

1. A random access method, comprising:

receiving first information, wherein the first information is used for indicating a target logical root sequence number of a cell, the target logical root sequence number is used for indicating K target physical root sequence numbers and J-1 target cyclic shift difference values, and K and J are integers greater than 1;

and sending a random access leader sequence, wherein the random access leader sequence is determined according to the K target physical root sequence numbers and the J-1 target cyclic shift difference values.

2. The method of claim 1, wherein K is J, the random access preamble sequence is determined according to the K target physical root sequence numbers and J target cyclic shift values, a jth target cyclic shift difference value of the J-1 target cyclic shift difference values is a difference value between a jth +1 target cyclic shift value and a 1 st target cyclic shift value of the J target cyclic shift values, the J target cyclic shift values are in one-to-one correspondence with the K target physical root sequence numbers, a value range of J is from 1 to J-1, and J is an integer.

3. The method of claim 2, wherein the random access preamble sequence is obtained by stacking J target sequences, and the J target sequences respectively correspond to the J target cyclic shift values.

4. The method according to any of claims 1 to 3, wherein the random access preamble sequence is one of M random access preamble sequences determined according to the K target physical root sequence numbers and the J-1 target cyclic shift difference values,

wherein Nzc is the length of the target physical root sequence, Ncs is the target zero correlation value,

indicating rounding down and MAX indicating the maximum value.

5. The method according to any of claims 1 to 4, wherein the cubic metric CM value of the random access preamble sequence is smaller than a preset CM threshold.

6. The method according to any of claims 1 to 5, wherein the J-1 target cyclic shift differences are cyclic shift differences at a target zero correlation value Ncs-2.

7. The method according to any one of claims 1 to 5, wherein the J-1 target cyclic shift difference is

8. The method according to any one of claims 1 to 7, further comprising:

receiving second information, where the second information is used to indicate a target zero correlation value of the cell from a candidate zero correlation value set, and a zero correlation value in the candidate zero correlation value set is an integer multiple of 2.

9. A random access method, comprising:

sending first information, wherein the first information is used for indicating a target logical root sequence number of a cell, the target logical root sequence number is used for indicating K target physical root sequence numbers and J-1 target cyclic shift difference values, and K and J are integers greater than 1;

receiving a random access preamble sequence, wherein the random access preamble sequence is determined according to the K target physical root sequence numbers and the J-1 target cyclic shift difference values.

10. The method of claim 9, wherein K equals J, the random access preamble sequence is determined according to the K target physical root sequence numbers and J target cyclic shift values, the J target cyclic shift values are determined according to the J-1 target cyclic shift difference values, a jth target cyclic shift difference value of the J-1 target cyclic shift difference values is a difference value between a jth +1 target cyclic shift value and a 1 st target cyclic shift value of the J target cyclic shift value, the J target cyclic shift values are in one-to-one correspondence with the K target physical root sequence numbers, J ranges from 1 to J-1, and J is an integer.

11. The method of claim 10, wherein the random access preamble sequence is obtained by stacking J target sequences, and wherein the J target sequences respectively correspond to the J target cyclic shift values.

12. The method according to any of claims 9 to 11, wherein the random access preamble is one of M random access preamble sequences determined according to the K target physical root sequence numbers and the J-1 target cyclic shift difference values,

indicating rounding down and MAX indicating the maximum value.

13. The method according to any of claims 9 to 12, wherein the cubic metric, CM, value of the random access preamble sequence is smaller than a preset CM threshold.

14. The method according to any of claims 9 to 13, wherein the J-1 target cyclic shift differences are cyclic shift differences at a target zero correlation value Ncs-2.

15. According to any of claims 9 to 13The method is characterized in that the J-1 target cyclic shift difference value is

16. The method according to any one of claims 9 to 15, further comprising:

and sending second information, wherein the second information is used for indicating the target zero correlation value of the cell from a candidate zero correlation value set, and the zero correlation value in the candidate zero correlation value set is an integral multiple of 2.

17. An apparatus for carrying out the method of any one of claims 1 to 16.

18. An apparatus comprising a processor and a memory, the processor and the memory coupled, the processor configured to perform the method of any of claims 1-16.