Communication method and apparatus

Abstract

A communication method and apparatus, which are used for improving communication performance. The method may comprise the following steps: a first communication apparatus acquiring indication information of a first sequence, wherein the first sequence is an exponential sequence of a cubic polynomial, the cubic term coefficient of the cubic polynomial is associated with the quadratic term coefficient of the cubic polynomial, the quadratic term coefficient of the cubic polynomial is associated with the frequency-domain position of the first sequence, and the cubic term coefficient of the cubic polynomial and / or the quadratic term coefficient of the cubic polynomial are / is associated with a cell identifier; and the first communication apparatus also being capable of transmitting a first signal, wherein the first signal is obtained by means of the first sequence being subjected to frequency-domain resource mapping.

Description

Communication method and device

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims priority to the Chinese patent application filed with the State Intellectual Property Office of the People's Republic of China on December 15, 2023, with application number 202311738988.7 and invention name "A Communication Method and Device", the entire contents of which are incorporated by reference into this application. Technical Field

[0003] The present application relates to the field of mobile communication technologies, and in particular to a communication method and device. Background Art

[0004] Gold sequences are commonly used in communication systems. For example, the demodulation reference signal (DMRS) of an orthogonal frequency-division multiplexing (OFDM) waveform uses a Gold sequence modulated by frequency-domain quadrature phase shift keying (QPSK).

[0005] Currently, the communication performance based on Gold sequences needs to be improved. Summary of the Invention

[0006] The present application provides a communication method and apparatus for improving communication performance.

[0007] In a first aspect, a communication method is provided. The method can be implemented by a first communication device. The first communication device can be used to send a signal. For example, the first communication device can be a terminal device or an access network device (or replaced by a network device, such as a base station). The first communication device can also be a component in the terminal device or a component in the access network device. The component in the present application can include, for example, at least one of a chip, a chip system, a processor, a transceiver, a processing unit, or a transceiver unit. Taking the execution subject as the first communication device as an example, the communication method provided in the present application can include the following steps: the first communication device obtains indication information of a first sequence, the first sequence is a cubic polynomial exponential sequence, the cubic term coefficient of the cubic polynomial is associated with the quadratic term coefficient of the cubic polynomial, the quadratic term coefficient of the cubic polynomial is associated with the frequency domain position of the first sequence, wherein the cubic term coefficient and / or the quadratic term coefficient is associated with a cell identifier; the first communication device can also transmit a first signal, which is obtained by mapping the first sequence to frequency domain resources.

[0008] Based on the method shown in the first aspect, the first communication device can determine the first sequence according to the indication information of the first sequence, and send the first signal corresponding to the first sequence. The first sequence can be a Weil index sum sequence, that is, a sequence that satisfies the index sum theorem, and has better self-ambiguity and mutual ambiguity characteristics than the Gold sequence. Therefore, if frequency domain resource mapping is used to construct a non-orthogonal frequency offset-resistant DMRS sequence, the interference between non-orthogonal DMRS ports can be reduced, the DMRS sequence capacity can be increased, and thus the transmission performance can be improved. In addition, since the cubic term coefficient a and / or the quadratic term coefficient b of the first sequence are associated with the cell identifier, the sequence corresponding to the adjacent cell is equivalent to performing a frequency hopping pattern shift, which will not cause a collision of the frequency hopping pattern, can reduce the transmission interference of users between different cells, and improve the transmission performance.

[0009] In one possible implementation, the cubic coefficient of the cubic polynomial is associated with the quadratic coefficient of the cubic polynomial, including: the cubic coefficient of the cubic polynomial is related to λ, and the quadratic coefficient of the cubic polynomial is related to multiples of λ; wherein the value range of λ is an integer greater than or equal to 1 and less than or equal to P-1, where P is a maximum prime number that does not exceed the sequence length of the first sequence. Based on this implementation, the first sequence using frequency-domain discontinuous mapping has ideal autocorrelation characteristics within the maximum delay spread range.

[0010] In one possible implementation, the coefficient of the quadratic term of the cubic polynomial is an integer multiple of λ. Based on this implementation, the mutual ambiguity function of the first sequence using frequency domain discontinuous mapping within the maximum delay spread and maximum Doppler spread range satisfies the exponential sum theorem.

[0011] In a possible implementation, the frequency domain position corresponds to a transmission comb index, and the first sequence s λ,k,l,m (n) Satisfy:

[0012] Wherein, P is the maximum prime number that does not exceed the sequence length of the first sequence, M represents the number of transmission comb teeth, Δ F represents the maximum Doppler spread, λ represents the cubic coefficient index of the cubic polynomial, k represents the quadratic coefficient index of the cubic polynomial, m represents the transmission comb index, N represents the sequence length of the first sequence, Δ T represents the maximum delay spread, n represents the symbol position of the first sequence, and l represents the cyclic shift index.

[0013] Based on this implementation, the first sequence has an ideal autocorrelation characteristic within the maximum delay spread range.

[0014] In one possible implementation, Here, ∨ represents logical OR.

[0015] Based on this implementation, the sequence capacity of the first sequence is

[0016] In a possible implementation, the maximum Doppler spread Δ F And the transmission comb number M satisfies:

[0017] in, Represents an integer.

[0018] Based on this implementation, the condition that the mutual fuzzy function of the first sequence is applicable to the exponential sum theorem can be met.

[0019] In one possible implementation, the first communication device may further obtain a first indication corresponding to the transmission comb index. Based on this implementation, the network device may instruct the first communication device to use the transmission comb index to implement mapping of the first sequence through the first indication.

[0020] In a possible implementation, the frequency domain position corresponds to a frequency division multiplexing index, and the first sequence s λ,k,l,r,m (n,q) satisfies:

[0021] Wherein, N represents the length of the first sequence, Δ T represents the maximum delay spread, n represents the symbol position of the first sequence, l represents the cyclic shift index, and r represents the frequency domain orthogonal cover code index.

[0022] Based on this implementation, the first sequence has an ideal autocorrelation characteristic within the maximum delay spread range.

[0023] In one possible implementation, Here, ∨ represents logical OR.

[0024] Based on this implementation, the sequence capacity of the first sequence

[0025] In a possible implementation, the maximum Doppler spread Δ F , the frequency division multiplexing number M and the frequency domain orthogonal cover code length Q satisfy:

[0026] in, Represents an integer.

[0027] Based on this implementation, the mutual ambiguity functions of the first sequence are applicable to the conditions of the exponential sum theorem.

[0028] In one possible implementation, the first communication device may further receive a second indication corresponding to the frequency division multiplexing index. Based on this implementation, the network device may instruct the first communication device to use the frequency division multiplexing index to implement mapping of the first sequence through the second indication.

[0029] In one possible implementation, the first communication device may also obtain a third indication, wherein the third indication is used to indicate the indication information of the sequence and at least one of the corresponding frequency domain orthogonal cover code length, cyclic shift index, transmission comb index, frequency division multiplexing index, quadratic term coefficient index of the cubic polynomial, cubic term coefficient index of the cubic polynomial or time domain orthogonal cover code index, and the sequence includes the first sequence.

[0030] Based on this implementation method, the third indication can indicate the correspondence between the indication information of the sequence (such as the antenna port number) and the frequency domain orthogonal cover code index, the cyclic shift index, the transmission comb index, the frequency division multiplexing index, the quadratic term coefficient index of the cubic polynomial, the cubic term coefficient index of the cubic polynomial or the time domain orthogonal cover code index. Therefore, the first communication device can determine the frequency domain orthogonal cover code index, the cyclic shift index, the transmission comb index, the frequency division multiplexing index, the quadratic term coefficient index of the cubic polynomial, the cubic term coefficient index of the cubic polynomial or the time domain orthogonal cover code index of the first sequence according to the indication information of the first sequence, so as to determine the first sequence or transmit the first signal according to at least one of the frequency domain orthogonal cover code length, the cyclic shift index, the transmission comb index, the frequency division multiplexing index, the quadratic term coefficient index of the cubic polynomial and the cubic term coefficient index of the cubic polynomial.

[0031] In one possible implementation, the cubic coefficient of the cubic polynomial is associated with the cell ID, including: the cubic coefficient index λ of the cubic polynomial is a function of the cell ID. The quadratic coefficient of the cubic polynomial is associated with the cell ID, including: the quadratic coefficient index k of the cubic polynomial is a function of the cell ID.

[0032] Based on this implementation, different cubic term coefficient indices and / or quadratic term coefficient indices may be configured for different cells through cell planning.

[0033] In a possible implementation, the cubic term coefficient index λ of the cubic polynomial satisfies:

[0034] in, u c Indicates the sequence group number corresponding to the cubic coefficient index, v c Indicates the serial number corresponding to the index of the cubic term coefficient, v c and / or uc Associated with the cell identity, P c Indicates the number of candidate values ​​for the cubic term coefficient index.

[0035] Based on this implementation, P is uniformly selected from all P-1 possible cubic coefficient indices. c different candidate values.

[0036] In a possible implementation, the sequence group number u corresponding to the cubic coefficient index is c satisfy:

[0037] in, represents the group frequency hopping pattern of the cubic coefficient, n s Indicates the time slot number, The sequence offset pattern representing the cubic coefficient, the group hopping pattern of the cubic coefficient index and / or the sequence offset pattern of the cubic coefficient index are associated with the cell identifier.

[0038] Based on this implementation, the sequence group number corresponding to the cubic coefficient index can be jointly controlled by the group hopping pattern of the cubic coefficient index and the sequence offset pattern of the cubic coefficient index.

[0039] In a possible implementation, the quadratic term coefficient index k of the cubic polynomial satisfies:

[0040] in, u q Indicates the sequence group number corresponding to the quadratic term coefficient index, v q Indicates the serial number corresponding to the quadratic coefficient index, u q and / or v q associated with the cell identity, Indicates the number of candidate values ​​for the quadratic term coefficient index.

[0041] Based on this implementation, in all possible quadratic coefficient indices are uniformly selected different candidate values.

[0042] In a possible implementation, the sequence group number u corresponding to the quadratic term coefficient index of the cubic polynomial is q satisfy:

[0043] in, The group hopping pattern representing the quadratic term coefficient index, n s Indicates the time slot number, The sequence offset pattern of the quadratic term coefficient index is represented, and the group hopping pattern of the quadratic term coefficient index and / or the sequence offset pattern of the quadratic term coefficient index are associated with the cell identifier.

[0044] Based on this implementation, the sequence group number corresponding to the quadratic term coefficient index can be jointly controlled by the group hopping pattern of the quadratic term coefficient index and the sequence offset pattern of the quadratic term coefficient index.

[0045] In one possible implementation, when group frequency hopping is enabled, the group frequency hopping pattern indexed by the cubic term coefficient is satisfy:

[0046] Wherein, c(·) represents a Gold sequence, and the initial value of the Gold sequence is associated with the cell identifier to satisfy B c represents the truncation length of the Gold sequence corresponding to the cubic coefficient index, represents the number of time domain symbols contained in each time slot, l represents the cyclic shift index, and i represents the truncation position of the Gold sequence.

[0047] Based on this implementation, the group hopping pattern indexed by the cubic term coefficient includes P c candidate values.

[0048] In one possible implementation, the sequence offset pattern of the cubic coefficient index is satisfy:

[0049] in, represents the cell identifier, P c represents the number of candidate values ​​of the cubic coefficient index, Indicates the number of candidate values ​​for the quadratic term coefficient index.

[0050] Based on this implementation, the cubic coefficient index includes P c candidate sequence offset patterns.

[0051] In a possible implementation, the sequence number v corresponding to the cubic coefficient index is c Satisfy: v c =0.

[0052] Based on this implementation, the sequence number corresponding to the cubic term coefficient index does not change over time.

[0053] In one possible implementation, when group frequency hopping is enabled, the group frequency hopping pattern indexed by the quadratic term coefficient is satisfy:

