Communication method and communication apparatus

Abstract

The present application provides a communication method and a communication apparatus. In the solution, a first device determines a polynomial exponential sequence, wherein the degree of the polynomial exponential sequence is greater than or equal to 2, and at least one of a quadratic term coefficient, a linear term coefficient, or a zero-term coefficient of the polynomial exponential sequence is associated with an index of an element of the polynomial exponential sequence. In this way, by designing the relationship between a coefficient of a polynomial exponential sequence and an index of an element, the interference between a plurality of polynomial exponential sequences can be reduced, so that a large-capacity and relatively low-interference non-orthogonal polynomial exponential sequence is provided.

Description

Communication method and communication apparatus

[0001] The present application claims priority to the Russian patent application No. 2024112931, filed on May 14, 2024, with the Russian Federal Service for Intellectual Property, with the title “Communication method and communication apparatus”, the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

[0002] The present application relates to the field of wireless communication technology, and more particularly, to a communication method and a communication apparatus. BACKGROUND

[0003] A multiple-input multiple-output (MIMO) system can support a single user to transmit multiple streams of data, which is a single user MIMO (SU-MIMO) transmission, or multiple users to transmit multiple streams of data, which is a multi-user MIMO (MU-MIMO) transmission. Generally, a user transmits data of each stream, and also transmits a de-modulation reference signal (DMRS) corresponding to the stream at the same time. The DMRSs corresponding to different streams are orthogonal. The data of each stream can be mapped to one antenna port. The number of streams in the SU-MIMO or MU-MIMO transmission, which is also the number of orthogonal DMRSs, can be referred to as the capacity of DMRS. The DMRS can be used to estimate the channel response of the corresponding stream of data. Based on the estimated channel response and the received data of the stream, the receiver can demodulate the data.

[0004] For future communication standards, MIMO systems need to support more number of streams to improve system spectral efficiency. However, due to the constraint of channel multipath delay, the number of orthogonal DMRS is limited. Thus, the industry proposes to design non-orthogonal DMRS to support more number of streams, but how to control the interference between non-orthogonal DMRS is a key problem. In addition, in a large connection multiple access system, a large number of terminal devices need to be supported, and the number of terminal devices transmitting data is also relatively large. However, the number of resources used for transmitting data is limited, at this time, non-orthogonal multiple access (NoMA) technology can be considered, and there is interference between the data transmitted by multiple terminal devices, and the receiving device eliminates the interference between different terminal devices through successive interference cancellation (SIC) technology, and improves the demodulation performance. For example, a linear spreading sequence can be used to spread the data sent by the terminal device before sending, and the linear spreading sequences used by different terminal devices are different. Multiple linear spreading sequences are non-orthogonal, and the interference between the linear spreading sequences determines the interference between the data sent by different terminal devices. When a large number of terminal devices need to be supported, how to control the interference between non-orthogonal linear spreading sequences is still a key problem.

[0005] Therefore, how to make the low interference between large-capacity non-orthogonal sequences is a problem to be solved. SUMMARY

[0006] The present application provides a communication method and a communication device, which can support large-capacity, low-interference non-orthogonal polynomial exponential sequences.

[0007] In a first aspect, a communication method is provided, which can be executed by a communication device or a module (for example, a processor, a chip, a chip system, an integrated circuit, etc., which can also be a logic node, a logic module, hardware and / or software capable of realizing all or part of the functions of the communication device) applied to the communication device, and this is not limited. The method can include: determining a first polynomial exponential sequence, the degree of the first polynomial exponential sequence being greater than or equal to 2, and at least one of the quadratic term coefficient, the linear term coefficient or the zero term coefficient of the first polynomial exponential sequence being related to the index of the elements of the first polynomial exponential sequence; transmitting based on the first polynomial exponential sequence.

[0008] In the technical solution of the present application, by designing the quadratic term coefficient, the linear term coefficient and at least one of the quadratic term coefficients of the polynomial exponential sequence to be related to the index of the elements of the polynomial exponential sequence, for a plurality of polynomial exponential sequences, the relationship between the coefficients of each polynomial exponential sequence and the index of the elements can be designed, so that the interference between the non-orthogonal polynomial exponential sequences can be controlled to meet different service requirements, supporting large capacity and low interference non-orthogonal polynomial exponential sequences.

[0009] In combination with the first aspect, in some implementations of the first aspect, the first polynomial exponential sequence is represented as: Or, n=0,…,N-1; where d is the degree of the first polynomial exponential sequence, n is the index of the elements of the first polynomial exponential sequence, M is the base length of the first polynomial exponential sequence, N is the length of the first polynomial exponential sequence, p i is the i-th term coefficient, i=0,…,d.

[0010] In combination with the first aspect, in some implementations of the first aspect, the ratio of the length of the first polynomial exponential sequence to the base length of the first polynomial exponential sequence is N / M=Q, Q is an integer greater than 1.

[0011] In this implementation, the length of the polynomial exponential sequence is Q times the base length, at this time it can be considered that the polynomial exponential sequence contains Q short sequences. By designing the coefficients (such as quadratic term coefficients, linear term coefficients and zero term coefficients) of each short sequence of different polynomial exponential sequences, the interference between the plurality of different polynomial exponential sequences can be controlled.

[0012] In combination with the first aspect, in some implementations of the first aspect, the determination of the first polynomial exponential sequence comprises: determining a first sequence set, the first sequence set contains K sequence groups, each sequence group contains M g,seq polynomial exponential sequences, K is a positive integer greater than 1, M g,seq is an integer less than or equal to M, M is the base length of the polynomial exponential sequence; determining the first polynomial exponential sequence from the first sequence set.

[0013] In this implementation, the first device can first determine a sequence set containing a plurality of polynomial exponential sequences, and then determine a polynomial exponential sequence from the sequence set.

[0014] In combination with the first aspect, in some implementations of the first aspect, each polynomial exponential sequence in the first sequence set corresponds to one antenna port.

[0015] In the implementation, each polynomial exponential sequence in any one sequence set corresponds to one antenna port, and by configuring different antenna ports with corresponding polynomial exponential sequences, orthogonality between the polynomial exponential sequences of different antenna ports can be ensured, thereby supporting low interference between different antenna ports.

[0016] In combination with the first aspect, in some implementations of the first aspect, different polynomial exponential sequences in any one sequence group are orthogonal to each other; and polynomial exponential sequences in any two sequence groups of the K sequence groups are non-orthogonal.

[0017] In the implementation, a sequence set contains multiple polynomial exponential sequences, and part of the multiple polynomial exponential sequences that are orthogonal to each other can be regarded as a sequence group, or in other words, any two polynomial exponential sequences in a group are orthogonal. A sequence set can contain multiple sequence groups, and polynomial exponential sequences in any two sequence groups are non-orthogonal.

[0018] In combination with the first aspect, in some implementations of the first aspect, different polynomial exponential sequences in any one sequence group are orthogonal, including that the quadratic term coefficients of the different polynomial exponential sequences are the same, the zero-order term coefficients are the same, and the first-order term coefficients are different.

[0019] In the implementation, the orthogonality between different polynomial exponential sequences can be achieved by designing the quadratic term coefficients, the first-order term coefficients, and the zero-order term coefficients of different polynomial exponential sequences. As an example, different first-order term coefficients of two polynomial exponential sequences can make the two polynomial exponential sequences orthogonal. By designing different first-order term coefficients, orthogonality between large-capacity sequences can be supported, thereby supporting low interference between large-capacity sequences.

[0020] In combination with the first aspect, in some implementations of the first aspect, polynomial exponential sequences in any two sequence groups are non-orthogonal, including that the quadratic term coefficients of any one polynomial exponential sequence in a first sequence group and any one polynomial exponential sequence in a second sequence group are different; or the quadratic term coefficients and the zero-order term coefficients of any one polynomial exponential sequence in the first sequence group and any one polynomial exponential sequence in the second sequence group are different; wherein the first sequence group and the second sequence group are any two sequence groups of the K sequence groups.

[0021] In the implementation, the quadratic term coefficients of polynomial exponential sequences in different sequence groups are different, or the quadratic term coefficients and the zero-order term coefficients are different, and then the polynomial exponential sequences in different sequence groups are non-orthogonal.

[0022] In some implementations of the first aspect, the first sequence set is any one of at least two sequence sets, each of the at least two sequence sets corresponds to a combination of a number of sequence groups and a number of polynomial exponential sequences in a sequence group, and the at least two sequence sets correspond to different combinations of the number of sequence groups and / or the number of polynomial exponential sequences in a sequence group; and the method further includes determining one sequence set from the at least two sequence sets as the first sequence set.

[0023] In other words, each of the at least two sequence sets corresponds to a combination of a number of sequence groups and a number of polynomial exponential sequences in a sequence group, and different sequence sets correspond to different combinations of the number of sequence groups and the number of polynomial exponential sequences in a sequence group.

[0024] In this implementation, there can be multiple sequence sets, and different sequence sets can correspond to different numbers of sequence groups K and different numbers of sequences in a group, thereby adapting to different numbers of sequences and interference requirements.

[0025] In some implementations of the first aspect, each of the Q short sequences corresponds to a combination of a quadratic coefficient, a linear coefficient, and a zero-order coefficient.

[0026] In this implementation, when the polynomial exponential sequence includes Q short sequences (or is spliced from Q short sequences), each short sequence corresponds to a combination of a quadratic coefficient, a linear coefficient, and a zero-order coefficient. At this time, the polynomial exponential sequence corresponds to Q combinations of coefficients.

[0027] In some implementations of the first aspect, a length of each of the Q short sequences is M, and M is a base length of the first polynomial exponential sequence.

[0028] In some implementations of the first aspect, the quadratic coefficient of the same index short sequence of any two polynomial exponential sequences in each of the K sequence groups is the same.

[0029] In some implementations of the first aspect, the linear coefficient and the zero-order coefficient of any one short sequence in the polynomial exponential sequence in any one of the K sequence groups are related to the quadratic coefficient.

[0030] In this implementation, the linear coefficient and the zero-order coefficient of any one short sequence can be determined based on the quadratic coefficient.

[0031] In some implementations of the first aspect, at least one of the coefficients of the second order term or the coefficients of the zero order term of the first polynomial exponential sequence is related to the index of the elements of the first polynomial exponential sequence; and the data transmission based on the first polynomial exponential sequence comprises: cyclically shifting the first polynomial exponential sequence based on a cyclic shift value to obtain a second polynomial exponential sequence; and performing the transmission based on the second polynomial exponential sequence.

[0032] In this implementation, the coefficient of the first order term of the polynomial exponential sequence is not related to the index of the elements of the polynomial exponential sequence. After the coefficients of the second order term and the coefficients of the zero order term of the polynomial exponential sequence are determined, the output sequence (i.e., the second polynomial exponential sequence) is obtained by cyclically shifting the polynomial exponential sequence, and by configuring different cyclic shift values, the plurality of polynomial exponential sequences can be orthogonal.

[0033] In some implementations of the first aspect, the coefficient of the first order term of the first polynomial exponential sequence is related to the cyclic shift value.

[0034] In this implementation, the first device configures different coefficients of the first order term for different polynomial exponential sequences, which is equivalent to the first device cyclically shifting the polynomial exponential sequences based on different cyclic shift values. In the embodiments of the present application, one of them can be used to obtain the technical effects described in the embodiments.

[0035] In some implementations of the first aspect, the kth group of the K groups of sequences comprises M g,seq polynomial exponential sequences, the M g,seq polynomial exponential sequences correspond to M g,seq cyclic shift values, and any two of the M g,seq cyclic shift values are different.

