Communication method and apparatus

Abstract

A communication method and apparatus, which can improve the sequence capacity and the sequence configuration efficiency. The method comprises: a network device sending first information, wherein the first information indicates P candidate maximum round-trip delays and Q candidate maximum Doppler frequency shifts, the P candidate maximum round-trip delays and the Q candidate maximum Doppler frequency shifts correspond to P×Q sequence sets, a sequence in the sequence sets is a cubic polynomial exponential sequence, a cubic term coefficient and a quadratic term coefficient of the cubic polynomial exponential sequence are associated, and P and Q are positive integers; a terminal device sending a first sequence, wherein the first sequence belongs to a first sequence set among the P×Q sequence sets, the first sequence set corresponds to a first maximum round-trip delay and a first maximum Doppler frequency shift, the first maximum round-trip delay is one of the P candidate maximum round-trip delays, and the first maximum Doppler frequency shift is one of the Q candidate maximum Doppler frequency shifts; and the network device receiving the first sequence, and determining a round-trip delay and / or a Doppler frequency shift of the terminal device on the basis of the first sequence.

Description

Communication method and device Technical Field

[0001] The embodiments of the present application relate to the field of communications, and in particular to communication methods and devices. Background Art

[0002] In long term evolution (LTE) or new radio (NR) systems, Zadoff-Chu sequences (ZC sequences for short) are generally used for uplink random access.

[0003] For example, the base station configures the starting ZC root sequence number, maximum round-trip delay, and maximum Doppler frequency deviation through broadcast information. The terminal device first traverses the cyclic shift and then the root sequence number, determining 64 sequences in sequence and then selecting one from the 64 sequences for random access.

[0004] However, to combat frequency offset, in scenarios where the terminal is moving at high speed, multiple root sequence numbers may be required to determine the 64 sequences. This means that if the total number of root sequence numbers is fixed, it is impossible to configure the starting ZC root sequence number for more cells. In other words, the sequence configuration efficiency of the above solution is low.

[0005] Summary of the Invention

[0006] The embodiments of the present application provide a communication method and apparatus that can improve sequence capacity and the efficiency of sequence configuration.

[0007] In a first aspect, a communication method is provided. The method can be executed by a terminal device, or by a component of the terminal device, such as a processor, chip, or chip system of the terminal device, or by a logic module or software capable of implementing all or part of the terminal device's functions. The method includes: receiving first information, the first information indicating P candidate maximum round-trip delays and Q candidate maximum Doppler shifts, the P candidate maximum round-trip delays and the Q candidate maximum Doppler shifts corresponding to P×Q sequence sets, the sequences in the sequence sets being cubic polynomial exponential sequences, the cubic coefficients of the cubic polynomial exponential sequences being associated with the quadratic coefficients of the cubic polynomial exponential sequences, and P and Q being positive integers; and sending a first sequence, the first sequence belonging to a first sequence set in the P×Q sequence sets, the first sequence set corresponding to a first maximum round-trip delay and a first maximum Doppler shift, the first maximum round-trip delay being one of the P candidate maximum round-trip delays, and the first maximum Doppler shift being one of the Q candidate maximum Doppler shifts.

[0008] Based on this solution, the sequences in the P×Q sequence set are cubic polynomial exponential sequences. Based on this sequence design, the sequence capacity can be proportional to the cube of the sequence length, which improves the sequence capacity compared to the ZC sequence. In addition, the network device can indicate at least one candidate maximum round-trip delay and at least one candidate maximum Doppler shift, so that terminal devices at different locations and different moving speeds in the cell can select appropriate maximum round-trip delay and maximum Doppler shift to determine the sequence set and select a sequence from it. When the total number of sequences M required for random access (for example, 64) is certain, since the network device divides the maximum round-trip delay and the maximum Doppler shift, the M sequences are distributed in the P×Q sequence set, that is, the parameters for determining the M sequences include P candidate maximum round-trip delays, Q candidate maximum Doppler shifts, and the cubic coefficients of the cubic polynomial exponential sequence. In other words, the same number of sequences can be determined using fewer values ​​of the cubic coefficients, thereby saving the use of the cubic coefficients, allowing the network device to configure the cubic coefficients for more cells, thereby improving the efficiency of sequence configuration.

[0009] In one possible design, the method further includes: receiving a first signal; and the first maximum round-trip delay is related to a signal quality of the first signal.

[0010] In one possible design, the first maximum Doppler shift is related to the moving speed of the terminal device.

[0011] Based on the above two possible designs, the terminal device can select the candidate maximum round-trip delay and the candidate maximum Doppler shift based on the signal quality and its own moving speed, thereby improving the configuration efficiency of the sequence.

[0012] In a second aspect, a communication method is provided. The method can be executed by a network device, or by a component of the network device, such as a processor, chip, or chip system of the network device, or by a logic module or software capable of implementing all or part of the network device's functions. The method includes: sending first information, the first information indicating P candidate maximum round-trip delays and Q candidate maximum Doppler shifts, the P candidate maximum round-trip delays and the Q candidate maximum Doppler shifts corresponding to P×Q sequence sets, the sequences in the sequence sets being cubic polynomial exponential sequences, the cubic coefficients of the cubic polynomial exponential sequences being associated with the quadratic coefficients of the cubic polynomial exponential sequences, and P and Q being positive integers; receiving a first sequence from a terminal device, the first sequence belonging to a first sequence set in the P×Q sequence sets, the first sequence set corresponding to a first maximum round-trip delay and a first maximum Doppler shift, the first maximum round-trip delay being one of the P candidate maximum round-trip delays, and the first maximum Doppler shift being one of the Q candidate maximum Doppler shifts; and determining the round-trip delay and / or Doppler shift of the terminal device based on the first sequence. Among them, the technical effects brought about by the second aspect can refer to the technical effects brought about by the above-mentioned first aspect, and will not be repeated here.

[0013] In combination with the first aspect or the second aspect, in a possible design, low ambiguity regions corresponding to different sequence sets in the P×Q sequence sets do not overlap, and / or low ambiguity regions corresponding to different sequences in the same sequence set do not overlap.

[0014] In combination with the first aspect or the second aspect, in a possible design, sequences in different sequence sets among the P×Q sequence sets do not overlap with each other.

[0015] Based on the above two possible designs, among the P×Q sequence sets, the low ambiguity areas of sequences in different sequence sets do not overlap, the sequences in different sequence sets do not overlap, and the low ambiguity areas of different sequences in the same sequence set do not overlap, which can reduce interference between terminal devices and improve the success rate of random access.

[0016] In combination with the first aspect or the second aspect, in a possible design, the p-th candidate maximum round-trip delay Δ in the P×Q sequence set is T,p and the qth candidate maximum Doppler shift Δ F,q The corresponding cubic polynomial exponential sequence in the sequence set can be expressed as:

[0017] Where λ is the cubic coefficient of the cubic polynomial exponential sequence, is the coefficient of the quadratic term of the cubic polynomial exponential sequence, is the coefficient of the first term of the cubic polynomial exponential sequence, the sequence length N of the cubic polynomial exponential sequence is a prime number, p∈{1,2,…,P},q∈{1,2,…,Q},

[0018] In combination with the first aspect or the second aspect, in one possible design, the number of sequences included in each of the P×Q sequence sets is Ω p,q for:

[0019] Where N represents the length of the cubic polynomial exponential sequence, Δ T,p represents the pth candidate maximum round trip delay, Δ F,q represents the qth candidate maximum Doppler shift, R represents the number of candidate cubic coefficients, and the operator Indicates rounding down, and the operator ∑· indicates accumulation.

[0020] Based on this possible design, since each of the P×Q sequence sets includes the same number of sequences, it is applicable to scenarios where the maximum round-trip delay and maximum Doppler shift corresponding to multiple terminal devices in a cell are uniformly distributed. In this case, the probability of a terminal device selecting any sequence set is equal, the number of sequences included in each sequence set is the same, and different terminal devices have the same probability of selecting the same sequence.

[0021] In combination with the first aspect or the second aspect, in a possible design, the pth candidate maximum round trip delay Δ T,p and the qth candidate maximum Doppler shift Δ F,q The corresponding sequence set includes Ω p,q cubic polynomial exponential sequence s p,q (n) is expressed as:

[0022] Among them, the sequence length N of the cubic polynomial exponential sequence is a prime number, λ r is the cubic coefficient of the cubic polynomial exponential sequence, λ r ∈{1,2,…,N-1},r∈{1,2,…,R},λ1≠λ2≠…≠λ R , is the coefficient of the quadratic term of the cubic polynomial exponential sequence, is the coefficient of the first term of the cubic polynomial exponential sequence,

[0023] In combination with the first aspect or the second aspect, in a possible design, the p-th candidate maximum round-trip delay Δ in the P×Q sequence set is T,p and the qth candidate maximum Doppler shift Δ F,q The number of sequences included in the corresponding sequence set Ω p,q for:

[0024] Where N represents the length of the cubic polynomial exponential sequence, R represents the number of candidate cubic coefficients, p∈{1,2,…,P},q∈{1,2,…,Q}, and the operator Indicates rounding down.

[0025] In combination with the first aspect or the second aspect, in a possible design, the total area of ​​the low ambiguity region corresponding to each sequence set in the P×Q sequence sets is the same.

[0026] The two possible designs described above are suitable for scenarios where the maximum round-trip delay and maximum Doppler shift for multiple terminal devices within a cell follow an exponential distribution. In this case, the terminal device has a higher probability of selecting the sequence set with the smaller maximum round-trip delay and maximum Doppler shift. Sequence sets with smaller maximum round-trip delay and maximum Doppler shift contain more sequences, and different terminal devices have similar probabilities of selecting the same sequence.

[0027] In combination with the first aspect or the second aspect, in a possible design, the pth candidate maximum round trip delay Δ T,p and the qth candidate maximum Doppler shift Δ F,q The corresponding sequence set includes Ω p,q cubic polynomial exponential sequence s p,q (n) is expressed as:

[0028] Among them, the sequence length N of the cubic polynomial exponential sequence is a prime number, λ r is the cubic coefficient of the cubic polynomial exponential sequence, λ r ∈{1,2,…,N-1},r∈{1,2,…,R},λ1≠λ2≠…≠λ R , is the coefficient of the quadratic term of the cubic polynomial exponential sequence, is the coefficient of the first term of the cubic polynomial exponential sequence,

[0029] In combination with the first aspect or the second aspect, in a possible design, among the P×Q sequence sets, the coefficients of the cubic terms corresponding to the sequences in any sequence set are the same.

[0030] In combination with the first aspect or the second aspect, in a possible design, the cubic term coefficients corresponding to the sequences in the first sequence set are related to the first maximum round-trip delay.

[0031] In combination with the first aspect or the second aspect, in a possible design, among the P×Q sequence sets, the cubic term coefficients corresponding to the multiple second sequence sets are the same, and the candidate maximum round-trip delays corresponding to the multiple second sequence sets are the same.

[0032] In combination with the first aspect or the second aspect, in a possible design, the p-th candidate maximum round-trip delay Δ in the P×Q sequence set is T,p The number of sequences included in the corresponding sequence set Ω p，q for:

[0033] Where N represents the length of the cubic polynomial exponential sequence, Δ F,q represents the qth candidate maximum Doppler shift, p∈{1,2,…,P},q∈{1,2,…,Q}, the operator Indicates rounding down, and the operator ∑· indicates accumulation.

[0034] In combination with the first aspect or the second aspect, in a possible design, the pth candidate maximum round trip delay Δ T,p and the qth candidate maximum Doppler shift Δ F,q The corresponding sequence set includes Ω p,q cubic polynomial exponential sequence s p,q (n) is expressed as:

[0035] Among them, the sequence length N of the cubic polynomial exponential sequence is a prime number, λ p is the cubic coefficient of the cubic polynomial exponential sequence, λ p ∈{1,2,…,N-1},p∈{1,2,…,P},λ1≠λ2≠…≠λ P , 3λ p kΔ Tp is the coefficient of the quadratic term of the cubic polynomial exponential sequence, is the coefficient of the first term of the cubic polynomial exponential sequence,

[0036] The above design is applicable to scenarios where the maximum round-trip delays for multiple terminal devices within a cell follow an exponential distribution, and the maximum Doppler shift follows a uniform distribution. In this scenario, the terminal device has a higher probability of selecting a sequence set with a smaller maximum round-trip delay. Sequence sets with smaller maximum round-trip delays contain more sequences, and different terminal devices have similar probabilities of selecting the same sequence.