[0054] Wherein, c(·) represents a Gold sequence, and the initial value of the Gold sequence is associated with the cell identifier to satisfy B q represents the truncation length of the Gold sequence corresponding to the quadratic term coefficient index, represents the number of time domain symbols contained in each time slot, l represents the cyclic shift index, and i represents the truncation position of the Gold sequence.

[0055] Based on this implementation, the group hopping patterns indexed by the quadratic term coefficients include candidate values.

[0056] In one possible implementation, the sequence offset pattern of the quadratic term coefficient index is satisfy:

[0057] in, represents the cell identifier, Indicates the number of candidate values ​​for the quadratic term coefficient index.

[0058] Based on this implementation, the quadratic term coefficient index includes candidate sequence offset patterns.

[0059] In a possible implementation, the sequence number v corresponding to the quadratic term coefficient index is q Satisfy: v q =0.

[0060] Based on this implementation, the sequence number corresponding to the quadratic term coefficient index does not change over time.

[0061] In a possible implementation manner, the first communication device may further obtain first information, where the first information is used to enable group frequency hopping.

[0062] Based on this implementation, the first communication device may determine, based on the first information for enabling group frequency hopping, to determine the cubic term coefficient index and the quadratic term coefficient index of the first sequence in the manner described.

[0063] Based on the above implementation, for adjacent cell identifiers, the frequency hopping patterns of the cubic coefficients are the same, and the frequency hopping patterns of the quadratic coefficients are shifted. Group frequency hopping does not cause frequency hopping pattern collision. At this time, the maximum value of the mutual ambiguity function of the first sequence used by adjacent cells is For cell identifiers that differ by more than For two cell identifiers, the frequency hopping pattern of the cubic coefficient is shifted, and the group frequency hopping will not cause the frequency hopping pattern to collide, and the maximum value of the mutual ambiguity function does not exceed For cell identifiers that differ by more than For two cell identifiers, group frequency hopping will cause the frequency hopping patterns to collide, and the interference will be greater.

[0064] In one possible implementation, when sequence hopping is enabled, the group hopping pattern of the cubic coefficient index is satisfy:

[0065] Based on this implementation, the group hopping pattern indexed by the cubic term coefficient does not change over time.

[0066] In one possible implementation, the sequence offset pattern of the cubic coefficient index is satisfy:

[0067] in, represents the cell identifier, P c represents the number of candidate values ​​of the cubic coefficient index, Indicates the number of candidate values ​​for the quadratic term coefficient index.

[0068] Based on this implementation, the cubic coefficient index includes P c candidate sequence offset patterns.

[0069] In a possible implementation, the sequence number v corresponding to the cubic coefficient index is c satisfy:

[0070] Wherein, c(·) represents a Gold sequence, and the initial value of the Gold sequence is associated with the cell identifier to satisfy Indicates the number of time domain symbols contained in each time slot, n s represents the time slot number, and l represents the cyclic shift index.

[0071] Based on this implementation, the sequence number of the cubic term coefficient index changes over time.

[0072] In one possible implementation, when sequence hopping is enabled, the group hopping pattern indexed by the quadratic term coefficient is satisfy:

[0073] Based on this implementation, the group hopping pattern indexed by the quadratic term coefficient does not change over time.

[0074] In one possible implementation, the sequence offset pattern of the quadratic term coefficient index is satisfy:

[0075] in, represents the cell identifier, Indicates the number of candidate values ​​for the quadratic term coefficient index.

[0076] Based on this implementation, the quadratic term coefficient index includes candidate sequence offset patterns.

[0077] In a possible implementation, the sequence number v corresponding to the quadratic term coefficient index is q satisfy:

[0078] Wherein, c(·) represents a Gold sequence, and the initial value of the Gold sequence is associated with the cell identifier to satisfy Indicates the number of time domain symbols contained in each time slot, n s represents the time slot number, and l represents the cyclic shift index.

[0079] Based on this implementation, the sequence number corresponding to the quadratic term coefficient index changes over time.

[0080] In a possible implementation, the first communication device may further obtain second information, where the second information is used to enable sequence frequency hopping.

[0081] Based on this implementation, the first communication device may determine the cubic term coefficient index and the quadratic term coefficient index of the first sequence in the above manner based on the first information for enabling sequence hopping.

[0082] In a possible implementation, the first communication device may further obtain indication information of a second sequence, where the indication information of the first sequence and the indication information of the second sequence satisfy at least one of the following:

[0083] The cubic coefficient index of the cubic polynomial corresponding to the indication information of the first sequence is different from the cubic coefficient index of the cubic polynomial corresponding to the indication information of the second sequence;

[0084] The quadratic term coefficient index of the cubic polynomial corresponding to the indication information of the first sequence is different from the quadratic term coefficient index of the cubic polynomial corresponding to the indication information of the second sequence.

[0085] Based on this implementation, the cubic term coefficient index of the sequence and / or the quadratic term coefficient index of the cubic polynomial can be modified to expand the sequence capacity.

[0086] In a second aspect, a communication method is provided. The method can be implemented by a second communication device. The second communication device can be used to receive signals. For example, the second communication device can be a terminal device or an access network device (or replaced by a network device, such as a base station). The second communication device can also be a component in the terminal device or a component in the access network device. Among them, the components in the present application may include, for example, at least one of a chip, a chip system, a processor, a transceiver, a processing unit, or a transceiver unit. Taking the execution subject as the second communication device as an example, the communication method provided in the present application may include the following steps: the second communication device obtains indication information of a first sequence, the first sequence is a cubic polynomial exponential sequence, the cubic term coefficient of the cubic polynomial is associated with the quadratic term coefficient of the cubic polynomial, and the quadratic term coefficient of the cubic polynomial is associated with the frequency domain position of the first sequence; the second communication device can also transmit a first signal, which is obtained by mapping the first sequence to frequency domain resources.

[0087] The possible implementations of the second aspect can refer to the corresponding possible implementations of the first aspect, and the repeated parts will be omitted.

[0088] In a third aspect, a communication device is provided. The device can implement the method described in any possible implementation of any of the first and second aspects. The device has the functions of the first or second communication device described above. The device can be, for example, a terminal device, a functional module in a terminal device, a network device, or a functional module in a network device.

[0089] In an optional implementation, the device may include a module corresponding to the method / operation / step / action described in any possible implementation of any aspect of the first to second aspects, and the module may be a hardware circuit, or software, or a hardware circuit combined with software. In an optional implementation, the device includes a processing unit (sometimes also referred to as a processing module) and a communication unit (sometimes also referred to as a transceiver module, a communication module, etc.). The transceiver unit can implement a sending function and a receiving function. When the transceiver unit implements the sending function, it can be called a sending unit (sometimes also referred to as a sending module). When the transceiver unit implements the receiving function, it can be called a receiving unit (sometimes also referred to as a receiving module). The sending unit and the receiving unit can be the same functional module, which is called a transceiver unit, and the functional module can implement a sending function and a receiving function; or, the sending unit and the receiving unit can be different functional modules, and the transceiver unit is a general term for these functional modules.

[0090] Exemplarily, when the apparatus is used to execute the method described in any one of the first aspect to the second aspect, the apparatus may include a communication unit and a processing unit.

[0091] In a fourth aspect, an embodiment of the present application also provides a communication device, comprising a processor for executing a computer program (or computer-executable instructions) stored in a memory. When the computer program (or computer-executable instructions) is executed, the device executes the method described in any possible implementation of any one of the first to second aspects.

[0092] In one possible implementation, the processor and memory are integrated;

[0093] In another possible implementation, the memory is located outside the communication device.

[0094] The communication device also includes a communication interface, which is used for the communication device to communicate with other devices, such as sending or receiving data and / or signals. Exemplarily, the communication interface can be a transceiver, circuit, bus, module or other type of communication interface.

[0095] In a fifth aspect, a computer-readable storage medium is provided, which is used to store computer programs or instructions. When the computer-readable storage medium is executed, the method described in any possible implementation of any aspect from the first to the second aspect and the method shown in any possible implementation thereof are implemented.

[0096] In a sixth aspect, a computer program product comprising instructions is provided, which, when executed on a computer, enables the method described in any possible implementation of any one of the first to second aspects to be implemented.

[0097] In a seventh aspect, an embodiment of the present application further provides a communication device for executing the method described in any possible implementation of any one of the first to second aspects above.

[0098] In an eighth aspect, a chip system is provided, which includes a logic circuit (or it can be understood that the chip system includes a processor, and the processor may include a logic circuit, etc.), and may also include an input and output interface. The input and output interface can be used to input messages and can also be used to output messages. The input and output interfaces can be the same interface, that is, the same interface can implement both the sending function and the receiving function; or, the input and output interfaces include an input interface and an output interface, the input interface is used to implement the receiving function, that is, for receiving messages; the output interface is used to implement the sending function, that is, for sending messages. The logic circuit can be used to perform the operations other than the sending and receiving functions in the method described in any possible implementation of any one of the first to second aspects above; the logic circuit can also be used to transmit messages to the input and output interface, or receive messages from other communication devices from the input and output interface. The chip system can be used to implement the method described in any possible implementation of any one of the first to second aspects above. The chip system can be composed of a chip, or it can include a chip and other discrete devices.

[0099] Optionally, the chip system may further include a memory, which may be used to store instructions, and the logic circuit may call the instructions stored in the memory to implement corresponding functions.

[0100] In the ninth aspect, a communication method is provided, which may include the method implemented by the first communication device as shown in the first aspect and any possible implementation thereof, and the method implemented by the second communication device as shown in the second aspect and any possible implementation thereof.

[0101] In a tenth aspect, a communication system is provided, which may include a first communication device and a second communication device. The first communication device may be used to implement the method of the first aspect and any possible implementation thereof, and the second communication device may be used to implement the method of the second aspect and any possible implementation thereof.

[0102] The technical effects brought about by the above third to tenth aspects can be found in the description of the beneficial effects of the corresponding schemes in the above first to second aspects, and will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0103] FIG1 is a schematic diagram of the architecture of a wireless communication system provided in an embodiment of the present application;

[0104] FIG2 is a schematic diagram of a DMRS communication port configuration provided in an embodiment of the present application;

[0105] FIG3 is a schematic diagram of a communication method provided in an embodiment of the present application;

[0106] FIG4 is a schematic diagram of a frequency hopping pattern when group frequency hopping is enabled according to an embodiment of the present application;

[0107] FIG5 is a schematic diagram of a frequency hopping pattern when sequence frequency hopping is enabled according to an embodiment of the present application;

[0108] FIG6 is a schematic structural diagram of a communication device provided in an embodiment of the present application;

[0109] FIG7 is a schematic structural diagram of another communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0110] To facilitate understanding of the embodiments of the present application, the application scenarios used in the present application are described using the communication system architecture shown in FIG1 as an example. FIG1 is a schematic diagram illustrating a possible, non-limiting system. As shown in FIG1 , a communication system 1000 includes a radio access network (RAN) 100 and a core network (CN) 200. The RAN 100 includes at least one network device (such as 110a and 110b in FIG1 , collectively referred to as 110) and at least one terminal device (such as 120a-120j in FIG1 , collectively referred to as 120). The RAN 100 may also include other RAN nodes, such as wireless relay devices and / or wireless backhaul devices (not shown in FIG1 ). The terminal device 120 is wirelessly connected to the network device 110. The network device 110 is wirelessly or wiredly connected to the core network 200. The core network device in the core network 200 and the network device 110 in the RAN 100 may be different physical devices, or they may be the same physical device that integrates the core network logical functions and the radio access network logical functions.

[0111] The RAN 100 may be a cellular system related to the 3rd Generation Partnership Project (3GPP), such as a 4th generation (4G), long term evolution (LTE), 5th generation (5G), new radio (NR) mobile communication system, or an evolutionary system after 5G (such as a 6th generation (6G) mobile communication system). The RAN 100 may also be an open access network (O-RAN or ORAN), a cloud radio access network (CRAN), or a wireless fidelity (WiFi) system. The RAN 100 may also be a communication system that integrates two or more of the above systems.