[0036] In this implementation, different polynomial exponential sequences (i.e., different second polynomial exponential sequences, which are output sequences of the cyclic shift operation) in the group are obtained by cyclically shifting the first polynomial exponential sequence based on different cyclic shift values.

[0037] As an example, the M g,seq cyclic shift values are M g,seq integers in the set {0, 1, …, M-1}.

[0038] In some implementations of the first aspect, M=M g,seq , and the M g,seq cyclic shift values corresponding to the M g,seq polynomial exponential sequences are integers in the set {0, 1, …, M-1}.g,seq M in -1} is an integer corresponding to one of the following: g,seq wherein the jth polynomial index sequence in the kth group corresponds to a cyclic shift value A equal to j.

[0039] Optionally, the constant phase values corresponding to the same index of any two polynomial index sequences in any one of the K sequence groups are the same.

[0040] In this implementation, the constant phase value is used to determine the zeroth order coefficient corresponding to the short sequence.

[0041] Optionally, the cyclic shift value is related to the index of the elements of the first polynomial index sequence.

[0042] With reference to the first aspect, in some implementations of the first aspect, the difference between the quadratic term coefficient of the 0th short sequence and the quadratic term coefficient of the 1st short sequence of any two polynomial index sequences in a first sequence group and a second sequence group of the K sequence groups is the same modulo M, wherein the first sequence group and the second sequence group are any two sequence groups of the K sequence groups. Optionally, Q = 2.

[0043] This implementation gives the condition that the quadratic term coefficients of the polynomial index sequences of different groups satisfy.

[0044] With reference to the first aspect, in some implementations of the first aspect, the first polynomial index sequence is obtained based on a ZC sequence, and the root of the ZC sequence is related to the index of the elements of the ZC sequence.

[0045] In this implementation, the polynomial index sequence can be a ZC sequence. In this case, the quadratic term coefficient of the polynomial index sequence corresponds to the root of the ZC sequence. Therefore, the description of the quadratic term coefficient of the polynomial index sequence in the above implementations can be replaced by the description of the root of the ZC sequence.

[0046] With reference to the first aspect, in some implementations of the first aspect, the first polynomial index sequence includes Q short sequences, each short sequence of the Q short sequences corresponds to a ZC sequence, and the Q short sequences correspond to Q ZC sequences.

[0047] With reference to the first aspect, in some implementations of the first aspect, the short sequences satisfy one of the following: each short sequence is a sequence obtained by cyclically shifting or phase rotating a ZC sequence based on a cyclic shift value; or each short sequence is a sequence obtained by multiplying a ZC sequence by a constant phase value.

[0048] In this implementation, one polynomial index sequence includes Q short sequences, and each short sequence can be obtained based on a ZC sequence.

[0049] With reference to the first aspect, in some implementations of the first aspect, the first plurality of polynomial exponential sequences are from a first sequence set, the first sequence set contains K sequence groups, roots corresponding to short sequences of a same index of any two polynomial exponential sequences in each sequence group of the K sequence groups are the same; and / or constant phase values corresponding to short sequences of a same index of any two polynomial exponential sequences in each sequence group of the K sequence groups are the same.

[0050] In this implementation, if the polynomial exponential sequences are ZC sequences, roots of ZC sequences corresponding to short sequences of a same index of different polynomial exponential sequences in a sequence group of the sequence set are the same and / or constant phase values are the same.

[0051] With reference to the first aspect, in some implementations of the first aspect, the Q short sequences are mapped on N subcarriers, the N subcarriers are located in one or more symbols; each short sequence of the Q short sequences is mapped on M subcarriers in an equal interval in a symbol, different short sequences are located in different combs, the Q short sequences are mapped in a symbol or in multiple symbols, and the M is the length of a short sequence.

[0052] The second aspect provides a communication apparatus having a function of implementing the method in the first aspect or any possible implementation manner of the first aspect. The function can be implemented by hardware or by hardware executing corresponding software. The hardware or software includes one or more units corresponding to the above functions.

[0053] The third aspect provides a communication apparatus including at least one processor configured to cause the communication apparatus to perform the method in the first aspect or any possible implementation manner thereof. Optionally, the at least one processor is coupled with at least one memory for storing a computer program or instructions, and the at least one processor is configured to call and run the computer program or instructions from the at least one memory, so that the communication apparatus performs the method in the first aspect or any possible implementation manner thereof. Optionally, the at least one processor can be included in the communication apparatus or configured outside the communication apparatus.

[0054] The fourth aspect provides a communication apparatus including a communication interface and a circuit, the communication interface is configured to receive information and / or data to be processed and transmit the information and / or data to the circuit; the circuit is configured to process the information and / or data to perform the method in the first aspect or any possible implementation manner of the first aspect. Optionally, the communication interface is further configured to output the information and / or data processed by the circuit.

[0055] In a fifth aspect, a computer readable storage medium is provided, which stores computer program codes or instructions, when the computer program codes or instructions are run on a computer, the method in the first aspect or any possible implementation manner thereof is implemented.

[0056] In a sixth aspect, a computer program product is provided, which comprises computer program codes or instructions, when the computer program codes or instructions are run on a computer, the method in the first aspect or any possible implementation manner thereof is implemented.

[0057] In a seventh aspect, a wireless communication system is provided, which comprises the communication apparatus in the first aspect. Optionally, the system further comprises other communication apparatuses which communicate with the communication apparatus in the first aspect. BRIEF DESCRIPTION OF DRAWINGS

[0058] FIG. 1 is an architecture diagram of a communication system suitable for embodiments of the present application.

[0059] FIG. 2 is a schematic flowchart of a communication method provided by the present application.

[0060] FIG. 3 is a schematic diagram of a polynomial exponential sequence comprising three short sequences.

[0061] FIG. 4 is a schematic diagram of a polynomial exponential sequence.

[0062] FIG. 5 is a schematic diagram of a combination of coefficient groups corresponding to short sequences comprised by each polynomial exponential sequence in a group in a sequence set.

[0063] FIG. 6 is a schematic diagram of a time-frequency resource mapping manner of a polynomial exponential sequence provided by the present application.

[0064] FIG. 7 is a schematic diagram of another time-frequency resource mapping manner of a polynomial exponential sequence provided by the present application.

[0065] FIG. 8 is a schematic structural diagram of a communication apparatus provided by the present application.

[0066] FIG. 9 is a schematic structural diagram of another communication apparatus provided by the present application.

[0067] FIG. 10 is a schematic structure of a chip provided by the present application. DETAILED DESCRIPTION

[0068] The technical solutions in the present application will be described below with reference to the accompanying drawings.

[0069] Embodiments of the present application can be applied to various communications systems, including but not limited to a 5th generation (5G) system, an LTE system, a long term evolution-advanced (LTE-A) system, an LTE frequency division duplex (FDD) system, an LTE time division duplex (TDD) system, and the like. It can also be applied to future communications systems, such as a 6th generation mobile communications system. In addition, it can also be applied to device to device (D2D) communications, vehicle-to-everything (V2X) communications, machine to machine (M2M) communications, machine type communications (MTC), an internet of things (IoT) communications system, a narrow band-internet of things (NB-IoT) system, or other communications systems. In addition, it can also be extended to similar wireless communications systems, such as wireless-fidelity (WiFi), worldwide interoperability for microwave access (WIMAX), and 3rd generation partnership project (3GPP) related communications systems, without limitation.

[0070] A communications system suitable for embodiments of the present application can include one or more data sending ends and one or more data receiving ends. Optionally, one of the sending end and the receiving end can be a terminal device, and the other can be a network device.

[0071] FIG. 1 is an architecture diagram of a communications system suitable for embodiments of the present application. As shown in FIG. 1, embodiments of the present application can be applied to both uplink transmission and downlink transmission. In FIG. 1, only uplink transmission or downlink transmission between one network device and two terminal devices (such as terminal device 1 and terminal device 2) is taken as an example. In uplink transmission, the data sending end is a terminal device, and the data receiving end is a network device; in downlink transmission, the sending end is a network device, and the receiving end is a terminal device.

[0072] The network device of the present application can be a device with wireless transceiving function, which can be a device providing wireless communication function service, usually located at the network side, including but not limited to next generation base station (gNodeB, gNB) in 5G system, base station in sixth generation mobile communication system, base station in future mobile communication system, or access node in wireless fidelity (WiFi) system, evolved node B (eNB) in long term evolution (LTE) system, radio network controller (RNC), node B (NB), base station controller (BSC), home base station (such as home evolved NodeB or home Node B, HNB), base band unit (BBU), transmission reception point (TRP), transmitting point (TP), base transceiver station (BTS), satellite, unmanned aerial vehicle, etc. In one network structure, the network device can include a centralized unit (CU) node, or include a distributed unit (DU) node, or be a RAN device including CU node and DU node, or be a RAN device including control plane CU node and user plane CU node, and DU node, or the network device can also be a wireless controller in cloud radio access network (CRAN) scenario, relay station, vehicle-mounted device, wearable device, etc. In addition, the base station can be a macro base station, micro base station, relay node, donor node or combination thereof. The base station can also refer to a communication module, modem or chip for setting in the foregoing device or apparatus. The base station can also be a mobile switching center, and a device assuming base station function in D2D, V2X, M2M communication, network side device in future communication network, device assuming base station function in future communication system, etc. The base station can support networks of the same or different access technologies, without limitation.

[0073] The terminal device in the embodiments of the present application can also be referred to as a user equipment (UE), an access terminal, a user unit, a user station, a mobile station, a mobile station, a mobile terminal (MT), a remote station, a remote terminal, a mobile device, a user terminal, a terminal, a drone, a wireless communication device, a user agent or a user apparatus, etc. The terminal device in the embodiments of the present application can refer to a device that provides voice and / or data connectivity to a user, and can be used to connect people, things and machines, such as handheld devices with wireless connection function, vehicle-mounted devices, etc. The terminal device in the embodiments of the present application can be a mobile phone, a tablet computer, a notebook computer, a palm computer, a mobile internet device (MID), a wearable device, a virtual reality (VR) device, an augmented reality (AR) device, a wireless terminal in industrial control, a wireless terminal in self driving, a wireless terminal in remote medical surgery, a wireless terminal in smart grid, a wireless terminal in transportation safety, a wireless terminal in smart city, a wireless terminal in smart home, etc.

[0074] FIG. 2 is a schematic flowchart of a communication method 200 provided by the present application. The communication method 200 can be performed by a first device, which can be a first apparatus or a device (such as a chip, a chip system, a processor, or an integrated circuit, etc.) for the first apparatus. In the embodiments of the present application, the first apparatus can be a sending end of data, or can also be a receiving end of data, which is not limited. As an example, the first apparatus can be a network apparatus, or can be a terminal apparatus.

[0075] 210, the first device determines a first polynomial index sequence.

[0076] The degree of the polynomial index sequence is greater than or equal to 2, and at least one of the quadratic term coefficient, the linear term coefficient or the zero term coefficient of the polynomial index sequence is associated with the index of the element of the first polynomial index sequence. The first polynomial index sequence can include at least two elements.

[0077] Without loss of generality, the d-th polynomial index sequence is represented as:

[0078] or

[0079] wherein d is the degree of the polynomial exponential sequence, n is the index of the element. M is the base length of the polynomial exponential sequence, N is the length of the polynomial exponential sequence, p i denotes the coefficient of the i-th term, i = 0,..., d.

[0080] That is, at least one of the quadratic term coefficient p2, the linear term coefficient pi and the zero term coefficient p0 of the first polynomial exponential sequence is associated with the index (i.e. n) of the element of the polynomial exponential sequence.

[0081] In step 210, the first device can determine the first polynomial exponential sequence by itself or through receiving signaling from other devices, which is not limited. For example, the first device is a network device, and the network device determines the first polynomial exponential sequence by itself; the first device is a terminal device, and the terminal device determines the first polynomial exponential sequence through receiving signaling from the network device, i.e. the network device sends signaling to indicate the first polynomial exponential sequence.