[0037] In combination with the first aspect or the second aspect, in a possible design, cubic term coefficients corresponding to sequences in the first sequence set are related to the first maximum Doppler frequency shift.

[0038] In combination with the first aspect or the second aspect, in a possible design, among the P×Q sequence sets, cubic term coefficients corresponding to multiple third sequence sets are the same, and candidate maximum Doppler shifts corresponding to the multiple third sequence sets are the same.

[0039] In combination with the first aspect or the second aspect, in a possible design, the qth candidate maximum Doppler shift Δ in the P×Q sequence set is F,q The number of sequences included in the corresponding sequence set Ω p,q for:

[0040] Where N represents the length of the cubic polynomial exponential sequence, Δ T,p represents the pth candidate maximum round trip delay, p∈{1,2,…,P},q∈{1,2,…,Q}, the operator Indicates rounding down, and the operator ∑· indicates accumulation.

[0041] In combination with the first aspect or the second aspect, in a possible design, the pth candidate maximum round trip delay Δ T,p and the qth candidate maximum Doppler shift Δ F,q The corresponding sequence set includes Ω p,q cubic polynomial exponential sequence s p,q (n) is expressed as:

[0042] Among them, the sequence length N of the cubic polynomial exponential sequence is a prime number, λ q is the cubic coefficient of the cubic polynomial exponential sequence, λ q ∈{1,2,…,N-1},q∈{1,2,…,Q},λ1≠λ2≠…≠λ Q , is the coefficient of the quadratic term of the cubic polynomial exponential sequence, lΔ F,q is the coefficient of the first term of the third order polynomial exponential sequence,

[0043] The above possible design is applicable to scenarios where the maximum round-trip delays and maximum Doppler shift indicators for multiple terminal devices within a cell are evenly distributed. In this case, the terminal device has a higher probability of selecting a sequence set with a smaller maximum Doppler shift. Sequence sets with smaller maximum Doppler shifts contain more sequences, and different terminal devices have similar probabilities of selecting the same sequence.

[0044] In a third aspect, a communication device is provided for implementing various methods. The communication device may be the terminal device in the first aspect, or a device included in the terminal device, such as a chip or a chip system; or the communication device may be the network device in the second aspect, or a device included in the network device, such as a chip or a chip system. The communication device includes a module, unit, or means corresponding to the implementation method, and the module, unit, or means may be implemented by hardware, software, or by executing the corresponding software implementation by hardware. The hardware or software includes one or more modules or units corresponding to the functions.

[0045] In some possible designs, the communication device may include a processing module and a transceiver module. The processing module may be configured to implement the processing functionality of any of the above aspects and any possible implementations thereof. The transceiver module may include a receiving module and a transmitting module, respectively configured to implement the receiving functionality and the transmitting functionality of any of the above aspects and any possible implementations thereof.

[0046] In some possible designs, the transceiver module may be composed of a transceiver circuit, a transceiver, a transceiver or a communication interface.

[0047] In a fourth aspect, a communication device is provided, comprising: a processor and a memory; the memory is configured to store computer instructions, and when the processor executes the instructions, the communication device performs the method described in any aspect. The communication device may be the terminal device described in the first aspect, or a device included in the terminal device, such as a chip or a chip system; or the communication device may be the network device described in the second aspect, or a device included in the network device, such as a chip or a chip system.

[0048] In a fifth aspect, a communication device is provided, comprising: a processor and a communication interface; the communication interface is configured to communicate with a module external to the communication device; and the processor is configured to execute a computer program or instruction to cause the communication device to perform the method described in any aspect. The communication device may be the terminal device described in the first aspect, or a device included in the terminal device, such as a chip or chip system; or the communication device may be the network device described in the second aspect, or a device included in the network device, such as a chip or chip system.

[0049] In a sixth aspect, a communication device is provided, comprising: at least one processor; the processor is configured to execute a computer program or instruction stored in a memory, so that the communication device performs the method described in any aspect. The memory may be coupled to the processor, or may be independent of the processor. The communication device may be the terminal device described in the first aspect, or a device included in the terminal device, such as a chip or chip system; or the communication device may be the network device described in the second aspect, or a device included in the network device, such as a chip or chip system.

[0050] In the seventh aspect, a communication device is provided, which may be a terminal device, or a module or unit (for example, a chip, or a chip system, or a circuit) in a terminal device that corresponds one-to-one to the method / operation / step / action described in the first aspect, or a module or unit that can be used in conjunction with a terminal device. Alternatively, the communication device may also be a network device, or a module or unit (for example, a chip, or a chip system, or a circuit) in a network device that corresponds one-to-one to the method / operation / step / action described in the second aspect, or a module or unit that can be used in conjunction with a network device.

[0051] In an eighth aspect, a computer-readable storage medium is provided, in which a computer program or instruction is stored. When the computer-readable storage medium is run on a communication device, the communication device can execute the method described in either the first aspect or the second aspect.

[0052] In a ninth aspect, a computer program product comprising instructions is provided, which, when executed on a communication device, enables the communication device to execute the method described in any one of the first aspect or the second aspect.

[0053] In a tenth aspect, a communication device is provided (for example, the communication device may be a chip or a chip system), which includes a processor for implementing the functions involved in any one of the first aspect or the second aspect.

[0054] In some possible designs, the communication device includes a memory for storing necessary program instructions and data.

[0055] In some possible designs, when the device is a chip system, it can be composed of a chip or include a chip and other discrete devices.

[0056] It can be understood that when the communication device provided in any one of the third to ninth aspects is a chip, the sending action / function of the communication device can be understood as output information, and the receiving action / function of the communication device can be understood as input information.

[0057] Among them, the technical effects brought about by any design method in the third to tenth aspects can refer to the technical effects brought about by different design methods in the first or second aspects, and will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0058] FIG1 is a schematic structural diagram of a communication system provided by the present application;

[0059] FIG2 is a flow chart of a communication method provided by the present application;

[0060] FIG3 is a schematic diagram of a method for dividing a sequence set provided in this application;

[0061] FIG4 is a schematic diagram of another method for dividing sequence sets provided in this application;

[0062] FIG5 is a schematic diagram of another method for dividing sequence sets provided in the present application;

[0063] FIG6 is a schematic diagram of another method for dividing sequence sets provided in the present application;

[0064] FIG7 is a schematic structural diagram of a communication device provided by the present application;

[0065] FIG8 is a schematic structural diagram of another communication device provided by the present application;

[0066] FIG9 is a schematic structural diagram of yet another communication device provided in this application. DETAILED DESCRIPTION

[0067] In the description of this application, unless otherwise specified, " / " indicates that the objects associated before and after are in an "or" relationship, for example, A / B can represent A or B; "and / or" in this application is merely a description of the association relationship of associated objects, indicating that three relationships may exist, for example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural.

[0068] In the description of this application, unless otherwise specified, "plurality" means two or more than two. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, or c can mean: a, b, c, a and b, a and c, b and c, a, b, and c, where a, b, and c can be single or plural.

[0069] In addition, to facilitate the clear description of the technical solutions of the embodiments of the present application, in the embodiments of the present application, the words "first" and "second" are used to distinguish between identical or similar items with substantially the same functions and effects. Those skilled in the art will understand that the words "first" and "second" do not limit the quantity or execution order, and the words "first" and "second" do not necessarily mean different.

[0070] In the embodiments of this application, words such as "exemplary" or "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design described as "exemplary" or "for example" in the embodiments of this application should not be construed as being preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner to facilitate understanding.

[0071] It will be understood that the “embodiment” mentioned throughout the specification means that the specific features, structures or characteristics related to the embodiment are included in at least one embodiment of the present application. Therefore, the various embodiments throughout the specification do not necessarily refer to the same embodiment. In addition, these specific features, structures or characteristics can be combined in one or more embodiments in any suitable manner. It will be understood that in the various embodiments of the present application, the size of the sequence number of each process does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiment of the present application.

[0072] It is understood that some optional features in the embodiments of the present application may, in certain scenarios, be implemented independently of other features, such as the solution on which they are currently based, to solve corresponding technical problems and achieve corresponding effects. They may also be combined with other features in certain scenarios as needed. Accordingly, the devices provided in the embodiments of the present application may also implement these features or functions accordingly, which will not be described in detail here.

[0073] In this application, unless otherwise specified, the same or similar parts between the various embodiments can be referenced to each other. In the various embodiments of this application, unless otherwise specified and there is no logical conflict, the terms and / or descriptions between different embodiments are consistent and can be referenced to each other. The technical features in different embodiments can be combined to form new embodiments based on their inherent logical relationships. The following description of the embodiments of this application does not constitute a limitation on the scope of protection of this application.

[0074] The technical solution provided in this application can be used in various communication systems, which may be a third generation partnership project (3GPP) communication system, for example, a fourth generation (4G) long term evolution (LTE) system, an evolved LTE system (LTE-Advanced, LTE-A) system, a fifth generation (5G) new radio (NR) system, a sixth generation (6G) communication system, a communication perception integrated system, a perception system, a vehicle to everything (V2X) system, a system of LTE and NR hybrid networking, or a device to device (D2D) system, a machine to machine (M2M) communication system, an Internet of Things (IoT), an industrial Internet, a non-terrestrial network (NTN), other next generation communication systems, etc. Alternatively, the communication system may also be a non-3GPP communication system, without limitation.

[0075] Among them, the above-mentioned communication system applicable to the present application is only an example, and the communication system applicable to the present application is not limited to this. It is uniformly described here and will not be repeated below.

[0076] Referring to Figure 1 , an exemplary communication system provided by the present application is shown, which includes at least one network device (such as 110a and 110b in Figure 1 ) and at least one terminal device (such as 120a to 120j in Figure 1 ).

[0077] Optionally, terminal devices, network devices, and network devices can communicate with each other via wired or wireless means. Figure 1 is merely a schematic diagram. The communication system may also include other devices, such as wireless relay devices, wireless backhaul devices, and core network devices, which are not shown in Figure 1. The number of network devices and terminal devices in Figure 1 is merely an example. The communication system may include more or fewer network devices or terminal devices than shown in Figure 1.

[0078] Optionally, the terminal device may be a user-side device with wireless transceiver functions, or may be a chip or chip system provided in the device. The terminal device may also be referred to as user equipment (UE), terminal, access terminal, user unit, user station, mobile station (MS), remote station, remote terminal, mobile terminal (MT), user terminal, wireless communication device, user agent or user device, etc. The terminal device may be, for example, a terminal device in IoT, V2X, D2D, M2M, 5G network, or a future evolved public land mobile network (PLMN). The terminal device may be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; it may also be deployed on water (such as ships, etc.); it may also be deployed in the air (such as airplanes, balloons and satellites, etc.).

[0079] Exemplarily, the terminal device may be a drone, an IoT device (e.g., a sensor, an electricity meter, a water meter, etc.), a V2X device, a station (ST) in a wireless local area network (WLAN), a cellular phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA) device, a handheld device with wireless communication function, a computing device or other processing device connected to a wireless modem, an in-vehicle device, a wearable device (also referred to as a wearable smart device), a tablet computer or a computer with wireless transceiver function, a virtual reality (VR) terminal, a wireless terminal in industrial control, a wireless terminal in self-driving, a wireless terminal in remote medical care, a wireless terminal in a smart grid, a wireless terminal in transportation safety, a wireless terminal in a smart city, a smart home, or a similar device. The terminal device can be a mobile or fixed device, which is not specifically limited in this application.

[0080] Optionally, the network device may be a network-side device with wireless transceiver functions, or may be a chip or chip system provided in the device, located in the radio access network (RAN) of the mobile communication system, for providing access services for terminal devices. The network device can be an evolutionary Node B (eNB or eNodeB) in an LTE or evolved LTE system (LTE-Advanced, LTE-A), such as a traditional macro base station eNB and a micro base station eNB in ​​a heterogeneous network scenario; or it can be a next generation node B (gNodeB or gNB) in a 5G system; or it can be a transmission reception point (TRP); or it can be a base station in a future evolved PLMN; or it can be a broadband network service gateway (BNG), an aggregation switch or a non-3GPP access device; or it can be a wireless controller in a cloud radio access network (CRAN); or it can be an access point (AP) in a WiFi system; or it can be a wireless relay node or a wireless backhaul node; or it can be a device that implements base station functions in IoT, V2X, D2D, or M2M, and the embodiments of the present application do not specifically limit this. Exemplarily, the base stations in the embodiments of the present application may include various forms of base stations, such as: macro base stations, micro base stations (also called small stations), relay stations, access points, etc., and the embodiments of the present application do not specifically limit this.