[0112] The apparatus provided in the embodiment of the present application can be applied to the network device 110 or to the terminal device 120. It is understood that FIG1 only shows a possible communication system architecture to which the embodiment of the present application can be applied, and in other possible scenarios, the communication system architecture may also include other devices.

[0113] Another communication system used in the embodiment of the present application may include a first communication device and a second communication device.

[0114] In one implementation method, the first communication device is a network device or a module for a network device, and the second communication device is a terminal device or a module for a terminal device, wherein the network device is, for example, an access network device. The first communication device and the second communication device communicate via an air interface.

[0115] In another implementation method, the first communication device is a terminal device or a module for a terminal device, and the second communication device is a network device or a module for a network device. The first communication device and the second communication device communicate with each other via an air interface.

[0116] In another implementation method, the first communication device is a network device or a module for a network device, and the second communication device is a network device or a module for a network device. The first communication device and the second communication device communicate with each other via an air interface or a wired manner.

[0117] In another implementation method, the first communication device is a terminal device or a module for a terminal device, and the second communication device is a terminal device or a module for a terminal device. The first communication device and the second communication device communicate with each other via an air interface.

[0118] Of course, the first communication device and the second communication device in the embodiment of the present application can also be other types of devices. For example, the first communication device can also be a cloud device or a cloud server and the second communication device can be a cloud device or a cloud server. This application does not limit this.

[0119] In the implementation of this application, a terminal device is a device with wireless transceiver capabilities, and may specifically refer to user equipment (UE), access terminal, subscriber unit, user station, mobile station, remote station, remote terminal, mobile device, user terminal, wireless communication device, user agent, or user device. The terminal device can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; can also be deployed on water (such as ships); and can also be deployed in the air (such as aircraft, balloons, and satellites). The terminal device may be a cellular phone, a mobile phone, a tablet computer (pad), a handheld device, a laptop computer, a wireless data card, a personal digital assistant computer, a wireless modem, a machine type communication terminal, a satellite terminal, a vehicle (e.g., a car, a bicycle, an electric car, an airplane, a ship, a train, a high-speed rail, etc.) onboard equipment, a robotic arm, a workshop equipment, a wearable device (e.g., a smart watch, a smart bracelet, a pedometer, etc.), a drone, a robot, a smart point of sale (POS) machine, a customer-premises equipment (CPE), a computer with wireless transceiver function, a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a terminal device in industrial control, a terminal device in self-driving, a terminal device in remote medical care, a terminal device in a smart grid, a terminal in transportation safety, a terminal device in a smart city, a smart home, or a similar terminal device. The terminal device may also be other devices with terminal functions. The embodiments of the present application do not limit the device form of the terminal. The device for realizing the function of the terminal device may be a terminal device; or it may be a device that can support the terminal device to realize the function, such as a chip system. The device may be installed in the terminal device or used in combination with the terminal device. In the embodiments of the present application, the chip system may be composed of chips, or may include chips and other discrete devices.

[0120] In the implementation of this application, the network device is a device with wireless transceiver functions, which is used to communicate with the terminal device or other network devices; it can also be a device that can access the terminal device to the wireless network, such as a radio access network (RAN) device or node. The network devices in the embodiments of the present application may include various forms of base stations, such as: base stations, evolved NodeBs (eNodeBs), next generation NodeBs (gNodeBs, gNBs), macro base stations, micro base stations (also known as small stations), relay stations, access points, devices that implement base station functions in communication systems evolved after the fifth generation (5G) technology, access points (APs) in wireless local area networks (WLANs), integrated access and backhaul (IAB) nodes, transmission points (TRPs), transmitting points (TPs), mobile switching centers, and devices that perform base station functions in device-to-device (D2D), vehicle-to-everything (V2X), and machine-to-machine (M2M) communications, etc., and may also include non-terrestrial communication networks (non-terrestrial networks). A base station is a network device in a wireless network (NTN) communication system, which can be deployed on a high-altitude platform or satellite. In some possible scenarios, different network devices respectively implement part of the functions of a base station. For example, a network device can be a centralized unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU). The CU and DU can be set separately, or they can be included in the same network element, such as a baseband unit (BBU). The RU can be included in a radio frequency device or a radio frequency unit, such as a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH).It is understood that the network device may be a CU node, a DU node, or a device including a CU node and a DU node. In addition, the CU may be classified as a network device in the access network RAN, or may be classified as a network device in the core network CN, without limitation herein.

[0121] 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, in an open access network (open RAN, ORAN) system, CU may also be called O-CU (open CU), DU may also be called O-DU, CU-CP may also be called O-CU-CP, CU-UP may also be called O-CU-UP, and RU may also be called O-RU. For the convenience of description, this application uses CU, CU-CP, CU-UP, DU and RU as examples for description. Any unit of CU (or CU-CP, CU-UP), DU and RU in this application can be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0122] In the embodiments of the present application, the form of the network device is not limited. The device used to implement the function of the network device can be a network device; it can also be a device that can support the network device to implement the function, such as a chip system. The device can be installed in the network device or used in conjunction with the network device.

[0123] It can be understood that the network devices and terminal devices, the network devices and the network devices, and the terminal devices in this application can communicate through authorized spectrum, can communicate through unauthorized spectrum, or can communicate through both authorized spectrum and unauthorized spectrum. In addition, the network devices and the terminal devices, the network devices and the network devices, and the terminal devices can communicate through spectrum below 6 gigahertz (GHz), for example, through 700 / 900 megahertz (MHz), 2.1 / 2.6 / 3.5GHz frequency bands, or through spectrum above 6GHz, for example, through millimeter waves, terahertz (THz) waves, and can also use spectrum below 6GHz and spectrum above 6GHz for communication at the same time. The embodiments of this application do not limit the spectrum resources used for wireless communication.

[0124] In the embodiments of the present application, the functions of the network device may also be performed by a module (such as a chip) in the network device, or by a control subsystem that includes the network device functions. The control subsystem that includes the network device functions here may be a control center in the above-mentioned application scenarios such as smart grid, industrial control, smart transportation, and smart city. The functions of the terminal device may also be performed by a module (such as a chip or a modem) in the terminal device, or by a device that includes the terminal device functions.

[0125] Throughout the evolution of communication systems, high throughput and a large number of connections have always been core challenges for wireless communication networks. To address these challenges, 5G communications have proposed applications such as enhanced mobile broadband (eMBB), ultra-reliable and low-latency communication (URLLC), and massive machine-type communication (mMTC) as technical goals. The 6G communication system, which will evolve after 5G, will inevitably evolve towards higher throughput, lower latency, higher reliability, a larger number of connections, and greater spectrum utilization.

[0126] The following is an introduction to the technical terms involved in this application.

[0127] (1) Frequency hopping pattern refers to the relationship between sequence parameters and time.

[0128] (2) Group hopping refers to the change of sequence group numbers over time.

[0129] (3) Sequence hopping refers to the change of sequence numbers over time.

[0130] The problems addressed by this application are described below.

[0131] At present, in LTE and NR communication systems, the DMRS of the OFDM waveform adopts the Gold sequence of frequency domain mapped QPSK modulation. The initial value of the Gold sequence can be determined by the cell identifier or the scrambling identifier. Among them, in the evolution process of the NR OFDM waveform DMRS, release (Rel) -15 to Rel-17 support a maximum of 12 orthogonal DMRS ports, namely DMRS port 0 to DMRS port 11. The 12 orthogonal DMRS ports use 2 frequency domain orthogonal cover codes (FD-OCC), 2 time domain orthogonal cover codes (TD-OCC) and 3 frequency division multiplexing (FDM). In addition, Rel-18 supports a maximum of 24 orthogonal DMRS ports, namely DMRS port 0 to DMRS port 23. The 24 orthogonal DMRS ports multiplex 4 FD-OCC, 2 TD-OCC and 3 FDM.

[0132] Figure 2 shows a schematic diagram of the types of NR OFDM waveform DMRS port configurations, where number (a) corresponds to the configuration types supported by Rel-15 to Rel-17, including NR DMRS configuration type 1 (type 1) and NR DMRS configuration type 2 (type 2), and number (b) corresponds to the configuration types supported by Rel-18, including NR DMRS configuration type 1 and NR DMRS configuration type 2.

[0133] The Gold sequence has good autocorrelation and cross-correlation characteristics, but the self-ambiguity performance of the Gold sequence is poor, and the cross-ambiguity performance of the Gold sequence is poor. On the one hand, the poor self-ambiguity performance is reflected in the large Doppler sidelobes of the self-ambiguity function of the Gold sequence. For high-speed mobile scenarios, the DMRS ports of the cyclic shift, transmission comb, orthogonal cover code or frequency division multiplexing are no longer orthogonal, that is, the frequency deviation caused by factors such as high-speed movement destroys the orthogonality between the DMRS ports. On the other hand, the cross-correlation function between the Gold sequences scrambled with different initial values ​​fluctuates randomly, resulting in large interference between non-orthogonal DMRS ports. Therefore, the self-ambiguity and cross-ambiguity performance of the Gold sequence will lead to increased interference between non-orthogonal DMRS ports in some situations, resulting in reduced transmission performance.

[0134] In order to solve the above technical problems, the present application provides a communication method. The communication method can be implemented by a first communication device and a second communication device. Optionally, the first communication device can serve as a signal sending end, and the second communication device can serve as a signal receiving end. That is, the first communication device can be used to send signals, and the second communication device can be used to receive signals. As an example, during uplink communication, the first communication device can be a terminal device, or can be a module or chip or other component in the terminal device, and the second communication device can be a network device, or can be a module or chip or other component in the network device, and the network device can be, for example, a RAN or other access network device. As another example, during downlink communication, the first communication device can be a network device, or can be a module or chip or other component in the network device, and the second communication device can be a terminal device, or can be a module or chip or other component in the terminal device. Similarly, it can also be considered that the first communication device can serve as a signal receiving end, and the second communication device can serve as a signal sending and receiving end.

[0135] The method is described below with reference to the process shown in FIG3 .

[0136] S101: A first communication device and a second communication device respectively obtain indication information of a first sequence.

[0137] In this application, the first sequence is a cubic polynomial exponential sequence, and the expression of the first sequence satisfies:

[0138] Wherein, N represents the sequence length of the first sequence, a in the cubic polynomial represents the cubic term coefficient, b represents the quadratic term coefficient, c represents the linear term coefficient, and d represents the constant term.

[0139] Optionally, if the constant term d in the cubic polynomial is 0, the expression of the first sequence can also satisfy:

[0140] Wherein, N represents the sequence length of the first sequence, a in the cubic polynomial represents the coefficient of the cubic term, b represents the coefficient of the quadratic term, and c represents the coefficient of the linear term.

[0141] Optionally, if the length of the first sequence is a prime number, the expression of the first sequence may also satisfy:

[0142] Where N represents the length of the first sequence, and a, b, and c are all finite fields. The elements in , then the sequence capacity of the first sequence is positively correlated with the cube of the sequence length.

[0143] Optionally, if the length of the first sequence is a prime number and the constant term d in the cubic polynomial is 0, the expression of the first sequence may also satisfy:

[0144] Where N represents the length of the first sequence, and a, b, and c are all finite fields. The elements in , then the sequence capacity of the first sequence is positively correlated with the cube of the sequence length.

[0145] In the present application, the cubic term coefficient a is associated with the quadratic term coefficient b, that is, there is an association relationship between the cubic term coefficient a and the quadratic term coefficient b. Optionally, "associated" can be replaced with or understood as "corresponding".

[0146] As an example of how the cubic coefficient a and the quadratic coefficient b are associated, the cubic coefficient a and the quadratic coefficient b are both associated with λ. The value range of λ is an integer greater than or equal to 1 and less than or equal to P-1, where P is a maximum prime number that does not exceed the sequence length N of the first sequence.