[0082] 220. The first device transmits based on the first polynomial exponential sequence.

[0083] As an example, the first device determines the first polynomial exponential sequence and transmits based on the first polynomial exponential sequence.

[0084] In an implementation, the first device transmits the first polynomial exponential sequence and data, and the first polynomial exponential sequence is used for demodulation of the data. Specifically, the first device determines the first polynomial exponential sequence and indicates the first polynomial exponential sequence to the second device through signaling, the second device receives the signaling from the first device and determines the first polynomial exponential sequence through the received signaling. Then, the first device transmits the first polynomial exponential sequence and the data. The second device performs channel estimation to obtain a channel response based on the received first polynomial exponential sequence and the first polynomial exponential sequence indicated by the first device (known sequence), and demodulates the data according to the result of the channel estimation (i.e. the channel response).

[0085] wherein the data transmitted by the first device can be determined by a specific service, which is not limited by the present application. For example, the first device can determine a bit data stream to be transmitted based on a specific service, then perform encoding, modulation, layer mapping, resource mapping, orthogonal frequency-division multiplexing (OFDM) generation and other processing processes on the bit data stream to obtain time domain data, and the data transmitted by the first device is the time domain data.

[0086] In another implementation, the first device cyclically shifts the first polynomial exponential sequence to obtain a second polynomial exponential sequence, and transmits based on the second polynomial exponential sequence. Similarly, after the first device determines the second polynomial exponential sequence, the first device indicates the second polynomial exponential sequence to the second device through signaling, and the second device receives the signaling from the first device and determines the second polynomial exponential sequence based on the received signaling. Then the first device transmits the second polynomial exponential sequence and data. The second device performs channel estimation based on the received second polynomial exponential sequence and the second polynomial exponential sequence indicated by the first device (known sequence), and demodulates the data according to the result of the channel estimation (channel response). The process of the first device cyclically shifting the first polynomial exponential sequence to obtain the second polynomial exponential sequence will be described in detail below.

[0087] In another implementation, the first device determines the first polynomial exponential sequence, and indicates the first polynomial exponential sequence to the second device through signaling. Then, the second device transmits the first polynomial exponential sequence and data to the first device, and the first device demodulates the data received from the second device according to the received first polynomial exponential sequence and the first polynomial exponential sequence determined by the first device and indicated to the second device (known sequence).

[0088] In another implementation, the first device cyclically shifts the first polynomial exponential sequence to obtain a second polynomial exponential sequence. And the first device indicates the second polynomial exponential sequence to the second device through signaling, and the second device receives the signaling from the first device and determines the second polynomial exponential sequence based on the received signaling. Then, the second device transmits the second polynomial exponential sequence and data. The first device performs channel estimation based on the received second polynomial exponential sequence and the second polynomial exponential sequence determined by the first device and indicated to the second device (known sequence), and demodulates the data according to the result of the channel estimation (channel response).

[0089] As another example, the first device receives signaling from other devices, and the signaling indicates a first polynomial exponential sequence. The first device determines the first polynomial exponential sequence based on the signaling. The first device transmits based on the first polynomial exponential sequence, including: transmitting the first polynomial exponential sequence and data, the first polynomial exponential sequence being used for demodulation of the transmitted data; or receiving the first polynomial exponential sequence and data, and demodulating the received data based on the received first polynomial exponential sequence and the first polynomial exponential sequence indicated by the signaling. The specific implementation can refer to the several possible implementations in the previous example, and will not be described here.

[0090] The first device indicates the first polynomial index sequence to the second device by signaling. Alternatively, the first device determines the first polynomial index sequence, i.e., determines the coefficients of the terms of the first polynomial index sequence, which can also be known to the first device and the second device by predefinition or pre-configuration, etc.

[0091] As an example, in downlink transmission, the first device is a network device, and the second device is a terminal device. The network device determines the first polynomial index sequence and indicates the first polynomial index sequence to the terminal device. Subsequently, the network device transmits the first polynomial index sequence and downlink data to the terminal device, and the terminal device demodulates the received downlink data based on the first polynomial index sequence indicated by the network device and the received first polynomial index sequence.

[0092] As an example, in uplink transmission, the first device is a network device, and the second device is a terminal device. The network device determines the first polynomial index sequence and indicates the first polynomial index sequence to the terminal device. Subsequently, the terminal device transmits the first polynomial index sequence and uplink data to the network device. The network device demodulates the received uplink data based on the known first polynomial index sequence and the received first polynomial index sequence.

[0093] The first polynomial index sequence in the embodiments of the present application can also be referred to as a demodulation reference signal (DMRS) or as a DMRS for data demodulation. In other words, the first device transmits or receives the DMRS and data, which can be the first device transmitting or receiving the first polynomial index sequence and data.

[0094] If the first device indicates the first polynomial index sequence to the second device by signaling, in one implementation, the signaling can carry a coefficient combination corresponding to the first polynomial index sequence, which can include one or more of the quadratic term coefficient, the linear term coefficient, and the zero-order term coefficient. If the signaling carries part of the coefficients in the coefficient combination, the other coefficients can be determined by predefinition, pre-configuration, etc.

[0095] In the embodiments of the present application, by designing at least one of the quadratic term coefficient, the linear term coefficient, and the zero-order term coefficient of the first polynomial index sequence to be associated with the index of the elements of the first polynomial index sequence, for a plurality of polynomial index sequences, the relationship between the term coefficients and the indexes of the elements of each polynomial index sequence can be designed, thereby providing controllable degrees of freedom and optimizing the interference between the plurality of polynomial index sequences.

[0096] The first polynomial index sequence in the embodiments of the present application will be described in more detail below.

[0097] In step 210, the first device determines the first polynomial index sequence. For example, the first device can first determine a first sequence set, and then determine the first polynomial index sequence from the first sequence set. The first polynomial index sequence can be any polynomial index sequence in the first sequence set. In other words, the first sequence set can include two or more polynomial index sequences, each of which satisfies the characteristics of the first polynomial index sequence, i.e., at least one of the quadratic term coefficient, the linear term coefficient, and the zero-order term coefficient is related to the index of the element of the polynomial index sequence, and the degree of each polynomial index sequence is greater than or equal to 2.

[0098] Optionally, the first device can determine at least two sequence sets, and then determine the first sequence set from the at least two sequence sets, and further determine the first polynomial index sequence from the first sequence set.

[0099] For example, the first sequence set is a set including a plurality of polynomial index sequences, which can be divided into K groups, each group including M g,seq polynomial index sequences. M g,seq is a positive integer, K is a positive integer greater than 1, and M g,seq is not greater than M.In other words, the first sequence set is a sequence set including K groups of polynomial index sequences, each group including M g,seq polynomial index sequences.

[0100] For example, if there are a plurality of sequence sets, the M g,seq and / or K corresponding to different sequence sets are different. In other words, each sequence set corresponds to a combination of M g,seq and K, and different sequence sets correspond to different combinations of M g,seq and K, so as to adapt to different sequence numbers and interference requirements. g,seq

[0101] In the embodiments of the present application, each polynomial index sequence in any sequence set corresponds to an antenna port. Alternatively, each polynomial index sequence is associated with an antenna port. In fact, the plurality of polynomial index sequences in each sequence set correspond to a plurality of antenna ports in a one-to-one manner. When the first device selects a polynomial index sequence for transmission, the antenna port corresponding to the polynomial index sequence is determined.

[0102] As an example, the one-to-one correspondence between the polynomial exponential sequences and the antenna ports can be in a table form. Assuming that the first device determines a sequence set containing 3 groups, each group containing 2 polynomial exponential sequences, the sequence set contains 6 polynomial exponential sequences in total. After the first device determines the sequence set, the first device establishes the one-to-one correspondence between the 6 polynomial exponential sequences and the antenna ports, and indicates the one-to-one correspondence to the second device through signaling. In Table 1, the antenna port index starts from 1 as an example, and can also start from 0, which is not limited.

[0103] Table 1

[0104] In Table 1, the polynomial exponential sequence index corresponds to a sequence in the sequence set, for example, the polynomial exponential sequence indexes 0, 1, 2, 3, 4, and 5 correspond to the 0th, 1st, 2nd, 3rd, 4th, and 5th polynomial exponential sequences in the sequence set, respectively. The antenna port index is used to determine the value of the antenna port, and different antenna port indexes can correspond to different values of the antenna port.

[0105] In another example, the polynomial exponential sequence index can directly correspond to the value of the antenna port, as shown in Table 2.

[0106] Table 2

[0107] It can be understood that each polynomial exponential sequence corresponds to a combination of a quadratic term coefficient, a linear term coefficient, and a zero-order term coefficient, and therefore, the polynomial exponential sequence and the antenna port correspond to each other, that is, the combination of the coefficients of the polynomial exponential sequence and the antenna port correspond to each other. Alternatively, when the polynomial exponential sequence corresponding to a certain antenna port is changed, the first device can indicate the new polynomial exponential sequence corresponding to the antenna port to the second device through signaling.

[0108] Taking any one sequence set as an example, the different polynomial exponential sequences in each group in the sequence set are orthogonal. The different polynomial exponential sequences in different groups in the sequence set are non-orthogonal. That is, any two polynomial exponential sequences in a group in a sequence set are orthogonal, and any polynomial exponential sequences in any two groups are non-orthogonal.

[0109] In an implementation manner, the orthogonality between any two polynomial exponential sequences in a group of the sequence set can include:

[0110] The quadratic term coefficients corresponding to any two polynomial exponential sequences in each group are the same, the zero-order term coefficients are the same, and the linear term coefficients are different.

[0111] In another implementation manner, the non-orthogony between the different polynomial exponential sequences in different groups in the sequence set can include:

[0112] The coefficients of the quadratic terms in different sets of polynomial exponent sequences are different; or,

[0113] The coefficients of the quadratic term and the zeroth term are different for different groups of polynomial exponential sequences.

[0114] Furthermore, the non-orthogonality between any two polynomial exponential sequences from different groups can also mean that the interference between any two sequences from different groups is equal to and equal to a given threshold (minimum interference); or it can mean that the interference between any two sequences from different groups does not exceed a given threshold. In the above embodiments, the first device determines a sequence set containing K groups, each group containing M... g,seq A series of polynomial exponent sequences are designed such that the coefficients of the first-order terms of the polynomial exponent sequences are orthogonal to each other. By designing coefficients (e.g., coefficients of the quadratic terms, or coefficients of the quadratic terms and coefficients of the zeroth degree) that are associated with the indices of the elements in the polynomial exponent sequences of different groups, interference between the polynomial exponent sequences of different groups can be minimized as much as possible.

[0115] From the representation of the above d-th degree polynomial exponential sequence (see s(n) for details), we know that a d-th degree polynomial exponential sequence X of length N can be expressed as: X(n)=e-j2πP(n) / M, n=0,…,N-1 P(n)=p d n d +p d-1 n d-1 +…+p1n+p0

[0116] Right now,

[0117] Alternatively, a polynomial exponential sequence X of length N and degree d can also be expressed as: X(n) = e -jπP(n) / M n = 0, ..., N-1

[0118] Alternatively, P(n) = (p d n d +p d-1 n d-1 +…+p1n+p0)mod M.

[0119] Where d is an integer greater than or equal to 2, p i This represents the coefficient of the i-th term. For example, p1 represents the coefficient of the first-degree term or the coefficient of a linear term. M is the base length of the polynomial exponent sequence, N is the length of the polynomial exponent sequence, and n is the index of the element.

[0120] For example, when d = 3, the cubic polynomial exponential sequence X can be represented as:

[0121] For example, when d = 2, the quadratic polynomial exponential sequence X can be expressed as:

[0122] As described above, at least one of the quadratic term coefficient, the linear term coefficient and the zero term coefficient of the polynomial exponential sequence is associated with the index of the element of the polynomial exponential sequence. That is, at least one of the quadratic term coefficient p2, the linear term coefficient p1 and the zero term coefficient p0 of the polynomial exponential sequence X is associated with the index (i.e. n) of the element of the polynomial exponential sequence.

[0123] In one possible implementation, one polynomial exponential sequence X contains Q short sequences, the length of the qth short sequence is M q , and satisfies At this time, one polynomial exponential sequence X can be obtained by sequentially concatenating the Q short sequences. Each short sequence can also be considered to be generated by a polynomial exponential sequence with a length of M, and has its corresponding coefficient. There are two short sequences in the Q short sequences with different lengths.

[0124] For example, the qth (q = 0,..., Q-1) short sequence x q in the Q short sequences and the polynomial exponential sequence X satisfy the following relationship:

[0125] wherein M -1 = 0.

[0126] In another possible implementation, M is the base length of the polynomial exponential sequence, N is the length of the polynomial exponential sequence, N / M = Q, and Q is an integer greater than 1. At this time, one polynomial exponential sequence X can be considered to contain Q short sequences, and the length of each short sequence is M. That is, one polynomial exponential sequence X can be obtained by sequentially concatenating the Q short sequences. Each short sequence can also be considered to be a polynomial exponential sequence with a length of M, and has its corresponding coefficient.

[0127] For example, the qth (q = 0,..., Q-1) short sequence x q in the Q short sequences and the polynomial exponential sequence X satisfy the following relationship: X(qM+m) = x q (m), m = 0,..., M-1

[0128] FIG. 3 is a schematic diagram of a polynomial exponential sequence containing three short sequences. The polynomial exponential sequence is obtained by sequentially concatenating the 0th short sequence, the 1st short sequence and the 2nd short sequence.

[0129] Further, at least one of the quadratic term coefficient, the linear term coefficient and the zero term coefficient is associated with an index of the elements of the polynomial index sequence, indicating that each short sequence corresponds to one quadratic term coefficient, one linear term coefficient and one zero term coefficient, and at least one of the quadratic term coefficients, the linear term coefficients and the zero term coefficients of the at least two short sequences is different.

[0130] Optionally, as an example, the quadratic term coefficients of the at least two short sequences are different; or the linear term coefficients of the at least two short sequences are different; or the zero term coefficients of the at least two short sequences are different; or the quadratic term coefficients of the at least two short sequences are different and the linear term coefficients are different; or the quadratic term coefficients of the at least two short sequences are different and the zero term coefficients are different; or the linear term coefficients of the at least two short sequences are different and the zero term coefficients are different; or the quadratic term coefficients of the at least two short sequences are different, the linear term coefficients are different and the zero term coefficients are different.

[0131] Exemplarily, the quadratic term coefficient corresponding to the qth short sequence in the Q short sequences is p 2,q , the linear term coefficient is p 1,q , and the zero term coefficient is p 0,q , q = 0, …, Q-1. That is, when the index n of the element of the polynomial index sequence X satisfies qM ≤ n < (q+1)M, the quadratic term coefficient of the polynomial index sequence X is p 2,q , the linear term coefficient is p 1,q , and the zero term coefficient is p 0,q .

[0132] Taking the quadratic polynomial index sequence as an example, at this time, the qth short sequence x q in the Q short sequences can be expressed as:

[0133] or

[0134] It can be understood that when the length of the qth short sequence in the Q short sequences is M q , taking the quadratic polynomial index sequence as an example, at this time, the qth short sequence x q in the Q short sequences can be expressed as:

[0135] or

[0136] wherein, M -1 = 0.

[0137] When the coefficient of the polynomial index sequence is greater than 2, the coefficients of the cubic term or higher order term of the Q short sequences can be the same, i.e., the Q cubic term coefficients of the Q short sequences are the same, the Q quartic term coefficients are the same, and so on, without limitation.

[0138] In one implementation, the quadratic coefficient p2, the linear coefficient p1, and the zero-order coefficient p0 of the polynomial exponential sequence X can be represented as: p2 = p 2,q ,n∈{qM,qM+1,…,(q+1)M-1} p1 = p 1,q ,n∈{qM,qM+1,…,(q+1)M-1} p0 = p 0,q ,n∈{qM,qM+1,…,(q+1)M-1}

[0139] In the above representation, (q+1)M-1 can also be replaced by qM+M-1.

[0140] It can be understood that when the length of the qth short sequence in the Q short sequences is M q , the quadratic coefficient p2, the linear coefficient p1, and the zero-order coefficient p0 of the polynomial exponential sequence X can be represented as:

[0141] In another implementation, the quadratic coefficient p2, the linear coefficient p1, and the zero-order coefficient p0 of the polynomial exponential sequence X can be represented as:

[0142] In still another implementation, the quadratic coefficient p2, the linear coefficient p1, and the zero-order coefficient p0 of the polynomial exponential sequence X can be represented as:

[0143] Taking the polynomial exponential sequence as a quadratic polynomial exponential sequence as an example, the polynomial exponential sequence X can be represented as:

[0144] For example, if Q = 2 and d = 2, the polynomial exponential sequence X is:

[0145] It can be understood that when the length of the qth short sequence in the Q short sequences is M q , taking the polynomial exponential sequence as a quadratic polynomial exponential sequence as an example, the polynomial exponential sequence X can be represented as:

[0146] For example, if Q = 2 and d = 2, the polynomial exponential sequence X is:

[0147] If a quadratic coefficient, a linear coefficient, and a zero-order coefficient form a coefficient combination <quadratic coefficient, linear coefficient, zero-order coefficient>, the quadratic coefficient p 2,q , the linear coefficient p 1,q , and the zero-order coefficient p 0,q of the qth short sequence correspond to a coefficient combination <p2,0 1,0 0,0 The first (or 1st) short sequence corresponds to a coefficient combination <p 2,1 1,1 0,1 .

[0148] FIG. 4 is a schematic diagram of a polynomial exponential sequence. As shown in FIG. 4, the polynomial exponential sequence includes two short sequences, each of which corresponds to a coefficient combination, where the 0th short sequence corresponds to a coefficient combination <p 2,0 1,0 0,0 The 1st short sequence corresponds to a coefficient combination <p 2,1 1,1 0,1 .

[0149] Optionally, the polynomial exponential sequence can include terms higher than the quadratic term. As an example, when the polynomial exponential sequence X includes terms higher than the quadratic term, the coefficients of the terms higher than the quadratic term can be predefined or indicated by signaling. Optionally, the other term coefficients (coefficients of terms other than the quadratic term coefficient, the linear term coefficient and the zeroth term coefficient) corresponding to the Q short sequences can be the same. For example, when the polynomial exponential sequence X includes terms up to the fourth term, the coefficients of the third term corresponding to each of the Q short sequences are the same, and the coefficients of the fourth term corresponding to each of the Q short sequences are the same.

[0150] It can be understood that when the quadratic term coefficient, the linear term coefficient and the zeroth term coefficient corresponding to each of the Q short sequences are determined, a polynomial exponential sequence is determined.

[0151] As an implementation of the above embodiment, the first device can indicate part or all of the quadratic term coefficient, the linear term coefficient and the zeroth term coefficient of the first polynomial exponential sequence to the second device by signaling, thereby indicating the first polynomial exponential sequence to the second device. When the first polynomial exponential sequence includes Q short sequences, the coefficients indicated by the first device to the second device include the quadratic term coefficient, the linear term coefficient and the zeroth term coefficient corresponding to each of the Q short sequences of the first polynomial exponential sequence. Optionally, part of the quadratic term coefficient, the linear term coefficient and the zeroth term coefficient corresponding to each of the short sequences can be predefined, preconfigured or agreed by protocol, and in this implementation, the signaling sent by the first device to the second device can carry coefficients other than the predefined, preconfigured or agreed coefficients. Optionally, the coefficient combination corresponding to each of the short sequences of each polynomial exponential sequence in the sequence set can be determined by a predefined manner (such as listed by a table), and based on the coefficient combination corresponding to each of the short sequences, the polynomial exponential sequence can be determined.

[0152] ​​​​​​​​Optionally, if the first polynomial exponential sequence has a degree greater than 2, the coefficients of the higher order terms of the first polynomial exponential sequence higher than the second order term can be predefined or determined by the first device and then signaled to the second device.

[0153] In the following examples, the polynomial exponential sequence in the embodiments of the present application is described by taking a quadratic polynomial exponential sequence as an example.

[0154] As described above, one sequence set contains K groups, and any two polynomial exponential sequences in each group are orthogonal, while any two polynomial exponential sequences in different groups are non-orthogonal.

[0155] As an example, the orthogonality between two polynomial exponential sequences can also be represented as: the inner product of the two polynomial exponential sequences is zero.

[0156] As another example, the orthogonality between two polynomial exponential sequences can also be represented as: the period correlation is performed on the two qth short sequences of the two polynomial exponential sequences to obtain the qth period correlation result, and then the Q period correlation results corresponding to the Q short sequences are added and combined to obtain a combined result of 0. The period correlation result contains M values, and the combined result also contains M values. The combined result of 0 indicates that the M values are all 0.

[0157] Optionally, any two polynomial exponential sequences in each group have the same quadratic term coefficient, or have the same quadratic term coefficient and zero term coefficient, and have different linear term coefficients, and the two polynomial exponential sequences are orthogonal. For example, for a 2nd polynomial exponential sequence, when the quadratic term coefficients of the two 2nd polynomial exponential sequences are the same, the zero term coefficients are the same, and the linear term coefficients are different, the two 2nd polynomial exponential sequences can be orthogonal.

[0158] It should be understood that different polynomial exponential sequences in different groups in the sequence set are non-orthogonal, i.e., the polynomial exponential sequences in any two groups of the K groups are non-orthogonal.

[0159] As an example, the non-orthogonality between two polynomial exponential sequences can also be represented as: the inner product of the two polynomial exponential sequences is not zero.

[0160] As another example, the orthogonality between two polynomial exponential sequences can also be represented as: the period correlation is performed on the two qth short sequences of the two polynomial exponential sequences to obtain the qth period correlation result; and then the Q period correlation results corresponding to the Q short sequences are added and combined to obtain a combined result that is not 0. The period correlation result contains M values, and the combined result also contains M values. The combined result that is not 0 indicates that at least one of the M values is not 0.

[0161] Optionally, any two polynomial exponential sequences of different groups are non-orthogonal when the quadratic coefficients of the two polynomial exponential sequences are different, or the quadratic coefficients of the two polynomial exponential sequences are different and the zero-order coefficients are different. For example, a polynomial exponential sequence 1 is from a group #1 of a sequence set, and a polynomial exponential sequence 2 is from a group #2 of the sequence set. When the quadratic coefficients of the polynomial exponential sequence 1 and the polynomial exponential sequence 2 are different, and the zero-order coefficients are different, the polynomial exponential sequence 1 and the polynomial exponential sequence 2 are non-orthogonal. Here, the group #1 and the group #2 are any two groups of the sequence set, the polynomial exponential sequence 1 is any one of the polynomial exponential sequences in the group #1, and the polynomial exponential sequence 2 is any one of the polynomial exponential sequences in the group #2.

[0162] For example, for 2-order polynomial exponential sequences, when the quadratic coefficients of two 2-order polynomial exponential sequences are different, the two 2-order polynomial exponential sequences are non-orthogonal.

[0163] When a polynomial exponential sequence X contains Q short sequences, each short sequence and a coefficient combination correspond to each other, and then the polynomial exponential sequence and Q coefficient combinations correspond to each other.