[0081] In some scenarios, the network device may also be a module or unit that can implement some or all of the functions of a base station. For example, the network device may be a centralized unit (CU), a distributed unit (DU), a CU and DU, a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU). The CU and DU may be configured separately or included in the same network element, such as a baseband unit (BBU). The RU may be included in a radio frequency device or radio frequency unit, such as a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH).

[0082] In different systems, CU (or CU-CP and CU-UP), DU or RU may also have different names, but those skilled in the art can understand their meanings. For example, the network device may be a network device or a module of a network device in an open radio access network (open RAN, ORAN) system. In the ORAN system, CU may also be referred to as open (open, O)-CU, DU may also be referred to as O-DU, CU-CP may also be referred to as O-CU-CP, CU-UP may also be referred to as O-CU-UP, and RU may also be referred to as O-RU. Any of the CU (or CU-CP, CU-UP), DU and RU in this application may be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0083] In some scenarios, the network device may also be called a RAN node, a RAN device, or an access network device, or the network device may also have other naming methods, which is not specifically limited in this application.

[0084] In some scenarios, the roles of network devices and terminal devices are relative. For example, network element 120i in Figure 1 can be a helicopter or drone, which can be configured as a mobile base station. For terminal device 120j that accesses the RAN through network element 120i, network element 120i is a base station; however, for network element 110a, network element 120i is a terminal device. Network devices and terminal devices are sometimes referred to as communication devices. For example, network elements 110a and 110b in Figure 1 can be understood as communication devices with base station functions, and network elements 120a-120j can be understood as communication devices with terminal functions.

[0085] All or part of the functions of the terminal device or network device in this application may also be implemented through software functions running on hardware, or through virtualization functions instantiated on a platform (such as a cloud platform). The terminal device or network device in this application may also be a logical node, logical module or software that can implement all or part of the functions of the terminal device or network device.

[0086] It should be noted that the communication system described in the embodiment of the present application is intended to more clearly illustrate the technical solution of the embodiment of the present application, and does not constitute a limitation on the technical solution provided in the embodiment of the present application. Ordinary technicians in this field can know that with the evolution of network architecture and the emergence of new business scenarios, the technical solution provided in the embodiment of the present application is also applicable to similar technical problems.

[0087] In order to facilitate understanding of the technical solutions of the embodiments of the present application, a brief introduction to the relevant technologies of the present application is first given as follows.

[0088] (1) Correlation: Sequence correlation can be used to measure the impact of transmission delay on the transmitted signal. Sequence correlation can be reflected by the correlation value obtained by correlation operation.

[0089] A correlation operation refers to the processing between two sequences, including multiplication and addition operations between different elements of the two sequences. Correlation operations can be periodic or aperiodic. In aperiodic correlation, the correlation value of the overlapping elements of the two sequences is calculated by the relative shift between the sequences. In periodic correlation, the correlation value of the two sequences is calculated by the relative cyclic shift between the sequences.

[0090] (2) Autocorrelation: If two series are identical, then the correlation between them is called autocorrelation.

[0091] (3) Cross-correlation: If two sequences are different, then the correlation between them is called cross-correlation.

[0092] (4) Ambiguity function: The ambiguity function can be used to measure the impact of Doppler frequency shift and transmission delay on the transmitted signal. There are two types of ambiguity functions: self-ambiguity function and mutual ambiguity function.

[0093] Self-ambiguity function: It can represent the correlation between signal #1 and signal #2, where signal #2 is the signal of signal #1 after being affected by time delay and Doppler frequency shift.

[0094] Mutual ambiguity function: It can represent the correlation between signal #A and signal #B, where signal #A is the signal of signal #C after being affected by time delay and Doppler frequency shift, and signal #B and signal #C are in the same sequence set.

[0095] (5) Zero ambiguity zone: The zero ambiguity zone means that the ambiguity function is equal to zero within a certain delay and Doppler range.

[0096] (6) Low ambiguity zone: The low ambiguity zone refers to the area within a certain delay and Doppler range where the ambiguity function value is less than the preset threshold.

[0097] (7) Zero correlation zone: The zero correlation zone refers to the area within a certain time delay interval (without Doppler frequency offset) where the correlation function is equal to zero.

[0098] (8) Low correlation zone: The low correlation zone refers to a region within a certain time delay interval (without Doppler frequency deviation) where the correlation function value is less than a preset threshold.

[0099] (9) Sequence capacity: Sequence capacity refers to the number of sequences contained in a sequence set.

[0100] Currently, communication sequences are widely used in long-term evolution (LTE) or new radio (NR) systems. The correlation of sequences can be used to achieve downlink synchronization and uplink random access, and the orthogonality of sequences can be used to achieve pilot multiplexing.

[0101] In LTE or NR, Zadoff-Chu sequence (ZC sequence for short) is usually used for uplink random access. As an implementation, ZC sequence s u,k (n) can be expressed as:

[0102] Where u represents the root sequence number, u∈{1,2,…,N-1}, k represents the cyclic shift index, Δ T Indicates the relevant area, operator Indicates rounding down, N indicates the sequence length of the ZC sequence, and N is a prime number.

[0103] Generally, multiple ZC sequences generated by different cyclic shifts of the same root sequence number can form a zero correlation zone, and ZC sequences generated by any cyclic shift of different root sequence numbers can form a low correlation zone. It can be seen that for a certain root sequence number u, the ZC sequence obtained based on the above formula (1) is ZC sequence A zero correlation zone is formed in the time delay domain.

[0104] For high-speed moving scenes, there is Doppler shift, s u,k The fuzzy function of (n) has multiple peaks. For example, s u,k The fuzzy function A(τ,v) of (n) can be expressed as:

[0105] Where τ represents the transmission delay and v represents the Doppler shift.

[0106] In order to improve the ability of the ZC sequence to resist frequency offset, the cyclic shift can be restricted, that is, the cyclic shift is obtained according to the restriction set. For example, the ZC sequence with restricted cyclic shift can be expressed as:

[0107] Among them, C k represents cyclic shift, C kDerived from restricted sets. Currently, there are restricted sets Type A (used to mitigate a single subcarrier frequency offset) and Type B (used to mitigate a double subcarrier frequency offset). The number of cyclic shifts available in restricted sets Type A does not exceed one-third of that in unrestricted sets, and the number of cyclic shifts available in restricted sets Type B does not exceed one-fifth of that in unrestricted sets.

[0108] When performing uplink random access, the network device can broadcast the starting root sequence number and the maximum round-trip delay Δ through the system information block 1 (SIB1). T , maximum Doppler shift Δ F The terminal device determines 64 preamble code sequences according to one or more root sequence numbers including the starting root sequence number, following the principle of "traversing the cyclic shift first and then traversing the root sequence number", and then selects a preamble code sequence from the 64 preamble code sequences to initiate random access.

[0109] For example, with a ZC sequence length of N=839, the maximum round-trip delay Δ T =15, maximum Doppler shift Δ F =1,3,5, the starting root sequence number u=21 as an example, as shown in Table 1, Δ F =1 (no need to combat frequency offset), 64 preamble code sequences need to be generated through 2 root sequence numbers and corresponding cyclic shifts. As shown in Table 2, Δ F =3 (needing to counteract the frequency deviation of ±1 subcarrier spacing), 64 preamble code sequences need to be generated through 3 root sequence numbers and corresponding cyclic shifts. As shown in Table 3, Δ F =5 (needing to combat a frequency offset of ±2 subcarrier spacings), 64 preamble code sequences need to be generated using 5 root sequence numbers and corresponding cyclic shifts.

[0110] Table 1 Δ F =1

[0111] Table 2 Δ F =3

[0112] Table 3 Δ F =5

[0113] The sequence capacity of the ZC sequence is positively correlated with the square of the sequence length. For example, the sequence capacity corresponding to the unrestricted set of cyclic shifts is The sequence capacity is relatively limited. Furthermore, for high-speed mobile scenarios, the sequence capacity corresponding to the cyclic shift restriction set type does not exceed The sequence capacity is further reduced.

[0114] In addition, the network device configures the same maximum round-trip delay Δ for all terminal devices in the cell. T and the maximum Doppler shift Δ F , requiring a large number of root sequence numbers to determine a certain number of sequences (e.g., 64). Consequently, given a fixed total number of root sequence numbers, it is impossible to configure starting root sequence numbers for more cells. This means that the sequence configuration efficiency in the above solution is low.

[0115] Based on this, the present application provides a cubic polynomial exponential sequence whose sequence capacity is proportional to the cube of the sequence length, thereby improving sequence capacity. Furthermore, a network device can indicate at least one candidate maximum round-trip delay and at least one candidate maximum Doppler shift, allowing terminal devices at different locations and speeds within a cell to select appropriate maximum round-trip delay and maximum Doppler shift to determine the preamble sequence, thereby improving the efficiency of sequence configuration.

[0116] The following will describe the communication method provided in the embodiment of the present application in detail with reference to the accompanying drawings, taking the interaction between the network device and the terminal device shown in FIG1 as an example.

[0117] It is understood that in the embodiments of the present application, the network device or terminal device may perform some or all of the steps in the embodiments of the present application. These steps or operations are merely examples, and the embodiments of the present application may also perform other operations or variations of various operations. In addition, the various steps may be performed in a different order than those presented in the embodiments of the present application, and it is possible that not all of the operations in the embodiments of the present application need to be performed.

[0118] It should be noted that the message names between the devices or the names of the parameters in the messages in the following embodiments of the present application are only examples. Other names may be used in specific implementations, and the embodiments of the present application do not specifically limit this.

[0119] FIG2 is a flow chart of a communication method provided in an embodiment of the present application, which includes the following steps:

[0120] S201: A network device sends first information. Correspondingly, a terminal device receives the first information from the network device.

[0121] The first information indicates P candidate maximum round trip delays and Q candidate maximum Doppler shifts, where P and Q are positive integers. For example, the P candidate maximum round trip delays can be expressed as Δ T,1 ,Δ T,2,…,Δ T,P ; Q candidate maximum Doppler shifts can be expressed as Δ F,1 ,Δ F,2 ,…,Δ F,Q .

[0122] Among them, P candidate maximum round-trip delays and Q candidate maximum Doppler shifts correspond to P×Q sequence sets. That is, the pth candidate maximum round-trip delay Δ T,p and the qth candidate maximum Doppler shift Δ F,q Corresponding to a sequence set, p∈{1,2,…,P},q∈{1,2,…,Q}.

[0123] Wherein, the sequence in each sequence set is a cubic polynomial exponential sequence. The cubic term coefficient of the cubic polynomial exponential sequence is associated with the quadratic term coefficient of the cubic polynomial exponential sequence. Exemplarily, the cubic polynomial exponential sequence can be expressed as:

[0124] Wherein, a is the coefficient of the cubic term of the cubic polynomial exponential sequence, b is the coefficient of the quadratic term of the cubic polynomial exponential sequence, c is the coefficient of the linear term of the cubic polynomial exponential sequence, d is the constant term of the cubic polynomial exponential sequence, and N is the sequence length of the cubic polynomial exponential sequence. N can be a prime number, n∈{0,1,…,N-1}.

[0125] It can be understood that the constant term d of the cubic polynomial exponential sequence can be regarded as the sequence s a,b,c,d All symbols in (n) are rotated by a common phase e -j2πd / N Since phase rotation does not change the correlation and ambiguity of the sequence, without loss of generality, when d = 0, the cubic polynomial exponential sequence degenerates to For the convenience of description, the following embodiments of the present application are described by taking d=0 as an example.

[0126] As one possible implementation, the cubic term coefficient and the quadratic term coefficient of the cubic polynomial exponential sequence are correlated, which can be understood as follows: the cubic term coefficient can be used to determine the quadratic term coefficient. For example, the cubic term coefficient a and the quadratic term coefficient b can satisfy: b = 3aX. X will be described in detail in subsequent embodiments and is not detailed here.