[0147] Optionally, the cubic term coefficient a is related to λ, and the quadratic term coefficient b is related to a multiple (such as an integer multiple) of λ. In other words, the quadratic term coefficient b is a multiple (such as an integer multiple) of the cubic term coefficient a.

[0148] In addition, in the present application, the quadratic term coefficient b is associated with the frequency domain position of the first sequence. The frequency domain position is the position of the frequency domain resource mapped by the first sequence. Optionally, the first sequence in the present application adopts non-continuous mapping in the frequency domain. For example, the frequency domain position may correspond to a transmission comb (TC) index or a frequency division multiplexing index. The frequency domain position corresponding to the transmission comb index may mean that when frequency domain comb mapping is adopted, the frequency domain position can be indicated by the transmission comb index. Optionally, at this time, the quadratic term coefficient b may be associated with the transmission comb index. The frequency domain position corresponding to the frequency division multiplexing index may mean that when frequency division multiplexing mapping is adopted, the frequency domain position can be indicated by the frequency division multiplexing index. Optionally, at this time, the quadratic term coefficient b may be associated with the frequency division multiplexing index.

[0149] In addition, the cubic coefficient a and / or the quadratic coefficient b of the cubic polynomial are associated with the cell identifier. Therefore, the sequences corresponding to adjacent cells are equivalent to frequency hopping pattern shifting, which does not cause frequency hopping pattern collision, thereby reducing transmission interference and improving transmission performance.

[0150] The cell ID can be a real cell ID (cell ID), that is, corresponding to a cell; the cell ID can also be a virtual cell ID, that is, not corresponding to a real cell, for example, it can correspond to a certain area in a real cell. In addition, the cell ID can also be a scrambled ID.

[0151] In the present application, when different frequency hopping schemes are adopted, the cubic term coefficient a of the cubic polynomial and the quadratic term coefficient b of the cubic polynomial are respectively implemented in different ways. The expressions of the cubic term coefficient a and the quadratic term coefficient b will be introduced in combination with Example 1 and Example 2 below, which will not be expanded here.

[0152] In the present application, the cubic polynomial exponential sequence can be determined based on the base sequence and the auxiliary sequence. For example, the cubic polynomial exponential sequence can be expressed as the point-by-point multiplication of the base sequence and the auxiliary sequence s a,b,c (n) = u a (n)·v b,c (n).

[0153] Among them, the base sequence u a (n) Satisfy global low ambiguity. For example, the maximum value of the self-ambiguity function of the base sequence is The maximum value of the mutual ambiguity function of the basis sequence does not exceed Auxiliary sequence v b,c (n) Satisfy low ambiguity and high capacity. For example, the maximum value of the mutual ambiguity function of the auxiliary sequence within the maximum delay spread and maximum Doppler spread range is The number of auxiliary sequences is positively correlated with the square of the sequence length.

[0154] As an example, a base sequence may satisfy:

[0155] The auxiliary sequence can satisfy:

[0156] It can be understood that the first sequence satisfies the exponential sum theorem, which can also be called the Weil bound on exponential sum theorem. Therefore, the first sequence can also be called the Weil exponential sum sequence, or simply the W sequence.

[0157] Where, the exponent and theorem are:

[0158] d-degree polynomial p(n)=p d n d +p d-1 n d-1 The coefficient of the highest-order term in +…+p1n+p0 represents the finite field {1,…,N-1}; the coefficient of the non-highest-order term represents the finite field {0,1,…,N-1}, N is a prime number, d≥1, and the exponential sum satisfy: |·| represents modulo.

[0159] In particular, when d = 2, the exponential sum degenerates into a Gaussian sum That is, the Gaussian sum satisfies:

[0160] In this application, the first sequence of time domain continuous mapping and The mutual fuzzy function satisfies:

[0161] Therefore, as long as the mutual ambiguity function of two cubic polynomial exponential sequences does not have a peak value N in the ambiguity region, the maximum value of the ambiguity function does not exceed It should be pointed out that for any two cubic polynomial exponents and sequences, there is no guarantee that the mutual ambiguity function will not have a peak N in the ambiguity region. For example, and Fuzzy zone Δ T ×Δ F =2×3, the mutual ambiguity function has a peak at <τ,ν>=<1,2> In order to ensure low ambiguity between sequences, it is necessary to design cubic polynomial exponents and sequences in the fuzzy region Δ T ×Δ F Avoid the peak of the mutual ambiguity function and maximize the sequence capacity. T represents the maximum delay spread, Δ F In the case where the sequence length of the first sequence is a composite number, the expression of the first sequence will be further explained below in conjunction with Example 1 and Example 2, and will not be described here in detail.

[0162] S102: The first communication device and the second communication device transmit a first signal.

[0163] The first signal corresponds to the first sequence. For example, the first signal is a signal obtained by frequency-domain resource mapping the first sequence. The frequency-domain mapping method can be obtained by frequency-domain resource mapping the first sequence based on a transmission comb index or a frequency division multiplexing index. This will be described below in conjunction with Embodiments 1 and 2, and will not be expanded here.

[0164] In the present application, in uplink communication or downlink communication, a first signal may be transmitted between the first communication device and the second communication device via an air interface, for example, the first communication device sends the first signal to the second communication device.

[0165] For example, both the first communication device and the second communication device have air interface transmission capabilities, such as both the first communication device and the second communication device have wireless transceivers such as antennas, then the first communication device can send the first signal through the wireless transceiver, and accordingly, the second communication device can receive the first signal through the wireless transceiver, and demodulate and process the first signal to obtain the information carried by the first signal.

[0166] In addition, the first communication device and / or the second communication device may be a device or apparatus that does not have air interface communication capabilities, such as a chip. The first communication device and / or the second communication device may communicate via an external antenna or other wireless transceiver. For example, in a case where neither the first communication device nor the second communication device has air interface communication capabilities, the first communication device may output a first signal to the antenna via an interface between the first communication device and the antenna, and the antenna may be used to transmit the first signal via the air interface. Correspondingly, the antenna connected to the second communication device may be used to receive the first signal transmitted via the air interface and transmit the signal to the second communication device via the interface between the antenna and the second communication device. The second communication device may then perform demodulation or other processing on the received signal to obtain the information carried by the first signal.

[0167] Based on the process shown in Figure 3, the first communication device can determine the first sequence according to the indication information of the first sequence, and send the first signal corresponding to the first sequence. The first sequence can be a Weil index sum sequence, that is, a sequence that satisfies the index sum theorem, and has better self-ambiguity and mutual ambiguity characteristics than the Gold sequence. If frequency domain mapping is used to construct a non-orthogonal frequency offset-resistant DMRS sequence, the interference between non-orthogonal DMRS ports can be reduced, the DMRS sequence capacity can be increased, and thus the transmission performance can be improved. In addition, the cubic term coefficient a and / or the quadratic term coefficient b of the first sequence are associated with the cell identifier. Therefore, the sequence corresponding to the adjacent cell is equivalent to performing a frequency hopping pattern shift, which will not cause a collision of the frequency hopping pattern, can reduce the transmission interference of users between different cells, and improve the transmission performance.

[0168] The following is an introduction to the indication information of the first sequence in this application.

[0169] In the present application, the indication information of the first sequence can be used to determine the first sequence. For example, the indication information of the first sequence can include parameters related to the first sequence, such as the quadratic coefficients and / or cubic coefficients of the first sequence. In another example, the indication information can be used to indicate the index of the first sequence in a sequence codebook. In another example, the indication information can include the first sequence, i.e., the indication information includes the entire sequence of the first sequence. The following describes the implementation of the indication information of the first sequence using examples.

[0170] Optionally, in uplink transmission and / or downlink transmission, the network device may send indication information of the first sequence to the terminal device, that is, the network device may indicate the first sequence to the terminal device. The indication information of the first sequence may be included in a radio resource control (RRC) message, a medium access control (MAC) control element (CE), or downlink control information (DCI) sent by the network device to the terminal device.

[0171] In the present application, the first communication device may be a terminal device, and the second communication device may be a network device, so the second communication device may send the first sequence of indication information to the first communication device. Alternatively, the first communication device may be a network device, and the second communication device may be a terminal device, so the first communication device may send the first sequence of indication information to the second communication device.

[0172] As an example, in uplink transmission, a first sequence of indication information may be sent by a network device to a terminal device. At this time, the terminal device may serve as a first communication device, the network device may serve as a second communication device, and the first sequence of indication information may be sent by the network device to the terminal device. Therefore, in uplink transmission, the first communication device obtaining the first sequence of indication information may refer to: the first communication device receiving the first sequence of indication information from the second communication device. The second communication device obtaining the first sequence of indication information may refer to: the second communication device generating the first sequence of indication information after allocating the first sequence to the first communication device, or the network device reading the generated first sequence of indication information.

[0173] As another example, in downlink transmission, the network device can still send the first sequence of indication information to the terminal device. In this case, the network device can serve as the first communication device, and the terminal device can serve as the second communication device. Therefore, in downlink transmission, the first communication device obtaining the first sequence of indication information can mean that the first communication device generates indication information for indicating the first sequence after allocating the first sequence to the second communication device, or the network device reads the generated first sequence of indication information; the second communication device obtaining the first sequence of indication information can mean that the second communication device receives the first sequence of indication information from the first communication device.

[0174] In addition, in communication between terminal devices, the first communication device and the second communication device may be different terminal devices. In this case, the first communication device may send the first sequence of indication information to the second communication device, or the second communication device may send the first sequence of indication information to the first communication device. In addition, in communication between terminal devices, the first sequence may also be configured by the network device. In this case, as an implementation of S101, the first communication device and the second communication device may each receive the first sequence of indication information from the network device.

[0175] The following is an example of how to implement the first sequence of indication information.

[0176] (1) As a possible implementation, the indication information of the first sequence can be used to indicate parameters related to the first sequence. The parameters related to the first sequence can be used to indicate the first sequence and / or to transmit the first signal corresponding to the first sequence, or the parameters related to the first sequence can be used to determine the first sequence and / or to transmit the first signal corresponding to the first sequence. For example, the parameters related to the first sequence can include one or more parameters in the expression of the first sequence, such as the frequency domain orthogonal cover code index, the delay domain cyclic shift index, the transmission comb index, the frequency division multiplexing index, the Doppler domain cyclic shift index, the cubic coefficient index of the cubic polynomial or at least one of the time domain orthogonal cover code index. Therefore, the first communication device and / or the second communication device can determine the first sequence and / or transmit the first signal based on the indication information of the first sequence. Among them, the frequency domain orthogonal cover code index can be used to indicate the frequency domain orthogonal cover code. The time domain orthogonal cover code index can be used to indicate the time domain orthogonal cover code.

[0177] Specifically, the indication information of the first sequence may indicate an antenna port, for example, the indication information includes an antenna port number. The antenna port number corresponds to a parameter related to the first sequence. Therefore, when the first communication device and / or the second communication device obtains the antenna port number, it can query the correspondence between the antenna port number and the parameter related to the first sequence to determine the parameter related to the first sequence corresponding to the antenna port number.

[0178] Optionally, in this implementation, the network device may send the correspondence between the antenna port number and the sequence-related parameters through an RRC message. Therefore, the first communication device and / or the second communication device can obtain the correspondence between the antenna port and the sequence-related parameters, including the correspondence between the antenna port number corresponding to the first sequence and the parameters related to the first sequence. In addition, the network device may also send indication information of the first sequence for the transmission of the first signal, indicating the port number corresponding to the first sequence. Therefore, the first communication device and / or the second communication device can query according to the antenna port number and obtain the parameters related to the first sequence.

[0179] (2) As another possible implementation, the indication information of the first sequence may be an index of the first sequence in a sequence codebook. The sequence codebook may be indicated by the network device through configuration information. Accordingly, when the first sequence needs to be indicated, the network device may indicate the index of the first sequence in the sequence codebook through the indication information of the first sequence.

