A communication method, apparatus and system

Abstract

The application relates to the communication technical field, and discloses a communication method, device and system. The method comprises the following steps: a first communication device receives a first index value and a second index value, the first index value is an index value of a first recursive formula in N recursive formulas, and the second index value is an index value of a first initial value sequence in K initial value sequences corresponding to the first recursive formula; a random access signal is generated according to the first index value and the second index value, and the random access signal is sent; wherein the index values of the N recursive formulas and / or the K initial value sequences satisfy a sorting rule. In this way, by designing the sorting rule, low correlation and / or basically same coverage radius are maintained between multiple sequences in the same cell, and the terminal device can generate the random access signal according to the first index value and the second index value sent by the network device, so that the indication cost of the network device is reduced.

Description

Technical Field

[0001] This application relates to the field of communication technology, and in particular to a communication method, apparatus and system. Background Technology

[0002] The random access procedure refers to the process from when a terminal device sends a random access signal to attempt to access the network until a basic signaling connection is established with the network device. The random access signal is used to initiate the random access procedure, and it is obtained based on the random access preamble, which can be simply referred to as the preamble.

[0003] Currently, the preamble is generated based on the ZC sequence. The terminal device determines the physical root index number corresponding to the logical root index number by querying a predefined or preconfigured table according to the logical root index number sent by the network device, and determines the root sequence according to the physical root index number. Then, the root sequence is cyclically shifted to determine the preamble set of the cell. A preamble is selected from the preamble set and a random access signal is generated.

[0004] To expand the capacity of the preamble and enable multiple terminal devices to access the network, one approach is to generate the preamble based on a recursive formula and an initial value sequence. However, the implementation details regarding the generation of random access signals by terminal devices under this expanded preamble still require further investigation. Summary of the Invention

[0005] This application provides a communication method, apparatus, and system for expanding the capacity of the preamble by designing sorting rules, enabling terminal devices to generate random access signals based on index values ​​sent by network devices, thereby reducing the indication overhead of network devices.

[0006] In a first aspect, embodiments of this application provide a communication method that can be applied to a first communication device, which can be a terminal device or a component (such as a chip or circuit) in the terminal device. For example, in the method provided in the first aspect, a first communication device receives a first index value and a second index value, wherein the first index value is the index value of a first recursive formula among N recursive formulas, and the second index value is the index value of a first initial value sequence among K initial value sequences corresponding to the first recursive formula; a random access signal is generated based on the first index value and the second index value; the random access signal is obtained based on a first sequence among W sequences, wherein the W sequences include at least M1 sequences, and the M1 sequences are obtained based on the first recursive formula, the first initial value sequence, and M1 cyclic shift values; the random access signal is transmitted; wherein at least one of the following is satisfied: the cross-correlation value between two recursive formulas with adjacent index values ​​among the N recursive formulas is less than or equal to a first threshold; the index values ​​of the K initial value sequences are sorted according to the peak-to-average power ratio (PAPR) of the K sequences, and the K sequences are obtained based on the first recursive formula and the K initial value sequences; the PAPR of the K sequences is less than or equal to a second threshold; W and K are integers greater than 1, and M1 is an integer greater than or equal to 1.

[0007] Using the above method, when expanding the sequence (such as preamble) used to generate random access signals, the design of sorting rules enables terminal devices to generate random access signals based on the first and second index values ​​sent by the network device, thus reducing the indication overhead of the network device. Furthermore, when the sorting rule includes N recursive formulas, and the cross-correlation value between two adjacent recursive formulas is less than or equal to a first threshold, multiple sequences (e.g., W sequences) within the same cell maintain low cross-correlation, improving the detection performance of the preamble. When the sorting rule includes K initial value sequences whose index values ​​are sorted according to the PAPR of the K sequences, multiple sequences within the same cell maintain essentially the same coverage radius. When the sorting rule includes K sequences whose PAPR is less than or equal to a second threshold, the coverage range of the random access signal is improved.

[0008] In one possible design, the W sequences further include M2 ​​sequences, which are obtained based on the first recursive formula, the K1 initial value sequences corresponding to the first recursive formula, and at least one cyclic shift value; wherein the index values ​​of the K1 initial value sequences are consecutive, and the minimum index value among the index values ​​of the K1 initial value sequences is equal to the index value of the first initial value sequence plus 1; M2 and K1 are integers greater than or equal to 1.

[0009] Thus, if the number of sequences obtained based on the first recursive formula, the first initial value sequence, and M1 cyclic shift values ​​is less than W, the terminal device can continue with the next initial value sequence corresponding to the first recursive formula until the number of sequences obtained is W. In other words, the terminal device can first traverse the initial value sequences corresponding to the same recursive formula. Since the cross-correlation values ​​between multiple Z4 sequences obtained from the same recursive formula are relatively low, traversing the initial value sequences corresponding to the same recursive formula helps ensure low cross-correlation values ​​between multiple sequences within the same cell, thereby enabling the preamble to have better detection performance.

[0010] In one possible design, the W sequences further include M3 sequences, which are obtained based on at least one recursive formula, at least one initial value sequence corresponding to the at least one recursive formula, and at least one cyclic shift value; the index values ​​of the at least one recursive formula are consecutive, and the minimum index value among the index values ​​of the at least one recursive formula is equal to the index value of the first recursive formula plus 1; M3 is an integer greater than or equal to 1.

[0011] Thus, when traversing the initial value sequence corresponding to the first recursive formula, if the number of generated cyclic shift sequences is less than W, the initial value sequence corresponding to the next recursive formula can be traversed. Since the cross-correlation value between two recursive formulas with adjacent index values ​​in the N recursive formulas is less than or equal to the first threshold, the terminal device generates multiple sequences for the same cell based on the recursive formulas with adjacent index values. This facilitates ensuring that there are enough sequences for the same cell while minimizing the cross-correlation value between multiple sequences in the same cell.

[0012] In one possible design, the W sequences are Z4 sequences.

[0013] In one possible design, W is an integer greater than 64.

[0014] Thus, when the preamble is generated based on the ZC sequence, the number of cell sequences (such as preamble) determined by the terminal device is equal to 64. However, in this embodiment, the number of cell sequences determined by the terminal device is greater than 64, thereby enabling the expansion of the preamble and reducing the probability of collisions when different terminal devices access the network device.

[0015] In one possible design, the first threshold is 0.37.

[0016] In one possible design, the second threshold is 6 or 7.

[0017] Thus, when the second threshold is 6 or 7, it is easy to ensure that the random access signal maintains essentially the same transmit power as MSG3 during the random access process.

[0018] Secondly, embodiments of this application provide a communication method that can be applied to a second communication device, which can be a network device or a component (such as a chip or circuit) in a network device. For example, in the method provided in the second aspect, the second communication device transmits a first index value and a second index value, wherein the first index value is the index value of a first recursive formula among N recursive formulas, and the second index value is the index value of a first initial value sequence among K initial value sequences corresponding to the first recursive formula; receives a random access signal, the random access signal being obtained based on a first sequence among W sequences, the W sequences including at least M1 sequences, the M1 sequences being obtained according to the first recursive formula, the first initial value sequence, and M1 cyclic shift values; wherein at least one of the following is satisfied: the cross-correlation value between two recursive formulas with adjacent index values ​​among the N recursive formulas is less than or equal to a first threshold; the index values ​​of the K initial value sequences are sorted according to the PAPR of the K sequences, the K sequences being obtained according to the first recursive formula and the K initial value sequences; the PAPR of the K sequences is less than or equal to a second threshold; W and K are integers greater than 1, and M1 is an integer greater than or equal to 1.

[0019] In one possible design, the W sequences further include M2 ​​sequences, which are obtained based on the first recursive formula, the K1 initial value sequences corresponding to the first recursive formula, and at least one cyclic shift value; wherein the index values ​​of the K1 initial value sequences are consecutive, and the minimum index value among the index values ​​of the K1 initial value sequences is equal to the index value of the first initial value sequence plus 1; M2 and K1 are integers greater than or equal to 1.

[0020] In one possible design, the W sequences further include M3 sequences, which are obtained based on at least one recursive formula, at least one initial value sequence corresponding to the at least one recursive formula, and at least one cyclic shift value; the index values ​​of the at least one recursive formula are consecutive, and the minimum index value among the index values ​​of the at least one recursive formula is equal to the index value of the first recursive formula plus 1; M3 is an integer greater than or equal to 1.

[0021] In one possible design, the W sequences are Z4 sequences.

[0022] In one possible design, W is an integer greater than 64.

[0023] In one possible design, the first threshold is 0.37.

[0024] In one possible design, the second threshold is 6 or 7.

[0025] Thirdly, embodiments of this application provide a communication method, which can be applied to a first communication device, which can be a terminal device or a component (such as a chip or circuit) in the terminal device. For example, in the method provided in the first aspect, the first communication device receives a third index value, the third index value being the index value of a second sequence among A sequences; generates a random access signal based on the third index value; the random access signal is obtained based on a first sequence among W sequences, the W sequences including at least B1 sequences, the B1 sequences being obtained based on the second sequence and B1 cyclic shift values; and transmits the random access signal; wherein the second sequence is obtained based on a first recursive formula and a first initial value sequence among N recursive formulas; the A sequences include N recursive formulas corresponding to N... There are N sequence sets, where the sequences in the sequence set corresponding to the first recursive formula are obtained based on the first recursive formula and at least one initial value sequence, wherein the at least one initial value sequence includes the first initial value sequence; A, W, and N are integers greater than 1, and B1 is an integer greater than or equal to 1; at least one of the following is satisfied: the cross-correlation value between the recursive formulas corresponding to two sequence sets with consecutive index values ​​is less than or equal to a first threshold; the index values ​​of multiple sequences in each sequence set are sorted according to the PAPR of the multiple sequences; and the PAPR of the A sequences is less than or equal to a second threshold.

[0026] Using the above method, when the preamble is expanded, by designing sorting rules, the terminal device can generate a random access signal based on the third index value sent by the network device, which helps reduce the indication overhead of the network device. Furthermore, when the sorting rule includes N sequence sets, and the cross-correlation value between the recursive formulas corresponding to two consecutive sequence sets with consecutive index values ​​is less than or equal to a first threshold, multiple sequences (e.g., W sequences) in the same cell can maintain low cross-correlation, which helps improve the detection performance of the preamble; when the sorting rule includes multiple sequences in each sequence set sorted according to their PAPR (Packet Arrangement Proportion), multiple sequences in the same cell can maintain a substantially similar coverage radius; when the sorting rule includes A sequences with PAPR less than or equal to a second threshold, it helps improve the coverage range of the random access signal.

[0027] In one possible design, the W sequences further include B2 sequences, which are obtained from at least one of the A sequences and at least one cyclic shift value; the index values ​​of the at least one sequence are consecutive, and the minimum index value of the at least one sequence is equal to the index value of the second sequence plus 1.

[0028] In one possible design, the at least one sequence includes a third sequence, which belongs to the sequence set corresponding to the second recursive formula among the N recursive formulas.

[0029] In one possible design, all A sequences are Z4 sequences.

[0030] In one possible design, the W sequences are integers greater than 64.

[0031] In one possible design, the first threshold is 0.37.

[0032] In one possible design, the second threshold is 6 or 7.

[0033] Fourthly, embodiments of this application provide a communication method that can be applied to a second communication device, which can be a network device or a component (such as a chip or circuit) in a network device. For example, in the method provided in the second aspect, the second communication device transmits a third index value, the third index value being the index value of a second sequence among A sequences; receives a random access signal, the random access signal being obtained based on a first sequence among W sequences, the W sequences including at least B1 sequences, the B1 sequences being obtained based on the second sequence and B1 cyclic shift values; wherein, the second sequence is obtained based on a first recursive formula among N recursive formulas and a first initial value sequence; the A sequences include N sequence sets corresponding to the N recursive formulas, the sequences in the sequence set corresponding to the first recursive formula are obtained based on the first recursive formula and at least one initial value sequence, the at least one initial value sequence including the first initial value sequence; A, W, and N are integers greater than 1, and B1 is an integer greater than or equal to 1; at least one of the following is satisfied: the cross-correlation value between the recursive formulas corresponding to two sequence sets with consecutive index values ​​in the N sequence sets is less than or equal to a first threshold; the index values ​​of multiple sequences in each sequence set are sorted according to the PAPR of the multiple sequences; the PAPR of the A sequences is less than or equal to a second threshold.