[0127] As a possible implementation, the low ambiguity regions corresponding to different sequence sets in the P × Q sequence sets do not overlap. The low ambiguity region corresponding to a sequence set can be understood as the sum of the low ambiguity regions of all sequences in the sequence set. Alternatively, the low ambiguity regions of sequences in different sequence sets do not overlap. For example, if sequence 1 and sequence 2 belong to sequence sets 1 and 2, respectively, then the low ambiguity regions of sequence 1 and sequence 2 do not overlap. Alternatively, the low ambiguity regions of different sequences in the same sequence set do not overlap. For example, if sequence 3 and sequence 4 both belong to sequence set 1, then the low ambiguity regions of sequence 3 and sequence 4 do not overlap.

[0128] As a possible implementation, sequences in different sequence sets among the P×Q sequence sets do not overlap with each other, or in other words, different sequence sets do not include the same sequence, that is, a certain sequence belongs to only one sequence set.

[0129] As a possible implementation, the network device may send the first information in system information or a system message. For example, the first information may be carried in SIB1, or the first information may be carried in other system messages, which is not specifically limited in this application.

[0130] As a possible implementation, the network device may further configure the terminal device with the sequence length N, the total number of sequences M required for random access (eg, 64), the coefficient of the starting cubic term, and the like.

[0131] S202: The terminal device sends a first sequence. Correspondingly, the network device receives the first sequence from the terminal device.

[0132] The first sequence belongs to the first sequence set among the P×Q sequence sets. The first sequence set corresponds to a first maximum round-trip delay and a first maximum Doppler shift. The first maximum round-trip delay is one of the P candidate maximum round-trip delays, and the first maximum Doppler shift is one of the Q candidate maximum Doppler shifts.

[0133] As a possible implementation, the first maximum round-trip delay is related to the signal quality of the first signal. The first signal may be a signal from the network device received by the terminal device before step S202. The first signal may be, for example, a secondary synchronization signal (SSS) signal. The signal quality may be represented by reference signal received power (RSRP), reference signal received quality (RSRQ), etc. In addition, the first maximum Doppler shift is related to the moving speed of the terminal device.

[0134] Illustratively, before step S202, the terminal device may select a first maximum round-trip delay from P candidate maximum round-trip delays based on the signal quality of the first signal, and select a first maximum Doppler shift from Q candidate maximum Doppler shifts based on the terminal device's own moving speed. For example, when the signal quality of the first signal is high, the first maximum round-trip delay is low, and when the moving speed of the terminal device is high, the first maximum Doppler shift is also high.

[0135] As a possible implementation, after determining the first maximum round-trip delay and the first maximum Doppler shift, the terminal device can determine its corresponding first sequence set, randomly select a sequence in the first sequence set as the first sequence, generate a first signal based on the first sequence (such as mapping the first sequence to time domain and / or frequency domain resources), and send the first signal.

[0136] As a possible implementation, the network device receiving the first sequence may include: the network device performing blind detection based on a set of P×Q sequences. Exemplarily, the network device may receive a second signal, process the second signal to obtain a second sequence, and then determine the first sequence based on the second sequence. The second signal may be understood as the first signal after transmission through a channel, the second sequence may be understood as the first sequence after time and / or frequency offset, or the second sequence may be understood as the first sequence after transmission through a channel.

[0137] Exemplarily, processing the second signal to obtain the second sequence may include: sampling the second signal, removing the cyclic prefix (CP), and then performing N FFT Point fast Fourier transform (FFT), and then N point inverse discrete Fourier transform (IDFT) to obtain the second sequence. FFT is the number of sampling points, and N FFT >N.

[0138] Exemplarily, determining the first sequence based on the second sequence may include: without considering Doppler frequency shift, using the second sequence and sequences in the P×Q sequence set to perform a correlation operation, thereby determining the first sequence; while considering Doppler frequency shift, using the second sequence and sequences in the sequence set with different Doppler frequency shifts to perform a correlation operation, thereby determining the first sequence.

[0139] In a possible implementation, the first sequence can be used as a random access preamble sequence, and the terminal device sending the first sequence can be understood as the terminal device initiating random access. After receiving the first sequence, the network device can perform subsequent random access procedures.

[0140] S203: The network device determines the round-trip delay and / or Doppler shift of the terminal device according to the first sequence.

[0141] As a possible implementation, the network device may determine the round-trip delay and / or Doppler shift of the terminal device based on the correlation operation results of the first sequence and the second sequence. In addition, the network device may determine the timing advance (TA) based on the round-trip delay of the terminal device, and / or determine the frequency offset (FO) based on the Doppler shift of the terminal device. Thereafter, the network device may send indication information to the terminal device, indicating the determined TA and / or FO, so that the terminal device communicates with the network device according to the TA and / or FO.

[0142] Based on the solution of the present application, the sequences in the P×Q sequence set are cubic polynomial exponential sequences. Based on the sequence design, the sequence capacity can be proportional to the cube of the sequence length, which improves the sequence capacity compared to the ZC sequence. In addition, the network device can indicate at least one candidate maximum round-trip delay and at least one candidate maximum Doppler shift, so that terminal devices at different locations and different moving speeds in the cell can select appropriate maximum round-trip delay and maximum Doppler shift to determine the sequence set and select a sequence from it. When the total number of sequences M (for example, 64) required for random access is certain, since the network device divides the maximum round-trip delay and the maximum Doppler shift, the M sequences are distributed in the P×Q sequence set, that is, the parameters for determining the M sequences include P candidate maximum round-trip delays, Q candidate maximum Doppler shifts, and cubic coefficients of the cubic polynomial exponential sequence. In other words, the same number of sequences can be determined using fewer values ​​of the cubic coefficients, thereby saving the use of the cubic coefficients, allowing the network device to configure the cubic coefficients for more cells, thereby improving the efficiency of sequence configuration.

[0143] In addition, among the P×Q sequence sets, the low ambiguity areas of sequences in different sequence sets do not overlap, the sequences in different sequence sets do not overlap, and the low ambiguity areas of different sequences in the same sequence set do not overlap, which can reduce interference between terminal devices and improve the success rate of random access.

[0144] The communication method provided in the present application is described above. The following describes the sequences in the P×Q sequence set and the method of dividing the sequences.

[0145] For example, the p-th candidate maximum round trip delay Δ in the P×Q sequence set is T,p and the qth candidate maximum Doppler shift Δ F,q The corresponding cubic polynomial exponential sequence in the sequence set can be expressed as:

[0146] Where a=λ is the cubic coefficient of the cubic polynomial exponential sequence, is the coefficient of the quadratic term of the cubic polynomial exponential sequence, is the coefficient of the first term of the cubic polynomial exponential sequence, d=0 is the constant term of the cubic polynomial exponential sequence, N is the sequence length of the cubic polynomial exponential sequence, N can be a prime number, p∈{1,2,…,P},q∈{1,2,…,Q}, satisfying

[0147] Among them, for different sequence set division methods, and There may be different implementations. For example, for the division of P×Q sequence sets, this application provides the following four division methods:

[0148] Method 1: The number of sequences included in each of the P×Q sequence sets is the same. For example, the number of sequences included in each sequence set is Ω p，q for:

[0149] Where N represents the length of the cubic polynomial exponential sequence, Δ T,p represents the pth candidate maximum round trip delay, Δ F,q represents the qth candidate maximum Doppler shift, R represents the number of candidate cubic coefficients, p∈{1,2,…,P},q∈{1,2,…,Q}, and the operator Indicates rounding down, and the operator ∑· indicates accumulation.

[0150] In the first approach, the pth candidate maximum round trip delay Δ T,p and the qth candidate maximum Doppler shift Δ F,q The corresponding sequence set includes Ω p,q cubic polynomial exponential sequence s p,q (n) is expressed as:

[0151] The sequence length N of the cubic polynomial exponential sequence may be a prime number, n=0, 1, ...N-1.

[0152] a=λ=λ r , is the cubic coefficient of the cubic polynomial exponential sequence, λ r ∈{1,2,…,N-1},r∈{1,2,…,E},λ1≠λ2≠…≠λ R , that is, λ rThe value of is not related to the maximum round-trip delay and the maximum Doppler shift. r can be understood as the index of the cubic coefficient.

[0153] is the coefficient of the quadratic term of the cubic polynomial exponential sequence, Right now

[0154] is the coefficient of the first term of the cubic polynomial exponential sequence,

[0155] Optional, parameter λ r Can be associated with a cell. For example, the same cell corresponds to the same λ r Different cells correspond to different λ r value; or, the same cell corresponds to multiple λ r Different cells correspond to different λ r The network device can configure the starting λ for a cell. r The value of λ corresponding to the cell is determined when the total number of sequences M required for random access is determined. r The number of can be determined based on the starting λ r The value of each λ can be determined r The value of .

[0156] parameter and Can be associated with a sequence set. For example, for different sequence sets in P×Q sequence sets, the parameter and / or The value of can be different. For different sequences in the same sequence set, the parameter and / or The value of is also different.

[0157] For example, with P=Q=3, Δ T,1 =Δ T ,Δ T,2 =2Δ T ,Δ T,3 =3Δ T , Δ F,1 =Δ F ,Δ F,2 =2Δ F ,Δ F,3 =3Δ F , Δ T and Δ FThey are the minimum unit of round-trip delay and the minimum unit of Doppler frequency shift, respectively. Taking 4 sequences in each sequence set as an example, as shown in Figure 3, the division method of each sequence set in the delay-Doppler plane is shown. (a), (b), and (c) in Figure 3 represent different λ r The sequence set corresponding to the value. It can be seen that in this way, different λ r The values ​​correspond to the same way of dividing the sequence set, that is, the way of dividing the sequence set does not depend on the values ​​of the cubic coefficients.

[0158] As shown in (a), (b), and (c) of Figure 3, the horizontal axis represents the delay domain and the vertical axis represents the Doppler domain. Each rectangle corresponds to a sequence, and the area of ​​the rectangle represents the low ambiguity area of ​​the sequence. Sequences corresponding to rectangles with the same filling pattern belong to the same sequence set. If the unit scale on the horizontal axis is Δ T , the unit scale on the vertical axis is Δ F , then under different values ​​of p and q, and The values ​​of can be as follows:

[0159] p=1,q=1,that is,Δ T,1 ,Δ F,1 The sequence parameters contained in the corresponding sequence set <0,0>,<1,0>,<0,1>,<1,1>;

[0160] p=2,q=1, that is, Δ T,2 ,Δ F,1 The sequence parameters contained in the corresponding sequence set <2,0>,<4,0>,<2,1>,<4,1>;

[0161] p=3,q=1, that is, Δ T,3 ,Δ F,1 The sequence parameters contained in the corresponding sequence set <6,0>,<9,0>,<6,1>,<9,1>;

[0162] p=1,q=2, that is, Δ T1 ,Δ F2 The sequence parameters contained in the corresponding sequence set <0,2>,<1,2>,<0,4>,<1,4>;

[0163] p=2,q=2,that is,Δ T,2 ,Δ F,2 The sequence parameters contained in the corresponding sequence set <2,2>,<4,2>,<2,4>,<4,4>;

[0164] p=3,q=2, that is, Δ T,3 ,Δ F,2 The sequence parameters contained in the corresponding sequence set <6,2>,<9,2>,<6,4>,<9,4>;

[0165] p=1,q=3,that is,Δ T,1 ,Δ F,3 The sequence parameters contained in the corresponding sequence set <0,6>,<1,6>,<0,9>,<1,9>;

[0166] p=2,q=3,that is,Δ T,2 ,Δ F,3 The sequence parameters contained in the corresponding sequence set <2,6>,<4,6>,<2,9>,<4,9>;

[0167] p=3,q=3,that is,Δ T,3 ,Δ F,3 The sequence parameters contained in the corresponding sequence set <6,6>,<9,6>,<6,9>,<9,9>.

[0168] Based on the above approach 1, since each of the P×Q sequence sets includes the same number of sequences, this approach is applicable to scenarios where the maximum round-trip delay and maximum Doppler shift corresponding to multiple terminal devices in a cell are uniformly distributed. In this case, the probability of a terminal device selecting any sequence set is equal. Since each sequence set includes the same number of sequences, different terminal devices have the same probability of selecting the same sequence.