[0164] The coefficient combination C k,j,q corresponding to the qth short sequence of the jth polynomial exponential sequence in the kth group of a sequence set is represented as:

[0165] wherein, are the quadratic coefficient, the linear coefficient and the zero-order coefficient corresponding to the qth short sequence of the jth polynomial exponential sequence in the kth group, respectively. The coefficient combination C k,j,q corresponds to the index n∈{qM,qM+1,…,(q+1)M-1} of the element. That is, when qM≤n<(q+1)M, the quadratic coefficient, the linear coefficient and the zero-order coefficient of the polynomial exponential sequence constitute the coefficient combination C k,j,q .

[0166] Optionally, the coefficient combination C k,j,q can also be represented as:

[0167] Exemplarily, the jth polynomial exponential sequence in the kth group is represented as X k,j , and satisfies:

[0168] wherein, the quadratic coefficient p2, the linear coefficient p1, the zero-order coefficient p0 and Q coefficient combinations C k,j,0 ,C k,j,1 ,…,C k,j,Q-1 correspondence. For example, the quadratic term coefficient p2, the linear term coefficient p1, and the zero-order term coefficient p0 satisfy:

[0169] Correspondingly, the qth short sequence of the jth polynomial exponential sequence in the kth group is denoted as x k,j,q , satisfying:

[0170] Optionally, the coefficients of the cubic and higher-order terms of different polynomial exponential sequences in the sequence set are the same.

[0171] FIG. 5 is a schematic diagram of the coefficient combination corresponding to each short sequence included in each polynomial exponential sequence in each of the K groups of polynomial exponential sequences included in the sequence set.

[0172] As shown in the following figure, the sequence set includes K = 3 groups of sequences, each group including M g,seq = M polynomial exponential sequences, and each polynomial exponential sequence including Q = 2 short sequences. The coefficient combination corresponding to the 0th short sequence of the 0th polynomial exponential sequence in the 0th group is The coefficient combination corresponding to the 1st short sequence of the 0th polynomial exponential sequence in the 0th group is The coefficient combination corresponding to the 0th short sequence of the 1st polynomial exponential sequence in the 0th group is The coefficient combination corresponding to the 1st short sequence of the 1st polynomial exponential sequence in the 0th group is

[0173] In an implementation manner, the coefficient combination corresponding to each short sequence of each polynomial exponential sequence in each group of the sequence set is indicated through signaling.

[0174] Optionally, the quadratic term coefficients corresponding to the short sequences of the same index of any two polynomial exponential sequences in each group are the same, i.e., the quadratic term coefficients corresponding to the qth short sequence of the i th polynomial exponential sequence and the qth short sequence of the j th polynomial exponential sequence in each group are the same, satisfying:

[0175] At this time, the quadratic term coefficient corresponding to the qth short sequence of each polynomial exponential sequence in each group is denoted as satisfying

[0176] In an implementation manner, the linear term coefficient p1 and the zero-order term coefficient p0 are associated with the quadratic term coefficient,

[0177] Exemplarily, the quadratic term coefficient corresponding to the qth short sequence of the jth polynomial exponential sequence in the kth group is the linear term coefficient the zero-order term coefficient satisfy:

[0178] In this example, a quadratic polynomial exponential sequence is used. For example, the q-th short sequence of the j-th polynomial exponential sequence in the k-th group is represented as x. k,j,q : qM≤n<(q+1)M

[0179] Where Δ1 is a predefined value. The phase value is constant. This is called the constant phase parameter. For example, when the fundamental length M of the polynomial exponential sequence is odd, When the base length M of the polynomial exponential sequence is even, Δ1 = 0.

[0180] If let Called a base sequence, then x k,j,q This can be represented as follows:

[0181] When the coefficients of the quadratic terms corresponding to the same index of any two short sequences of polynomial exponent sequences in each group are the same, that is... Then we have:

[0182] At this point, the base sequence y corresponding to the different polynomial exponent sequences in the k-th group k,j,q They are the same and can be abbreviated as y. k,q , that is, y k,q =y k,j,q .

[0183] In other words, the j-th polynomial in the k-th group indicates the q-th short sequence x. k,j,q , and the quadratic polynomial exponent sequence y k,j,q Perform a cyclic shift based on the cyclic shift value A, and then multiply by the phase. The results were the same.

[0184] Understandably, once the coefficients of the quadratic term are determined... constant phase parameter (i.e., determine the phase) Given A and A, we can determine the qth short sequence of the jth polynomial exponent sequence in the kth group.

[0185] The following describes how the quadratic coefficients, constant phase parameters, and A (i.e., the aforementioned cyclic shift values, the linear coefficients of the associated polynomial exponential sequence) are determined.

[0186] As an example, A can be an integer. Different polynomial exponent sequences within each group correspond to different A values. In other words, the coefficients of the first-order terms of any two polynomial exponent sequences within a group are different. For quadratic polynomial exponent sequences, different quadratic polynomial exponent sequences obtained by cyclic shifting based on different cyclic shift values ​​are orthogonal.

[0187] Optionally, the value of A is M in the set {0,1,…,M-1}. g,seq An integer. The first device can determine M from the set {0,1,…,M-1} by signaling or a predefined method. g,seq There are M integers. g,seq A set M from a set of integers and sequences g,seq There is a one-to-one correspondence between each polynomial exponent sequence and M. That is, each polynomial exponent sequence corresponds to M. g,seq One of the integers is the cyclic shift value corresponding to the polynomial exponent sequence, so that any two polynomial exponent sequences within the group have different cyclic shift values. Optionally, M g,seq When =M, M in the group g,seq The cyclic shift values ​​corresponding to each of the polynomial exponent sequences can be set as {0,1,…,M-1}={0,1,…,M g,seq M in -1} g,seq The element, that is, the cyclic shift value A corresponding to the j-th polynomial exponent sequence in the group, takes the value j.

[0188] Optionally, the values ​​of A corresponding to different groups in a sequence set can be the same. That is, M is determined from the set {0,1,…,M-1}. g,seq There are M integers, and each group in this sequence set corresponds to one of these M. g,seq 1 integer, representing M in each group g,seq Each polynomial exponent sequence corresponds to M g,seq A cyclic shift value.

[0189] Optionally, the constant phase parameters corresponding to the short sequences with the same index of any two polynomial exponent sequences in each group are the same. That is, the constant phase parameters corresponding to the q-th short sequences of the i-th polynomial exponent sequence and the j-th polynomial exponent sequence in each group are the same, satisfying:

[0190] At this point, the constant phase parameter corresponding to the q-th short sequence of each polynomial exponential sequence in each group can be expressed as: satisfy

[0191] Optionally, the constant phase parameters corresponding to the same index of any two short sequences of polynomial exponential sequences within any group are different.

[0192] As an example, the quadratic term coefficients corresponding to the same index of any two polynomial-exponential sequences in each group (e.g., the quadratic term coefficients corresponding to the same index of any two polynomial-exponential sequences in the kth group ) are the same, and the constant phase parameters corresponding to the same index of any two polynomial-exponential sequences in each group (e.g., the constant phase parameters corresponding to the same index of any two polynomial-exponential sequences in the kth group ) are the same. In this case, the inter-group interference will reach the theoretical minimum.

[0193] In one example, for the quadratic term coefficient of the qth short sequence of any one polynomial-exponential sequence in the kth group satisfies:

[0194] where k0and k1are the indices of any two groups. is the modular inverse of the quadratic term coefficient of the qth short sequence of each polynomial-exponential sequence in the kth group satisfies

[0195] Equivalently, the above formula can also be expressed as:

[0196] where z is an integer. That is, the result of taking M modulo z is z.

[0197] In particular, in this example Q = 2.

[0198] In other words, for any two polynomial-exponential sequences from different groups, the difference between the quadratic term coefficient of the 0th short sequence and the quadratic term coefficient of the 1st short sequence of each polynomial-exponential sequence, when taken modulo M, results in the same value.

[0199] Here, the definition of a modular inverse is given: an integer is the modular inverse of an integer Z with respect to modulus M (or the integer Z is the modular inverse of the integer with respect to modulus M) if That is, the value of multiplying the integer and the integer Z modulo the positive integer M is 1.

[0200] In another example, Q = 2, K = 3, for the constant phase parameter of the qth (q = 0, 1) short sequence of the jth polynomial-exponential sequence in the kth (k = 0, 1, 2) group satisfies:

[0201] where may be any real number, and the parameters a 2,0 and a 1,2satisfies:

[0202] wherein r u denotes a ZC sequence with root u and length M, or denotes a base sequence with quadratic coefficient u. angle{β} denotes taking phase of the value β in radian (rad).

[0203] Optionally, the value of is 0, then the constant phase parameter satisfies:

[0204] At this time, only and are not 0 in the constant phase parameter.

[0205] In the above example, when Q=2, K=3, M g,seq =M, 3 groups of polynomial exponential sequences can be generated, each group containing M polynomial exponential sequences, so there are 3M polynomial exponential sequences in total. The length of each polynomial exponential sequence is N=QM=2M. The interference (which can be represented by the amplitude of the inner product) between any two polynomial exponential sequences of different groups reaches a minimum value, which is at this time, it is assumed that the amplitude of the inner product of the same two polynomial exponential sequences is normalized to 1. For two ZC sequences of different roots with a length of 2M, the interference is that is, compared with using ZC sequences of different roots, the interference between sequences is smaller by using the scheme of the present application.

[0206] Exemplarily, when Q=2, K=3, M g,seq =M=11, the 3 groups of combinations of <quadratic coefficient, constant phase parameter> can be as shown in Table 3 when the values of

[0207] Table 3

[0208] It should be understood that in Table 3, denotes the quadratic coefficient of the 0th short sequence of the jth group, denotes the quadratic coefficient of the 1st short sequence of the jth group; denotes the value of the constant phase parameter of the 0th short sequence of the jth group, denotes the value of the constant phase parameter of the 1st short sequence of the jth group.

[0209] Based on the combination of the quadratic coefficient and the constant phase parameter of any row in Table 3, and M g,seq =11, different M g,seqa cyclic shift value (corresponding to a linear term coefficient), a sequence set containing 3 groups (K=3) can be generated, each group containing 11 polynomial index sequences (M g,seq =11), and each polynomial index sequence can contain 2 short sequences (or be spliced by 2 short sequences).

[0210] As described above, in the above implementation, A is a cyclic shift value, which actually also corresponds to a linear term of a polynomial index sequence. Alternatively, the linear term coefficient of the polynomial index sequence is associated with the cyclic shift value. If at least one of the quadratic term coefficient and the zero term coefficient of the first polynomial index sequence is related to the index of the element of the first polynomial index sequence, the quadratic term coefficient and the zero term coefficient are determined, and the first polynomial index sequence is cyclically shifted based on the cyclic shift value A to obtain an output polynomial index sequence. It is equivalent to determining the quadratic term coefficient, the zero term coefficient and the linear term coefficient in the above embodiment to determine the first polynomial index sequence (as the output polynomial index sequence). This is two implementation ways of the first device to determine the output polynomial index sequence.

[0211] Here, the output polynomial index sequence can refer to the polynomial index sequence used for transmission in step 220. Thus, in step 220, the first device transmits based on the first polynomial index sequence. One possible implementation is that the first device determines the quadratic term coefficient, the linear term coefficient and the zero term coefficient of the first polynomial index sequence, and then determines the first polynomial index sequence, and transmits based on the first polynomial index sequence. In this implementation, the linear term coefficient is related to (or corresponds to) the cyclic shift value; another possible implementation is that at least one of the quadratic term coefficient and the zero term coefficient is related to the index of the element of the first polynomial index sequence, and the linear term coefficient is not related to the index of the element of the first polynomial index sequence. As an example, the linear term coefficient can be a predefined value. The linear term coefficients of different polynomial index sequences can be the same, and different polynomial index sequences can be obtained by cyclic shift operation to realize orthogonality. After the first device determines the quadratic term coefficient and the zero term coefficient of the first polynomial index sequence, the first polynomial index sequence is cyclically shifted based on the cyclic shift value to obtain a second polynomial index sequence, and the second polynomial index sequence is transmitted.