[0034] In one possible design, the W sequences further include B2 sequences, which are obtained from at least one of the A sequences and at least one cyclic shift value; the index values ​​of the at least one sequence are consecutive, and the minimum index value of the at least one sequence is equal to the index value of the second sequence plus 1.

[0035] In one possible design, the at least one sequence includes a third sequence, which belongs to the sequence set corresponding to the second recursive formula among the N recursive formulas.

[0036] In one possible design, all A sequences are Z4 sequences.

[0037] In one possible design, the W sequences are integers greater than 64.

[0038] In one possible design, the first threshold is 0.37.

[0039] In one possible design, the second threshold is 6 or 7.

[0040] It is understood that the communication methods provided in the first to fourth aspects are based on the same inventive concept, and the beneficial effects of different aspects can be referred to each other.

[0041] Fifthly, this application provides a communication device that has the functions involved in any one of the first to fourth aspects. For example, the communication device includes modules, units, or means corresponding to the operations involved in any one of the first to fourth aspects. The functions, units, or means can be implemented by software, or by hardware, or by hardware executing corresponding software.

[0042] In one possible design, the communication device includes a processing unit and a communication unit, wherein the communication unit can be used to transmit and receive signals to enable communication between the communication device and other devices; the processing unit can be used to perform some internal operations of the communication device. The functions performed by the processing unit and the communication unit can correspond to the operations involved in any of the first to fourth aspects described above.

[0043] In one possible design, the communication device includes a processor that can be coupled to a memory. The memory can store necessary computer programs or instructions for implementing the functions involved in any of the first to fourth aspects described above. The processor can execute the computer programs or instructions stored in the memory, such that, when executed, the communication device implements the methods in any of the possible designs or implementations of the first to fourth aspects described above.

[0044] In one possible design, the communication device includes a processor and a memory, the memory of which may store necessary computer programs or instructions for implementing the functions involved in any of the first to fourth aspects described above. The processor may execute the computer programs or instructions stored in the memory, and when the computer programs or instructions are executed, cause the communication device to implement the methods in any possible design or implementation of the first to fourth aspects described above.

[0045] In one possible design, the communication device includes a processor and an interface circuit, wherein the processor is configured to communicate with other devices via the interface circuit and to execute the methods in any of the possible designs or implementations of the first to fourth aspects described above.

[0046] Understandably, in the fifth aspect above, the processor can be implemented in hardware or software. When implemented in hardware, the processor can be a logic circuit, integrated circuit, etc.; when implemented in software, the processor can be a general-purpose processor that reads software code stored in memory. Furthermore, there can be one or more processors, and one or more memories. The memory can be integrated with the processor, or the memory and processor can be separate. In specific implementations, the memory can be integrated with the processor on the same chip, or it can be set on different chips. This application does not limit the type of memory or the arrangement of the memory and processor.

[0047] In a sixth aspect, this application provides a communication system that may include a first communication device and a second communication device; wherein the first communication device is used to perform the method described in the first aspect, and the second communication device is used to perform the method described in the second aspect; or, the first communication device is used to perform the method described in the third aspect, and the second communication device is used to perform the method described in the fourth aspect.

[0048] In a seventh aspect, this application provides a computer-readable storage medium storing a computer program (or computer-readable instructions) in which, when a computer reads and executes some or all of the computer-readable instructions, the method in any of the possible designs in the first to fourth aspects described above is executed.

[0049] For example, a computer-readable storage medium can be any available medium that a computer can access. This includes, but is not limited to, non-transient computer-readable media, random-access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), CD-ROM or other optical disc storage, magnetic disk storage media, or other magnetic storage devices, or any other medium capable of carrying or storing desired program code in the form of instructions or data structures and accessible by a computer.

[0050] Eighthly, this application provides a computer program product that, when read and executed by a computer, causes any of the possible designs in the first to fourth aspects described above to be performed.

[0051] Ninthly, this application provides a chip (or chip system) including a processor coupled to a memory storing a computer program; the processor is configured to invoke part or all of the computer program in the memory, such that any of the possible designs in the first to fourth aspects described above are executed. Attached Figure Description

[0052] Figure 1 This is a schematic diagram of the architecture of the communication system used in the embodiments of this application;

[0053] Figure 2 This is a schematic diagram of the random access process provided in an embodiment of this application;

[0054] Figure 3 This is a schematic diagram of the basic structure of the feedback shift register provided in the embodiments of this application;

[0055] Figure 4 A flowchart illustrating the communication method provided in Embodiment 1 of this application;

[0056] Figure 5 This is a flowchart illustrating the communication method provided in Embodiment 2 of this application.

[0057] Figure 6 The following are possible exemplary block diagrams of the apparatus involved in the embodiments of this application;

[0058] Figure 7 This is a schematic diagram of the structure of a communication device provided in an embodiment of this application. Detailed Implementation

[0059] The technical solutions in the embodiments of this application will now be described with reference to the accompanying drawings. This application will focus on various aspects, embodiments, or features of a system that may include multiple devices, components, modules, etc. It should be understood and appreciated that each system may include additional devices, components, modules, etc., and / or may not include all the devices, components, modules, etc. discussed in conjunction with the accompanying drawings. Furthermore, combinations of these solutions may also be used.

[0060] In the embodiments of this application, words such as "exemplarily" and "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design scheme described as an "example" in this application should not be construed as being more preferred or advantageous than other embodiments or design schemes. Specifically, the use of the term "example" is intended to present concepts in a concrete manner. In the embodiments of this application, "of," "corresponding, relevant," and "corresponding" may sometimes be used interchangeably, and it should be noted that their intended meanings are consistent unless their distinction is emphasized.

[0061] The technical solutions of this application can be applied to various wireless communication systems, such as Universal Mobile Telecommunications System (UMTS), Wireless Local Area Network (WLAN), short-range wireless communication systems (such as sidelink, Wireless Fidelity (Wi-Fi), Bluetooth, etc.), wired networks, vehicle-to-everything (V2X) communication systems, device-to-device (D2D) communication systems, vehicle-to-everything (V2X) communication systems, 4th generation (4G) mobile communication systems (such as Long Term Evolution (LTE) systems), LTE Frequency Division Duplex (FDD) systems, LTE Time Division Duplex (TDD) systems, Worldwide Interoperability for Microwave Access (WiMAX) communication systems, 5th generation (5G) mobile communication systems (such as New Radio (NR) systems), Future Communications systems, or other similar communication systems, and are not limited thereto. The embodiments of this application use... Figure 1 The communication system shown is used as an example for description. When the technical solutions of the embodiments of this application are applied to other communication systems, the devices, components, modules, etc. in the embodiments can be replaced with corresponding devices, components, modules in other communication systems without limitation.

[0062] Figure 1 This is a schematic diagram of the architecture of the communication system used in the embodiments of this application. Figure 1As shown, the communication system includes an access network 100. Optionally, the communication system may also include a core network 200 and an Internet 300. The access network 100 may include at least one network device, such as... Figure 1 110a and 110b may also include at least one terminal device, such as Figure 1 The series consists of 120a-120j. Specifically, 110a is a base station, 110b is a micro-station, 120a, 120e, 120f, and 120j are mobile phones, 120b is a car, 120c is a fuel dispenser, 120d is a home access point (HAP) deployed indoors or outdoors, 120g is a laptop, 120h is a printer, and 120i is a drone. The same terminal device or network device can provide different functions in different application scenarios. For example... Figure 1 The mobile phones included are 120a, 120e, 120f, and 120j. Mobile phone 120a can access base station 110a, connect to car 120b, communicate directly with mobile phone 120e, and access HAP. Car 120b can access HAP and communicate directly with mobile phone 120a. Mobile phone 120f can connect to micro-station 110b, connect to laptop 120g, and connect to printer 120h. Mobile phone 120j can control drone 120i.

[0063] (1) Network equipment

[0064] A network device is a network-side device with wireless transceiver capabilities. A network device can be a device in a radio access network (RAN) that provides wireless communication capabilities to terminal devices; this is called RAN equipment. The RAN can be an access network within the 3rd Generation Partnership Project (3GPP), such as 4G, 5G, or future networks. The RAN can also be an open RAN (O-RAN or ORAN), a cloud radio access network (CRAN), or a communication network combining two or more of these.

[0065] RAN equipment can also be a base station, an evolved NodeB (eNodeB), a transmission reception point (TRP), a next-generation NodeB (gNB) in a 5G mobile communication system, a base station in a future mobile communication system, or an access node in a WiFi system, etc.

[0066] RAN equipment can also be modules or units that perform some of the functions of a base station. For example, it can be a central unit (CU), a distributed unit (DU), or a radio unit (RU). The CU performs the functions of the radio resource control (RRC) and PDCP protocols of the base station, and can also perform the functions of the service data adaptation protocol (SDAP). The CU can be further divided into a CU control plane (CP) (i.e., CU-CP) and a CU user plane (UP) (i.e., CU-UP). The DU performs the functions of the RLC and MA layers of the base station, and can also perform some or all of the physical layer functions. For specific descriptions of the above protocol layers, please refer to the relevant 3GPP technical specifications. CU and DU can be set up separately, or they can be included in the same network element, such as in a baseband unit (BBU). The RU can be included in radio frequency equipment or radio frequency units, such as in a remote radio unit (RRU), an active antenna unit (AAU), or a remote radiohead (RRH). In different systems, CU, DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an ORAN system, CU can also be called O-CU (open CU), DU can also be called O-DU, and RU can also be called O-RU. Any of the CU (or CU-CP, CU-UP), DU, and RU units in this application can be implemented through software modules, hardware modules, or a combination of software and hardware modules. RA equipment can be a macro base station (such as...) Figure 1 110a in the text), can also be a micro base station or an indoor station (such as... Figure 1 In 110b), it can also be a relay node or a donor node, etc. The embodiments of this application do not limit the specific technology or device form used in the network equipment.

[0067] In the embodiments of this application, the functions of the network device can be executed by modules (such as chips) within the network device, or by a control subsystem that includes the functions of the network device. This control subsystem, which includes the functions of the network device, can be a control center in the aforementioned application scenarios such as smart grids, industrial control, intelligent transportation, and smart cities.

[0068] (2) Terminal equipment

[0069] A terminal device is a user-side device with wireless transceiver capabilities. Terminal devices can also be called terminals, user equipment (UE), mobile stations, mobile terminals, etc. Terminal devices can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), the Internet of Things (IoT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, intelligent transportation, and smart cities. Terminal devices can be mobile phones, tablets, computers with wireless transceiver capabilities, wearable devices, vehicles, drones, helicopters, airplanes, ships, robots, robotic arms, smart home devices, etc. In the embodiments of this application, the device used to implement the functions of the terminal device can be the terminal device itself, or it can be a device that supports the terminal device in implementing that function, such as a chip system or a combination of devices or components that can implement the functions of the terminal device. This device can be installed in the terminal device. The embodiments of this application do not limit the specific technology or specific device form used in the terminal device.

[0070] In this embodiment of the application, the functions of the terminal device can also be performed by modules (such as chips or modems) in the terminal device, or by a device containing the functions of the terminal device.

[0071] Network devices and terminal devices can be fixed in location or mobile. They can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; and they can also be deployed in the air on airplanes, balloons, and artificial satellites. The embodiments of this application do not limit the application scenarios of the network devices and terminal devices.

[0072] The roles of network devices and terminal devices can be relative, for example, Figure 1 The helicopter or drone 120i can be configured as a mobile network device. For terminal devices 120j that access the wireless access network 100 via 120i, terminal device 120i is a network device; however, for network device 110a, 120i is a terminal device, meaning that 110a and 120i communicate via a wireless air interface protocol. Of course, 110a and 120i can also communicate via a network device-to-network device interface protocol; in this case, 120i is also a network device relative to 110a. Therefore, both network devices and terminal devices can be collectively referred to as communication devices. Figure 1110a and 110b can be referred to as communication devices with network equipment functions. Figure 1 The 120a-120j in the text can be referred to as communication devices with terminal equipment functions.

[0073] Network devices and terminal devices, network devices and network devices, and terminal devices can communicate through licensed spectrum, unlicensed spectrum, or both simultaneously, without limitation.

[0074] The network architecture and business scenarios described in this application are intended to more clearly illustrate the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0075] The relevant terms and technical features involved in the embodiments of this application are explained here. These explanations are intended to make the embodiments of this application easier to understand and should not be regarded as strict limitations on the terms in the scope of protection claimed by this application.