[0169] Method 2: The total area of ​​the low ambiguity region corresponding to each sequence set in the P×Q sequence sets is the same. For example, the total area of ​​the low ambiguity region corresponding to the sequence set may be the sum of the areas of the low ambiguity regions of each sequence in the sequence set.

[0170] For example, in the second approach, the maximum round trip delay Δ of the pth candidate in the P×Q sequence set is T,p and the qth candidate maximum Doppler shift Δ F,q The number of sequences included in the corresponding sequence set Ω p,q for:

[0171] Where N represents the length of the cubic polynomial exponential sequence, R represents the number of candidate cubic coefficients, p∈{1,2,…,P},q∈{1,2,…,Q}, and the operator Indicates rounding down.

[0172] In the second approach, the pth candidate maximum round trip delay ΔT,p and the qth candidate maximum Doppler shift Δ F,q The corresponding sequence set includes Ω p,q cubic polynomial exponential sequence s p,q (n) is expressed as:

[0173] The sequence length N of the cubic polynomial exponential sequence may be a prime number, n=0, 1, ...N-1.

[0174] a=λ=λ r , is the cubic coefficient of the cubic polynomial exponential sequence, λ r ∈{1,2,…,N-1},r∈{1,2,…,R},λ1≠λ2≠…≠λ R , that is, λ r The value of is not related to the maximum round-trip delay and the maximum Doppler shift. r can be understood as the index of the cubic coefficient.

[0175] is the coefficient of the quadratic term of the cubic polynomial exponential sequence, Right now

[0176] is the coefficient of the first term of the cubic polynomial exponential sequence,

[0177] Optional, parameter λ r Can be associated with a cell. Parameters and It can be associated with a sequence set. Please refer to the relevant description in the above method 1, which will not be repeated here.

[0178] For example, with P=Q=2, Δ T,1 =Δ T ,Δ T,2 =2Δ T , Δ F,1 =Δ F ,Δ F,2 =2Δ F , Δ T and Δ F Taking the minimum unit of round-trip delay and the minimum unit of Doppler frequency shift as an example, Figure 4 shows the division method of each sequence set in the delay-Doppler plane. (a), (b), and (c) in Figure 4 are different λ r The sequence set corresponding to the value. It can be seen that under this method, different λ rThe values ​​correspond to the same way of dividing the sequence set, that is, the way of dividing the sequence set does not depend on the values ​​of the cubic coefficients.

[0179] As shown in Figures 4 (a), (b), and (c), the horizontal axis represents the delay domain, and the vertical axis represents the Doppler domain. Each rectangle corresponds to a sequence, and the area of ​​the rectangle represents the area of ​​the low-ambiguity region for that sequence. Sequences corresponding to rectangles with the same fill pattern belong to the same sequence set. The sequence set corresponding to p = 1, q = 1 includes 16 sequences, the sequence set corresponding to p = 2, q = 1 includes 8 sequences, the sequence set corresponding to p = 1, q = 2 includes 8 sequences, and the sequence set corresponding to p = 2, q = 2 includes 4 sequences.

[0180] As shown in (a), (b), and (c) of FIG4 , although the number of sequences included in different sequence sets may be different, the total area of ​​the low ambiguity region corresponding to each sequence set is the same.

[0181] In addition, if the unit scale on the horizontal axis is Δ T , the unit scale on the vertical axis is Δ F , then in the example shown in Figure 4, under different values ​​of p and q, the values ​​of k and l can be as follows:

[0182] p=1,q=1,that is,Δ T,1 ,Δ F,1 The sequence parameters contained in the corresponding sequence set <0,0>,<1,0>,<2,0>,<3,0>,<0,1>,<1,1>,<2,1>,<3,1>,<0,2>,<1,2>,<2,2>,<3,2>,<0,3>,<1,3>,<2,3>,<3,3>;

[0183] p=2,q=1, that is, Δ T,2 ,Δ F,1 The sequence parameters contained in the sequence set corresponding to the sequence set <4,0>,<6,0>,<4,1>,<6,1>,<4,2>,<6,2>,<4,3>,<6,3>;

[0184] p=1,q=2, that is, Δ T,1 ,Δ F,2 The sequence parameters contained in the sequence set corresponding to the sequence set <0,4>,<1,4>,<2,4>,<3,4>,<0,6>,<1,6>,<2,6>,<3,6>;

[0185] p=2,q=2,that is,Δ T,2 ,Δ F,2 The sequence parameters contained in the sequence set corresponding to the sequence set <4,4>,<6,4>,<4,6>,<6,6>.

[0186] Method 2 above is applicable to scenarios where the maximum round-trip delay and maximum Doppler shift corresponding to multiple terminal devices in a cell follow an exponential distribution. In this case, the terminal device has a higher probability of selecting the sequence set with the smaller maximum round-trip delay and maximum Doppler shift. Sequence sets with smaller maximum round-trip delay and maximum Doppler shift contain more sequences, and different terminal devices have similar probabilities of selecting the same sequence.

[0187] Method 3: Among the P×Q sequence sets, the sequences in any sequence set have the same cubic coefficient, and the cubic coefficient is correlated with the maximum round-trip delay corresponding to the sequence set. For example, the sequences in the first sequence set have the same cubic coefficient, and the cubic coefficient is correlated with the first maximum round-trip delay.

[0188] That is, the cubic coefficient of the sequence is associated with the maximum round trip delay. For example, the P candidate maximum round trip delays may correspond to the P cubic coefficients one-to-one, and different candidate maximum round trip delays may correspond to different cubic coefficients.

[0189] When the cubic term coefficient is associated with the maximum round-trip delay, the cubic term coefficients of multiple sequence sets corresponding to the same candidate maximum round-trip delay are the same. For example, if the cubic term coefficients corresponding to multiple second sequence sets in P×Q sequence sets are the same, then the candidate maximum round-trip delays corresponding to the multiple second sequence sets are the same.

[0190] In addition, multiple sequence sets corresponding to the same candidate maximum round trip delay include the same number of sequences. For example, if multiple second sequence sets in the P×Q sequence sets correspond to the same candidate maximum round trip delay, then the multiple second sequence sets have the same number of sequences.

[0191] For example, the p-th candidate maximum round trip delay Δ in the P×Q sequence set is T,p The number of sequences included in the corresponding sequence set Ω p,q for:

[0192] Where N represents the length of the cubic polynomial exponential sequence, Δ F,q represents the qth candidate maximum Doppler shift, p∈{1,2,…,P},q∈{1,2,…,Q}, the operator Indicates rounding down, and the operator ∑· indicates accumulation.

[0193] In addition, in the third approach, the pth candidate maximum round trip delay Δ T,p and the qth candidate maximum Doppler shift Δ F,q The corresponding sequence set includes Ω p,qcubic polynomial exponential sequence s p,q (n) is expressed as:

[0194] The sequence length N of the cubic polynomial exponential sequence may be a prime number, n=0, 1, ...N-1.

[0195] a=λ=λ p , is the cubic coefficient of the cubic polynomial exponential sequence, λ p ∈{1,2,…,N-1},p∈{1,2,…,P},λ1≠λ2≠…≠λ P λ p It can be understood as the maximum round-trip delay Δ with the pth candidate T,p The coefficient of the associated cubic term.

[0196] is the coefficient of the quadratic term of the cubic polynomial exponential sequence, That is, b = 3aX = 3λ p kΔ T,p .

[0197] is the coefficient of the first term of the cubic polynomial exponential sequence,

[0198] Optional, parameter and It can be associated with a sequence set or a sequence. Please refer to the related description in the above method 1, which will not be repeated here.

[0199] For example, with P=Q=3, Δ T,1 =Δ T ,Δ T,2 =2Δ T ,Δ T,3 =3Δ T , Δ F,1 =Δ F ,Δ F,2 =2Δ F ,Δ F,3 =3Δ F , Δ T and Δ F Taking the minimum unit of round-trip delay and the minimum unit of Doppler frequency shift as an example, Figure 5 shows the division method of each sequence set in the delay-Doppler plane. (a), (b), and (c) in Figure 5 represent different λ p Values ​​and different candidate maximum round-trip delays Δ T,p The corresponding sequence set.

[0200] Specifically, (a) in FIG5 represents p=1, that is, λ1 and the candidate maximum round-trip delay Δ T,1 The corresponding sequence set; (b) in Figure 5 represents p = 2, that is, λ2 and the candidate maximum round-trip delay Δ T,2 The corresponding sequence set; (c) in Figure 5 represents p = 3, that is, λ3 and the candidate maximum round-trip delay Δ T,3 The corresponding sequence set.

[0201] As shown in (a), (b), and (c) in Figure 5, λ p and the candidate maximum round trip delay Δ T,p The number of sequences in each sequence set corresponding to a set of values ​​of is the same. T,1 The corresponding three sequence sets each include 24 sequences, λ2 and Δ T,2 The corresponding three sequence sets each include 12 sequences, λ3 and Δ T,3 The corresponding three sequence sets each include 8 sequences.

[0202] It can be understood that the three sequence sets represented by (a), (b), and (c) in FIG5 together constitute P×Q=9 sequence sets in this example.

[0203] In addition, if the unit scale on the horizontal axis is Δ T , the unit scale on the vertical axis is Δ F , then in the example shown in Figure 5, under different values ​​of p and q, and The values ​​of can be as follows:

[0204] p=1,q=1,that is,Δ T,1 ,Δ F,1 The sequence parameters contained in the corresponding sequence set <λ1,0,0>,<λ1,1,0>,<λ1,2,0>,<λ1,3,0>,<λ1,4,0>,<λ1,5,0>,<λ1,6,0>,<λ1,7,0>,<λ1,8,0>,<λ1,9,0>,<λ1,10,0>,<λ1,11,0>, <λ1,0,1>,<λ1,1,1>,<λ1,2,1>,<λ1,3,1>,<λ1,4,1>,<λ1,5,1>,<λ1,6,1>,<λ1,7,1>,<λ1,8,1>,<λ1,9,1>,<λ1,10,1>,<λ1,11,1>;

[0205] p=1,q=2, that is, Δ T1 ,Δ F2 The sequence parameters contained in the corresponding sequence set <λ1,0,2>,<λ1,1,2>,<λ1,2,2>,<λ1,3,2>,<λ1,4,2>,<λ1,5,2>,<λ1,6,2>,<λ1,7,2>,<λ1,8,2>,<λ1,9,2>,<λ1,10,2>,<λ1,11,2>, <λ1,0,4>,<λ1,1,4>,<λ1,2,4>,<λ1,3,4>,<λ1,4,4>,<λ1,5,4>,<λ1,6,4>,<λ1,7,4>,<λ1,8,4>,<λ1,9,4>,<λ1,10,4>,<λ1,11,4>;

[0206] p=1,q=3,that is,Δ T1 ,Δ F3 The sequence parameters contained in the corresponding sequence set <λ1,0,6>,<λ1,1,6>,<λ1,2,6>,<λ1,3,6>,<λ1,4,6>,<λ1,5,6>,<λ1,6,6>,<λ1,7,6>,<λ1,8,6>,<λ1,9,6>,<λ1,10,6>,<λ1,11,6>, <λ1,0,9>,<λ1,1,9>,<λ1,2,9>,<λ1,3,9>,<λ1,4,9>,<λ1,5,9>,<λ1,6,9>,<λ1,7,9>,<λ1,8,9>,<λ1,9,9>,<λ1,10,9>,<λ1,11,9>;

[0207] p=2,q=1, that is, Δ T,2 ,Δ F,1 The sequence parameters contained in the corresponding sequence set <λ2,0,0>,<λ2,2,0>,<λ2,4,0>,<λ2,6,0>,<λ2,8,0>,<λ2,10,0>,<λ2,0,1>,<λ2,2,1>,<λ2,4,1>,<λ2,6,1>,<λ2,8,1>,<λ2,10,1>;

[0208] p=2,q=2,that is,Δ T2 ,Δ F2 The sequence parameters contained in the corresponding sequence set <λ2,0,2>,<λ2,2,2>,<λ2,4,2>,<λ2,6,2>,<λ2,8,2>,<λ2,10,2>,<λ2,0,4>,<λ2,2,4>,<λ2,4,4>,<λ2,6,4>,<λ2,8,4>,<λ2,10,4>;