[0212] In the implementation of the first device determining the output polynomial index sequence based on the cyclic shift value, the first device can determine a sequence set containing K groups of polynomial index sequences, and different polynomial index sequences in each group can correspond to different cyclic shift values A.

[0213] The method for determining a polynomial index sequence provided by the present application is described in detail above.

[0214] As a possible implementation, the ZC sequence itself is a special polynomial exponential sequence. Alternatively, the first polynomial exponential sequence in any one of the above embodiments can be a ZC sequence. The following takes the ZC sequence as an example to describe how to determine the coefficients of the first order term and the second order term of the polynomial exponential sequence. The ZC sequence, i.e., the Zad-off Chu sequence.

[0215] A ZC sequence r zc with a length of N u can be expressed as:

[0216] wherein u is a root of the ZC sequence, N zc is the length of the ZC sequence, and W is a predefined integer. The root and the length of the ZC sequence are coprime.

[0217] Optionally, when N zc is an odd number, W = 1, and in this case:

[0218] Optionally, when N zc is an even number, W = 0, and in this case:

[0219] In the embodiments of the present application, for the quadratic polynomial exponential sequence, when the coefficients p0, p1, and p2 of the quadratic polynomial exponential sequence are certain values, the quadratic polynomial exponential sequence is a ZC sequence. Alternatively, the ZC sequence is a special quadratic polynomial exponential sequence.

[0220] Taking the polynomial exponential sequence e-j2πP(n) / M as an example, when p2 = u / 2, p1 = p2, p0 = 0, M = N zc and N zc is an odd number, the quadratic polynomial exponential sequence is the same as the ZC sequence.

[0221] Taking the polynomial exponential sequence e -jπP(n) / M as an example, when p2 = u, p1 = p2, p0 = 0, M = N zc and N zc is an odd number, the quadratic polynomial exponential sequence is the same as the ZC sequence.

[0222] It can be seen that the coefficients of the first order term and the second order term of the quadratic polynomial exponential sequence corresponding to the ZC sequence are both related to the root u of the ZC sequence. When the polynomial exponential sequence is the ZC sequence, at least one of the coefficients of the second order term, the coefficient of the first order term, and the coefficient of the zero order term of the polynomial exponential sequence is associated with the index of the element of the polynomial exponential sequence, in other words, the root of the ZC sequence is associated with the index of the element of the ZC sequence.

[0223] In a possible implementation, a ZC sequence can be cyclically shifted based on a cyclic shift value a to obtain a new sequence s u , satisfying: u (m) = x u [(m + a) mod N ZC ], m = 0, …, N zc -1

[0224] Alternatively, s u (m) = x u (m + a), m = 0, …, N zc -1

[0225] wherein the new sequence s u is still a binomial exponential sequence. The binomial exponential sequence and the new sequence s u obtained by cyclically shifting a ZC sequence can be made identical by configuring appropriate p0, p1, p2.

[0226] In another possible implementation, a ZC sequence can be phase-rotated based on a cyclic shift value a to obtain a new sequence s u , satisfying:

[0227] Alternatively,

[0228] wherein N cs is a positive integer, which can be predefined or indicated by signaling.

[0229] It can be understood that the new sequence s u is still a binomial exponential sequence, and the binomial exponential sequence and the new sequence s u obtained by phase-rotating a ZC sequence can be made identical by configuring appropriate p0, p1, p2.

[0230] When a ZC sequence is transmitted, for an antenna port, a cyclic shift value a can be configured, and a ZC sequence is phase-rotated or cyclically shifted based on the cyclic shift value a to generate a new sequence s u corresponding to the antenna port, and the new sequence s u is transmitted or received. For different antenna ports, different cyclic shift values can be configured to make the multiple new sequences of the multiple antenna ports transmitted or received have no interference or lower interference. In other words, multiple antenna ports can be supported by configuring multiple cyclic shift values a to a ZC sequence.

[0231] The first apparatus determines a polynomial exponential sequence containing at least two elements, the polynomial exponential sequence being obtained by concatenating Q short sequences, and each short sequence being obtained based on a ZC sequence.

[0232] In one possible implementation, each short sequence is a ZC sequence, for example, N ZC =M,N zc Given an odd number of short sequences, the q-th short sequence x in the Q short sequences. q It can be represented as:

[0233] or,

[0234] or,

[0235] Where, n′ = n mod M or n′ = n mod N zc u q For the q-th short sequence x q The root of the corresponding ZC sequence. In this implementation, the Q short sequences have equal lengths, all being N. ZC =M. That is, the basic length of the polynomial exponential sequence in the above embodiments. Optionally, N ZC It can also be different from M, for example, N. ZC It is the largest prime number not exceeding M.

[0236] Optionally, the length of the q-th short sequence among the Q short sequences is M. q At this point, the q-th short sequence x in the Q short sequences... q It can be represented as:

[0237] or,

[0238] or,

[0239] Where, M -1 =0, n′=n mod M or n′=n mod N zc .

[0240] In another possible implementation, each short sequence is a new sequence obtained by phase rotation of a ZC sequence based on a cyclic shift value α, and the q-th short sequence x among the Q short sequences is... q It can be represented as:

[0241] or,

[0242] or,

[0243] Where, n′ = n mod M or n′ = n mod N zc In this implementation, the lengths of the Q short sequences do not have to be exactly equal.

[0244] In another possible implementation, each short sequence is based on multiplying a ZC sequence by a constant phase value, the qth short sequence xq(n) in the Q short sequences is q may be expressed as:

[0245] or,

[0246] or,

[0247] where n' = n mod M or n' = n mod N zc . is a constant phase value of the qth short sequence, is a constant phase parameter of the qth short sequence. In this implementation, the lengths of the Q short sequences are equal.

[0248] In the implementation where the polynomial exponential sequence is a ZC sequence, one sequence set can include K groups of polynomial exponential sequences, each group containing M g,seq polynomial exponential sequences. Each polynomial exponential sequence contains Q short sequences, each short sequence corresponding to a ZC sequence. Each short sequence corresponds to a root and a cyclic shift value, or each short sequence corresponds to a root and a constant phase value, or each short sequence corresponds to a root, a cyclic shift value and a constant phase value.

[0249] Optionally, the Q short sequences of each polynomial exponential sequence in each group correspond to the same cyclic shift value.

[0250] Optionally, the different short sequences of each polynomial exponential sequence in each group can correspond to different cyclic shift values. At this time, the Q short sequences of each polynomial exponential sequence correspond to a combination of Q cyclic shift values.

[0251] Optionally, the Q short sequences of different polynomial exponential sequences in each group correspond to different cyclic shift values. Based on different cyclic shift values, orthogonality between different polynomial exponential sequences in a group can be achieved. When the Q short sequences of each polynomial exponential sequence correspond to a combination of Q cyclic shift values, the Q short sequences of different polynomial exponential sequences correspond to different cyclic shift values, indicating that the combination of Q cyclic shift values corresponding to different polynomial exponential sequences is different.

[0252] The cyclic shift value a can be determined by referring to the method of determining the cyclic shift value A in the above embodiments, which is not described herein.

[0253] Optionally, the roots corresponding to the same index of any two polynomial exponent sequences in each group are the same, that is, the roots corresponding to the q-th short sequences of the i-th polynomial exponent sequence and the j-th polynomial exponent sequence in each group are the same, satisfying:

[0254] At this point, the root corresponding to the q-th short sequence of each polynomial exponential sequence in each group can be represented as: satisfy j = 0, ..., M g,seq -1.

[0255] Optionally, the constant phase parameters corresponding to the same index of any two short sequences of polynomial exponent sequences in each group are the same, that is, the constant phase parameters corresponding to the i-th polynomial exponent sequence and the q-th short sequence of the j-th polynomial exponent sequence in the k-th group are the same, satisfying:

[0256] At this point, the constant phase parameter corresponding to the q-th short sequence of each polynomial exponential sequence in each group can be expressed as: satisfy

[0257] The following describes how to determine the root and constant phase parameters.

[0258] As mentioned above, the coefficients of the quadratic terms in a quadratic polynomial exponential sequence correspond to the roots of the ZC sequence.

[0259] With the polynomial exponent sequence e -jπP(n) / M For example, if the coefficients and roots of the quadratic term are the same, then the root corresponding to the qth short sequence of the j-th polynomial exponent sequence in the k-th group is... And the quadratic term coefficients corresponding to the qth short sequence of the jth polynomial exponent sequence in the kth group in the above embodiments. same, When any two short sequences with the same index in each group of polynomial exponent sequences have the same root, then

[0260] Taking the polynomial exponent sequence as e^(-j2πP(n) / M) as an example, or When any two short sequences with the same index in each group of polynomial exponent sequences have the same root, then or

[0261] Therefore, for the root of the qth short sequence of the jth polynomial exponential sequence in the kth group... The above embodiments can be used as a reference to determine the following. The method is used to determine this.

[0262] Optionally, the constant phase value corresponding to the qth short sequence of the jth polynomial exponential sequence in the kth group and the constant phase value in the above embodiment are the same. When the constant phase parameters corresponding to the short sequences with the same sequence number of any two polynomial exponential sequences in each group are the same, the constant phase value corresponding to the qth short sequence of the jth polynomial exponential sequence in the kth group and the constant phase value in the above embodiment are the same.

[0263] Thus, when Q=2 and K=3, the method for determining may be determined by referring to the method for determining

[0264] The above is a description of how to determine the root, cyclic shift value and constant phase parameter of the ZC sequence when the polynomial exponential sequence is a ZC sequence.

[0265] After the first device determines the polynomial exponential sequence used for transmission, transmission is performed based on the polynomial exponential sequence. For example, the first device transmits the determined polynomial exponential sequence, and the mapping manner of the polynomial exponential sequence on the time-frequency resource can be various, and several examples are given below.

[0266] Method 1: The polynomial exponential sequence is sequentially mapped on N subcarriers of a symbol in a continuous or equal-interval manner. Optionally, the symbol can be an orthogonal frequency division multiplexing (OFDM) symbol or a single-carrier frequency-division multiple access (SC-FDMA) symbol, etc., without limitation.

[0267] Method 2: Each short sequence of the Q short sequences is sequentially mapped on M subcarriers of a symbol in an equal-interval manner, and different short sequences are located in different combs.

[0268] A sequence is mapped on subcarriers with an interval D, and it can be said that the sequence is mapped with a comb D. For example, a sequence is mapped with a comb D=4, and there are 4 different combs available, which are subcarriers 0, 4, 8, 12, … (0th comb); subcarriers 1, 5, 9, 13, … (1st comb); subcarriers 2, 6, 10, 14, … (2nd comb); and subcarriers 3, 7, 11, 15, … (3rd comb).

[0269] Figure 6 is a schematic diagram of a time-frequency resource mapping manner of a polynomial exponential sequence provided by the present application. In this example, Q=2, each polynomial exponential sequence contains 2 short sequences, mapped with comb D=2, the 0th short sequence is mapped on subcarriers 0, 2, 4, 6, … of the 0th comb, and the 1st short sequence is mapped on subcarriers 1, 3, 5, 7, … of the 1st comb.