[0076] (1) Sequence

[0077] In this application's embodiments, the "sequence" includes one or more elements. These elements can be represented as complex numbers, including a real part and an imaginary part; alternatively, elements can also be represented as real numbers, without any specific limitation.

[0078] For example, the sequence [s(n)] contains L elements, where L is an integer greater than 1. n belongs to [0, ..., L-1], that is, n∈[0, ..., L-1]. In [0, ..., L-1], "..." represents an integer between 0 and L-1. For example, when L=5, n∈[0, 1, 2, 3, 4, ...]. The L elements in [s(n)] can be s(0), ..., s(L-1); in other words, the element numbered n in [s(n)] can be s(n).

[0079] It is understood that this application embodiment uses a numbering method with a starting number of 0 and incrementing by a step size of 1 as an example, but it is not limited to this. For example, the numbering method can also be: starting number of 1 and incrementing by a step size of 1. Another example is that the numbering method can also be: starting number of X and decrementing by a step size of 1, where X is an integer greater than 1. "[·]" and "{·}" can be used interchangeably to represent multiple elements, which can be understood as a set, group, or sequence, etc., and are not limited thereto.

[0080] (2) Cross-correlation between sequences

[0081] For two sequences of length L, such as [s1(n)] and [s2(n)], considering all time-domain cyclic shifts, the cross-correlation value between [s1(n)] and [s2(n)] satisfies the following formula:

[0082]

[0083] Where c(s1,s2)' represents the cross-correlation value between [s1(n)] and [s2(n)] (i.e., the cross-correlation value before normalization), c(s1,s2) represents the cross-correlation value between [s1(n)] and [s2(n)] (i.e., the cross-correlation value after normalization), τ takes values ​​in the range of [-L,L], and abs represents taking the absolute value.

[0084] Without considering time-domain cyclic shift, the cross-correlation value between [s1(n)] and [s2(n)] satisfies the following formula:

[0085]

[0086] Where c(s1,s2)' represents the cross-correlation value between [s1(n)] and [s2(n)] (i.e., the cross-correlation value before normalization), and c(s1,s2) represents the cross-correlation value between [s1(n)] and [s2(n)] (i.e., the cross-correlation value after normalization).

[0087] (3) Random access procedure

[0088] A random access procedure refers to the process from when a terminal device sends a random access signal to attempt to access the network until a basic signaling connection is established with the network device. The random access signal is used to initiate the random access procedure; for example, it is derived from a random access preamble, which can be called a random access preamble sequence, preamble sequence, or preamble. The random access signal is carried on the physical random access channel (PRACH). The terminal device can interact with the network device through the random access procedure to achieve uplink synchronization with the network device. Optionally, it can also request resources or transmit data through the random access procedure.

[0089] Based on whether the preamble is selected by the terminal device itself, random access procedures can be divided into contention-based random access procedures and non-contention-based random access procedures. The following description uses a contention-based random access procedure as an example to illustrate one possible implementation of the random access procedure.

[0090] Figure 2 This is a schematic diagram of a random access procedure provided in an embodiment of this application. Figure 2 As shown, it includes the following steps:

[0091] In step S200, the network device sends random access configuration information to the terminal device, and the terminal device can correspondingly receive the configuration information from the network device. This step can be considered preparatory work before executing the random access procedure and is not part of the random access procedure itself.

[0092] For example, a network device can send random access configuration information to a terminal device via system messages. This configuration information may include Message 1, which configures multiple PRACH occasions (ROs). An RO can be understood as a time-frequency resource used to transmit a random access signal once.

[0093] The configuration information may also include information 2, such as the logical root index number. The logical root index number is used to determine the sequence set (or preamble set) of the current cell, as described below.

[0094] In addition, the configuration information can also be used to configure other possible information, such as the correspondence between multiple ROs and (synchronization signal block, SS) / physical broadcast channel (PBCH) blocks (SS / PBCH block).

[0095] S201, the terminal device sends a random access signal to the network device. This random access signal can be referred to as the first message or message 1 (Msg1) of the random access procedure.

[0096] Specifically, the terminal device can receive multiple SS / PBCH blocks sent by the network device and select a target SS / PBCH block from among them based on the measured values ​​of the multiple SS / PBCH blocks (such as the reference signal receiving power (RSRP) of the multiple SS / PBCH blocks). Further, the terminal device selects a preamble (such as sequence a) from the preamble set of the current cell, generates a random access signal based on sequence a, and then transmits the random access signal on a RO corresponding to the target SS / PBCH block.

[0097] S202, after detecting the random access signal sent by the terminal device, the network device sends a random access response (RAR) to the terminal device. This random access response can be referred to as message 2 or message 2 (Msg2) in the random access procedure.

[0098] For example, after receiving a random access signal on the RO corresponding to the target SS / PBCH block, the network device can determine that the downlink beam communicating with the terminal device is the beam corresponding to the target SS / PBCH block, and then use the beam corresponding to the target SS / PBCH block to send a RAR to the terminal device.

[0099] For example, RAR includes timing advance (TA), which is used for uplink synchronization between terminal devices and network devices.

[0100] S203, the terminal device sends an uplink signaling message to the network device according to the TA. This uplink signaling message can be referred to as message 3 or message 3 (Msg3) of the random access procedure.

[0101] In S204, the network device sends a contention resolution message to the terminal device. Correspondingly, the terminal device can receive the contention resolution message from the network device. If the contention resolution message determines that the random access conflict has been won, the random access is considered successful; otherwise, the terminal device determines that the random access has failed. The contention resolution message can be referred to as message 4 or message 4 (Msg4) in the random access procedure.

[0102] It is understandable that the above Figure 2 The random access procedure shown is only one possible example, and the embodiments of this application do not limit it.

[0103] (4) Preamble set

[0104] In wireless communication systems (such as LTE or NR), the preamble set of each cell can include 64 preambles, that is, 64 sequences. These 64 sequences are obtained by cyclic shifting based on at least one root sequence, which is the Zadoff-Chu (ZC) sequence.

[0105] For example, the 64 sequences in the preamble set can be divided into sequences for contention-based random access and sequences for non-contention-based random access. The sequences for contention-based random access can be further divided into Group A and Group B. Group B is used for scenarios where MSG3 has a large data volume and low path loss, while Group A is used for other scenarios unsuitable for Group B. Therefore, for... Figure 2 In the contention-based random access scenario, the terminal device can determine whether to use Group A or Group B based on the data volume of MSG3 and the magnitude of path loss. If Group A is selected, a sequence is randomly chosen from Group A, and a random access signal is generated based on the selected sequence. If Group B is selected, a sequence is randomly chosen from Group B, and a random access signal is generated based on the selected sequence.

[0106] The implementation of obtaining the preamble set by the terminal device is described below in two steps (i.e., step 1 and step 2).

[0107] Step 1: The terminal device generates a root sequence [X] u [(n)] serves as a baseline sequence.

[0108] For example, after receiving the logical root index number (denoted as i) from the network device, the terminal device can look up the physical root index number (denoted as u) in a predefined table based on the logical root index number, and then generate the root sequence based on the physical root index number. The specific generation formula (i.e., the generation formula of the ZC sequence) is as follows:

[0109]

[0110] Where L is the length of the root sequence. For example, the length of the root sequence is 139 or 839.

[0111] When the length of the root sequence is 139, the physical root index number ranges from 1 to 138. The predefined table is shown in Table 1.

[0112] Table 1: Correspondence between Logical Root Index Number and Physical Root Index Number

[0113]

[0114] Step 2: The terminal device processes the root sequence [X] u Perform a cyclic shift on [n] to generate a 64-sequence [X]. u,v (n)]. If for the root sequence [X] u If the number of sequences generated by cyclic shifting (n) is less than 64, then continue to generate the next root sequence and perform cyclic shifting on the next root sequence until 64 sequences are generated.

[0115] Wherein, sequence [X] u,v [n] can be generated using the following formula:

[0116] X u,v (n)=X u ((n+C v )mod LRA

[0117] The above C v For cyclic shift values, such as C v =vN CS , Indicates L / N CS Round down; N CS The cyclic shift interval is the specific value that can be configured by the network device.

[0118] The following example, with a root sequence length of 139, illustrates how to obtain 64 sequences from the preamble set.

[0119] The terminal device receives a logical root index number of 20, obtains a physical root index number of 11 by looking up Table 1, and can then generate the root sequence [X]. 11 (n)]. Further, assume N CS If the value is 4, then v = 0, 1, 2...34.

[0120] The first sequence: v = 0, C v =vN CS =0,X 11,0 (n)=X 11 (n), that is, the first sequence is the root sequence [X] 11 (n)];