[0209] p=2,q=3,that is,Δ T2 ,Δ F3The sequence parameters contained in the corresponding sequence set <λ2,0,6>,<λ2,2,6>,<λ2,4,6>,<λ2,6,6>,<λ2,8,6>,<λ2,10,6>,<λ2,0,9>,<λ2,2,9>,<λ2,4,9>,<λ2,6,9>,<λ2,8,9>,<λ2,10,9>;

[0210] p=3,q=1, that is, Δ T3 ,Δ F1 The sequence parameters contained in the corresponding sequence set <λ3,0,0>,<λ3,3,0>,<λ3,6,0>,<λ3,9,0>,<λ3,0,1>,<λ3,3,1>,<λ3,6,1>,<λ3,9,1>;

[0211] p=3,q=2, that is, Δ T3 ,Δ F2 The sequence parameters contained in the corresponding sequence set <λ3,0,2>,<λ3,3,2>,<λ3,6,2>,<λ3,9,2>,<λ3,0,4>,<λ3,3,4>,<λ3,6,4>,<λ3,9,4>;

[0212] p=3,q=3,that is,Δ T3 ,Δ F3 The sequence parameters contained in the corresponding sequence set <λ3,0,6>,<λ3,3,6>,<λ3,6,6>,<λ3,9,6>,<λ3,0,9>,<λ3,3,9>,<λ3,6,9>,<λ3,9,9>.

[0213] Method 3 above is applicable to scenarios where the maximum round-trip delays for multiple terminal devices within a cell follow an exponential distribution and the maximum Doppler shift follows a uniform distribution. In this case, the terminal device has a higher probability of selecting a sequence set with a smaller maximum round-trip delay. Sequence sets with smaller maximum round-trip delays contain more sequences, and different terminal devices have similar probabilities of selecting the same sequence.

[0214] Method 4: Among the P×Q sequence sets, the cubic coefficients corresponding to the sequences in any sequence set are the same, and the cubic coefficients are correlated with the maximum Doppler shift corresponding to the sequence set. For example, the cubic coefficients corresponding to the sequences in the first sequence set are correlated with the first maximum Doppler shift.

[0215] That is, the cubic coefficient of the sequence is associated with the maximum Doppler shift. For example, the Q maximum Doppler shift candidates may correspond to the Q cubic coefficients one-to-one, and different maximum Doppler shift candidates may correspond to different cubic coefficients.

[0216] When the cubic term coefficient is associated with the maximum Doppler shift, the cubic term coefficients of multiple sequence sets corresponding to the same candidate maximum Doppler shift are the same. For example, if the cubic term coefficients corresponding to multiple third sequence sets in the P×Q sequence sets are the same, then the maximum Doppler shift candidates corresponding to the multiple third sequence sets are the same.

[0217] In addition, multiple sequence sets corresponding to the same candidate maximum Doppler shift include the same number of sequences. For example, if multiple third sequence sets in the P×Q sequence sets correspond to the same candidate maximum Doppler shift, then the multiple third sequence sets have the same number of sequences.

[0218] For example, the qth candidate maximum Doppler shift Δ in the P×Q sequence set is F,q The number of sequences included in the corresponding sequence set Ω p,q for:

[0219] Where N represents the length of the cubic polynomial exponential sequence, Δ T,p represents the pth candidate maximum round trip delay, p∈{1,2,…,P},q∈{1,2,…,Q}, the operator Indicates rounding down, and the operator ∑· indicates accumulation.

[0220] In addition, in the fourth approach, the pth candidate maximum round trip delay Δ T,p and the qth candidate maximum Doppler shift Δ F,q The corresponding sequence set includes Ω p,q cubic polynomial exponential sequence s p,q (n) is expressed as:

[0221] The sequence length N of the cubic polynomial exponential sequence may be a prime number, n=0, 1, ...N-1.

[0222] a=λ=λ q , is the cubic coefficient of the cubic polynomial exponential sequence, λ q ∈{1,2,…,N-1},q∈{1,2,…,Q},λ1≠λ2≠…≠λ Q λ q It can be understood as the maximum Doppler frequency shift Δ of the qth candidate F,q The coefficient of the associated cubic term.

[0223] is the coefficient of the quadratic term of the cubic polynomial exponential sequence, Right now

[0224] is the coefficient of the first term of the third order polynomial exponential sequence,

[0225] Optional, parameter and It can be associated with a sequence set or a sequence. Please refer to the related description in the above method 1, which will not be repeated here.

[0226] For example, with P=Q=3, Δ T,1 =Δ T ,Δ T,2 =2Δ T ,Δ T,3 =3Δ T , Δ F,1 =Δ F ,Δ F,2 =2Δ F ,Δ F,3 =3Δ F , Δ T and Δ F Taking the minimum unit of round-trip delay and the minimum unit of Doppler frequency shift as an example, Figure 6 shows the division method of each sequence set in the delay-Doppler plane. (a), (b), and (c) in Figure 6 represent different λ q Values ​​and different candidate maximum Doppler shift Δ F,q The corresponding sequence set.

[0227] Specifically, (a) in FIG6 represents q=1, that is, λ1 and the candidate maximum Doppler shift Δ F,1 Corresponding sequence set; Figure 6 (b) represents q = 2, that is, λ2 and the candidate maximum Doppler shift Δ F,2 Corresponding sequence set; (c) in Figure 6 represents q = 3, that is, λ3 and the candidate maximum Doppler shift Δ F,3 The corresponding sequence set.

[0228] As shown in (a), (b), and (c) in Figure 6, λ q and the candidate maximum Doppler shift Δ F,q The number of sequences in each sequence set corresponding to a set of values ​​of is the same. F,1 The corresponding three sequence sets each include 24 sequences, λ2 and Δ F,2 The corresponding three sequence sets each include 12 sequences, λ3 and Δ F,3 The corresponding three sequence sets each include 8 sequences.

[0229] It can be understood that the three sequence sets represented by (a), (b), and (c) in FIG6 together constitute P×Q=9 sequence sets in this example.

[0230] In addition, if the unit scale on the horizontal axis is Δ T , the unit scale on the vertical axis is Δ F , then in the example shown in Figure 6, under different values ​​of p and q, and The values ​​of can be as follows:

[0231] p=1,q=1,that is,Δ T1 ,Δ F1 The sequence parameters contained in the corresponding sequence set <λ1,0,0>,<λ1,1,0>,<λ1,0,1>,<λ1,1,1>,<λ1,0,2>,<λ1,1,2>,<λ1,0,3>,<λ1,1,3>,<λ1,0,4>,<λ1,1,4>,<λ1,0,5>,<λ1,1,5>,<λ 1,0,6>,<λ1,1,6>,<λ1,0,7>,<λ1,1,7>,<λ1,0,8>,<λ1,1,8>,<λ1,0,9>,<λ1,1,9>,<λ1,0,10>,<λ1,1,10>,<λ1,0,11>,<λ1,1,11>;

[0232] p=2,q=1, that is, Δ T,2 ,Δ F,1 The sequence parameters contained in the corresponding sequence set <λ1,2,0>,<λ1,4,0>,<λ1,2,1>,<λ1,4,1>,<λ1,2,2>,<λ1,4,2>,<λ1,2,3>,<λ1,4,3>,<λ1,2,4>,<λ1,4,4>,<λ1,2,5>,<λ1,4,5>,<λ 1,2,6>,<λ1,4,6>,<λ1,2,7>,<λ1,4,7>,<λ1,2,8>,<λ1,4,8>,<λ1,2,9>,<λ1,4,9>,<λ1,2,10>,<λ1,4,10>,<λ1,2,11>,<λ1,4,11>;

[0233] p=3,q=1, that is, Δ T,3 ,Δ F,1 The sequence parameters contained in the corresponding sequence set <λ1,6,0>,<λ1,9,0>,<λ1,6,1>,<λ1,9,1>,<λ1,6,2>,<λ1,9,2>,<λ1,6,3>,<λ1,9,3>,<λ1,6,4>,<λ1,9,4>,<λ1,6,5>,<λ1,9,5>,<λ 1,6,6>,<λ1,9,6>,<λ1,6,7>,<λ1,9,7>,<λ1,6,8>,<λ1,9,8>,<λ1,6,9>,<λ1,9,9>,<λ1,6,10>,<λ1,9,10>,<λ1,6,11>,<λ1,9,11>;

[0234] p=1,q=2, that is, Δ T,1 ,Δ F,2 The sequence parameters contained in the corresponding sequence set <λ2,0,0>,<λ2,1,0>,<λ2,0,2>,<λ2,1,2>,<λ2,0,4>,<λ2,1,4>,<λ2,0,6>,<λ2,1,6>,<λ2,0,8>,<λ2,1,8>,<λ2,0,10>,<λ2,1,10>;

[0235] p=2,q=2,that is,Δ T,2 ,Δ F,2 The sequence parameters contained in the corresponding sequence set <λ2,2,0>,<λ2,4,0>,<λ2,2,2>,<λ2,4,2>,<λ2,2,4>,<λ2,4,4>,<λ2,2,6>,<λ2,4,6>,<λ2,2,8>,<λ2,4,8>,<λ2,2,10>,<λ2,4,10>;

[0236] p=3,q=2, that is, Δ T3 ,Δ F2 The sequence parameters contained in the corresponding sequence set <λ2,6,0>,<λ2,9,0>,<λ2,6,2>,<λ2,9,2>,<λ2,6,4>,<λ2,9,4>,<λ2,6,6>,<λ2,9,6>,<λ2,6,8>,<λ2,9,8>,<λ2,6,10>,<λ2,9,10>;

[0237] p=1,q=3,that is,Δ T1 ,Δ F2 The sequence parameters contained in the corresponding sequence set <λ3,0,0>,<λ3,1,0>,<λ3,0,3>,<λ3,1,3>,<λ3,0,6>,<λ3,1,6>,<λ3,0,9>,<λ3,1,9>;

[0238] p=2,q=3,that is,Δ T,2 ,Δ F,3 The sequence parameters contained in the corresponding sequence set <λ3,2,0>,<λ3,4,0>,<λ3,2,3>,<λ3,4,3>,<λ3,2,6>,<λ3,4,6>,<λ3,2,9>,<λ3,4,9>;

[0239] p=3,q=3,that is,Δ T3 ,Δ F3 The sequence parameters contained in the corresponding sequence set <λ3,6,0>,<λ3,9,0>,<λ3,6,3>,<λ3,9,3>,<λ3,6,6>,<λ3,9,6>,<λ3,6,9>,<λ3,9,9>.

[0240] Method 4 above is applicable to scenarios where the maximum round-trip delays and maximum Doppler shift indicators for multiple terminal devices within a cell are evenly distributed. In this case, the terminal device has a higher probability of selecting a sequence set with a smaller maximum Doppler shift. Sequence sets with smaller maximum Doppler shifts contain more sequences, and different terminal devices have similar probabilities of selecting the same sequence.

[0241] Optionally, after receiving the first information from the network device and selecting the first maximum round-trip delay and the first maximum Doppler shift, the terminal device may determine the first sequence set according to one of the four aforementioned methods, and then transmit the first sequence in the first sequence set. Exemplarily, the sequence set partitioning method used by the terminal device may be configured by the network device or predefined by a protocol, and this application does not specifically limit this.

[0242] The above is an example of the sequence set partitioning method provided in this application being applied in a communication scenario. In addition, the sequence set partitioning method can also be applied to a perception scenario. For example, after the network device indicates multiple candidate maximum round-trip delays and multiple candidate maximum Doppler shifts, the terminal device can select a candidate maximum round-trip delay and a candidate maximum Doppler shift according to its own environment or perception requirements, determine the sequence set based on the selected candidate maximum round-trip delay and candidate maximum Doppler shift, and send the sequence in the sequence set through the perception signal.

[0243] For example, if the terminal device is in a home environment, since the distance between objects in the home environment is relatively close and the movement speed is relatively slow, the terminal device can select a smaller candidate maximum round-trip delay and a smaller candidate maximum Doppler shift. If the terminal device is on a highway, the terminal device can select a larger candidate maximum round-trip delay and a larger candidate maximum Doppler shift.

[0244] Exemplarily, the product of the candidate maximum round-trip delay selected by the terminal device and the speed of light can be understood as the maximum distance that the terminal device can perceive, and the candidate maximum Doppler shift selected by the terminal device can indicate the maximum moving speed that the terminal device can perceive.