[0180] For example, the network device may configure a sequence codebook to the terminal device through an RRC message or a MAC CE, and send indication information of the first sequence to the terminal device through a DCI. At this time, the indication information of the first sequence may be an index of the sequence, used to indicate the sequence from the sequence codebook. For another example, the indication information of the first sequence may indicate parameters related to the first sequence. For example, the parameters related to the first sequence include at least one of an index for indicating a frequency domain orthogonal cover code, a delay domain cyclic shift index, a transmission comb index, a frequency division multiplexing index, a Doppler domain cyclic shift index, an index of the cubic coefficient of the cubic polynomial, or an index of an orthogonal cover code in the time domain; accordingly, the terminal device may obtain the parameters of the first sequence according to the indication information of the first sequence, determine the first sequence according to the expression of the first sequence and the corresponding parameters in this application, and transmit the first signal.

[0181] (3) As another possible implementation, the indication information of the first sequence may include the first sequence. Accordingly, the first communication device and / or the second communication device may obtain the first sequence according to the indication information of the first sequence.

[0182] The first sequence in this application is described below in conjunction with Example 1 and Example 2. Example 1 provides a method for constructing a DMRS sequence for frequency-domain comb mapping. When the number of cyclic shifts is 2 and the number of transmission combs is 2, Example 1 corresponds to NR DMRS configuration type 1. Example 2 provides a method for constructing a DMRS sequence for frequency-division multiplexing mapping. When the frequency-domain orthogonal cover code length is 2 and the number of frequency-division multiplexing is 3, Example 2 corresponds to NR DMRS configuration type 2.

[0183] In Example 1, when frequency domain comb mapping is adopted, the cubic coefficient of the first sequence is The coefficient of the quadratic term of the first sequence is

[0184] Where P can be the largest prime number that does not exceed the sequence length N. If resource allocation is based on a resource block (including 12 subcarriers), the sequence length N of the first sequence is usually a composite number. This application does not limit resource allocation to a resource block granularity, and a larger or smaller resource allocation granularity can be used in actual applications. M represents the number of transmission comb teeth, Δ Frepresents the maximum Doppler spread, λ represents the index of the cubic coefficient of the cubic polynomial of the first sequence, k represents the index of the quadratic coefficient of the cubic polynomial, and m represents the transmission comb index.

[0185] Optionally, the first sequence s λ,k,l,m The expression of (n) satisfies:

[0186] Wherein, N represents the length of the first sequence, Δ T represents the maximum delay spread, n represents the time domain resource index of the first sequence, and l represents the cyclic shift index. In this application, the time domain resource index of the first sequence is, for example, the symbol position of the first sequence or a time domain position of other granularity other than the symbol.

[0187] Optionally, the value range of λ,k,l,m can satisfy: Here, ∨ represents logical OR. Indicates rounding down. In some applications, rounding down can be replaced by rounding up or rounding up.

[0188] The values ​​of λ and / or k are related to the cell identifier, which will be described below in combination with Embodiment 3 and Embodiment 4 and will not be expanded here.

[0189] In embodiment 1, the first communication device may perform frequency domain resource mapping on the first sequence according to the transmission comb index m to obtain the first signal, that is, the first signal is obtained by performing frequency domain resource mapping on the first sequence according to the transmission comb index m.

[0190] For example, the first signal The expression can satisfy:

[0191] Among them, N represents the sequence length of the first sequence, M represents the number of transmission comb teeth, n represents the time domain resource position of the first sequence, λ represents the cubic coefficient index of the cubic polynomial, k represents the quadratic coefficient index of the cubic polynomial, l represents the cyclic shift index, m represents the transmission comb index, δ(i) represents the impulse function, and i represents the frequency domain resource index. In this application, if the subcarrier is used as the granularity of the frequency domain resource, the frequency domain resource index can be the subcarrier number. In addition, this application does not limit the frequency domain resource to only the subcarrier granularity. For example, a larger or smaller frequency domain resource granularity can be used.

[0192] It can be seen that if the subcarrier is used as the granularity of the frequency domain resources, the first signal occupies M·N subcarriers in total.

[0193] Optionally, if the ambiguity function of the first sequence is applicable to the exponential sum theorem, the maximum Doppler spread ΔF And the transmission comb teeth number M can satisfy:

[0194] in, represents an integer. Therefore, the mutual fuzzy function of the first order is subject to the conditions of the exponential sum theorem.

[0195] Optionally, in embodiment 1, the first communication device and the second communication device may obtain a first indication, where the first indication corresponds to a transmission comb index. In other words, the first indication corresponds to sequence mapping according to the transmission comb index. For example, the first indication may be indication information of NR DMRS configuration type 1.

[0196] In the uplink transmission and / or downlink transmission, the network device may send a first indication to the terminal device, that is, the network device may indicate the sequence mapping mode or the NR DMRS configuration type to the terminal device. The first indication may be included in an RRC message, MAC CE or DCI sent by the network device to the terminal device.

[0197] In Example 2, when frequency domain comb mapping is used, the cubic coefficient of the first sequence is The coefficient of the quadratic term of the first sequence is

[0198] Wherein, P is the maximum prime number that does not exceed the sequence length of the first sequence, M represents the frequency division multiplexing number, Q represents the frequency domain orthogonal cover code length, Δ F represents the maximum Doppler spread, q represents the symbol position of the frequency domain orthogonal cover code, the value range of q is an integer greater than or equal to 0 and less than or equal to Q-1, λ represents the cubic coefficient index of the cubic polynomial, k represents the quadratic coefficient index of the cubic polynomial, and m represents the frequency division multiplexing index.

[0199] Optionally, the first sequence s λ,k,l,r,m The expression of (n,q) satisfies:

[0200] Wherein, N represents the length of the first sequence, Δ T represents the maximum delay spread, n represents the time domain position of the first sequence (such as the symbol position), l represents the cyclic shift index, and r represents the frequency domain orthogonal cover code index.

[0201] In Example 2, the value ranges of λ, k, l, m, and r can satisfy:

[0202] Here, ∨ represents logical OR.

[0203] The values ​​of λ and / or k are related to the cell identifier, which will be described below in combination with Embodiment 3 and Embodiment 4 and will not be expanded here.

[0204] In embodiment 2, the first communication device can perform frequency domain resource mapping on the first sequence according to the frequency division multiplexing index m and the symbol position q of the frequency domain orthogonal cover code to obtain the first signal, that is, the first signal is obtained by performing frequency domain resource mapping on the first sequence according to the frequency division multiplexing index m and the symbol position q of the frequency domain orthogonal cover code.

[0205] For example, the first signal The expression can satisfy:

[0206] Wherein, N represents the sequence length of the first sequence, M represents the frequency division multiplexing number, Q represents the frequency domain orthogonal cover code length, s λ,k,l,r,m (n,q) represents the first sequence, n represents the symbol position of the first sequence, q represents the symbol position of the frequency domain orthogonal cover code, λ represents the cubic coefficient index of the cubic polynomial, k represents the quadratic coefficient index of the cubic polynomial, l represents the cyclic shift index, m represents the frequency division multiplexing index, δ(i) represents the impulse function, and i represents the frequency domain resource index.

[0207] It can be seen that if the subcarrier is used as the granularity of the frequency domain resources, the first signal occupies a total of M·N·Q subcarriers.

[0208] Optionally, if the ambiguity function of the first sequence is applicable to the exponential sum theorem, the maximum Doppler spread Δ F And the transmission comb teeth number M can satisfy:

[0209] in, represents an integer. Therefore, the mutual fuzzy function of the first order is subject to the conditions of the exponential sum theorem.

[0210] Optionally, in embodiment 2, the first communication device and the second communication device may obtain a second indication, where the second indication corresponds to a frequency division multiplexing index. In other words, the first indication corresponds to sequence mapping according to the frequency division multiplexing index. For example, the second indication may be indication information of NR DMRS configuration type 2.

[0211] In the uplink transmission and / or downlink transmission, the network device may send a second indication to the terminal device, that is, the network device may indicate the sequence mapping mode or NR DMRS configuration type to the terminal device. The second indication may be included in an RRC message, MAC CE or DCI sent by the network device to the terminal device.

[0212] In the present application, the cubic coefficient index λ of the cubic polynomial is related to the cell identifier, that is, different cells correspond to different sequences, and the cubic coefficient index λ of the cubic polynomial of different sequences is different.

[0213] As a possible example, the cubic coefficient index λ of a cubic polynomial may satisfy:

[0214] in, u c Indicates the sequence group number corresponding to the cubic coefficient index, v c Indicates the serial number corresponding to the index of the cubic coefficient, P c The number of candidate values ​​of the cubic coefficient index is represented by P. c It can be the number of all selectable cubic coefficient indices λ when the sequence length is N.

[0215] In formula 1, the sequence group number u corresponding to the cubic coefficient index c and / or the serial number v corresponding to the cubic coefficient index c Associated with the cell ID.

[0216] For example, the sequence group number u corresponding to the cubic coefficient index c The group hopping pattern corresponding to the cubic coefficient index Sequence offset pattern corresponding to the cubic coefficient index Related, that is, the sequence group number u corresponding to the cubic coefficient index c The corresponding group frequency hopping pattern can be indexed according to the cubic coefficient Sequence offset pattern corresponding to the cubic coefficient index Determine. Among them, the group frequency hopping pattern corresponding to the cubic coefficient index Sequence offset pattern corresponding to the cubic coefficient index At least one item in is associated with a cell identifier.

[0217] For example, the sequence group number u corresponding to the cubic coefficient index c Can satisfy:

[0218] In formula 2, Indicates the group frequency hopping pattern corresponding to the cubic coefficient index, Indicates the sequence offset pattern corresponding to the cubic coefficient index.

[0219] The following describes the group frequency hopping pattern corresponding to the cubic coefficient index through embodiments 3 and 4. Sequence offset pattern corresponding to the cubic coefficient index The serial number v corresponding to the index of the cubic coefficient c The difference between Example 3 and Example 4 is that Example 3 is applicable to the scenario of enabling group frequency hopping, while Example 4 is applicable to the scenario of enabling sequence frequency hopping.

[0220] In addition, in the present application, the quadratic coefficient index k of the cubic polynomial is related to the cell identifier, that is, different cells correspond to different sequences, and the quadratic coefficient index k of the cubic polynomial of different sequences is different.

[0221] As a possible example, the quadratic term coefficient index k of a cubic polynomial may satisfy:

[0222] in, u q Indicates the sequence group number corresponding to the quadratic term coefficient index, v q Indicates the serial number corresponding to the quadratic coefficient index k, v q and u q associated with the cell identity, Indicates the number of candidate values ​​for the quadratic coefficient index. It can be the number of all selectable quadratic term coefficient indices k when the sequence length is N.

[0223] In formula 3, the sequence group number u corresponding to the quadratic term coefficient index q and / or the sequence number v corresponding to the quadratic coefficient index q Associated with the cell ID.

[0224] For example, the sequence group number u corresponding to the quadratic term coefficient index q The group hopping pattern corresponding to the quadratic term coefficient index Sequence offset pattern corresponding to the quadratic coefficient index Related, that is, the sequence group number u corresponding to the quadratic coefficient index q The corresponding group hopping pattern can be indexed according to the quadratic term coefficient Sequence offset pattern corresponding to the quadratic coefficient index Determine. Among them, the group frequency hopping pattern corresponding to the quadratic term coefficient index Sequence offset pattern corresponding to the quadratic coefficient index At least one item in is associated with a cell identifier.

[0225] For example, the sequence group number u corresponding to the quadratic term coefficient index q Can satisfy:

[0226] In formula 4, Indicates the group frequency hopping pattern corresponding to the quadratic term coefficient index, Indicates the sequence offset pattern corresponding to the quadratic term coefficient index.

[0227] The group frequency hopping pattern corresponding to the quadratic term coefficient index is shown in the following example 3 and example 4. Sequence offset pattern corresponding to the quadratic term coefficient index The serial number v corresponding to the quadratic coefficient index q In the third and fourth embodiments, the coefficients of the cubic term and the coefficients of the quadratic term of the cubic polynomial are both associated with the cell identifier.