[0121] Second sequence: v = 1, C v =vN CS =4,X 11,1 (n)=X 11 ((n+4) mod 139;

[0122] The third sequence: v = 2, C v =vN CS =8,X 11,2 (n)=X 11 ((n+8) mod 139;

[0123] And so on;

[0124] The 35th sequence: v = 34, C v =vN CS =136, X 11,34 (n)=X 11 ((n+136)mod 139.

[0125] Due to the root sequence [X] 11If the number of sequences generated by the cyclic shift of [n] is less than 64, then the next root sequence is generated and cyclically shifted. The physical root index of the next root sequence is 128 (i.e., the logical root index is 21), therefore, the next root sequence is [X]. 128 (n)].

[0126] The 36th sequence: v = 0, C v =vN CS =0,X 128,0 (n)=X 128 (n), that is, the 36th sequence is the root sequence [X] 128 (n)];

[0127] The 37th sequence: v = 1, C v =vN CS =4,X 128,1 (n)=X 128 ((n+4) mod 139;

[0128] And so on;

[0129] The 64th sequence: v = 28, C v =vN CS =112, X 128,28 (n)=X 128 ((n+112)mod 139, thus obtaining 64 sequences.

[0130] It is understandable that the above description is based on the example of the terminal device generating 64 sequences. In other examples, the terminal device can also determine the physical root index number and cyclic shift value corresponding to each of the 64 sequences without actually generating the sequence. After the terminal device selects one of the sequences (such as sequence a), it generates sequence a according to the physical root index number and cyclic shift value corresponding to sequence a.

[0131] As described above, the preamble is currently generated based on the ZC sequence. The terminal device determines the physical root index number corresponding to the logical root index number by querying a predefined or preconfigured table based on the logical root index number sent by the network device, and determines the root sequence (i.e., the ZC sequence) based on the physical root index number. The root sequence is then cyclically shifted to determine the preamble set of the cell. Finally, a preamble is selected from the preamble set, and a random access signal is generated.

[0132] To expand the capacity of the preamble and enable multiple terminal devices to access the network device, one approach is to generate the preamble based on a recursive formula and an initial value sequence, such as a Z4 sequence or other possible sequences (e.g., the Gold sequence). This application will describe the example of "preamble generation based on a Z4 sequence." The relevant technical features of the Z4 sequence are introduced here.

[0133] (1) Z4 sequence

[0134] Since the Z4 sequence and the m / Gold sequence are related, for ease of understanding, we will first introduce the m sequence and the Gold sequence.

[0135] m-sequence: An m-sequence is short for Longest Linear Feedback Shift Register Sequence, which is the longest-period sequence generated by a shift register with linear feedback. Generally, the longest period generated by a V-stage linear feedback shift register is equal to 2. v -1. Figure 3 The basic structure of a feedback shift register involves storing initialization bit data in memory, and then generating new values ​​through a feedback function and adding them back to memory. Assume the feedback function performs an XOR operation on all bits in memory, i.e. Then a1, a2, ..., a n Given the initial value sequence, the output sequence is: The length of the output sequence is 2. v -1.

[0136] This can be understood as follows: the m-sequence is determined by the initial value sequence stored in the register and the primitive polynomial. The set of initial values ​​is {0,1}, and the order of the primitive polynomial is the highest power of the polynomial. For example, the primitive polynomial f(x) = x 7 The recurrence relation for +x+1 is s(t)+s(t-6)+s(t-7)=0. Since binary addition is defined as modulo-2 addition, the above recurrence relation can be transformed into s(t)=s(t-6)+s(t-7), that is, the primitive polynomial f(x)=x 7 +x+1 corresponds to the recursive formula s(t)=s(t-6)+s(t-7).

[0137] Gold sequence: The Gold sequence can be seen as the result of XORing two m-sequences with different primitive polynomials element by element.

[0138] Z4 Sequence: The period of a Z4 sequence is the same as that of a binary Gold sequence of the same length, and the initial value set is {0, 1, 2, 3}. Z4 sequences can be generated using a circular shift register. The generation of Z4 sequences is very similar to that of m-sequences, except that Z4 sequences are defined on a four-element ring {0, 1, 2, 3}, therefore addition and subtraction must be modulo 4. For example, the primitive polynomial of a Z4 sequence is f(x) = x. 7 +2x 4 The primitive polynomial, denoted as 10020013, can also be expressed as s(t) = 2s(t-3) + 3s(t-6) + s(t-7). In other words, the recursive formula can be derived from the primitive polynomial, and there is a one-to-one correspondence between the recursive formula and the primitive polynomial. In this embodiment, the terms "recursive formula" and "primitive polynomial" can be interchanged.

[0139] (2) Comparison of the number of preambles

[0140] As mentioned above, for ZC sequences: when the length of the ZC sequence is 139, since there are 138 physical root index numbers, 138 root sequences can be generated based on these 138 physical root index numbers; further, assuming N CS =15, then a total of 15 can be generated. There are 1380 preambles for each sequence (for example, 1380 sequences are equivalent to 1380 preambles).

[0141] For an m-sequence: for the same recursive formula, m-sequences generated from different initial value sequences are cyclically shifted versions of each other. For example, if the length of an m-sequence is 63, there are 64(2) sequences. 6 Given 64 initial value sequences, for the same recursive formula, the m-sequences generated by these 64 initial value sequences are mutually cyclically shifted sequences. For example, initial value sequence 1 is [s(5), s(4), s(3), s(2), s(1), s(0)] = [0,0,0,0,0,1]. Based on initial value sequence 1 and the recursive formula, m-sequence 1 is generated. Initial value sequence 2 is [s(5), s(4), s(3), s(2), s(1), s(0)] = [0,0,0,0,1,0]. Based on initial value sequence 2 and the recursive formula, m-sequence 2 is generated. m-sequence 1 and m-sequence 2 are mutually cyclically shifted sequences, that is, cyclically shifting m-sequence 1 yields m-sequence 2. Therefore, it can be considered that the m-sequence has only one initial value sequence.

[0142] When the length of the m-sequence is 127 (i.e., taking a value close to 139 as an example), if the m-sequence has 18 recursive formulas, then 18 sequences can be generated based on an initial value sequence; further, assuming N CS=15, then a total of 15 can be generated. There are 180 preambles in the sequence.

[0143] For the Z4 sequence: for example, if the length of the Z4 sequence is 64, there are a total of 4096 (4 6 Given 4096 initial value sequences, for the same recursive formula, the Z4 sequences generated by 65 of these 65 initial value sequences are not cyclically shifted versions of each other, while the Z4 sequences generated by the other initial value sequences are cyclically shifted versions of the Z4 sequences generated by these 65 initial value sequences. For example, if the length of the Z4 sequence is 127, there are 4... 7 4 initial value sequences, for the same recursive formula, 7 The Z4 sequences generated by the 129 initial value sequences are not cyclically shifted sequences of each other, while the Z4 sequences generated by the other initial value sequences are cyclically shifted sequences of the Z4 sequences generated by these 129 initial value sequences.

[0144] When the length of the Z4 sequence is 127 (i.e., taking a value close to 139 as an example), if the m sequence has 18 recursive formulas, and the ratio of the number of recursive formulas in the Z4 sequence to the number of recursive formulas in the m sequence is γ, then based on 129 initial value sequences, 18γ*129 sequences can be generated; where γ is a value greater than or equal to 1, such as γ being 1, 1.1, or 1.2. Further, assume N... CS =15, then a total of 15 can be generated. There are 23220γ sequences, corresponding to 23220γ preambles (for example, 23220γ preambles are obtained by modulating 23220γ sequences).

[0145] This shows that when the lengths of the ZC and Z4 sequences are similar, the number of preambles corresponding to the Z4 sequence is much greater than the number of preambles corresponding to the ZC sequence (more than 20 times the expansion). Therefore, generating preambles based on the Z4 sequence can effectively expand the preamble.

[0146] Based on this, this application will study the relevant implementation of generating random access signals by terminal devices under the condition of preamble expansion. Specifically, this application provides a communication method for, when the preamble is expanded, to design sorting rules so that sequences (i.e., W sequences) in the same cell maintain low cross-correlation and / or have basically the same coverage radius, and enable terminal devices to generate random access signals according to the index values ​​sent by network devices, thereby reducing the indication overhead of network devices.

[0147] For example, the sorting rules may include at least one of rule 1, rule 2 and rule 3.

[0148] Rule 1: Among N recursive formulas, the cross-correlation value between two recursive formulas with adjacent index values ​​is less than or equal to a first threshold. The first threshold can be set according to actual needs, for example, 0.37; its specific value is not limited.

[0149] Taking the Z4 sequence as an example, the cross-correlation value between different recursive formulas can refer to the maximum cross-correlation value among multiple Z4 sequences obtained based on different recursive formulas. For example, if the length of the Z4 sequence is 64 and the cyclic shift interval is 35, 65 sequences can be generated according to recursive formula 1 and 65 initial value sequences. Cyclic shifting these 65 sequences yields 130 sequences (such as sequences a1 to a130); similarly, 65 sequences can be generated according to recursive formula 2 and 65 initial value sequences. Cyclic shifting these 65 sequences yields 130 sequences (such as sequences b1 to b130). By calculating the cross-correlation values ​​between each sequence in sequences a1 to a130 and each sequence b1 to b130, 130*130 cross-correlation values ​​can be obtained (i.e., 130 cross-correlation values ​​between sequence a1 and sequences b1 to b130, 130 cross-correlation values ​​between sequence a2 and sequences b1 to b130, and so on). The cross-correlation value between recursive formula 1 and recursive formula 2 is the maximum cross-correlation value among the 130*130 cross-correlation values. The cross-correlation values ​​involved here can be cross-correlation values ​​considering time-domain cyclic shift or those not considering time-domain cyclic shift; and the cross-correlation values ​​involved here can be cross-correlation values ​​considering frequency offset or those without frequency offset, without any specific limitation. Among them, the frequency offset corresponds to a subcarrier frequency offset of 0.35 times (in high-speed mobile scenarios, a subcarrier spacing of 15kHz is considered, with a frequency offset of 2.5kHz, corresponding to a frequency domain shift of 2.5 / 15 = 0.167. Considering the compatibility of future higher-speed transportation vehicles, the frequency offset can be set to 0.35).

[0150] For example, there are N recursive formulas, including recursive formula 1, recursive formula 2, ..., recursive formula N. For recursive formula 1, the recursive formula adjacent to the index value of recursive formula 1 is recursive formula 2; for recursive formula N, the recursive formula adjacent to the index value of recursive formula N is recursive formula N-1; for recursive formula i (i is an integer greater than 1 or less than N), the recursive formula adjacent to the index value of recursive formula i is recursive formula i+1 or recursive formula i-1.

[0151] For example, the recursive formula for a Z4 sequence of length 127 includes: [10020013], [10030203], [10201003], [10221133], [10233123], [11122323], [11131123], [11321133], [11332133], [11332203], [12122333], [12303213].

[0152] There are 18 recursive formulas in total, including [12311203], [12331333], [13002003], [13210123], [13212213], and [13223213]. Taking [10020013] as an example, 10020013 is the coefficient of the recursive formula, and [10020013] represents the recursive formula s(t) = 2s(t-3) + 3s(t-6) + s(t-7).

[0153] By calculating the cross-correlation value between any two of the 18 recursive formulas, a total of [values ​​can be obtained]. The cross-correlation values ​​are then used to sort the 18 recursive formulas based on the cross-correlation values ​​that are less than or equal to the first threshold. The index values ​​of the 18 recursive formulas are obtained, as shown in Table 2A.

[0154] Table 2A: Examples of Index Values ​​for 18 Recursive Formulas

[0155] Index value of the recursive formula Recurrence formula 1 [10020013] 2 [11332133] 3 [11122323] 4 [13210123] 5 [10201003] 6 [12122333] 7 [12331333] 8 [11321133] 9 [10233123] 10 [10221133] 11 [13212213] 12 [10030203] 13 [13002003] 14 [11332203] 15 [12311203] 16 [12303213] 17 [11131123] 18 [13223213]

[0156] It is understandable that each recursive formula corresponds to a set of sequences. The sequences in the set corresponding to a recursive formula are obtained based on at least one initial value sequence corresponding to that recursive formula and the recursive formula itself. The number of sequences in the set corresponding to different recursive formulas can be the same or different, without any specific limitation. For example, when the length of the Z4 sequence is 127, there are 129 initial value sequences. Assuming that the initial value sequences corresponding to each of the 18 recursive formulas include 129 initial value sequences, then the set of sequences corresponding to the recursive formula [10020013] includes 129 sequences. These 129 sequences are obtained based on the 129 initial value sequences and the recursive formula [10020013]. The set of sequences corresponding to the recursive formula [11332133] includes 129 sequences. These 129 sequences are obtained based on the 129 initial value sequences and the recursive formula [11332133], and so on. In this embodiment of the application, the index value of the recursive formula can also be replaced with the index value of the sequence set corresponding to the recursive formula.

[0157] Rule 2: The sequences in the sequence set corresponding to each recursive formula are sorted according to the peak-to-average power ratio (PAPR).

[0158] PAPR is defined as the ratio of peak power to average power of a signal. Since the dynamic range of a power amplifier is limited, an excessively high PAPR can cause the amplified signal to enter the nonlinear region, leading to nonlinear distortion, spectral spread, and in-band signal distortion, thus reducing system performance. To avoid entering the nonlinear region, power back-off is required; the higher the PAPR, the higher the required back-off power. Different PAPRs imply different power back-offs, resulting in different coverage radii. Power back-off leads to decreased coverage performance; therefore, a lower PAPR is more beneficial for improving coverage performance. In this embodiment, PAPR can also be replaced by a cubic metric (CM), the definition of which can be found in existing technologies.

[0159] For example, the Z4 sequence of length 127 has 18 recursive formulas, and the sequence set corresponding to each recursive formula can include up to 129 sequences. Calculations show that the PAPR of the sequences in the sequence sets corresponding to the 18 recursive formulas ranges from 4 to 8 dB. See Table 2B for examples of PAPR of sequences in the sequence sets corresponding to different recursive formulas.

[0160] Table 2B: Examples of PAPR of sequences in the sequence set corresponding to different recursive formulas

[0161]

[0162] For example, the sequence set corresponding to the recursive formula [10020013] includes 129 sequences. The 129 sequences can be sorted according to their PAPR values ​​to obtain the index values ​​of the 129 sequences, or in other words, the index values ​​of the 129 initial value sequences corresponding to the recursive formula [10020013], as shown in Table 3.

[0163] Table 3: Examples of index values ​​for 129 sequences or 129 initial value sequences

[0164]

[0165]

[0166] In Table 3, Sequence 1 is obtained based on the recursive formula [10020013] and the initial value sequence 1, Sequence 2 is obtained based on the recursive formula [10020013] and the initial value sequence 2, and so on. Among the 129 sequences, the smaller the index value, the higher or lower the PAPR of the sequence; for example, in two sequences with adjacent index values, the sequence with the smaller index value has a higher PAPR, or the sequence with the smaller index value has a lower PAPR, or the two sequences have the same PAPR.

[0167] Rule 3: The PAPR of the sequence in the sequence set corresponding to each recursive formula is less than or equal to the second threshold.

[0168] For example, for the recursive formula [10020013], based on the recursive formula [10020013] and 129 initial value sequences, 129 sequences can be obtained. Then, based on the PAPR of these 129 sequences, sequences whose PAPR is less than or equal to the second threshold are selected from the 129 sequences. For example, if 120 of the 129 sequences have a PAPR less than or equal to the second threshold, then the sequence set corresponding to the recursive formula [10020013] includes 120 sequences.

[0169] The second threshold can be set according to actual needs, such as 6 or 7, without any specific limitation. In this embodiment, since the MSG3 in the random access process uses quadrature phase shift keying (QPSK) modulation and a single-carrier waveform, the corresponding PAPR is 6 or 7. Therefore, when the second threshold is 6 or 7, it is convenient to ensure that the random access signal and MSG3 in the random access process maintain basically the same transmit power.

[0170] Based on the sorting rules, a table can be predefined or preconfigured in this embodiment, meaning the predefined or preconfigured table satisfies the sorting rules. The network device can send an index value to the terminal device according to the predefined or preconfigured table; correspondingly, the terminal device can generate and send a random access signal based on the predefined or preconfigured table and the received index value. It is understood that this embodiment uses a table as an example, but other presentation methods besides tables can be used in specific implementations, without limitation.

[0171] The predefined or preconfigured table includes N recursive formulas and the initial value sequence corresponding to each recursive formula. For example, recursive formula 1 corresponds to X1 initial value sequences, recursive formula 2 corresponds to X2 initial value sequences, and so on. Recursive formula N corresponds to XN initial value sequences, where X1 to XN are all integers greater than or equal to 1.

[0172] As one possible implementation, predefined or preconfigured tables are shown in Table 4.

[0173] Table 4: Predefined or pre-configured tables

[0174]

[0175] (1) When the sorting rule includes rule 1, in Table 4, the cross-correlation value between two recursive formulas with adjacent index values ​​in the N recursive formulas is less than or equal to the first threshold, and the sorting method of the index values ​​of the initial value sequence corresponding to each recursive formula is not limited.

[0176] (2) When the sorting rule includes rule 2, in Table 4, the index values ​​of the initial value sequence corresponding to each recursive formula are sorted according to the PAPR of the sequences in the sequence set corresponding to that recursive formula. The sorting method of the index values ​​of the N recursive formulas is not limited. The sequences in the sequence set corresponding to the recursive formula are obtained based on the recursive formula and the initial value sequence corresponding to that recursive formula. For example, the initial value sequence corresponding to recursive formula 1 includes initial value sequences 1-1 to 1-X1. Sequence 1-1 can be obtained from recursive formula 1 and initial value sequence 1-1, and sequence 1-2 can be obtained from recursive formula 1 and initial value sequence 1-2, and so on. That is to say, the index values ​​of the initial value sequences 1-1 to 1-X1 are sorted according to the PAPR of sequences 1-1 to 1-X1.

[0177] (3) When the sorting rule includes rule 3, in Table 4, the PAPR of the sequence in the sequence set corresponding to each of the N recursive formulas is less than or equal to the second threshold. The sorting method of the index values ​​of the N recursive formulas and the sorting method of the index values ​​of the initial value sequence corresponding to each recursive formula are not limited.

[0178] (4) When the sorting rules include rule 1 and rule 2, in Table 4, the cross-correlation value between two recursive formulas with adjacent index values ​​in the N recursive formulas is less than or equal to the first threshold, and the index value of the initial value sequence corresponding to each recursive formula is sorted according to the PAPR of the sequence in the sequence set corresponding to the recursive formula.

[0179] (5) When the sorting rules include rule 1 and rule 3, in Table 4, the cross-correlation value between two recursive formulas with adjacent index values ​​in the N recursive formulas is less than or equal to the first threshold, the PAPR of the sequence in the sequence set corresponding to each recursive formula is less than or equal to the second threshold, and the index value of the initial value sequence corresponding to each recursive formula is not limited.

[0180] (6) When the sorting rules include rules 2 and 3, in Table 4, the index value of the initial value sequence corresponding to each recursive formula is sorted according to the PAPR of the sequence in the sequence set corresponding to the recursive formula, and the PAPR of the sequence in the sequence set corresponding to each recursive formula is less than or equal to the second threshold. The sorting method of the N recursive formulas is not limited.

[0181] (7) When the sorting rules include rule 1, rule 2 and rule 3, in Table 4, the cross-correlation value between two recursive formulas with adjacent index values ​​in the N recursive formulas is less than or equal to the first threshold. The index value of the initial value sequence corresponding to each recursive formula is sorted according to the PAPR of the sequence in the sequence set corresponding to the recursive formula, and the PAPR of the sequence in the sequence set corresponding to each recursive formula is less than or equal to the second threshold.

[0182] As another possible implementation, the sum of X1 to XN is A, that is, the set of sequences corresponding to N recursive formulas has a total of A sequences, and the predefined or pre-configured table is shown in Table 5.

[0183] Table 5: Predefined or pre-configured tables

[0184]

[0185] In Table 5, sequence 1-1 is generated based on recursive formula 1 and initial value sequence 1-1, sequence 1-2 is generated based on recursive formula 1 and initial value sequence 1-2, and so on.

[0186] (1) When the sorting rule includes rule 1, in Table 5, N recursive formulas correspond to N sequence sets. Among the N sequence sets, the cross-correlation value between the recursive formulas corresponding to two sequence sets with consecutive index values ​​is less than or equal to the first threshold. The sorting method of the sequences in each sequence set is not limited. For example, the recursive formulas corresponding to two sequence sets with consecutive index values ​​are recursive formula 1 and recursive formula 2, or recursive formula 2 and recursive formula 3, and so on.

[0187] (2) When the sorting rule includes rule 2, in Table 5, the index values ​​of multiple sequences in each sequence set are sorted according to the PAPR of the multiple sequences.

[0188] (3) When the sorting rule includes rule 3, in Table 5, the PAPR of A sequences is less than or equal to the second threshold.

[0189] (4) When the sorting rules include rule 1 and rule 2, the cross-correlation value between the recursive formulas of two consecutive sequence sets with consecutive index values ​​in the N sequence sets is less than or equal to the first threshold, and the index values ​​of multiple sequences in each sequence set are sorted according to the PAPR of multiple sequences.

[0190] (5) When the sorting rules include rule 1 and rule 3, in Table 5, the cross-correlation value between the recursive formulas of two sequence sets with consecutive index values ​​in the N sequence sets is less than or equal to the first threshold, and the PAPR of A sequences is less than or equal to the second threshold.

[0191] (6) When the sorting rules include rules 2 and 3, in Table 5, the index values ​​of multiple sequences in each sequence set are sorted according to the PAPR of multiple sequences, and the PAPR of A sequences is less than or equal to the second threshold.

[0192] (7) When the sorting rules include rule 1, rule 2 and rule 3, in Table 5, the cross-correlation value between the recursive formulas of two consecutive sequence sets with consecutive index values ​​in the N sequence sets is less than or equal to the first threshold, the index values ​​of multiple sequences in each sequence set are sorted according to the PAPR of multiple sequences, and the PAPR of A sequences is less than or equal to the second threshold.

[0193] The communication method provided in this application will be described below with reference to Embodiment 1 and Embodiment 2. The communication method provided in this application involves a first communication device and a second communication device. The first communication device is the transmitting side of a random access signal, and the second communication device is the receiving side of the random access signal. For example, the first communication device is a terminal device or a component of a terminal device, such as a chip or chip system disposed in the terminal device; the second communication device is a network device or a component of a network device, such as a chip or chip system disposed in the network device. In this application, the example of "the first communication device being a terminal device and the second communication device being a network device" will be used for description.

[0194] Example 1

[0195] Figure 4 This is a flowchart illustrating the communication method provided in Embodiment 1 of this application. Figure 4 As shown, the process may include:

[0196] S401, the network device sends a first index value and a second index value, and correspondingly, the terminal device receives the first index value and the second index value.

[0197] Wherein, the first index value is the index value of the first recursive formula among the N recursive formulas, and the second index value is the index value of the first initial value sequence among the K initial value sequences corresponding to the first recursive formula. For example, at least one of the following is satisfied: the cross-correlation value between two recursive formulas with adjacent index values ​​among the N recursive formulas is less than or equal to a first threshold (i.e., rule 1); the index values ​​of the K initial value sequences are sorted according to the PAPR of the K sequences (i.e., rule 2); and the PAPR of the K sequences is less than or equal to a second threshold (i.e., rule 3). Wherein, the K sequences are obtained based on the first recursive formula and the K initial value sequences.

[0198] In one possible implementation, the network device selects a first index value and a second index value from a predefined or preconfigured table, and sends the first index value and the second index value. The predefined or preconfigured table is shown in Table 4.

[0199] In addition, there are several ways for network devices to send the first index value and the second index value, such as by sending the first index value and the second index value through system messages.

[0200] It is understood that the embodiments in this application use "the network device sending a first index value and a second index value" as an example. In other examples, the network device may send the first index value without sending the second index value; in this case, the first initial value sequence may be a predefined or preconfigured initial value sequence, such as the initial value sequence with the smallest index value corresponding to the first recursive formula (e.g., an index value of 1), or other possible initial value sequences, without specific limitations. Alternatively, the network device may also send the second index value without sending the first index value; in this case, the first recursive formula may be a preconfigured or predefined recursive formula, without specific limitations.

[0201] In this embodiment of the application, the network device sending a first index value and a second index value can be replaced by the network device sending first information and second information; the first information is used to indicate the first index value, and the second information is used to indicate the second index value; or, the first information is used to indicate the first recursive formula, and the second information is used to indicate the first initial value sequence corresponding to the first recursive formula.

[0202] S402, the terminal device generates a random access signal based on the first index value and the second index value.

[0203] As one possible implementation, in a contention-based random access scenario, the terminal device can determine W sequences of a cell based on a first index value and a second index value, and then generate a random access signal based on the first sequence among the W sequences. This application does not limit the specific implementation of the terminal device selecting the first sequence from the W sequences.

[0204] (1) The implementation of “the terminal device determines W sequences based on the first index value and the second index value” is described here.

[0205] For example, the W sequences include at least M1 sequences, which are obtained based on a first recursive formula, a first initial value sequence, and M1 cyclic shift values. L represents the sequence length of any one of the M1 sequences (all M1 sequences have the same length), and C represents the cyclic shift interval; L is an integer greater than 1, and C is an integer greater than or equal to 1. For example, the first cyclic shift value in the M1 cyclic shift values ​​is 0, the second cyclic shift value is C, the third cyclic shift value is 2C, the fourth cyclic shift value is 3C, and so on, with the M1th cyclic shift value being... For example, if L is 127 and C = 15, then... The M1 cyclic shift values ​​are 0, 15, 30, 45, 60, 75, 90, 105, and 120.

[0206] Optionally, the W sequences also include M2 ​​sequences, which are obtained based on the first recursive formula, the K1 initial value sequences corresponding to the first recursive formula, and at least one cyclic shift value. The indices of the K1 initial value sequences are consecutive, and the smallest index value among the K1 initial value sequences is equal to the index value of the first initial value sequence plus 1, or in other words, the smallest index value among the K1 initial value sequences is adjacent to the index value of the first initial value sequence.

[0207] Optionally, the W sequences also include M3 sequences, which are obtained based on at least one recursive formula, at least one initial value sequence corresponding to the at least one recursive formula, and at least one cyclic shift value. Wherein, the index values ​​of the at least one recursive formula are consecutive, the smallest index value among the index values ​​of the at least one recursive formula is equal to the index value of the first recursive formula plus 1, or the smallest index value among the index values ​​of the at least one recursive formula is adjacent to the index value of the first recursive formula.

[0208] From the perspective of the terminal device, after receiving the first index value and the second index value, the terminal device determines the first recursive formula and the first initial value sequence by querying a predefined or preconfigured table (such as Table 4); and, based on the first recursive formula and the first initial value sequence, the terminal device determines the sequence [Y]. s,z [(n)], where s represents the index value of the first recursive formula and z represents the index value of the first initial value sequence. Furthermore, the terminal device processes the sequence [Y... s,z (n)] is cyclically shifted (for example, the sequence [Y] is shifted according to M1 cyclic shift values). s,z (n)] is cyclically shifted to generate W sequences [Y] s,z,c[(n)], where c represents the cyclic shift value. W is a predefined or preconfigured value, such as an integer greater than or equal to 64.

[0209] If for sequence [Y] s,z If the number of sequences generated by cyclic shifting [n] is less than W (i.e., M1 is less than W), then according to the first recursive formula and the second initial value sequence, [Y] is generated. s,z+1 (n)], and for [Y s,z+1 (n)] is cyclically shifted (for example, the sequence [Y] is shifted according to M1 cyclic shift values). s,z+1 (n) is cyclically shifted until W sequences are generated; where the second initial value sequence is the next initial value sequence of the first initial value sequence, for example, the index value of the second initial value sequence is equal to the index value of the first initial value sequence plus 1.

[0210] If for sequence [Y] s,z+1 If the number of sequences generated by cyclic shifting (n) is still less than W, then according to the first recursive formula and the third initial value sequence, generate [Y]. s,z+2 (n)], and for [Y s,z+2 (n)] is cyclically shifted (for example, the sequence [Y] is shifted according to M1 cyclic shift values). s,z+2 (n) is cyclically shifted until W sequences are generated; where the third initial value sequence is the next initial value sequence after the second initial value sequence, for example, the index value of the third initial value sequence is equal to the index value of the second initial value sequence plus 1.

[0211] If, after traversing the initial value sequence corresponding to the first recursive formula, the number of generated sequences is still less than W (for example, the third initial value sequence is the initial value sequence with the largest index value corresponding to the first recursive formula, for the sequence [Y... s,z+2 If the number of sequences generated by cyclic shifting (n) is still less than W, then according to the second recursive formula and the initial value sequence with the smallest index value (e.g., index value 1) corresponding to the second recursive formula, generate [Y]. s+1,1 (n)], and for [Y s+1,1 (n)] is cyclically shifted (for example, the sequence [Y] is shifted according to M1 cyclic shift values). s+1,1 (n)] is cyclically shifted until W sequences are generated;

[0212] If for sequence [Y] s+1,1 If the number of sequences generated by cyclic shifting (n) is still less than W, then according to the second recursive formula and the initial value sequence with index 2, [Y] is generated. s+1,2 (n)], and for [Y s+1,2 The sequence (n) is cyclically shifted until W sequences are generated. This process continues in the same manner, without further explanation.

[0213] Thus, the terminal device first iterates through the initial value sequence corresponding to the same recursive formula. If the number of generated cyclic shift sequences is less than W, it iterates through the initial value sequence corresponding to the next recursive formula. Since the cross-correlation value between multiple Z4 sequences obtained from the same recursive formula is relatively low, iterating through the initial value sequence corresponding to the same recursive formula first ensures low cross-correlation values ​​between multiple sequences in the same cell, thereby improving the detection performance of the preamble. Since the cross-correlation value between two recursive formulas with adjacent index values ​​in the N recursive formulas is less than or equal to the first threshold, the terminal device generates cyclic shift sequences based on recursive formulas with adjacent index values. This ensures that while having a sufficient number of sequences in the same cell, it minimizes the cross-correlation value between multiple sequences in the same cell. Since the index values ​​of the K initial value sequences are sorted according to the PAPR of the K sequences, the coverage radii of multiple sequences in a cell determined by the terminal device based on consecutive initial value sequences are not significantly different or are essentially the same (since the cell radius is fixed, it is necessary to ensure that the coverage radii of multiple sequences in a cell are as similar as possible). Since the PAPR of K sequences is less than or equal to the second threshold, it is easier to improve the coverage of the preamble. In other words, by designing sorting rules, it is possible to ensure that multiple sequences (i.e., W sequences) in the same cell maintain low cross-correlation and / or have essentially the same coverage radius.

[0214] (2) The specific implementation of the terminal generating random access signals based on the first sequence is described.

[0215] For example, the terminal device generating a random access signal based on a first sequence can be replaced by the terminal device generating a random access signal based on a fourth sequence, where the fourth sequence is a preamble obtained based on the first sequence, such as a preamble obtained by modulating the first sequence. The modulation scheme used can be QPSK.

[0216] The terminal equipment generates a random access signal based on the fourth sequence. Specifically, this can be achieved by performing a Discrete Fourier Transform (DFT) on the fourth sequence to obtain a fifth sequence; then mapping the elements of the fifth sequence onto multiple subcarriers and performing an Inverse Fast Fourier Transform (IFFT) to generate the random access signal. In other words, the random access signal is a signal of a Discrete Fourier Transform-Spread-Orthogonal Frequency Division Multiplexing (DFT-s-OFDM) waveform.

[0217] It is understandable that the above description is based on the example of a terminal device generating W sequences. In other examples, the terminal device may also determine the recursive formula, initial value sequence, and cyclic shift value corresponding to each of the W sequences, without actually generating the sequence. After the terminal device selects one of the sequences (such as the first sequence), it generates the first sequence according to the recursive formula, initial value sequence, and cyclic shift value corresponding to the first sequence, or it generates sequence a' according to the recursive formula and initial value sequence corresponding to the first sequence, and then processes sequence a' according to the cyclic shift value and modulation method to generate the fourth sequence.

[0218] As another possible implementation, in a non-contention-based random access scenario, the network device can send a cyclic shift value in addition to the first and second index values; for example, the cyclic shift value is one of M1 cyclic shift values. Accordingly, the terminal device determines the first recursive formula and the first initial value sequence based on the first and second index values; and, based on the first recursive formula and the first initial value sequence, the terminal device determines the sequence [Y]. s,z (n)], based on the cyclic shift value pair [Y s,z The first sequence is obtained by cyclically shifting [n], and then a random access signal is generated based on the first sequence. The specific implementation of the terminal device generating the random access signal based on the first sequence is described above.

[0219] S403, the terminal device sends a random access signal to the network device; correspondingly, the network device receives the random access signal.

[0220] It is understandable that the random access signal is generated by the baseband chip of the terminal device. The terminal device sending the random access signal includes the baseband chip transmitting the random access signal to the radio frequency chip. The terminal device also sends the random access signal to the network device via its radio frequency chip.

[0221] For example, after receiving a random access signal, the network device processes the random access signal to obtain a sequence r. Then, based on the cross-correlation value between the sequence in the preamble set of the current cell and sequence r (considering time-domain cyclic shift), the device determines the sequence with the largest cross-correlation value between the preamble set and sequence r as the sequence actually transmitted by the terminal device. Simultaneously with determining the sequence actually transmitted by the terminal device, the network device can also determine the time-domain multipath delay, and then determine the TA of the current cell based on the time-domain multipath delay.

[0222] Optionally, the above method further includes:

[0223] S404, the network device sends a random access response to the terminal device; correspondingly, the terminal device receives the random access response.

[0224] For example, the random access response includes the TA of the current cell, and the terminal device can obtain the TA of the current cell from the random access response and perform uplink synchronization with the network device based on the TA of the current cell.

[0225] The above Figure 4 The illustrated method can be applied to both contention-based and non-contention-based random access. When Figure 4 The illustrated method flow can be applied to contention-based random access. The method flow may also include other possible steps, such as the terminal device sending uplink signaling to the network device according to the current cell's TA, and the network device sending a contention resolution message to the terminal device.

[0226] Using the above method, when the preamble is expanded, by designing sorting rules, multiple sequences (i.e., W sequences) in the same cell maintain low cross-correlation and / or have basically the same coverage radius, and enable the terminal device to generate a random access signal based on the first index value and the second index value sent by the network device, which helps to reduce the indication overhead of the network device.

[0227] Example 2

[0228] Figure 5 This is a flowchart illustrating the communication method provided in Embodiment 2 of this application. Figure 4 As shown, the process may include:

[0229] S501, the network device sends the third index value, and the terminal device receives the third index value accordingly.

[0230] The third index value is the index value of the second sequence among A sequences. The second sequence is obtained based on the first recursive formula and the first initial value sequence among N recursive formulas. A sequences include the N sequence sets corresponding to the N recursive formulas. The sequence in the sequence set corresponding to the first recursive formula is obtained based on the first recursive formula and at least one initial value sequence, and the at least one initial value sequence includes the first initial value sequence.

[0231] For example, at least one of the following is satisfied: the cross-correlation value between the recursive formulas corresponding to two sequence sets with consecutive index values ​​in N sequence sets is less than or equal to a first threshold (i.e., rule 1); the index values ​​of multiple sequences in each sequence set are sorted according to the PAPR of the multiple sequences (i.e., rule 2); the PAPR of A sequences is less than or equal to a second threshold (i.e., rule 3).

[0232] In one possible implementation, the network device selects a third index value from a predefined or preconfigured table and sends the third index value. See Table 5 for the predefined or preconfigured table.

[0233] Furthermore, there are various ways for a network device to send a third index value, such as sending it via a system message. In this embodiment, sending a third index value can be replaced by the network device sending third information, which indicates the third index value, or the third information indicates the second sequence.

[0234] S502, the terminal device generates a random access signal based on the third index value.

[0235] As one possible implementation, in a contention-based random access scenario, the terminal device determines W sequences of the cell based on a third index value, and then generates a random access signal based on the first sequence among the W sequences.

[0236] Among them, the W sequences include at least B1 sequences, which are obtained from the second sequence and B1 cyclic shift values; where... L represents the sequence length of any one of the B1 sequences (all B1 sequences have the same length), and C represents the cyclic shift interval. For example, the first cyclic shift value in the B1 cyclic shift values ​​is 0, the second cyclic shift value is C, the third cyclic shift value is 2C, the fourth cyclic shift value is 3C, and so on, with the B1th cyclic shift value being...

[0237] Optionally, the W sequences also include B2 sequences, which are obtained from at least one sequence from the A sequences and at least one cyclic shift value; the index values ​​of the at least one sequence are consecutive, and the minimum index value of the at least one sequence is equal to the index value of the second sequence plus 1. The at least one sequence may all belong to the sequence set corresponding to the first recursive formula; or, some sequences in the at least one sequence may belong to the sequence set corresponding to the first recursive formula, and another part of the sequences may belong to the sequence set corresponding to the second recursive formula among the N recursive formulas. For example, the at least one sequence may include a third sequence, which belongs to the sequence set corresponding to the second recursive formula; the specifics are not limited.

[0238] From the perspective of the terminal device, after receiving the third index value, the terminal device determines the second sequence (such as [Y]) by querying a predefined or preconfigured table (e.g., Table 5). j (n)], j represents the third index value); furthermore, the terminal device processes the sequence [Y] j (n)] is cyclically shifted (for example, the sequence [Y] is shifted according to B1 cyclic shift values). j (n)] is cyclically shifted to generate W sequences [Y] j,c [(n)]. W is a predefined or preconfigured value, such as W being an integer greater than or equal to 64.