[0245] In the self-transmitting and self-receiving sensing scenario, the terminal device can also receive the echo signal after the sensing signal is reflected by the target object, thereby perceiving the target object's position and movement speed based on the echo signal. In the self-transmitting and other-receiving sensing scenario, after the terminal device sends the sensing signal, other devices (such as network devices or other terminal devices) can receive the sensing signal reflected by the target object, thereby perceiving the target object's position and movement speed based on the received signal.

[0246] Furthermore, the sequence set partitioning method provided in this application can also be appropriately modified to be applicable to ZC sequences. For example, a network device can also indicate multiple candidate maximum round-trip delays and multiple candidate maximum Doppler shifts. The terminal device selects one candidate maximum round-trip delay and one candidate maximum Doppler shift, and determines the ZC sequence based on the selected candidate maximum round-trip delay and candidate maximum Doppler shift.

[0247] It is understood that in each of the above embodiments, the methods and / or steps implemented by the terminal device may also be implemented by components applicable to the terminal device (e.g., processor, chip, chip system, circuit, logic module, or software); the methods and / or steps implemented by the network device may also be implemented by components applicable to the network device (e.g., processor, chip, chip system, circuit, logic module, or software). The chip system may be composed of a chip, or may include a chip and other discrete components.

[0248] It is understandable that, in order to realize the above functions, the communication device includes hardware structures and / or software modules corresponding to the execution of each function. It should be easily appreciated by those skilled in the art that, in combination with the units and algorithm steps of each example described in the embodiments disclosed herein, the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0249] The embodiment of the present application can divide the functional modules of the communication device according to the above method embodiment. For example, each functional module can be divided according to each function, or two or more functions can be integrated into one processing module. The above integrated modules can be implemented in the form of hardware or in the form of software functional modules. It should be noted that the division of modules in the embodiment of the present application is schematic and is only a logical functional division. In actual implementation, there may be other division methods.

[0250] Communication Device Figure 7 shows a schematic structural diagram of a communication device 70. The communication device 70 includes a processing module 701 and a transceiver module 702. The communication device 70 can be used to implement the functions of the above-mentioned terminal device or network device.

[0251] In some embodiments, the communication device 70 may further include a storage module (not shown in FIG. 7 ) for storing program instructions and data.

[0252] In some embodiments, the transceiver module 702, which may also be referred to as a transceiver unit, is configured to implement a transmitting and / or receiving function. The transceiver module 702 may be composed of a transceiver circuit, a transceiver, a transceiver, or a communication interface.

[0253] In some embodiments, the transceiver module 702 may include a receiving module and a sending module, which are respectively used to execute the receiving and sending steps performed by the terminal device or network device in the above method embodiments, and / or used to support other processes of the technology described herein; the processing module 701 may be used to execute the processing steps (such as determination, etc.) performed by the terminal device or network device in the above method embodiments, and / or used to support other processes of the technology described herein.

[0254] When the communication device 70 is used to implement the functions of the terminal device:

[0255] Transceiver module 8,2 is configured to receive first information indicating P candidate maximum round-trip delays and Q candidate maximum Doppler shifts, where the P candidate maximum round-trip delays and the Q candidate maximum Doppler shifts correspond to P×Q sequence sets, where the sequences in the sequence sets are cubic polynomial exponential sequences, where the coefficients of the cubic terms of the cubic polynomial exponential sequences are correlated with the coefficients of the quadratic terms of the cubic polynomial exponential sequences, and where P and Q are positive integers. Transceiver module 702 is further configured to transmit a first sequence, where the first sequence belongs to a first sequence set in the P×Q sequence sets, where the first sequence set corresponds to a first maximum round-trip delay and a first maximum Doppler shift, where the first maximum round-trip delay is one of the P candidate maximum round-trip delays, and the first maximum Doppler shift is one of the Q candidate maximum Doppler shifts.

[0256] Optionally, the transceiver module 702 is further configured to receive a first signal, and the first maximum round-trip delay is related to the signal quality of the first signal.

[0257] Optionally, the first maximum Doppler frequency shift is related to the moving speed of the terminal device.

[0258] When the communication device 70 is used to implement the functions of the network device:

[0259] The transceiver module 702 is used to send first information, where the first information indicates P candidate maximum round-trip delays and Q candidate maximum Doppler shifts, where the P candidate maximum round-trip delays and the Q candidate maximum Doppler shifts correspond to P×Q sequence sets, where the sequences in the sequence sets are cubic polynomial exponential sequences, where the coefficients of the cubic terms of the cubic polynomial exponential sequences are associated with the coefficients of the quadratic terms of the cubic polynomial exponential sequences, and where P and Q are positive integers; the transceiver module 702 is also used to receive a first sequence from a terminal device, where the first sequence belongs to a first sequence set in the P×Q sequence sets, where the first sequence set corresponds to a first maximum round-trip delay and a first maximum Doppler shift, where the first maximum round-trip delay is one of the P candidate maximum round-trip delays, and the first maximum Doppler shift is one of the Q candidate maximum Doppler shifts; and the processing module 701 is used to determine the round-trip delay and / or Doppler shift of the terminal device based on the first sequence.

[0260] Among them, all relevant contents of each step involved in the above method embodiment can be referred to the functional description of the corresponding functional module and will not be repeated here.

[0261] In the present application, the communication device 70 may be presented in the form of functional modules divided in an integrated manner. The "module" here may refer to a specific application-specific integrated circuit (ASIC), a circuit, a processor and memory that executes one or more software or firmware programs, an integrated logic circuit, and / or other devices that can provide the above functions.

[0262] In some embodiments, when the communication device 70 in Figure 7 is a chip or a chip system, the function / implementation process of the transceiver module 702 can be implemented through the input and output interface (or communication interface) of the chip or chip system, and the function / implementation process of the processing module 701 can be implemented through the processor (or processing circuit) of the chip or chip system.

[0263] Since the communication device 70 provided in this embodiment can execute the above method, the technical effects that can be obtained can refer to the above method embodiments and will not be repeated here.

[0264] As a possible product form, the terminal device or network device described in the embodiments of the present application can also be implemented using the following: one or more field programmable gate arrays (FPGAs), programmable logic devices (PLDs), controllers, state machines, gate logic, discrete hardware components, any other suitable circuits, or any combination of circuits that can perform the various functions described throughout this application.

[0265] As another possible product form, the terminal device or network device described in the embodiment of the present application can be implemented by a general bus architecture. For ease of explanation, refer to Figure 8, which is a structural diagram of a communication device 800 provided in an embodiment of the present application, and the communication device 800 includes a processor 801 and a transceiver 802. The communication device 800 can be a terminal device, or a chip or chip system therein; or, the communication device 800 can be a network device, or a chip or module therein. Figure 8 only shows the main components of the communication device 800. In addition to the processor 801 and the transceiver 802, the communication device may further include a memory 803, and an input and output device (not shown in the figure).

[0266] Optionally, the processor 801 is primarily used to process communication protocols and communication data, as well as to control the entire communication device, execute software programs, and process data from the software programs, thereby implementing the methods provided in the above-mentioned method embodiments. The memory 803 is primarily used to store software programs and data. The transceiver 802 may include a radio frequency circuit and an antenna. The radio frequency circuit is primarily used to convert baseband signals into radio frequency signals and process radio frequency signals. The antenna is primarily used to transmit and receive radio frequency signals in the form of electromagnetic waves. Input and output devices, such as a touch screen, display screen, and keyboard, are primarily used to receive data input by a user and output data to the user.

[0267] Optionally, the processor 801 , the transceiver 802 , and the memory 803 may be connected via a communication bus.

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

[0269] In another implementation, the RF circuit and antenna may be provided independently of the processor performing baseband processing. For example, in a distributed scenario, the RF circuit and antenna may be remotely arranged independent of the communication device.

[0270] In some embodiments, in terms of hardware implementation, those skilled in the art may conceive that the communication device 70 may take the form of the communication device 800 shown in FIG. 8 .

[0271] As an example, the functions / implementation process of the processing module 701 in FIG7 can be implemented by the processor 801 in the communication device 800 shown in FIG8 calling the computer-executable instructions stored in the memory 803. The functions / implementation process of the transceiver module 702 in FIG7 can be implemented by the transceiver 802 in the communication device 800 shown in FIG8.

[0272] As another possible product form, the terminal device or network device in this application may adopt the structure shown in Figure 9, or include the components shown in Figure 9. Figure 9 is a schematic diagram of the structure of a communication device 900 provided in this application. The communication device 900 can be a terminal device or a chip or system-on-chip in a terminal device; or it can be a network device or a module, chip, or system-on-chip in a network device.

[0273] As shown in FIG9 , the communication device 900 includes at least one processor 901 and at least one communication interface ( FIG9 is merely an example of a communication interface 904 and a processor 901). Optionally, the communication device 900 may further include a communication bus 902 and a memory 903.

[0274] The processor 901 may be a general-purpose central processing unit (CPU), a general-purpose processor, a network processor (NP), a digital signal processor (DSP), a microprocessor, a microcontroller, a programmable logic device (PLD), or any combination thereof. The processor 901 may also be other devices with processing capabilities, such as circuits, devices, or software modules, without limitation.

[0275] Communication bus 902 is used to connect the various components in communication device 900, enabling communication between them. Communication bus 902 may be a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus, for example. This bus can be categorized as an address bus, a data bus, a control bus, and so on. For ease of illustration, FIG9 shows a single thick line, but this does not imply that there is only one bus or only one type of bus.

[0276] Communication interface 904 is used to communicate with other devices or communication networks. Exemplarily, communication interface 904 can be a module, circuit, transceiver, or any other device capable of communication. Optionally, communication interface 904 can also be an input / output interface within processor 901, used to implement signal input and output to the processor.

[0277] The memory 903 may be a device with a storage function, used to store instructions and / or data, wherein the instructions may be computer programs.

[0278] Exemplarily, the memory 903 may be a read-only memory (ROM) or other types of static storage devices that can store static information and / or instructions, or a random access memory (RAM) or other types of dynamic storage devices that can store information and / or instructions, or an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disc storage, optical disc storage (including compact discs, laser discs, optical discs, digital versatile discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, etc., without limitation.

[0279] It should be noted that the memory 903 can exist independently of the processor 901 or can be integrated with the processor 901. The memory 903 can be located within the communication device 900 or outside the communication device 900, without limitation. The processor 901 can be used to execute instructions stored in the memory 903 to implement the methods provided in the following embodiments of the present application.

[0280] As an optional implementation, the communication device 900 may further include an output device 905 and an input device 906. The output device 905 communicates with the processor 901 and can display information in a variety of ways. For example, the output device 905 can be a liquid crystal display (LCD), a light emitting diode (LED) display device, a cathode ray tube (CRT) display device, or a projector. The input device 906 communicates with the processor 901 and can receive user input in a variety of ways. For example, the input device 906 can be a mouse, a keyboard, a touch screen device, or a sensor device.

[0281] In some embodiments, in terms of hardware implementation, those skilled in the art may conceive that the communication device 70 shown in FIG. 7 may take the form of the communication device 900 shown in FIG. 9 .

[0282] As an example, the functions / implementation process of the processing module 701 in FIG7 can be implemented by the processor 901 in the communication device 900 shown in FIG9 calling the computer-executable instructions stored in the memory 903. The functions / implementation process of the transceiver module 702 in FIG7 can be implemented by the communication interface 904 in the communication device 900 shown in FIG9.

[0283] It should be noted that the structure shown in FIG9 does not constitute a specific limitation on the terminal device or network device. For example, in other embodiments of the present application, the terminal device or network device may include more or fewer components than shown in the figure, or combine or split some components, or arrange the components differently. The components shown in the figure may be implemented in hardware, software, or a combination of software and hardware.

[0284] In some embodiments, an embodiment of the present application further provides a communication device, which includes a processor for implementing the method in any of the above method embodiments.

[0285] As a possible implementation, the communication device further includes a memory. The memory is used to store necessary computer programs and data. The computer program may include instructions, and the processor may invoke the instructions in the computer program stored in the memory to instruct the communication device to perform any of the above-described method embodiments. Of course, the memory may not be located in the communication device.

[0286] As another possible implementation, the communication device also includes an interface circuit, which is a code / data read / write interface circuit, and the interface circuit is used to receive computer execution instructions (computer execution instructions are stored in a memory, may be read directly from the memory, or may pass through other devices) and transmit them to the processor.

[0287] As another possible implementation, the communication device further includes a communication interface, where the communication interface is used to communicate with a module outside the communication device.

[0288] It can be understood that the communication device can be a chip or a chip system. When the communication device is a chip system, it can be composed of chips or include chips and other discrete devices. The embodiments of the present application do not specifically limit this.

[0289] The present application also provides a computer-readable storage medium having a computer program or instruction stored thereon, which implements the functions of any of the above method embodiments when executed by a computer.

[0290] The present application also provides a computer program product, which implements the functions of any of the above method embodiments when executed by a computer.

[0291] Those skilled in the art will appreciate that, for the sake of convenience and brevity of description, the specific working processes of the above-described systems, devices, and units may refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0292] It is understood that the systems, devices, and methods described in this application may also be implemented in other ways. For example, the device embodiments described above are merely illustrative. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection shown or discussed may be through some interface, indirect coupling or communication connection of devices or units, and may be electrical, mechanical, or other forms.