[0270] Manner 3: at least two short sequences in the Q short sequences are mapped on M subcarriers of different symbols in a continuous or equally-spaced manner, i.e., the Q short sequences are mapped on at least two symbols. The combs in which different short sequences are mapped on different symbols can be different. For example, Q=4, 2 short sequences in the 4 short sequences are mapped on different combs of one symbol, and the other 2 short sequences are mapped on different combs of another symbol.

[0271] Figure 7 is a schematic diagram of another time-frequency resource mapping manner of a polynomial exponential sequence provided by the present application. In this example, Q=2, each polynomial exponential sequence contains 2 short sequences, in one implementation, the two short sequences are continuously mapped in two symbols respectively; in another implementation, the two short sequences are mapped with comb D=2 in two symbols respectively, mapping the same comb; in still another implementation, the two short sequences are mapped with comb D=2 in two symbols respectively, mapping different combs.

[0272] In the embodiments of the present application, by designing at least one of the quadratic term coefficient, the zeroth term coefficient, and the first term coefficient of the polynomial exponential sequence to be related to the index of the elements of the polynomial exponential sequence, the relationship between the term coefficients and the element indexes of the polynomial exponential sequence can be designed, and thus the interference between different polynomial exponential sequences can be controlled to reduce the interference between different polynomial exponential sequences to the greatest extent. In one application scenario, the requirement that more streams are supported in MIMO and the interference between polynomial exponential sequences of different antenna ports is as low as possible can be met, the DMRS (the polynomial exponential sequence is DMRS) capacity can be expanded, and the interference between DMRSs meets the communication requirement. In addition, the number of non-orthogonal linear spreading sequences is increased, and the interference between the spreading sequences meets the communication requirement.

[0273] The communication method provided by the present application is described in detail above, and the communication apparatus provided by the present application is introduced below.

[0274] To implement the functions of the communication apparatus (e.g., the first apparatus) in the embodiments of the present application, the communication apparatus can implement the corresponding functions in the form of a hardware structure, a software module, or a hardware structure plus a software module.

[0275] FIG. 8 is a schematic structural diagram of a communication apparatus provided in the present application. As shown in FIG. 8, the communication apparatus 1000 includes a processing module 801 and a communication module 802. The communication apparatus 800 can be a communication device, or an apparatus applied to a communication device, capable of realizing corresponding functions of the communication device, such as a chip, a chip system or a circuit, etc. For example, the communication device can be the first device in the method embodiments.

[0276] The communication module can also be a transceiver module, a transceiver, a transceiver device, or the like. The processing module can also be a processor, a processing board, a processing unit, or the like. Optionally, the communication module is configured to perform the sending operation or the receiving operation of the first device in any one of the method embodiments. The device in the communication module for realizing the receiving function can be regarded as a receiving unit, and the device in the communication module for realizing the sending function can be regarded as a sending unit, i.e., the communication module includes the receiving unit and the sending unit. The processing module is configured to perform the operation / process realized internally in the first device in any one of the method embodiments. The corresponding specific operations of each module can be found in the description of the method embodiments, and will not be described here. For example, in FIG. 2, the processing module 801 can perform step 210, and the communication module 802 can perform step 220, specifically, for example, the first polynomial exponential sequence and the data can be received or sent.

[0277] In addition, optionally, the communication module and / or the processing module can be realized by a virtual module, for example, the processing module can be realized by a software function unit or a virtual device, and the communication module can be realized by a software function or a virtual device. Alternatively, the processing module or the communication module can also be realized by an entity device, for example, the communication apparatus is realized by a chip, such as a system on chip (SoC), a hardware circuit, etc., and the communication module can be an input / output circuit and / or a communication interface, performing the input operation (corresponding to the receiving operation) and the output operation (corresponding to the sending operation); and the processing module is an integrated circuit or a logic circuit, etc.

[0278] The division of the modules in the present application is schematic, and is only a logical function division. In actual implementation, there can be another division mode. In addition, each function module in each example in the present application can be integrated in one module, or can be physically separated, or two or more modules can be integrated in one module. The integrated module can be realized in the form of hardware, or in the form of a software function module, or in the form of a hardware and software combined function module, without limitation.

[0279] FIG. 9 is a schematic structural diagram of another communication apparatus provided in the present application. The communication apparatus 900 can be used to implement the function of any one of the communication devices (e.g., the first device) in the communication system described in the foregoing examples. The communication apparatus 900 can include at least one processor 910. Optionally, the processor 910 (or processing apparatus) is coupled with a memory, which can be located within the communication apparatus, or the memory can be integrated with the processor, or the memory can also be located outside the communication apparatus. For example, the communication apparatus 900 can further include at least one memory 920. The memory 920 stores computer programs, instructions or data necessary for implementing any one of the method embodiments described above; and the processor 910 can execute the computer programs, instructions or data stored in the memory 920 to complete the corresponding functions of the first device in any one of the embodiments described above.

[0280] Optionally, the communication apparatus 900 can further include a communication interface 930, and the communication apparatus 900 can interact with other devices through the communication interface 930. For example, the communication interface 930 can be a transceiver, a circuit, a bus, a module, a pin or other types of communication interfaces. When the communication apparatus 900 is a chip-type apparatus or a circuit, the communication interface 930 in the apparatus 900 can also be an input / output circuit, which can input (or receive) information and / or output (or send) information; the processor can be an integrated circuit or a logic circuit, etc., and the processor can determine the output information according to the input information.

[0281] The coupling in the present application is an indirect coupling or communication connection between the apparatuses, units or modules, which can be electrical, mechanical or other forms, and is used for information interaction between the apparatuses, units or modules. The processor 910 can operate in cooperation with the memory 920 and the communication interface 930. The connection medium between the processor 910, the memory 920 and the communication interface 930 is not limited in the present application.

[0282] FIG. 10 is a schematic structural diagram of a chip provided in the present application. The chip 10 includes a circuit 11 and a communication interface 12. The circuit 11 can be a logic circuit, an integrated circuit, etc., and the communication interface 12 can also be referred to as an input / output circuit, an input / output interface, an interface circuit, etc., which can input (or receive) information or output (or send) information. The chip 10 can execute the method performed by the first device in the embodiments of the present application.

[0283] In addition, the present application further provides a computer readable storage medium, which stores computer instructions, and when the computer instructions run on a computer, the operations and / or processes performed by the first device in the method embodiments of the present application are executed.

[0284] The application further provides a computer program product comprising computer program code or instructions which, when run on a computer, cause the operations and / or processes performed by the first device in any of the method embodiments of the application to be performed.

[0285] Further, the application also provides a chip, which comprises a processor. A memory for storing a computer program is arranged independently of the chip, and the processor is configured to execute the computer program stored in the memory, so that the operations and / or processes performed by the first device in any of the method embodiments are executed. Further, the chip can further comprise a communication interface. The communication interface can be an input / output interface, an interface circuit, or the like. Further, the chip can further comprise a memory.

[0286] The application provides a communication system, which comprises the first device in any of the method embodiments. Optionally, the communication system can further comprise a second device.

[0287] The processor in the embodiments of the application has a signal processing capability, and can be a general processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array, or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, and can implement or execute the disclosed methods, steps and logic block diagrams in the application. The general processor can be a microprocessor or any conventional processor. The steps of the method disclosed in the application can be directly embodied as a hardware processor for execution, or be executed by a combination of hardware and software modules in the processor. The software module can be located in a random access memory, a flash memory, a read only memory, a programmable read only memory, or an electrically erasable programmable memory, a register, or other mature storage medium in the art. The storage medium is located in the memory, and the processor reads information in the memory and combines the hardware to complete the steps of the above method.

[0288] In embodiments of the application, the memory can be volatile memory or nonvolatile memory, or can include both volatile and nonvolatile memory. In one embodiment, nonvolatile memory can be read-only memory (ROM), programmable ROM (PROM), erasable PROM (EPROM), electrically EPROM (EEPROM), or flash memory. Volatile memory can be random access memory (RAM), which acts as external cache. By way of example and not limitation, many forms of RAM are available, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), Synchlink DRAM (SLDRAM), and direct rambus RAM (DR RAM). It is to be noted that the memory described herein is intended to include, among other things, these and any other suitable types of memory.

[0289] Those skilled in the art can clearly understand that the units and algorithm steps of each example described in combination with the embodiments disclosed herein can be realized by electronic hardware or a combination of computer software and electronic hardware. Whether the functions are realized in hardware or software depends on the specific application and design constraints of the technical solution. A person skilled in the art can use different methods to realize the described functions for each specific application, but such implementation should not be considered beyond the scope of the present application.

[0290] Those skilled in the art can clearly understand that, for the convenience and brevity of the description, the specific working processes of the above-described system, device and unit can refer to the corresponding processes in the foregoing method embodiments, which will not be described here.

[0291] In several embodiments provided in the present application, it should be understood that the disclosed system, device and method can be implemented by other ways. For example, the above-described device embodiments are merely illustrative, for example, the division of the units is merely a logical function division, and actual implementation can have another division manner, for example, a plurality of units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection can be indirect coupling or communication connection through some interfaces, devices or units, and can be electrical, mechanical or other forms.

[0292] The units described as separate components can or can not be physically separated, and the components shown as units can or can not be physical units, i.e. can be located in one place or can be distributed to a plurality of network units. Part or all of the units can be selected according to actual needs to achieve the purpose of the embodiment.

[0293] If the functions are realized in the form of software function units and sold or used as independent products, they can be stored in a computer readable storage medium. Based on this understanding, the technical solutions of the present application essentially or the part of the prior art or the part of the technical solutions can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a plurality of instructions for making a computer device (which can be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the method described in the embodiments of the present application. The foregoing storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), magnetic disk or optical disk and various program code storage media.

[0294] The above is merely a specific implementation of the present application, but the protection scope of the present application is not limited thereto, and any person skilled in the art can easily think of changes or replacements within the technical scope disclosed in the present application, which should be covered in the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

Claims

1. A communication method characterized by comprising: The method comprises: determining a first polynomial exponential sequence, a degree of the first polynomial exponential sequence being greater than or equal to 2, at least one of a quadratic term coefficient, a linear term coefficient or a zero term coefficient of the first polynomial exponential sequence being related to an index of an element of the first polynomial exponential sequence; transmitting based on the first polynomial exponential sequence.

2. The method of claim 1, wherein, The first polynomial exponential sequence is represented as: or where d is the degree of the first polynomial exponent sequence, n is the index of the elements of the first polynomial exponent sequence, M is the base length of the first polynomial exponent sequence, N is the length of the first polynomial exponent sequence, p i is the i-th term coefficient, i = 0,..., d.

3. The method of claim 2, wherein, A ratio of a length of the first polynomial exponential sequence and a base length of the first polynomial exponential sequence is N / M=Q, Q being an integer greater than 1.

4. The method of any one of claims 1 to 3, wherein, The determining the first polynomial exponential sequence comprises: determining a first sequence set, the first sequence set comprising K sequence groups, each sequence group comprising M g,seq polynomial exponential sequences, K being a positive integer greater than 1, M g,seq being an integer less than or equal to M, M being a base length of the polynomial exponential sequences; determining the first polynomial exponential sequence from the first sequence set.

5. The method of claim 4, wherein, Each polynomial exponential sequence in the first sequence set corresponds to one antenna port.

6. The method of claim 4 or 5, wherein, Different polynomial exponential sequences in any one sequence group of the K sequence groups are orthogonal; and Polynomial exponential sequences in any two sequence groups of the K sequence groups are non-orthogonal.

7. The method of claim 6, wherein, The different polynomial exponential sequences in any one sequence group are orthogonal, comprising: The different polynomial exponential sequences have the same quadratic term coefficient, the same zero term coefficient and different linear term coefficients.