[0239] If for sequence [Y] j If the number of sequences generated by cyclic shifting [n] is less than W (i.e., B1 is less than W), then the next sequence [Y] of the second sequence... j+1 (n)] is cyclically shifted (for example, the sequence [Y] is shifted according to B1 cyclic shift values). j+1 (n) is cyclically shifted until W sequences are generated. And so on, without further explanation.

[0240] As another possible implementation, in a non-contention-based random access scenario, the network device can send a cyclic shift value in addition to the third index value; for example, the cyclic shift value is one of B1 cyclic shift values. Accordingly, the terminal device determines the second sequence based on the third index value, and cyclically shifts the second sequence according to the cyclic shift value to obtain the first sequence, and then generates a random access signal based on the first sequence.

[0241] S503, the terminal device sends a random access signal to the network device; correspondingly, the network device receives the random access signal.

[0242] Optionally, the above method further includes:

[0243] S504, the network device sends a random access response to the terminal device; correspondingly, the terminal device receives the random access response.

[0244] For example, the above S501 and S502 focus on describing the differences from S401 and S402 in Embodiment 1. All other contents except for the differences can be referred to the description of S401 and S402 in Embodiment 1. The implementation of S503 and S504 can be referred to the description of S403 and S404 in Embodiment 1, and will not be repeated here.