[0228] In embodiment 3, the group hopping pattern of the cubic coefficient when group hopping is enabled is Sequence offset pattern corresponding to the cubic coefficient index The serial number v corresponding to the cubic coefficient index c , the group frequency hopping pattern corresponding to the quadratic term coefficient index The serial number v corresponding to the quadratic coefficient index q The method of determining .

[0229] (1) In Example 3, if the group frequency hopping transmission method is adopted, the group frequency hopping pattern of the cubic coefficient involved in Formula 2 is The number of time domain symbols that can be contained in each time slot Time slot number n s , the number of candidate values ​​P of the cyclic shift index l and the cubic coefficient index c At least one of the three terms is related. That is, the group frequency hopping pattern of the cubic term coefficient The number of time domain symbols contained in each time slot can be Time slot number n s , the number of candidate values ​​P of the cyclic shift index l and the cubic coefficient index c At least one of the following is determined.

[0230] For example, the group hopping pattern of the cubic coefficients Can satisfy:

[0231] Wherein, c(·) represents a Gold sequence, the initial value of the Gold sequence is associated with the cell identifier, and B c It represents the truncation length of the Gold sequence corresponding to the cubic coefficient index, l represents the cyclic shift index, and i represents the truncation position of the Gold sequence.

[0232] Optionally, the initial value of the Gold sequence can be the same as the cell identifier and / or the number of candidate values ​​of the cubic coefficient index. For example, the initial value of the Gold sequence satisfy:

[0233] (2) Sequence offset pattern corresponding to the cubic coefficient index Can be combined with cell identification The number of candidate values ​​for the quadratic coefficient index and the number of candidate values ​​for the cubic coefficient index of the cubic polynomial P c At least one of the items in the sequence is related, that is, the sequence offset pattern corresponding to the cubic coefficient index According to the cell identification The number of candidate values ​​for the quadratic coefficient index and the number of candidate values ​​for the cubic coefficient index of the cubic polynomial P c At least one of the following is determined.

[0234] For example, the sequence offset pattern corresponding to the cubic coefficient index Can satisfy:

[0235] in, Indicates the number of candidate values ​​for the coefficient index of the quadratic term of the cubic polynomial, where mod represents the modulo operation.

[0236] (3) In Example 3, v c Can satisfy: v c =0.

[0237] (4) In Example 3, if the group frequency hopping transmission mode is adopted, the group frequency hopping pattern corresponding to the quadratic term coefficient index involved in Formula 4 is The number of time domain symbols that can be contained in each time slot Time slot number n s and the number of candidate values ​​for the cyclic shift index l and the quadratic term coefficient index At least one of the three terms is related. That is, the group frequency hopping pattern of the cubic term coefficient The number of time domain symbols contained in each time slot can be Time slot number n s and cyclic shift index l.

[0238] For example, the group hopping pattern of the cubic coefficients Can satisfy:

[0239] Where c(·) represents the Gold sequence, the initial value of the Gold sequence is associated with the cell identifier, B qrepresents the truncation length of the Gold sequence corresponding to the quadratic term coefficient index, l represents the cyclic shift index, and i represents the truncation position of the Gold sequence.

[0240] The initial value of the Gold sequence can be the same as the cell identifier and / or the number of candidate values ​​for the quadratic coefficient index For example, the initial value of the Gold sequence satisfy:

[0241] (5) Sequence offset pattern corresponding to the quadratic term coefficient index Can be combined with cell identification and the number of candidate values ​​for the quadratic coefficient index Correlation, that is, the sequence offset pattern corresponding to the quadratic coefficient index According to the cell identification and the number of candidate values ​​for the quadratic coefficient index Sure.

[0242] For example, the sequence offset pattern corresponding to the quadratic coefficient index Can satisfy:

[0243] (6) In Example 3, the sequence number v corresponding to the quadratic term coefficient index q Can satisfy: v q =0.

[0244] Figure 4 shows that when N = 288, P = 283, Δ F =3,P c =10, When group frequency hopping is enabled, the frequency hopping patterns of the cubic coefficients and quadratic coefficients of the first sequence are the same. It can be seen that for adjacent cell identifiers, the frequency hopping patterns of the cubic coefficients are the same, and the frequency hopping patterns of the quadratic coefficients are shifted. Group frequency hopping will not cause the frequency hopping patterns to collide. At this time, the maximum value of the mutual ambiguity function of the first sequence used by adjacent cells is For cell identifiers that differ by more than For two cell identifiers, the frequency hopping pattern of the cubic coefficient is shifted, and the group frequency hopping will not cause the frequency hopping pattern to collide, and the maximum value of the mutual ambiguity function does not exceed For cell identifiers that differ by more than For two cell identifiers, group frequency hopping will cause the frequency hopping patterns to collide, and the interference will be greater.

[0245] In this application, the identity of the adjacent cells refers to the cell identity that differs by no more than For example, in FIG4 , the cell identifier 100 (i.e. ) and cell identifier 101 (ie ) is the adjacent cell identifier.

[0246] Optionally, in embodiment 3, the first communication device and / or the second communication device may obtain first information, where the first information is used to enable group frequency hopping. For example, the first information may be configuration information indicating that group frequency hopping is enabled. The first information may be carried in an RRC message, a MAC CE, or a DCI.

[0247] In which, during uplink transmission and / or downlink transmission, the network device can send the first information to the terminal device, that is, the network device can instruct the terminal device to enable group frequency hopping. Accordingly, the network device and the terminal device can use the scheme shown in Example 3 to determine the first sequence.

[0248] In embodiment 4, the group frequency hopping pattern of the cubic coefficients when sequence hopping is enabled is Sequential offset pattern of cubic coefficient indices The serial number v corresponding to the cubic coefficient index c , group hopping pattern indexed by quadratic term coefficients The serial number v of the quadratic coefficient index q The method of determining .

[0249] (1) In Example 4, if the DMRS sequence frequency hopping transmission method is adopted, the group frequency hopping pattern of the cubic coefficient involved in Formula 2 is Can satisfy:

[0250] (2) Sequence offset pattern corresponding to the cubic coefficient index Can be combined with cell identification The number of candidate values ​​for the quadratic coefficient index and the number of candidate values ​​for the cubic coefficient index P c At least one of the items in the sequence is related, that is, the sequence offset pattern corresponding to the cubic coefficient index According to the cell identification The number of candidate values ​​for the quadratic coefficient index and the number of candidate values ​​for the cubic coefficient index P c At least one of the following is determined.

[0251] For example, the sequence offset pattern corresponding to the cubic coefficient index Can satisfy:

[0252] in, Indicates the number of candidate values ​​for the quadratic coefficient index, and mod represents the modulo operation.

[0253] (3) In Example 4, the sequence number v corresponding to the cubic coefficient index c The number of time domain symbols that can be contained in each time slot Time slot number n s Or at least one of the cyclic shift indexes l. That is, the sequence number v corresponding to the cubic coefficient index c The number of time domain symbols contained in each time slot can be Time slot number n s or at least one of the cyclic shift indexes l.

[0254] For example, c Can satisfy:

[0255] Where c(·) represents the Gold sequence. The initial value of the Gold sequence can be the same as the cell identifier. and / or the number of candidate values ​​for the quadratic coefficient index For example, the initial value of the Gold sequence c satisfy:

[0256] (4) In Example 4, if the DMRS sequence frequency hopping transmission method is adopted, the group frequency hopping pattern corresponding to the quadratic term coefficient index involved in Formula 4 is Can satisfy:

[0257] (5) Sequence offset pattern corresponding to the quadratic term coefficient index Can be combined with cell identification and the number of candidate values ​​for the quadratic coefficient index Correlation, that is, the sequence offset pattern corresponding to the quadratic coefficient index According to the cell identification and the number of candidate values ​​for the quadratic coefficient index Sure.

[0258] For example, the sequence offset pattern corresponding to the quadratic coefficient index Can satisfy:

[0259] (6) In Example 4, the sequence number v corresponding to the quadratic term coefficient index q The number of time domain symbols that can be contained in each time slot Time slot number n s Or at least one of the cyclic shift indexes l. That is, the sequence number v corresponding to the quadratic term coefficient index q The number of time domain symbols contained in each time slot can be Time slot number n sor at least one of the cyclic shift indexes l.

[0260] For example, the serial number v corresponding to the quadratic coefficient index q Can satisfy:

[0261] Where c(·) represents the Gold sequence. The initial value of the Gold sequence c can be the same as the cell identifier. and / or the number of candidate values ​​for the quadratic coefficient index For example, the initial value of the Gold sequence c satisfy:

[0262] Figure 5 shows that when N = 288, P = 283, Δ F =3,P c =10, When DMRS sequence frequency hopping is enabled, the frequency hopping pattern of the cubic coefficient and the quadratic coefficient of the first sequence is used. It can be seen that for adjacent cell identifiers, the frequency hopping pattern of the cubic coefficient is the same, and the frequency hopping pattern of the quadratic coefficient is shifted. Group frequency hopping will not cause the frequency hopping pattern to collide. At this time, the maximum value of the mutual ambiguity function of the first sequence used by adjacent cells is For cell identifiers that differ by more than For two cell identifiers, the frequency hopping pattern of the cubic coefficient is shifted, and the group frequency hopping will not cause the frequency hopping pattern to collide, and the maximum value of the mutual ambiguity function does not exceed For cell identifiers that differ by more than For two cell identifiers, group frequency hopping will cause the frequency hopping patterns to collide, and the interference will be greater.

[0263] Optionally, in Embodiment 4, the first communication device and / or the second communication device may obtain second information, where the second information is used to enable sequence hopping. For example, the second information may be configuration information indicating that sequence hopping is enabled. The second information may be carried in an RRC message, a MAC CE, or a DCI.

[0264] In which, during uplink transmission and / or downlink transmission, the network device can send second information to the terminal device, that is, the network device can instruct the terminal device to enable sequence hopping. Accordingly, the network device and the terminal device can use the scheme shown in Example 4 to determine the first sequence.

[0265] It is understood that the first sequence in this application can be used not only for DMRS transmission, but also for transmission of other reference signals including sounding reference signal (SRS). The transmission process of other reference signals can refer to the DMRS transmission process shown in this application and will not be repeated here.

[0266] It should be noted that the first sequence expression provided in this application is not limited to the expression given as an example in this application. For example, by slightly changing the polynomial coefficients in the expression of the first sequence introduced in this application, such as adding constants and / or coefficients, the orthogonal DMRS ports and the non-orthogonal DMRS ports can also achieve the same or similar technical effects as those of this application. Therefore, the corresponding modified expression also falls within the scope of protection of this application.

[0267] It is understandable that in order to implement the functions in the above embodiments, the communication device provided in this application may include hardware structures and / or software modules corresponding to the functions of the first communication device and / or the second communication device. Those skilled in the art should easily realize that, in combination with the units and method steps of each example described in the embodiments disclosed in this application, this application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application scenario and design constraints of the technical solution.

[0268] Figures 6 and 7 are schematic diagrams of the structures of possible communication devices provided by the embodiments of the present application. These communication devices can be used to implement the functions of the first communication device and / or the second communication device in the above-mentioned method embodiment, and thus can also achieve the beneficial effects possessed by the above-mentioned method embodiment. Among them, the first communication device and / or the second communication device can be used as a terminal or a network device, respectively. In an embodiment of the present application, the communication device can be a terminal or a network device as shown in Figure 1, or it can be a module (such as a chip) applied to a terminal or a network device.

[0269] As shown in Figure 6, a communication device 600 includes a processing unit 610 and a transceiver unit 620. The communication device 600 is used to implement the functions of the transmitting end or the receiving end in the method embodiment shown in Figure 3 above.

[0270] When the communication device 600 is used to implement the functions of the first communication device or the second communication device in the method embodiment shown in FIG3 , the processing unit 610 or the transceiver unit 620 may be used to obtain the first sequence of indication information. The transceiver unit 620 may be used to transmit the first signal.