8. The method of claim 6 or 7, wherein, The polynomial exponential sequences in any two sequence groups are non-orthogonal, comprising: A quadratic term coefficient of any one polynomial exponential sequence of a first sequence group is different from that of any one polynomial exponential sequence of a second sequence group; or A quadratic term coefficient and a zero term coefficient of any one polynomial exponential sequence of a first sequence group are different from those of any one polynomial exponential sequence of a second sequence group; The first sequence set is any one of at least two sequence sets, each sequence set of the at least two sequence sets corresponding to a number of sequence groups and a number of polynomial exponential sequences in a sequence group respectively, the at least two sequence sets corresponding to different numbers of sequence groups and / or different numbers of polynomial exponential sequences in a sequence group; 9. The method of any one of claims 4 to 8, wherein, The method further comprises: determining one sequence set from the at least two sequence sets as the first sequence set. The first polynomial exponential sequence comprises Q short sequences, each short sequence of the Q short sequences corresponding to a combination of a quadratic term coefficient, a linear term coefficient and a zero term coefficient.

10. The method of any one of claims 1 to 9, wherein, Quadratic term coefficients of short sequences of the same index of any two polynomial exponential sequences in each sequence group of the K sequence groups are the same.

11. The method of claim 10, wherein, A linear term coefficient and a zero term coefficient of any one short sequence in a polynomial exponential sequence in any one sequence group of the K sequence groups are related to a quadratic term coefficient.

12. The method of claim 11, wherein, At least one of a quadratic term coefficient or a zero term coefficient of the first polynomial exponential sequence is related to an index of an element of the first polynomial exponential sequence.

13. The method of any one of claims 1 to 10, wherein, The transmitting based on the first polynomial exponential sequence comprises: cyclically shifting the first polynomial exponential sequence based on a cyclic shift value to obtain a second polynomial exponential sequence; transmitting based on the second polynomial exponential sequence. The linear term coefficient of the first polynomial exponential sequence is related to the cyclic shift value.

14. The method of any one of claims 4 to 13, wherein, ​ 15. The method of claim 14, wherein, M g,seq polynomial exponential sequences in the kth group of the K groups of sequences, any two different of the M g,seq polynomial exponential sequences in the kth group of the K groups of sequences, any two different of the M g,seq polynomial exponential sequences in the kth group of the K groups of sequences, any two different of the M g,seq polynomial exponential sequences in the kth group of the K groups of sequences, any two different of the M 16. The method of claim 15, wherein, M=M g,seq , the M g,seq polynomial exponential sequences correspond to the M g,seq cyclic shift values one-to-one with M g,seq integers in the set {0, 1, …, M g,seq -1}, wherein the cyclic shift value A corresponding to the jth polynomial exponential sequence in the kth group is equal to j.

17. The method of any one of claims 14 to 16, wherein, The difference between the quadratic coefficient of the 0th short sequence and the quadratic coefficient of the 1st short sequence of any two polynomial exponential sequences in the first and second sequence groups of the K sequence groups is the same when modulo M, wherein the first and second sequence groups are any two sequence groups in the K sequence groups.

18. The method of any one of claims 1 to 17, wherein, The first polynomial exponent sequence is obtained based on the ZC sequence, and the root of the ZC sequence is related to the index of the element of the ZC sequence.

19. The method of claim 18, wherein, The first polynomial exponent sequence includes Q short sequences, each of the Q short sequences corresponding to a ZC sequence, and the Q short sequences corresponding to Q ZC sequences.

20. The method of claim 19, wherein, The short sequence satisfies one of the following: Each short sequence is obtained by cyclically shifting or phase rotating a ZC sequence based on a cyclic shift value; or Each short sequence is obtained by multiplying a ZC sequence by a constant phase value.

21. The method of claim 19 or 20, wherein, The first polynomial exponent sequence comes from a first sequence set, which contains K sequence groups, wherein any two short sequences with the same index within each of the K sequence groups have the same root; and / or The constant phase values ​​corresponding to the short sequences with the same index of any two polynomial exponential sequences within each of the K sequence groups are the same.

22. The method of any one of claims 10 to 21, wherein, The Q short sequences are mapped onto N subcarriers, and the N subcarriers are located within one or more symbols; Each of the Q short sequences is equally spaced and mapped onto M subcarriers within a symbol. Different short sequences are located in different comb teeth. The Q short sequences are mapped within one or more symbols, and M is the length of a short sequence.

23. A communications device, characterized by include: The processing module is used to determine a first polynomial exponent sequence, wherein the degree of the first polynomial exponent sequence is greater than or equal to 2, and at least one of the quadratic term coefficient, linear term coefficient, or zero-degree term coefficient of the first polynomial exponent sequence is related to the index of the element of the first polynomial exponent sequence. A communication module for transmission based on the first polynomial exponent sequence.

24. The communications apparatus of claim 23, wherein The first polynomial index sequence is represented as: or where d is the degree of the first polynomial exponent sequence, n is the index of the elements of the first polynomial exponent sequence, M is the base length of the first polynomial exponent sequence, N is the length of the first polynomial exponent sequence, p i is the i-th term coefficient, i = 0,..., d.

25. The communications apparatus of claim 24, wherein The ratio of the length of the first polynomial exponent sequence to the base length of the first polynomial exponent sequence is N / M = Q, where Q is an integer greater than 1.

26. The communication apparatus of any of claims 23 to 25, wherein, The processing module is used for: determining a first sequence set, the first sequence set comprising K sequence groups, each sequence group comprising M g,seq polynomial exponential sequences, K being a positive integer greater than 1, M g,seq being an integer less than or equal to M, M being a base length of the polynomial exponential sequences; The first polynomial exponent sequence is determined from the first sequence set.

27. The communications apparatus of claim 26, wherein Each polynomial exponent sequence in the first sequence set corresponds to an antenna port.

28. The communication apparatus of claims 26 or 27, wherein, The different polynomial exponent sequences within any one of the K sequence groups are orthogonal; and... The polynomial exponential sequences in any two of the K sequence groups are not orthogonal.

29. The communications apparatus of claim 28, wherein The different polynomial exponent sequences within any given sequence group are orthogonal, including: The coefficients of the quadratic terms of the different polynomial exponent sequences are the same, the coefficients of the zero-degree terms are the same, and the coefficients of the linear terms are different.

30. The communication apparatus of claims 28 or 29, wherein, The polynomial exponential sequences in any two sequence groups are not orthogonal, including: The coefficients of the quadratic terms of any polynomial exponent sequence in the first sequence group are different from those of any polynomial exponent sequence in the second sequence group; or Any two polynomial exponential sequences in the first sequence group and any two polynomial exponential sequences in the second sequence group have different quadratic coefficients and different zero-order coefficients; The first sequence group and the second sequence group are any two sequence groups in the K sequence groups.

31. The communication apparatus of any of claims 26 to 30, wherein, The first sequence set is any one of at least two sequence sets, each of the at least two sequence sets corresponds to a number of sequence groups and a number of polynomial exponential sequences in each sequence group, and the at least two sequence sets correspond to different numbers of sequence groups and / or different numbers of polynomial exponential sequences in each sequence group. The processing module is configured to: Determine a sequence set from the at least two sequence sets as the first sequence set.

32. The communication apparatus of any of claims 23 to 31, wherein, The first polynomial exponential sequence includes Q short sequences, and each short sequence in the Q short sequences corresponds to a combination of a quadratic coefficient, a linear coefficient, and a zero-order coefficient.

33. The communications apparatus of claim 32, wherein The quadratic coefficients of the short sequences with the same index in any two polynomial exponential sequences in each sequence group in the K sequence groups are the same.

34. The communications apparatus of claim 33, wherein The linear coefficient and the zero-order coefficient of any short sequence in the polynomial exponential sequences in any sequence group in the K sequence groups are related to the quadratic coefficient.

35. The communication apparatus of any of claims 23 to 32, wherein, At least one of the quadratic coefficient or the zero-order coefficient of the first polynomial exponential sequence is related to the index of an element of the first polynomial exponential sequence. The processing module is configured to cyclically shift the first polynomial exponential sequence based on a cyclic shift value to obtain a second polynomial exponential sequence. The communication module is configured to perform the transmission based on the second polynomial exponential sequence.

36. The communication apparatus of any of claims 26 to 35, wherein, The linear coefficient of the first polynomial exponential sequence is related to the cyclic shift value.

37. The communications apparatus of claim 36, wherein M g,seq polynomial exponential sequences in the kth group of the K groups of sequences, any two different of the M g,seq polynomial exponential sequences in the kth group of the K groups of sequences, any two different of the M g,seq cyclic shift values corresponding to the M g,seq cyclic shift values corresponding to the M 38. The communications apparatus of claim 37, wherein M=M g,seq , the M g,seq polynomial exponential sequences correspond to the M g,seq cyclic shift values one-to-one with the M g,seq integers in the set {0, 1, …, M g,seq -1}, wherein the cyclic shift value A corresponding to the jth polynomial exponential sequence in the kth group is equal to j.

39. The communication apparatus of any of claims 36 to 38, wherein, The difference between the quadratic coefficient of the 0th short sequence and the quadratic coefficient of the 1st short sequence of any two polynomial exponential sequences in the first sequence group and the second sequence group in the K sequence groups is the same as the result of the modulo M operation, where the first sequence group and the second sequence group are any two sequence groups in the K sequence groups.

40. The communication apparatus of any of claims 1 to 39, wherein, The first polynomial exponential sequence is obtained based on a ZC sequence, and the root of the ZC sequence is related to the index of an element of the ZC sequence.

41. The communications apparatus of claim 40, wherein The first polynomial exponential sequence includes Q short sequences, and each short sequence in the Q short sequences corresponds to a ZC sequence, and the Q short sequences correspond to Q ZC sequences.

42. The communications apparatus of claim 41, wherein The short sequences satisfy one of the following conditions: Each short sequence is a sequence obtained by cyclically shifting or phase rotating a ZC sequence based on a cyclic shift value; or Each short sequence is a sequence obtained by multiplying a ZC sequence by a constant phase value.

43. The communication apparatus of claims 41 or 42, wherein, The first polynomial exponential sequence is from a first sequence set, the first sequence set includes K sequence groups, and the short sequences with the same index in any two polynomial exponential sequences in each sequence group in the K sequence groups correspond to the same root; and / or The short sequences with the same index in any two polynomial exponential sequences in each sequence group in the K sequence groups correspond to the same constant phase value.

44. The communication apparatus of any of claims 32 to 43, wherein, The Q short sequences are mapped on N subcarriers, and the N subcarriers are located in one or more symbols. Each of the Q short sequences is mapped on M subcarriers within a symbol at equal intervals, different short sequences are located in different combs, the Q short sequences are mapped within a symbol or multiple symbols, and the M is a length of a short sequence.

45. A communications device, characterized by The apparatus comprises a module or unit for performing the method of any one of claims 1 to 22.

46. A communications device, characterized by The apparatus comprises at least one processor configured to execute computer programs or instructions stored in a memory to cause the method of any one of claims 1 to 22 to be performed.

47. A chip, comprising: The apparatus comprises a circuit and a communication interface, the communication interface is configured to receive information and / or data to be processed and send the information and / or data to be processed to the circuit, and the circuit is configured to process the received information and / or data to cause the method of any one of claims 1 to 22 to be performed.

48. A computer-readable storage medium, characterized in that, The computer readable storage medium stores computer programs or instructions, which, when executed on a communication device, cause the communication device to perform the method of any one of claims 1 to 22.

49. A computer program product, characterised in that, The computer program product comprises computer programs or instructions for performing the method of any one of claims 1 to 22. The computer program product comprises computer programs or instructions for performing the method of any one of claims 1 to 22.

Images