[0293] The units described as separate components may or may not be physically separate, i.e., they may be located in one place or distributed across multiple network units. Components shown as units may or may not be physical units. Some or all of these units may be selected to achieve the objectives of this embodiment as needed.

[0294] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0295] In the above embodiments, all or part of the embodiments may be implemented by software, hardware, firmware, or any combination thereof. When implemented using a software program, all or part of the embodiments may be implemented in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of the present application are generated. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via a wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) method. The computer-readable storage medium may be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more media integrated therein. The available medium may be a magnetic medium (eg, a floppy disk, a hard disk, a magnetic tape), an optical medium (eg, a DVD), or a semiconductor medium (eg, a solid state drive (SSD)). In the embodiment of the present application, the computer may include the aforementioned device.

[0296] Although the present application is described herein in conjunction with various embodiments, in the process of implementing the claimed application, those skilled in the art can understand and implement other changes to the disclosed embodiments by reviewing the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other components or steps, and "a" or "an" does not exclude multiple situations. A single processor or other unit can implement several functions listed in the claims. Certain measures are recorded in different dependent claims, but this does not mean that these measures cannot be combined to produce good results.

[0297] Although the present application has been described with reference to specific features and embodiments thereof, it is apparent that various modifications and combinations may be made thereto without departing from the spirit and scope of the present application. Accordingly, this specification and the drawings are merely illustrative of the present application as defined by the appended claims and are deemed to cover any and all modifications, variations, combinations or equivalents within the scope of the present application. Obviously, those skilled in the art may make various modifications and variations to the present application without departing from the spirit and scope of the present application. Thus, the present application is intended to include such modifications and variations as fall within the scope of the claims of the present application and their equivalents.

Claims

1. A communication method, characterized in that: The method comprises: Receive first information, where the first information indicates P candidate maximum round-trip delays and Q candidate maximum Doppler shifts, where the P candidate maximum round-trip delays and the Q candidate maximum Doppler shifts correspond to P×Q sequence sets, where sequences in the sequence sets are cubic polynomial exponential sequences, where cubic term coefficients of the cubic polynomial exponential sequence are associated with quadratic term coefficients of the cubic polynomial exponential sequence, and where P and Q are positive integers; A first sequence is sent, where the first sequence belongs to a first sequence set among the P×Q sequence sets, the first sequence set corresponds to a first maximum round-trip delay and a first maximum Doppler shift, the first maximum round-trip delay is one of the P candidate maximum round-trip delays, and the first maximum Doppler shift is one of the Q candidate maximum Doppler shifts.

2. The method according to claim 1, characterized in that The method also includes: receiving a first signal; and the first maximum round-trip delay is related to a signal quality of the first signal.

3. The method according to claim 1 or 2, characterized in that: The first maximum Doppler frequency shift is related to the moving speed of the terminal device.

4. A communication method, characterized in that: The method comprises: Sending first information, where the first information indicates P candidate maximum round-trip delays and Q candidate maximum Doppler shifts, where the P candidate maximum round-trip delays and the Q candidate maximum Doppler shifts correspond to P×Q sequence sets, where the sequences in the sequence sets are cubic polynomial exponential sequences, where the cubic term coefficients of the cubic polynomial exponential sequence are associated with the quadratic term coefficients of the cubic polynomial exponential sequence, and where P and Q are positive integers; receiving a first sequence from a terminal device, where the first sequence belongs to a first sequence set among the P×Q sequence sets, where the first sequence set corresponds to a first maximum round-trip delay and a first maximum Doppler shift, where the first maximum round-trip delay is one of the P candidate maximum round-trip delays, and the first maximum Doppler shift is one of the Q candidate maximum Doppler shifts; The round-trip delay and / or Doppler frequency shift of the terminal device is determined according to the first sequence.

5. The method according to any one of claims 1 to 4, characterized in that: The low ambiguity regions corresponding to different sequence sets in the P×Q sequence sets do not overlap with each other, and / or the low ambiguity regions of different sequences in the same sequence set do not overlap with each other.

6. The method according to any one of claims 1 to 5, characterized in that: Sequences in different sequence sets of the P×Q sequence sets do not overlap with each other.

7. The method according to any one of claims 1 to 6, characterized in that: The pth candidate maximum round trip delay Δ in the P×Q sequence set T,p and the qth candidate maximum Doppler shift Δ F,q The corresponding cubic polynomial exponential sequence in the sequence set can be expressed as: Wherein, λ is the cubic coefficient of the cubic polynomial exponential sequence, is the coefficient of the quadratic term of the cubic polynomial exponential sequence, is the coefficient of the first term of the cubic polynomial exponential sequence, the sequence length N of the cubic polynomial exponential sequence is a prime number, p∈{1,2,…,P},q∈{1,2,…,Q}, 8. The method according to any one of claims 1 to 7, characterized in that: The number of sequences included in each of the P×Q sequence sets is Ω p,q for: Wherein, N represents the sequence length of the cubic polynomial exponential sequence, Δ T,p represents the pth candidate maximum round trip delay, Δ F,q represents the qth candidate maximum Doppler shift, R represents the number of candidate cubic coefficients, p∈{1,2,…,P},q∈{1,2,…,Q}, and the operator represents rounding down, and the operator ∑· represents accumulation.

9. The method according to claim 8, characterized in that The pth candidate maximum round trip delay Δ T,p and the qth candidate maximum Doppler shift Δ F,q The corresponding sequence set includes Ω p,q cubic polynomial exponential sequence s p,q (n) is expressed as: Wherein, the sequence length N of the cubic polynomial exponential sequence is a prime number, λ r is the cubic coefficient of the cubic polynomial exponential sequence, λ r ∈{1,2,…,N-1},r∈{1,2,…,R},λ1≠λ2≠…≠λ R , is the coefficient of the quadratic term of the cubic polynomial exponential sequence, is the coefficient of the first-order term of the cubic polynomial exponential sequence, 10. The method according to any one of claims 1 to 7, characterized in that: The pth candidate maximum round trip delay Δ in the P×Q sequence set T,p and the qth candidate maximum Doppler shift Δ F,q The number of sequences included in the corresponding sequence set Ω p,q for: Wherein, N represents the sequence length of the cubic polynomial exponential sequence, R represents the number of candidate cubic coefficients, p∈{1,2,…,P},q∈{1,2,…,Q}, and the operator Indicates rounding down.

11. The method according to any one of claims 1 to 7 and 10, characterized in that: The total area of ​​the low ambiguity region corresponding to each sequence set in the P×Q sequence sets is the same.

12. The method according to claim 10 or 11, characterized in that: The pth candidate maximum round trip delay Δ T,p and the qth candidate maximum Doppler shift Δ F,q The corresponding sequence set includes Ω p,q cubic polynomial exponential sequence s p,q (n) is expressed as: Wherein, the sequence length N of the cubic polynomial exponential sequence is a prime number, λ r is the cubic coefficient of the cubic polynomial exponential sequence, λ r ∈{1,2,…,N-1},r∈{1,2,…,R},λ1≠λ2≠…≠λ R , is the coefficient of the quadratic term of the cubic polynomial exponential sequence, is the coefficient of the first-order term of the cubic polynomial exponential sequence, 13. The method according to any one of claims 1 to 7, characterized in that: Among the P×Q sequence sets, the coefficients of the cubic terms corresponding to the sequences in any sequence set are the same.

14. The method according to any one of claims 1 to 7 and 13, characterized in that: The cubic term coefficients corresponding to the sequences in the first sequence set are related to the first maximum round-trip delay.

15. The method according to claim 13 or 14, characterized in that In the P×Q sequence sets, coefficients of cubic terms corresponding to the multiple second sequence sets are the same, and candidate maximum round-trip delays corresponding to the multiple second sequence sets are the same.

16. The method according to any one of claims 13 to 15, characterized in that: The pth candidate maximum round trip delay Δ in the P×Q sequence set T,p The number of sequences included in the corresponding sequence set Ω p,q for: Wherein, N represents the sequence length of the cubic polynomial exponential sequence, Δ F,q represents the qth candidate maximum Doppler shift, p∈{1,2,…,P},q∈{1,2,…,Q}, the operator represents rounding down, and the operator ∑· represents accumulation.

17. The method according to any one of claims 14 to 16, characterized in that: The pth candidate maximum round trip delay Δ T,p and the qth candidate maximum Doppler shift Δ F,q The corresponding sequence set includes Ω p,q cubic polynomial exponential sequence s p,q (n) is expressed as: Wherein, the sequence length N of the cubic polynomial exponential sequence is a prime number, λ p is the cubic coefficient of the cubic polynomial exponential sequence, λ p ∈{1,2,…,N-1},p∈{1,2,…,P},λ1≠λ2≠…≠λ P , 3λ p kΔ T,p is the coefficient of the quadratic term of the cubic polynomial exponential sequence, is the coefficient of the first-order term of the cubic polynomial exponential sequence, 18. The method according to any one of claims 1 to 7 and 13, characterized in that: The cubic term coefficients corresponding to the sequences in the first sequence set are related to the first maximum Doppler frequency shift.

19. The method according to claim 13 or 18, characterized in that In the P×Q sequence sets, cubic term coefficients corresponding to multiple third sequence sets are the same, and candidate maximum Doppler frequency shifts corresponding to the multiple third sequence sets are the same.

20. The method according to any one of claims 13, 18-19, characterized in that: The qth candidate maximum Doppler frequency shift Δ in the P×Q sequence set F,q The number of sequences included in the corresponding sequence set Ω p,q for: Wherein, N represents the sequence length of the cubic polynomial exponential sequence, Δ T,p represents the pth candidate maximum round trip delay, p∈{1,2,…,P},q∈{1,2,…,Q}, the operator represents rounding down, and the operator ∑· represents accumulation.

21. The method according to any one of claims 18 to 20, characterized in that: The pth candidate maximum round trip delay Δ T,p and the qth candidate maximum Doppler shift Δ F,q The corresponding sequence set includes Ω p,q cubic polynomial exponential sequence s p,q (n) is expressed as: Wherein, the sequence length N of the cubic polynomial exponential sequence is a prime number, λ q is the cubic coefficient of the cubic polynomial exponential sequence, λ q ∈{1,2,…,N-1},q∈{1,2,…,Q},λ1≠λ2≠…≠λ Q , is the coefficient of the quadratic term of the cubic polynomial exponential sequence, lΔ F,q is the coefficient of the first-order term of the third-order polynomial exponential sequence, 22. A communication device, characterized in that: The method comprises a unit for executing the method according to any one of claims 1 to 3 and 5 to 21, or comprises a unit for executing the method according to any one of claims 4 to 21.

23. A communication device, characterized in that: The communication device includes a processor; the processor is used to run a computer program or instruction to enable the communication device to execute the method as described in any one of claims 1-3 and 5-21, or to enable the communication device to execute a unit of the method as described in any one of claims 4-21.

24. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions or programs, and when the computer instructions or programs are executed on a computer, the method according to any one of claims 1 to 3 and 5 to 21 is executed, or the method according to any one of claims 4 to 21 is executed.

25. A computer program product, characterized in that The computer program product includes computer instructions; when part or all of the computer instructions are run on a computer, the method according to any one of claims 1 to 3, 5 to 21 is executed, or the method according to any one of claims 4 to 21 is executed.

Images