[0271] For a more detailed description of the actions involved in the above-mentioned processing unit 610 and the transceiver unit 620, reference may be made to the relevant description in the method embodiment shown in FIG. 3 .

[0272] As shown in Figure 7, communication device 700 includes a processor 710 and an interface circuit 720. Processor 710 and interface circuit 720 are coupled to each other. It will be appreciated that interface circuit 720 may be a transceiver or an input / output interface. Optionally, communication device 700 may further include a memory 730 for storing instructions executed by processor 710, input data required by processor 710 to execute instructions, or data generated after processor 710 executes instructions.

[0273] When the communication device 700 is used to implement the method shown in FIG. 3 , the processor 710 is used to implement the functions of the processing unit 610 , and the interface circuit 720 is used to implement the functions of the transceiver unit 620 .

[0274] When the above-mentioned communication device is a module or chip applied to the first communication device or the second communication device, the module or chip implements the functions of the first communication device or the second communication device in the above-mentioned method embodiment. The module or chip receives information through other modules (such as a radio frequency module or an antenna), and the information can be received by the other modules over the air interface and then transmitted to the module or chip; or the module or chip sends information to other modules (such as a radio frequency module or an antenna), and the other modules send the information over the air interface.

[0275] When the above-mentioned communication device is a module or chip applied to an access network device (such as a base station), the communication device implements the functions of the first communication device or the second communication device in the above-mentioned method embodiment. The module or chip can be used to receive information from other modules (such as a radio frequency module or antenna), and the information is received by other modules through the air interface; or, the module or chip sends information to other modules (such as a radio frequency module or antenna), and is used for other modules to send the information through the air interface. The module or chip here can be a baseband chip, or a CU, DU or other module, or a device under the O-RAN architecture, such as an open CU, open DU and other devices.

[0276] It is understood that the processor in the embodiments of the present application may be a central processing unit (CPU), or may be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field programmable gate arrays (FPGA), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. The general-purpose processor may be a microprocessor or any conventional processor.

[0277] The method steps in the embodiments of the present application can be implemented in hardware or in software instructions that can be executed by a processor. The software instructions can be composed of corresponding software modules, and the software modules can be stored in random access memory, flash memory, read-only memory, programmable read-only memory, erasable programmable read-only memory, electrically erasable programmable read-only memory, registers, hard disk, mobile hard disk, CD-ROM or any other form of storage medium well known in the art. An exemplary storage medium is coupled to the processor so that the processor can read information from the storage medium and write information to the storage medium. The storage medium can also be an integral part of the processor. The processor and the storage medium can be located in an ASIC. In addition, the ASIC can be located in a base station or an O-RAN. The processor and the storage medium can also exist as discrete components in a base station or an O-RAN.

[0278] The present application also provides a computer-readable storage medium that stores instructions, which may also be referred to as a computer program, computer program code, etc. The instructions are executed on a computer, causing the computer to execute the method shown in FIG. 3 of the above method embodiment and in various embodiments of the present application.

[0279] An embodiment of the present application further provides a computer program product, including a computer program or instructions. When the computer program or instructions are executed on a computer, the method shown in FIG. 3 and various embodiments of the present application is implemented.

[0280] An embodiment of the present application further provides a chip, which includes a processor coupled to a memory, and the processor is configured to execute a computer program or instruction stored in the memory, so that the method shown in FIG3 and the various embodiments of the present application is implemented. For example, taking the chip implementing the functions of an access network device as an example, the chip can receive information from other modules of the access network device (such as a radio frequency or antenna, etc.), and the information can be sent by a terminal to the access network device. Alternatively, the chip can send information to other modules in the access network device (such as a radio frequency or antenna, etc.), and the information is sent by the access network device to the terminal, etc.

[0281] The embodiment of the present application further provides a communication system, including a first communication device and a second communication device. The first communication device and the second communication device can be used to implement the functions of the first communication device and the second communication device in the present application, respectively.

[0282] In the above embodiments, all or part of the embodiments may be implemented using software, hardware, firmware, or any combination thereof. When implemented using software, 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 programs or instructions. When the computer program or instructions are loaded and executed on a computer, the processes or functions described in the embodiments of the present application are performed in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network, a network device, a user device, or other programmable device. The computer program or instructions may be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another. For example, the computer program or instructions may be transferred from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless means. The computer-readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server or data center that integrates one or more available media. The available medium may be a magnetic medium, such as a floppy disk, hard disk, or magnetic tape; an optical medium, such as a digital video disk; or a semiconductor medium, such as a solid-state drive. The computer-readable storage medium may be a volatile or nonvolatile storage medium, or may include both volatile and nonvolatile types of storage media.

[0283] In the various embodiments of the present application, unless otherwise specified or there is a logical conflict, the terms and / or descriptions between different embodiments are consistent and can be referenced by each other. The technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationships.

[0284] In this application, "at least one" means one or more, and "more" means two or more. "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural. In the text description of this application, the character " / " generally indicates that the previous and next associated objects are in an "or" relationship; in the formula of this application, the character " / " indicates that the previous and next associated objects are in a "division" relationship. "Including at least one of A, B and C" can mean: including A; including B; including C; including A and B; including A and C; including B and C; including A, B and C.

[0285] It is understood that the various numbers used in the embodiments of this application are merely for ease of description and are not intended to limit the scope of the embodiments of this application. The order of the sequence numbers of the above-mentioned processes does not necessarily imply a specific order of execution; the order of execution of the processes should be determined by their functions and inherent logic.

Claims

1. A sequence indication method, characterized in that: include: Acquire indication information of a first sequence, where the first sequence is a cubic polynomial exponential sequence, a cubic term coefficient of the cubic polynomial is associated with a quadratic term coefficient of the cubic polynomial, the quadratic term coefficient of the cubic polynomial is associated with a frequency domain position of the first sequence, and the cubic term coefficient of the cubic polynomial and / or the quadratic term coefficient of the cubic polynomial is associated with a cell identifier; A first signal is transmitted, where the first signal is obtained by mapping the first sequence to frequency domain resources.

2. The method according to claim 1, characterized in that The cubic coefficient of the cubic polynomial is associated with the quadratic coefficient of the cubic polynomial, including: The cubic coefficient of the cubic polynomial is related to λ, and the quadratic coefficient of the cubic polynomial is related to multiples of λ; The value range of λ is an integer greater than or equal to 1 and less than or equal to P-1, where P is the maximum prime number that does not exceed the sequence length of the first sequence.

3. The method according to claim 1 or 2, characterized in that The coefficient of the quadratic term of the cubic polynomial is an integer multiple of λ.

4. The method according to any one of claims 1 to 3, characterized in that: The frequency domain position corresponds to the transmission comb index, and the first sequence s λ,k,l,m (n) Satisfy: Wherein, N represents the sequence length of the first sequence, P is the maximum prime number that does not exceed the sequence length of the first sequence, M represents the number of transmission comb teeth, Δ T represents the maximum delay spread, Δ F represents the maximum Doppler spread, n represents the symbol position of the first sequence, λ represents the cubic coefficient index of the cubic polynomial, k represents the quadratic coefficient index of the cubic polynomial, m represents the transmission comb index, and l represents the cyclic shift index.

5. The method according to claim 4, characterized in that Here, ∨ represents logical OR.

6. The method according to claim 4 or 5, characterized in that The maximum Doppler spread Δ F And the transmission comb teeth number M satisfies: in, Represents an integer.

7. The method according to any one of claims 1 to 4, characterized in that: The frequency domain position corresponds to a frequency division multiplexing index, and the first sequence s λ,k,l,r,m (n,q) satisfies: Wherein, N represents the sequence length of the first sequence, P is the maximum prime number that does not exceed the sequence length of the first sequence, M represents the frequency division multiplexing number, Q represents the frequency domain orthogonal cover code length, Δ T represents the maximum delay spread, Δ F represents the maximum Doppler spread, n represents the symbol position of the first sequence, q represents the symbol position of the frequency domain orthogonal cover code, λ represents the cubic coefficient index of the cubic polynomial, k represents the quadratic coefficient index of the cubic polynomial, m represents the frequency division multiplexing index, l represents the cyclic shift index, and r represents the frequency domain orthogonal cover code index.

8. The method according to claim 7, characterized in that Here, ∨ represents logical OR.

9. The method according to claim 7 or 8, characterized in that The maximum Doppler spread Δ F , the frequency division multiplexing number M and the frequency domain orthogonal cover code length Q satisfy: in, Represents an integer.

10. The method according to any one of claims 4 to 9, characterized in that: The cubic coefficient of the cubic polynomial is associated with the cell identifier, including: The cubic term coefficient index λ of the cubic polynomial is a function of a cell identifier; The coefficient of the quadratic term of the cubic polynomial is associated with the cell identifier, including: The coefficient index k of the quadratic term of the cubic polynomial is a function of the cell identifier.

11. The method according to any one of claims 4 to 10, characterized in that: The cubic coefficient index λ of the cubic polynomial satisfies: in, u c represents the sequence group number corresponding to the coefficient index of the cubic term, v c Indicates the serial number corresponding to the coefficient index of the cubic term, u c and / or v c Associated with the cell identity, P c Represents the number of candidate values ​​for the cubic term coefficient index.

12. The method according to claim 11, characterized in that The sequence group number u corresponding to the cubic coefficient index c satisfy: in, represents the group hopping pattern of the cubic coefficient index, n s Indicates the time slot number, The sequence offset pattern of the cubic coefficient index is represented, and the group hopping pattern of the cubic coefficient index and / or the sequence offset pattern of the cubic coefficient index are associated with the cell identifier.

13. The method according to any one of claims 4 to 12, characterized in that: The quadratic term coefficient index k of the cubic polynomial satisfies: in, u q represents the sequence group number corresponding to the quadratic term coefficient index, v q Indicates the serial number corresponding to the quadratic term coefficient index, u q and / or v q is associated with the cell identity, Represents the number of candidate values ​​for the quadratic term coefficient index.

14. The method according to claim 13, characterized in that The sequence group number u corresponding to the quadratic term coefficient index of the cubic polynomial q satisfy: in, represents the group frequency hopping pattern of the quadratic term coefficient index, n s Indicates the time slot number, The sequence offset pattern of the quadratic term coefficient index is represented, and the group hopping pattern of the quadratic term coefficient index and / or the sequence offset pattern of the quadratic term coefficient index are associated with the cell identifier.

15. The method according to claim 12, characterized in that When group hopping is enabled, the group hopping pattern indexed by the cubic term coefficients satisfy: Wherein, c(·) represents a Gold sequence, and the initial value of the Gold sequence is associated with the cell identifier to satisfy B c represents the truncation length of the Gold sequence corresponding to the cubic coefficient index, represents the number of time domain symbols contained in each time slot, l represents the cyclic shift index, and i represents the truncation position of the Gold sequence.

16. The method according to claim 15, characterized in that The sequence offset pattern of the cubic coefficient index satisfy: in, represents the cell identity, P c represents the number of candidate values ​​of the cubic coefficient index, Represents the number of candidate values ​​for the quadratic term coefficient index.

17. The method according to claim 15 or 16, characterized in that The sequence number v corresponding to the cubic coefficient index c Satisfy: v c =0.

18. The method of claim 14, wherein: When group frequency hopping is enabled, the group frequency hopping pattern indexed by the quadratic term coefficient satisfy: Wherein, c(·) represents a Gold sequence, and the initial value of the Gold sequence is associated with the cell identifier to satisfy B q represents the truncation length of the Gold sequence corresponding to the quadratic term coefficient index, represents the number of time domain symbols contained in each time slot, l represents the cyclic shift index, and i represents the truncation position of the Gold sequence.

19. The method according to claim 18, characterized in that The sequence offset pattern of the quadratic term coefficient index satisfy: in, represents the cell identifier, Represents the number of candidate values ​​for the quadratic term coefficient index.

20. The method according to claim 18 or 19, characterized in that The sequence number v corresponding to the quadratic term coefficient index q Satisfy: v q =0.