[0245] Using the above method, when the preamble is expanded, by designing sorting rules, multiple sequences (i.e., W sequences) in the same cell maintain low cross-correlation and / or have basically the same coverage radius, and enable the terminal device to generate a random access signal based on the third index value sent by the network device, which helps to reduce the indication overhead of the network device.

[0246] Regarding the above embodiments, it is understood that:

[0247] (1) In this application, “predefined” usually refers to information that is defined by the standard, does not require configuration by other devices, and is recorded / written in advance in the hardware and / or software of the terminal device or network device itself, or can be understood as information that cannot be changed by the network device or terminal device.

[0248] In this application, "pre-configuration" can refer to the server sending relevant information to network devices or terminal devices; alternatively, it can refer to defining the relevant information and pre-writing it into the network devices or terminal devices. This application does not limit the specific method used. Furthermore, the relevant information can be changed or updated.

[0249] (2) In the various embodiments of this application, unless otherwise specified or logically conflicting, the terminology and / or descriptions between different embodiments are consistent and can be referenced by each other. Technical features in different embodiments can be combined to form new embodiments based on their inherent logical relationships. Furthermore, in the same embodiment, different implementations or different examples can also be referenced or referenced by each other.

[0250] (3) The various numerical designations used in this application are merely for descriptive convenience and are not intended to limit the scope of this application. The step numbers in the above flowcharts are only examples of the execution process and do not constitute a restriction on the order of execution of the steps. That is, the size of each step number does not imply the order of execution, and the execution order of each step should be determined by its function and internal logic. In addition, not all steps shown in the flowcharts are mandatory steps, and some steps can be added or deleted based on actual needs.

[0251] The above mainly describes the solution provided by the embodiments of this application from the perspective of the interaction between the first communication device and the second communication device. It is understood that, in order to achieve the above functions, the first communication device and the second communication device may include hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art should readily recognize that, in conjunction with the units and algorithm steps of the various examples described in the embodiments disclosed herein, the embodiments of this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0252] In this application embodiment, the first communication device and the second communication device can be divided into functional units according to the above method example. For example, each function can be divided into a separate functional unit, or two or more functions can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0253] When using integrated units, Figure 6 A possible exemplary block diagram of the apparatus involved in an embodiment of this application is shown. For example... Figure 6As shown, device 600 may include a processing unit 602 and a communication unit 603. The processing unit 602 is used to control and manage the operation of device 600. The communication unit 603 is used to support communication between device 600 and other devices. Optionally, the communication unit 603, also called a transceiver unit, may include a receiving unit and / or a sending unit, respectively used to perform receiving and sending operations. Device 600 may also include a storage unit 601 for storing the program code and / or data of device 600.

[0254] (1) The device 600 can be the first communication device in the above embodiments. The processing unit 602 can support the device 600 in performing the actions of the first communication device in the above method embodiments. Alternatively, the processing unit 602 mainly performs the internal actions of the first communication device in the method embodiments, and the communication unit 603 can support communication between the device 600 and other devices.

[0255] For example, in one embodiment, the communication unit 603 is configured to: receive a first index value and a second index value, wherein the first index value is the index value of the first recursive formula among N recursive formulas, and the second index value is the index value of the first initial value sequence among K initial value sequences corresponding to the first recursive formula; the processing unit 602 is configured to: generate a random access signal based on the first index value and the second index value; the random access signal is obtained based on a first sequence among W sequences, wherein the W sequences include at least M1 sequences, and the M1 sequences are obtained based on the first recursive formula, the first initial value sequence ... The initial value sequence and M1 cyclic shift values ​​are obtained; the communication unit 603 is further configured to: transmit the random access signal; wherein at least one of the following is satisfied: the cross-correlation value between two recursive formulas with adjacent index values ​​in the N recursive formulas is less than or equal to a first threshold; the index values ​​of the K initial value sequences are sorted according to the peak-to-average power ratio (PAPR) of the K sequences, the K sequences are obtained according to the first recursive formula and the K initial value sequences; the PAPR of the K sequences is less than or equal to a second threshold; W and K are integers greater than 1, and M1 is an integer greater than or equal to 1.

[0256] For example, in another embodiment, the communication unit 603 is configured to: receive a third index value, the third index value being the index value of the second sequence among A sequences; the processing unit 602 is configured to: generate a random access signal based on the third index value; the random access signal is obtained based on a first sequence among W sequences, the W sequences including at least B1 sequences, the B1 sequences being obtained based on the second sequence and B1 cyclic shift values; the communication unit 603 is further configured to: transmit the random access signal; wherein the second sequence is obtained based on a first recursive formula among N recursive formulas and a first initial value sequence; the A sequences include... The N sets of sequences corresponding to the N recursive formulas are defined. The sequences in the sequence set corresponding to the first recursive formula are obtained based on the first recursive formula and at least one initial value sequence, wherein the at least one initial value sequence includes the first initial value sequence. A, W, and N are integers greater than 1, and B1 is an integer greater than or equal to 1. At least one of the following conditions is satisfied: the cross-correlation value between the recursive formulas corresponding to two sequence sets with consecutive index values ​​is less than or equal to a first threshold; the index values ​​of multiple sequences in each sequence set are sorted according to the PAPR of the multiple sequences; and the PAPR of the A sequences is less than or equal to a second threshold.

[0257] (2) The device 600 can be the second communication device in the above embodiments. The processing unit 602 can support the device 600 in performing the actions of the second communication device in the above method embodiments. Alternatively, the processing unit 602 mainly performs the internal actions of the second communication device in the method embodiments, and the communication unit 603 can support communication between the device 600 and other devices.

[0258] For example, in one embodiment, the communication unit 603: sends a first index value and a second index value, wherein the first index value is the index value of the first recursive formula among N recursive formulas, and the second index value is the index value of the first initial value sequence among K initial value sequences corresponding to the first recursive formula; receives a random access signal, wherein the random access signal is obtained based on a first sequence among W sequences, wherein the W sequences include at least M1 sequences, and the M1 sequences are obtained according to the first recursive formula, the first initial value sequence, and M1 cyclic shift values; wherein at least one of the following is satisfied: the cross-correlation value between two recursive formulas with adjacent index values ​​among the N recursive formulas is less than or equal to a first threshold; the index values ​​of the K initial value sequences are sorted according to the PAPR of the K sequences, wherein the K sequences are obtained according to the first recursive formula and the K initial value sequences; the PAPR of the K sequences is less than or equal to a second threshold; W and K are integers greater than 1, and M1 is an integer greater than or equal to 1.

[0259] In another embodiment, the communication unit 603: transmits a third index value, the third index value being the index value of the second sequence among A sequences; receives a random access signal, the random access signal being obtained based on a first sequence among W sequences, the W sequences including at least B1 sequences, the B1 sequences being obtained based on the second sequence and B1 cyclic shift values; wherein, the second sequence is obtained based on a first recursive formula among N recursive formulas and a first initial value sequence; the A sequences include N sequence sets corresponding to the N recursive formulas, the sequences in the sequence set corresponding to the first recursive formula are obtained based on the first recursive formula and at least one initial value sequence, the at least one initial value sequence including the first initial value sequence; A, W, and N are integers greater than 1, and B1 is an integer greater than or equal to 1; at least one of the following is satisfied: the cross-correlation value between the recursive formulas corresponding to two sequence sets with consecutive index values ​​in the N sequence sets is less than or equal to a first threshold; the index values ​​of multiple sequences in each sequence set are sorted according to the PAPR of the multiple sequences; the PAPR of the A sequences is less than or equal to a second threshold.

[0260] It should be understood that the division of units in the above device is merely a logical functional division. In actual implementation, they can be fully or partially integrated into a single physical entity, or they can be physically separated. Furthermore, all units in the device can be implemented entirely through software calls from processing elements; all units can be implemented entirely in hardware; or some units can be implemented through software calls from processing elements, and some units can be implemented in hardware. For example, each unit can be a separate processing element, or it can be integrated into a chip within the device. Alternatively, it can be stored as a program in memory, called and executed by a processing element of the device. Moreover, these units can be fully or partially integrated together, or implemented independently. The processing element mentioned here can also be called a processor, which can be an integrated circuit with signal processing capabilities. In the implementation process, the operations of the above methods or the various units mentioned above can be implemented through integrated logic circuits in the processor element or through software calls from processing elements.

[0261] In one example, a unit in any of the above devices can be one or more integrated circuits configured to implement the methods described above, such as: one or more application-specific integrated circuits (ASICs), or one or more digital signal processors (DSPs), or one or more field-programmable gate arrays (FPGAs), or a combination of at least two of these forms of integrated circuits. As another example, when a unit in the device can be implemented in the form of a processing element scheduler, the processing element can be a processor, such as a general-purpose central processing unit (CPU), or other processor capable of calling programs. Furthermore, these units can be integrated together and implemented as a System-on-a-Chip (SoC).

[0262] The receiving unit described above is an interface circuit of the device, used to receive signals from other devices. For example, when the device is implemented as a chip, the receiving unit is an interface circuit for the chip to receive signals from other chips or devices. The transmitting unit described above is an interface circuit of the device, used to transmit signals to other devices. For example, when the device is implemented as a chip, the transmitting unit is an interface circuit for the chip to transmit signals to other chips or devices.

[0263] Based on the same technical concept, embodiments of this application also provide a communication device, which is used to implement the functions of the first or second communication device in the above embodiments. For example... Figure 7 As shown, the device can be a communication device or a chip within a communication device. The device includes a processor 701 and a communication interface 702, and optionally, a memory 703. Figure 7 Only the main components of the communication device are shown. In addition to the processor 701 and the communication interface 702, the communication device may further include a memory 703 and input / output devices (not shown).

[0264] The processor 701 is used to execute the program code stored in the memory 703, specifically to perform the actions of the processing unit 602 described above, which will not be described in detail here. The communication interface 702 is specifically used to perform the actions of the communication unit 603 described above, which will not be described in detail here.

[0265] Processor 701 can be a CPU, a digital processing unit, etc. Processor 701 can be used to process communication protocols and communication data, control the entire communication device, execute software programs, and process software program data, such as, but not limited to, baseband-related processing. Communication interface 702 can be used for transmitting and receiving signals, such as, but not limited to, radio frequency transceiver. The above-mentioned devices can be disposed on separate chips, or at least partially or entirely on the same chip. For example, processor 701 can be further divided into an analog baseband processor and a digital baseband processor. The analog baseband processor can be integrated with the transceiver on the same chip, while the digital baseband processor can be disposed on a separate chip. With the continuous development of integrated circuit technology, more and more devices can be integrated on the same chip. For example, a digital baseband processor can be integrated with multiple application processors (such as, but not limited to, graphics processors, multimedia processors, etc.) on the same chip. Such a chip can be called a system-on-a-chip (SoC). Whether to dispose of the devices independently on different chips or integrate them on one or more chips often depends on the specific needs of the product design. This embodiment of the invention does not limit the specific implementation of the above-mentioned devices.