21. The method according to any one of claims 15 to 20, characterized in that: The method further comprises: First information is acquired, where the first information is used to enable group frequency hopping.

22. The method of claim 12, wherein: When sequence hopping is enabled, the group hopping pattern indexed by the cubic term coefficients satisfy:

23. The method of claim 22, wherein: The sequence offset pattern of the cubic coefficient index satisfy: in, represents the cell identity, P c represents the number of candidate values ​​of the cubic coefficient index, Represents the number of candidate values ​​for the quadratic term coefficient index.

24. The method according to claim 22 or 23, characterized in that The sequence number v corresponding to the cubic coefficient index c satisfy: Wherein, c(·) represents a Gold sequence, and the initial value of the Gold sequence is associated with the cell identifier to satisfy Indicates the number of time domain symbols contained in each time slot, n s represents the time slot number, and l represents the cyclic shift index.

25. The method of claim 14, wherein: When sequence hopping is enabled, the group hopping pattern indexed by the quadratic term coefficient satisfy:

26. The method of claim 25, wherein: The sequence offset pattern of the quadratic term coefficient index satisfy: in, represents the cell identifier, Represents the number of candidate values ​​for the quadratic term coefficient index.

27. The method according to claim 25 or 26, characterized in that The sequence number v corresponding to the quadratic term coefficient index q satisfy: Wherein, c(·) represents a Gold sequence, and the initial value of the Gold sequence is associated with the cell identifier to satisfy Indicates the number of time domain symbols contained in each time slot, n s represents the time slot number, and l represents the cyclic shift index.

28. The method according to any one of claims 22 to 27, characterized in that: The method further comprises: Second information is acquired, where the second information is used to enable sequence frequency hopping.

29. The method according to any one of claims 4 to 28, characterized in that: The method further comprises: Obtain indication information of a second sequence, where the indication information of the first sequence and the indication information of the second sequence satisfy at least one of the following: The cubic coefficient index of the cubic polynomial corresponding to the indication information of the first sequence is different from the cubic coefficient index of the cubic polynomial corresponding to the indication information of the second sequence; The quadratic term coefficient index of the cubic polynomial corresponding to the indication information of the first sequence is different from the quadratic term coefficient index of the cubic polynomial of the second sequence.

30. A communication device, characterized in that: include: a processing unit, configured to obtain indication information of a first sequence, where the first sequence is a cubic polynomial exponential sequence, a cubic term coefficient of the cubic polynomial is associated with a quadratic term coefficient of the cubic polynomial, the quadratic term coefficient of the cubic polynomial is associated with a frequency domain position of the first sequence, and the cubic term coefficient of the cubic polynomial and / or the quadratic term coefficient of the cubic polynomial is associated with a cell identifier; The communication unit is used to transmit a first signal, where the first signal is obtained by mapping the first sequence to frequency domain resources.

31. The communication device according to claim 30, characterized in that The cubic coefficient of the cubic polynomial is associated with the quadratic coefficient of the cubic polynomial, including: The cubic coefficient of the cubic polynomial is related to λ, and the quadratic coefficient of the cubic polynomial is related to multiples of λ; The value range of λ is an integer greater than or equal to 1 and less than or equal to P-1, where P is the maximum prime number that does not exceed the sequence length of the first sequence.

32. The communication device according to claim 30 or 31, characterized in that: The coefficient of the quadratic term of the cubic polynomial is an integer multiple of λ.

33. The communication device according to any one of claims 30 to 32, characterized in that: The frequency domain position corresponds to the transmission comb index, and the first sequence s λ,k,l,m (n) Satisfy: Wherein, N represents the sequence length of the first sequence, P is the maximum prime number that does not exceed the sequence length of the first sequence, M represents the number of transmission comb teeth, Δ T represents the maximum delay spread, Δ F represents the maximum Doppler spread, n represents the symbol position of the first sequence, λ represents the cubic coefficient index of the cubic polynomial, k represents the quadratic coefficient index of the cubic polynomial, m represents the transmission comb index, and l represents the cyclic shift index.

34. The communication device according to claim 33, characterized in that Here, ∨ represents logical OR.

35. The communication device according to claim 33 or 34, characterized in that: The maximum Doppler spread Δ F And the transmission comb teeth number M satisfies: in, Represents an integer.

36. The communication device according to any one of claims 30 to 33, characterized in that: The frequency domain position corresponds to a frequency division multiplexing index, and the first sequence s λ,k,l,r,m (n,q) satisfies: Wherein, N represents the sequence length of the first sequence, P is the maximum prime number that does not exceed the sequence length of the first sequence, M represents the frequency division multiplexing number, Q represents the frequency domain orthogonal cover code length, Δ T represents the maximum delay spread, Δ F represents the maximum Doppler spread, n represents the symbol position of the first sequence, q represents the symbol position of the frequency domain orthogonal cover code, λ represents the cubic coefficient index of the cubic polynomial, k represents the quadratic coefficient index of the cubic polynomial, m represents the frequency division multiplexing index, l represents the cyclic shift index, and r represents the frequency domain orthogonal cover code index.

37. The communication device according to claim 36, characterized in that Here, ∨ represents logical OR.

38. The communication device according to claim 36 or 37, characterized in that: The maximum Doppler spread Δ F , the frequency division multiplexing number M and the frequency domain orthogonal cover code length Q satisfy: in, Represents an integer.

39. The communication device according to any one of claims 33 to 38, characterized in that: The cubic coefficient of the cubic polynomial is associated with the cell identifier, including: The cubic term coefficient index λ of the cubic polynomial is a function of a cell identifier; The coefficient of the quadratic term of the cubic polynomial is associated with the cell identifier, including: The coefficient index k of the quadratic term of the cubic polynomial is a function of the cell identifier.

40. The communication device according to any one of claims 33 to 39, characterized in that: The cubic coefficient index λ of the cubic polynomial satisfies: in, u c represents the sequence group number corresponding to the coefficient index of the cubic term, v c Indicates the serial number corresponding to the coefficient index of the cubic term, u c and / or v c Associated with the cell identity, P c Represents the number of candidate values ​​for the cubic term coefficient index.

41. The communication device according to claim 40, characterized in that The sequence group number u corresponding to the cubic coefficient index c satisfy: in, represents the group hopping pattern of the cubic coefficient index, n s Indicates the time slot number, The sequence offset pattern of the cubic coefficient index is represented, and the group hopping pattern of the cubic coefficient index and / or the sequence offset pattern of the cubic coefficient index are associated with the cell identifier.

42. The communication device according to any one of claims 33 to 41, characterized in that: The quadratic term coefficient index k of the cubic polynomial satisfies: in, u q represents the sequence group number corresponding to the quadratic term coefficient index, v q Indicates the serial number corresponding to the quadratic term coefficient index, u q and / or v q is associated with the cell identity, Represents the number of candidate values ​​for the quadratic term coefficient index.

43. The communication device according to claim 42, characterized in that The sequence group number u corresponding to the quadratic term coefficient index of the cubic polynomial q satisfy: in, represents the group frequency hopping pattern of the quadratic term coefficient index, n s Indicates the time slot number, The sequence offset pattern of the quadratic term coefficient index is represented, and the group hopping pattern of the quadratic term coefficient index and / or the sequence offset pattern of the quadratic term coefficient index are associated with the cell identifier.

44. The communication device according to claim 41, characterized in that When group hopping is enabled, the group hopping pattern indexed by the cubic term coefficients satisfy: Wherein, c(·) represents a Gold sequence, and the initial value of the Gold sequence is associated with the cell identifier to satisfy B c represents the truncation length of the Gold sequence corresponding to the cubic coefficient index, represents the number of time domain symbols contained in each time slot, l represents the cyclic shift index, and i represents the truncation position of the Gold sequence.

45. The communication device according to claim 44, characterized in that The sequence offset pattern of the cubic coefficient index satisfy: in, represents the cell identity, P c represents the number of candidate values ​​of the cubic coefficient index, Represents the number of candidate values ​​for the quadratic term coefficient index.

46. ​​The communication device according to claim 44 or 45, characterized in that: The sequence number v corresponding to the cubic coefficient index c Satisfy: v c =0.

47. The communication device according to claim 43, characterized in that When group frequency hopping is enabled, the group frequency hopping pattern indexed by the quadratic term coefficient satisfy: Wherein, c(·) represents a Gold sequence, and the initial value of the Gold sequence is associated with the cell identifier to satisfy B q represents the truncation length of the Gold sequence corresponding to the quadratic term coefficient index, represents the number of time domain symbols contained in each time slot, l represents the cyclic shift index, and i represents the truncation position of the Gold sequence.

48. The communication device according to claim 47, characterized in that The sequence offset pattern of the quadratic term coefficient index satisfy: in, represents the cell identifier, Represents the number of candidate values ​​for the quadratic term coefficient index.

49. The communication device according to claim 47 or 48, characterized in that: The sequence number v corresponding to the quadratic term coefficient index q Satisfy: v q =0.

50. The communication device according to any one of claims 44 to 49, characterized in that: The processing unit is also used for: First information is acquired, where the first information is used to enable group frequency hopping.

51. The communication device according to claim 41, characterized in that When sequence hopping is enabled, the group hopping pattern indexed by the cubic term coefficients satisfy:

52. The communication device according to claim 51, characterized in that The sequence offset pattern of the cubic coefficient index satisfy: in, represents the cell identity, P c represents the number of candidate values ​​of the cubic coefficient index, Represents the number of candidate values ​​for the quadratic term coefficient index.

53. The communication device according to claim 51 or 52, characterized in that: The sequence number v corresponding to the cubic coefficient index c satisfy: Wherein, c(·) represents a Gold sequence, and the initial value of the Gold sequence is associated with the cell identifier to satisfy Indicates the number of time domain symbols contained in each time slot, n s represents the time slot number, and l represents the cyclic shift index.

54. The communication device according to claim 43, characterized in that When sequence hopping is enabled, the group hopping pattern indexed by the quadratic term coefficient satisfy:

55. The communication device according to claim 54, characterized in that The sequence offset pattern of the quadratic term coefficient index satisfy: in, represents the cell identifier, Represents the number of candidate values ​​for the quadratic term coefficient index.

56. The communication device according to claim 54 or 55, characterized in that: The sequence number v corresponding to the quadratic term coefficient index q satisfy: Wherein, c(·) represents a Gold sequence, and the initial value of the Gold sequence is associated with the cell identifier to satisfy Indicates the number of time domain symbols contained in each time slot, n s represents the time slot number, and l represents the cyclic shift index.

57. The communication device according to any one of claims 51 to 56, characterized in that: The processing unit is also used for: Second information is acquired, where the second information is used to enable sequence frequency hopping.

58. The communication device according to any one of claims 33 to 57, characterized in that: The processing unit is also used for: Obtain indication information of a second sequence, where the indication information of the first sequence and the indication information of the second sequence satisfy at least one of the following: The cubic coefficient index of the cubic polynomial corresponding to the indication information of the first sequence is different from the cubic coefficient index of the cubic polynomial corresponding to the indication information of the second sequence; The quadratic term coefficient index of the cubic polynomial corresponding to the indication information of the first sequence is different from the quadratic term coefficient index of the cubic polynomial of the second sequence.

59. A communication device, characterized in that: The method comprises a unit or a module for executing the method according to any one of claims 1 to 29.

60. A communication device, characterized in that: The method comprises a processor configured to execute a computer program or an instruction to implement the method according to any one of claims 1 to 29.

61. A chip, characterized in that: The chip comprises a logic circuit, and the logic circuit is used to execute the method as claimed in any one of claims 1-29.

62. A computer-readable storage medium, characterized in that The storage medium stores a computer program or instruction. When the computer program or instruction is executed by the communication device, the method according to any one of claims 1 to 29 is implemented.

63. A computer program product, characterized in that When the computer program product is executed by a computer, the computer executes the method according to any one of claims 1 to 29.

Images