[0266] The communication interface 702 can be a transceiver, an interface circuit such as a transceiver circuit, or a transceiver chip, etc. Optionally, the communication interface 702 may include radio frequency (RF) circuitry and an antenna. The RF circuitry is mainly used for converting baseband signals to RF signals and processing RF signals. The antenna is mainly used for transmitting and receiving RF signals in the form of electromagnetic waves. Input / output devices, such as touchscreens, displays, and keyboards, are mainly used for receiving user input data and outputting data to the user.

[0267] Memory 703 is used to store programs executed by processor 701. Memory 703 can be non-volatile memory, such as a hard disk drive (HDD) or solid-state drive (SSD), or it can be volatile memory, such as random-access memory (RAM). Memory 703 can be any other medium capable of carrying or storing desired program code in the form of instructions or data structures that can be accessed by a computer, but is not limited to this.

[0268] When the communication device is powered on, the processor 701 can read the software program in the memory 703, interpret and execute the instructions of the software program, and process the data of the software program. When data needs to be transmitted wirelessly, the processor 701 performs baseband processing on the data to be transmitted and outputs the baseband signal to the radio frequency (RF) circuit. The RF circuit processes the baseband signal and transmits the RF signal outward in the form of electromagnetic waves through the antenna. When data is sent to the communication device, the RF circuit receives the RF signal through the antenna, converts the RF signal into a baseband signal, and outputs the baseband signal to the processor 701. The processor 701 converts the baseband signal into data and processes the data.

[0269] In another implementation, the radio frequency circuitry and antenna can be set up independently of the processor performing baseband processing. For example, in a distributed scenario, the radio frequency circuitry and antenna can be arranged remotely, independent of the communication device.

[0270] This application embodiment does not limit the specific connection medium between the communication interface 702, processor 701, and memory 703. This application embodiment... Figure 7 The memory 703, processor 701, and communication interface 702 are connected via a bus 704. Figure 7 The connections between other components are shown in bold lines only and are not intended to be limiting. Buses can be categorized as address buses, data buses, control buses, etc. For ease of illustration, Figure 7 The bus is represented by a single thick line, but this does not mean that there is only one bus or one type of bus.

[0271] Optionally, the communication device described above can be a standalone device or part of a larger device. For example, the communication device can be:

[0272] (1) An independent integrated circuit (IC), or chip, or chip system or subsystem;

[0273] (2) A collection of one or more ICs, optionally including a storage component for storing data and instructions;

[0274] (3) Application-specific integrated circuit (ASIC), such as modem;

[0275] (4) Modules that can be embedded in other devices;

[0276] (5) Receivers, smart terminals, wireless devices, handheld devices, mobile units, vehicle-mounted devices, cloud devices, artificial intelligence devices, etc.;

[0277] (6) Others, etc.

[0278] In this application embodiment, "multiple" can refer to two or more. Therefore, in this application embodiment, "multiple" can also be understood as "at least two". "At least one" can be understood as one or more, such as one, two, or more. For example, "including at least one" means including one, two, or more. For example, including at least one of A, B, and C, then it could include A, B, C, A and B, A and C, B and C, or A, B, and C. "And / or" describes the association relationship between related objects. Specifically, there can be three relationships. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, or B existing alone. Additionally, the character " / ", unless otherwise specified, generally indicates that the preceding and following related objects have an "or" relationship.

[0279] Furthermore, the terms "system" and "network" in the embodiments of this application can be used interchangeably, as can "according to" and "based on". The ordinal numbers such as "first" and "second" mentioned in the embodiments of this application are generally used to distinguish different objects and are not used to limit the order, sequence, priority, or importance of multiple objects. For example, the first communication device and the second communication device in the embodiments of this application are used to distinguish between two communication devices, and do not limit the priority or importance of these two communication devices.

[0280] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0281] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to this application. It should be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart illustrations. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0282] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0283] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

Claims

1. A communication method, characterized in that, The method includes: Receive a first index value and a second index value, wherein the first index value is the index value of the first recursive formula among N recursive formulas, and the second index value is the index value of the first initial value sequence among K initial value sequences corresponding to the first recursive formula; A random access signal is generated based on the first index value and the second index value; the random access signal is obtained based on the first sequence among W sequences, the W sequences including at least M1 sequences, the M1 sequences being obtained based on the first recursive formula, the first initial value sequence, and M1 cyclic shift values; Send the random access signal; At least one of the following must be satisfied: The cross-correlation value between two recursive formulas with adjacent index values ​​in the N recursive formulas is less than or equal to the first threshold. The index values ​​of the K initial value sequences are sorted according to the peak-to-average power ratio (PAPR) of the K sequences, and the K sequences are obtained based on the first recursive formula and the K initial value sequences. The PAPR of the K sequences is less than or equal to the second threshold; W and K are integers greater than 1, and M1 is an integer greater than or equal to 1.

2. The method according to claim 1, characterized in that, The W sequences also include M2 ​​sequences, which are obtained based on the first recursive formula, the K1 initial value sequences corresponding to the first recursive formula, and at least one cyclic shift value. Wherein, the index values ​​of the K1 initial value sequences are consecutive, and the minimum index value among the index values ​​of the K1 initial value sequences is equal to the index value of the first initial value sequence plus 1; M2 and K1 are integers greater than or equal to 1.

3. The method according to claim 1 or 2, characterized in that, The W sequences also include M3 sequences, which are obtained based on at least one recursive formula, at least one initial value sequence corresponding to the at least one recursive formula, and at least one cyclic shift value. The index values ​​of the at least one recursive formula are consecutive, and the smallest index value among the index values ​​of the at least one recursive formula is equal to the index value of the first recursive formula plus 1. M3 is an integer greater than or equal to 1.

4. The method according to any one of claims 1 to 3, characterized in that, The W sequences are Z4 sequences.

5. The method according to any one of claims 1 to 4, characterized in that, W is an integer greater than 64.

6. A communication method, characterized in that, The method includes: Send a first index value and a second index value, wherein the first index value is the index value of the first recursive formula among N recursive formulas, and the second index value is the index value of the first initial value sequence among K initial value sequences corresponding to the first recursive formula; Receive a random access signal, the random access signal being obtained based on a first sequence among W sequences, the W sequences including at least M1 sequences, the M1 sequences being obtained according to the first recursive formula, the first initial value sequence, and M1 cyclic shift values; At least one of the following must be satisfied: The cross-correlation value between two recursive formulas with adjacent index values ​​in the N recursive formulas is less than or equal to the first threshold. The index values ​​of the K initial value sequences are sorted according to the PAPR of the K sequences, and the K sequences are obtained based on the first recursive formula and the K initial value sequences; The PAPR of the K sequences is less than or equal to the second threshold; W and K are integers greater than 1, and M1 is an integer greater than or equal to 1.

7. The method according to claim 6, characterized in that, The W sequences also include M2 ​​sequences, which are obtained based on the first recursive formula, the K1 initial value sequences corresponding to the first recursive formula, and at least one cyclic shift value. Wherein, the index values ​​of the K1 initial value sequences are consecutive, and the minimum index value among the index values ​​of the K1 initial value sequences is equal to the index value of the first initial value sequence plus 1; M2 and K1 are integers greater than or equal to 1.

8. The method according to claim 6 or 7, characterized in that, The W sequences also include M3 sequences, which are obtained based on at least one recursive formula, at least one initial value sequence corresponding to the at least one recursive formula, and at least one cyclic shift value. The index values ​​of the at least one recursive formula are consecutive, and the smallest index value among the index values ​​of the at least one recursive formula is equal to the index value of the first recursive formula plus 1. M3 is an integer greater than or equal to 1.

9. The method according to any one of claims 6 to 8, characterized in that, The W sequences are Z4 sequences.

10. The method according to any one of claims 6 to 9, characterized in that, W is an integer greater than 64.

11. A communication method, characterized in that, The method includes: Receive a third index value, wherein the third index value is the index value of the second sequence among A sequences; A random access signal is generated based on the third index value; the random access signal is obtained based on the first sequence of W sequences, the W sequences including at least B1 sequences, the B1 sequences being obtained based on the second sequence and B1 cyclic shift values; Send the random access signal; Wherein, the second sequence is obtained based on the first recursive formula and the first initial value sequence among N recursive formulas; the A sequences include the N sequence sets corresponding to the N recursive formulas, the sequence in the sequence set corresponding to the first recursive formula is obtained based on the first recursive formula and at least one initial value sequence, the at least one initial value sequence includes the first initial value sequence; A, W, and N are integers greater than 1, and B1 is an integer greater than or equal to 1; At least one of the following must be satisfied: In the N sequence sets, the cross-correlation value between the recursive formulas corresponding to two sequence sets with consecutive index values ​​is less than or equal to the first threshold. The index values ​​of multiple sequences in each sequence set are sorted according to the PAPR of the multiple sequences; The PAPR of the A sequences is less than or equal to the second threshold.

12. The method according to claim 11, characterized in that, The W sequences further include B2 sequences, which are obtained from at least one of the A sequences and at least one cyclic shift value; The index values ​​of the at least one sequence are consecutive, and the minimum index value among the index values ​​of the at least one sequence is equal to the index value of the second sequence plus 1.

13. The method according to claim 12, characterized in that, The at least one sequence includes a third sequence, which belongs to the sequence set corresponding to the second recursive formula among the N recursive formulas.

14. The method according to any one of claims 11 to 13, characterized in that, All A sequences are Z4 sequences.

15. The method according to any one of claims 11 to 14, characterized in that, The W sequences are integers greater than 64.

16. A communication method, characterized in that, The method includes: Send a third index value, wherein the third index value is the index value of the second sequence among A sequences; Receive a random access signal, the random access signal being obtained based on a first sequence of W sequences, the W sequences including at least B1 sequences, the B1 sequences being obtained based on a second sequence and B1 cyclic shift values; Wherein, the second sequence is obtained based on the first recursive formula and the first initial value sequence among N recursive formulas; the A sequences include the N sequence sets corresponding to the N recursive formulas, the sequence in the sequence set corresponding to the first recursive formula is obtained based on the first recursive formula and at least one initial value sequence, the at least one initial value sequence includes the first initial value sequence; A, W, and N are integers greater than 1, and B1 is an integer greater than or equal to 1; At least one of the following must be satisfied: In the N sequence sets, the cross-correlation value between the recursive formulas corresponding to two sequence sets with consecutive index values ​​is less than or equal to the first threshold. The index values ​​of multiple sequences in each sequence set are sorted according to the PAPR of the multiple sequences; The PAPR of the A sequences is less than or equal to the second threshold.

17. The method according to claim 16, characterized in that, The W sequences further include B2 sequences, which are obtained from at least one of the A sequences and at least one cyclic shift value; The index values ​​of the at least one sequence are consecutive, and the minimum index value among the index values ​​of the at least one sequence is equal to the index value of the second sequence plus 1.

18. The method according to claim 17, characterized in that, The at least one sequence includes a third sequence, which belongs to the sequence set corresponding to the second recursive formula among the N recursive formulas.

19. The method according to any one of claims 16 to 18, characterized in that, All A sequences are Z4 sequences.

20. The method according to any one of claims 16 to 19, characterized in that, The W sequences are integers greater than 64.

21. A communication device, characterized in that, Includes units for performing the method as described in any one of claims 1 to 20.

22. A communication device, characterized in that, The device includes a processor coupled to a memory in which a computer program is stored; the processor is configured to invoke part or all of the computer program in the memory such that the method as described in any one of claims 1 to 20 is executed.

23. A communication system, characterized in that, The communication system includes a first communication device and a second communication device; wherein the first communication device is used to perform the method as described in any one of claims 1 to 5, and the second communication device is used to perform the method as described in any one of claims 6 to 10; or, the first communication device is used to perform the method as described in any one of claims 11 to 15, and the second communication device is used to perform the method as described in any one of claims 16 to 20.

24. A computer-readable storage medium, characterized in that, The storage medium stores a computer program that, when some or all of the computer program is executed by a computer, causes the method described in any one of claims 1 to 20 to be performed.

25. A computer program product, characterized in that, When the computer reads and executes the computer program product, the method described in any one of claims 1 to 20 is performed.

Images