Communication method and communication device

Abstract

A communication method comprises: determining K code words (S310), generating a first symbol according to the K code words and K cluster modulation data (S320), and transmitting the first symbol (S330). Wherein the K code words are in one-to-one correspondence with the K codebooks, the positions of non-zero coefficients contained in the K code words are related, the K code words are in one-to-one correspondence with the K cluster modulation data, and K is an integer greater than 1. According to the method, the peak-to-average ratio of the first symbol can be reduced, the transmission interference between users is reduced, and the demodulation performance is further improved.

Description

Communication method and communication device

[0001] This application claims priority to Russian patent application No. 2023119505 filed with the Russian State Intellectual Property Office on July 25, 2023, and priority to Russian patent application entitled “Communication method and communication device”, the entire contents of which are incorporated herein by reference. Technical Field

[0002] The embodiments of the present application relate to the field of communications, and more specifically, to a communication method and a communication device. Background Art

[0003] In a grant-free system, multiple terminal devices select a portion of a shared time-frequency resource to transmit data. The time-frequency resources selected by different terminals may fully or partially overlap, causing interference during data transmission and, in turn, impacting the base station's performance in demodulating data. This is particularly true in large-scale access scenarios, where there are a large number of access devices (terminal devices). The probability of overlapping time-frequency resources selected by different terminal devices is higher, leading to increased transmission interference between terminal devices.

[0004] For example, the long term evolution (LTE) system supports single-carrier frequency-division multiple access (SC-FDMA) symbol generation for dual-cluster data, which has a slightly higher peak-to-average power ratio (PAPR) than traditional SC-FDMA symbols and may affect system demodulation performance.

[0005] Summary of the Invention

[0006] Embodiments of the present application provide a communication method and a communication device, which generate a first symbol with a low PAPR to reduce transmission interference between users while improving demodulation performance.

[0007] In a first aspect, a communication method is provided. The method may be executed by a transmitting device, or may be executed by a chip or circuit used in the transmitting device, which is not limited in this application. For ease of description, the following description is based on an example of execution by a transmitting device.

[0008] The method includes: determining K codewords, where positions of non-zero coefficients contained in the K codewords are related, and K is an integer greater than 1; generating a first symbol based on the K codewords and K clusters of modulated data, where the K codewords and the K clusters of modulated data have a one-to-one correspondence; and sending the first symbol.

[0009] It should be understood that the embodiments of the present application can be applied to any communication scenario in which a transmitting device and a receiving device communicate. In other words, the embodiments of the present application can be applied to uplink, downlink, relay link, or sidelink communication scenarios. For example, uplink communication is communication between a terminal device and a network device; downlink communication is communication between a network device and a terminal device; and sidelink communication is communication between terminal devices. Therefore, the transmitting device can be a network device or a terminal device, and the receiving device can also be a network device or a terminal device, and this application does not limit this.

[0010] Exemplarily, the first symbol may be an SC-FDMA symbol.

[0011] Exemplarily, the one-to-one correspondence between the K codewords and the K clusters of modulated data can be understood as follows: each cluster of modulated data corresponds to a codeword, and the codewords corresponding to each cluster of modulated data are different. In other words, each cluster of modulated data in the K clusters of modulated data is mapped to a resource corresponding to any one of the K codewords, and the codewords mapped to each cluster of modulated data are different.

[0012] Exemplarily, the positions of the non-zero coefficients contained in the K codewords are related, which can be described as: the non-zero coefficients contained in the K codewords are complementary. In an embodiment of the present application, the positions of the non-zero coefficients contained in the K codewords are related, including: the positions of all the non-zero coefficients contained in the K codewords are related, or the positions of some of the non-zero coefficients contained in the K codewords are related. Similarly, the non-zero coefficients contained in the K codewords are complementary, including: all the non-zero coefficients contained in the K codewords are complementary, or some of the non-zero coefficients contained in the K codewords are complementary. In other words, the time-frequency resources corresponding to the positions of the non-zero coefficients contained in the K codewords are completely different or partially different.

[0013] According to the solution provided in the present application, a first symbol with a low PAPR is generated based on K codewords and K clusters of modulated data. The positions of the non-zero coefficients contained in the K codewords are correlated, so that the K codewords corresponding to the K clusters of modulated data of different transmitting devices can be different, thereby reducing the possibility of conflict when multiple transmitting devices transmit signals at the same time, while improving the demodulation performance of the receiving device.

[0014] In combination with the first aspect, in certain implementations of the first aspect, the K codewords correspond one-to-one to the K codebooks, each of the K codebooks contains N codewords, each of the N codewords contains the same number of elements, and N is an integer greater than 1.

[0015] That is, the K clusters of modulated data correspond one-to-one to the K codebooks.

[0016] Exemplarily, the K codewords correspond to the K codebooks in a one-to-one manner, which can be understood as: each codeword corresponds to a codebook, and the codebooks corresponding to each codeword are different from each other.

[0017] Considering the one-to-one correspondence between the K codewords and the K codebooks, and the one-to-one correspondence between the K codewords and the K clusters of modulated data, we can see that the one-to-one correspondence between the K clusters of modulated data and the K codebooks means that each cluster of modulated data corresponds to a codebook, and the codebooks corresponding to each cluster of modulated data are different. In other words, there is a one-to-one correspondence between the K codebooks, the K codewords, and the K clusters of modulated data.

[0018] Optionally, the K codebooks may be predefined, configured, preconfigured, or indicated by signaling. For example, if the transmitting device is configured with K codebooks upon leaving the factory, no signaling is required. For another example, the base station may send configuration information to the transmitting device to indicate the K codebooks, where the configuration information includes the number of K codebooks, the length of each codeword, and the values ​​of the elements contained in each codebook.

[0019] In combination with the first aspect, in certain implementations of the first aspect, determining the K codewords includes: determining the K codewords from K codebooks.

[0020] In conjunction with the first aspect, in certain implementations of the first aspect, determining K codewords from K codebooks includes: determining a first codeword index, where the first codeword index is a codeword index among N codeword indexes, where the N codeword indexes correspond one-to-one to the N codewords included in each codebook; and determining the K codewords from the K codebooks based on the first codeword index.

[0021] Exemplarily, the first codeword index may be predefined, configured, preconfigured, or indicated by signaling. For example, when codebook hopping or codeword hopping is not enabled, the K codebooks or first codeword indices determined by the transmitting device remain unchanged. When codebook hopping or codeword hopping is enabled, the K codebooks or first codeword indices determined by the transmitting device are the initially configured codebooks or codeword indices, and the next codebook hopping or codeword hopping (next symbol / time slot) will recalculate a new codebook or codeword index.

[0022] Exemplarily, the transmitting device may determine the first codeword index based on a pseudo-random sequence, where the initialization of the pseudo-random sequence is determined based on an identification of the transmitting device. Optionally, the pseudo-random sequence may be a Gold sequence or an m-sequence.

[0023] Based on this implementation, the sending device determines the first codeword index and can determine a corresponding codeword from each of the K codebooks based on the first codeword index, thereby obtaining K codewords.

[0024] In combination with the first aspect, in certain implementations of the first aspect, the i-th codebook S in the K codebooks i satisfy:

[0025] in, represents the jth codeword in the i-th codebook, L represents the number of elements contained in the jth codeword, At least one of the L elements contained has a value of 0, represents the mth element in the jth codeword, m=0,…,L-1, i and j are integers, i=0,…,K-1, j=0,…,N-1,

[0026] Exemplarily, the value of an element of each codeword in each codebook is 0 or 1, or the value of an element of each codeword in each codebook is 0, 1, or -1.

[0027] In conjunction with the first aspect, in certain implementations of the first aspect, the positions of the non-zero coefficients included in the K codewords are related, including: when L nonzero ≤L, L nonzero The positions of any two non-zero coefficients are different; or, when L nonzero >L, L nonzero The non-zero coefficients include L non-zero coefficients, and the positions of any two non-zero coefficients in the L non-zero coefficients are different. nonzero represents the sum of the number of elements of non-zero coefficients contained in K codewords determined from K codebooks based on a first codeword index, where the first codeword index is one of N codeword indexes, and the N codeword indexes correspond one-to-one to the N codewords contained in each codebook. L represents the number of elements contained in any codeword among the K codewords.

[0028] Optionally, the number of all non-zero coefficients L nonzero It can be related to the codeword index j corresponding to the jth codeword in the codebook. At this time, the number of all non-zero coefficients of the K codewords determined from the K codebooks based on the codeword index j can be expressed as

[0029] In conjunction with the first aspect, in some implementations of the first aspect, when When The positions of any two non-zero coefficients are different; or, when When The non-zero coefficients include L non-zero coefficients, and positions of any two non-zero coefficients among the L non-zero coefficients are different (ie, positions in the L elements of the codeword).

[0030] Based on this implementation, when When , since the K codebooks are complementary, the K cluster modulated data is expanded based on the K codebooks to determine the K cluster first data, and the SC-FDMA symbols are generated based on the K cluster first data. The SC-FDMA symbols corresponding to the first data of different clusters are complementary and superimposed, that is, the energy of the SC-FDMA symbols corresponding to the first data of a certain cluster is large, and the energy of the SC-FDMA symbols corresponding to the first data of other clusters at the same position is small, so that the PAPR of the superimposed SC-FDMA symbols is low, thereby improving the energy of the data sent by the sending device and improving the demodulation performance. At the same time, the K codewords corresponding to the K cluster modulated data of different sending devices can be different, thereby improving the demodulation performance while reducing the transmission interference between users. When When K codebooks are not complementary, but L nonzero The number of non-zero coefficients has some non-zero elements in different positions, which can be understood as partial complementarity. In this case, the partially complementary K codebooks have more flexibility and can design more codewords to support scenarios where more sending devices transmit data simultaneously, especially in large-scale access scenarios.

[0031] It should be understood that when L nonzero = L, based on the same codeword index, the number of all non-zero coefficients of the K codewords determined from the K codebooks is the codeword length L. In this case, the positions of any two of the L non-zero coefficients are different, so it can be understood that the positions of the L non-zero coefficients exactly traverse from 0 to L-1. At the same time, traversing all possible codeword indices satisfies that the positions of the L non-zero coefficients exactly traverse from 0 to L-1. Therefore, the positions of all non-zero coefficients of the K codewords determined from the K codebooks based on the same codeword index can be said to be complementary, and the K codebooks can also be said to be complementary codebooks.

[0032] It should be understood that for all non-zero coefficients L contained in K codewords nonzero , where any non-zero coefficient corresponds to one of the K codewords, and a codeword contains one or more non-zero coefficients. In other words, the position of any non-zero coefficient among all the non-zero coefficients contained in the K codewords corresponds to its position in the corresponding codeword.

[0033] In combination with the first aspect, in certain implementations of the first aspect, the first symbol is obtained by merging K first sub-symbols, and the K first sub-symbols are generated based on K clusters of first data.

[0034] In combination with the first aspect, in some implementations of the first aspect, the length of the kth cluster of modulation data in the K clusters of modulation data is related to the number of non-zero coefficients contained in the codeword corresponding to the kth cluster of modulation data, k=0,…,K-1.

[0035] Optionally, the length or size of the kth cluster of modulation data in the K clusters of modulation data is related to the kth codeword used by the kth cluster of modulation data, for example, related to the number of non-zero coefficients included in the used kth codeword.

[0036] Based on this implementation, since each cluster of modulated data corresponds to a codeword, the size or length of each cluster of modulated data is adapted to the number of non-zero coefficients contained in the corresponding codeword, which facilitates the data transmission performance of the sending device.

[0037] In combination with the first aspect, in certain implementations of the first aspect, the K clusters of modulated data are obtained by segmenting the first modulated data, and the first modulated data are bit data obtained based on a modulation method.

[0038] Exemplarily, the modulation mode includes any one of the following: binary phase-shift keying (BPSK) modulation, Pi / 2-BPSK modulation, or quadrature phase shift keying (QPSK) modulation, which is not limited in this application.

[0039] In combination with the first aspect, in certain implementations of the first aspect, generating a first symbol based on K codewords and K clusters of modulated data includes: expanding the K clusters of modulated data based on the K codewords to obtain K clusters of first data; and generating a first symbol based on the K clusters of first data.

[0040] In combination with the first aspect, in some implementations of the first aspect, K clusters of modulated data are expanded based on K codewords to obtain K clusters of first data, including: cw,1 codewords, expand the kth cluster modulated data to obtain the kth cluster first data, j cw,1 is the first codeword index, which is one of the N codeword indices. The N codeword indices correspond one-to-one to the N codewords contained in each codebook, k=0,…,K-1, j cw,1 ∈{0,…,N-1}, N is the number of codewords contained in each of the K codebooks.

[0041] It should be noted that the K codewords are determined based on the same codeword index, for example, the first codeword index.

[0042] In combination with the first aspect, in certain implementations of the first aspect, the k'th cluster of modulated data in the K clusters of modulated data corresponds to the k"th codebook in the K codebooks. The codebook index of the k"th codebook is determined based on an identifier of the transmitting device, k'=0,...,K-1, k"=0,...,K-1.

[0043] Based on this implementation method, the sending device can perform codebook hopping according to the identification of the sending device. When multiple sending devices send data within the same time-frequency resource segment, since the codebook hopping styles selected by different sending devices are different, the interference between the sent data of different sending devices can be randomized, thereby improving the demodulation performance of the receiving device.

[0044] In combination with the first aspect, in some implementations of the first aspect, the k'th cluster of modulation data in the K clusters of modulation data corresponds to the j'th cluster of modulation data in the k"th codebook in the K codebooks. cw,1 Code words, j cw,1 is the first codeword index, which is one of the N codeword indices, and the N codeword indices correspond one-to-one to the N codewords contained in each codebook. The first codeword index is determined based on the identifier of the transmitting device, k′=0,…,K-1, k″=0,…,K-1, j cw,1 ∈{0,…,N-1}.

[0045] Based on the above scheme, the sending device can perform codeword hopping according to the identification of the sending device. When multiple sending devices send data within the same time-frequency resource segment, since the codeword hopping styles selected by different sending devices are different, the interference between the sent data of different sending devices can be randomized, thereby improving the demodulation performance of the receiving device.

[0046] In conjunction with the first aspect, in certain implementations of the first aspect, K codebook indices corresponding one-to-one to the K clusters of modulated data are determined based on a pseudo-random sequence, and the K codebook indices correspond one-to-one to the K codebooks. The pseudo-random sequence is initialized based on an identifier of the transmitting device.

[0047] Optionally, the pseudo-random sequence may be a Gold sequence or an m-sequence.

[0048] It should be understood that the identifier of the transmitting device can be used to indicate, identify, or correspond to the identifier of the corresponding terminal device. For example, the identifier of the transmitting device can be an index or number used to uniquely identify the terminal device. This identifier can be configured by signaling, preconfigured, or predefined.

[0049] It should also be understood that the identifier of the transmitting device can also be an identifier used to indicate, identify, or correspond to the corresponding terminal device during transmission. This identifier can be signaling configured, preconfigured, or predefined. In combination with the first aspect, in certain implementations of the first aspect, the first codeword index corresponding to the K cluster modulated data is determined based on a pseudo-random sequence, the first codeword index is one of the N codeword indexes, and the N codeword indexes correspond one-to-one to the N codewords contained in each codebook; wherein, the initialization of the pseudo-random sequence is determined based on the identifier of the transmitting device.

[0050] In combination with the first aspect, in certain implementations of the first aspect, the K cluster modulation data corresponds one-to-one to the K cluster frequency positions, and the K cluster frequency positions are determined based on a bitmap, or the K cluster frequency positions are determined based on a combination number system.

[0051] Optionally, the frequency positions of the K clusters are predefined, or indicated by higher layer signaling, or indicated by downlink control signaling.

[0052] Exemplarily, the transmitting device indicates the location of the frequency resource mapped with K clusters of frequency data in a bit-map manner, where the K clusters of frequency data are obtained by performing Fourier transform on each cluster of first data of K clusters of first data.

[0053] In conjunction with the first aspect, in certain implementations of the first aspect, each frequency position in the K clusters of frequency positions includes a starting frequency position and a cutoff frequency position, and the K clusters of frequency positions are determined based on a combination number system, including: determining a signaling indication value I idx According to the signaling indication value I idx and the first relationship, determine the K cluster frequency position; wherein the first relationship represents the signaling indication value I idx The first relationship between the start frequency position and the cutoff frequency position of each cluster frequency position satisfies:

[0054] The frequency position of the kth cluster corresponds to the kth cluster modulation data in the K cluster modulation data, S 2k Indicates the starting frequency position of the kth cluster frequency position, S 2k+1 -1 represents the cutoff frequency position of the kth cluster frequency position, s 2K-1 >s 2K-2 >…>s1>s0, k=0,…,K-1.

[0055] Optionally, the sending device determines the signaling indication value I idx , it can be that the sending device receives the signaling indication value from the base station.

[0056] In a second aspect, a communication method is provided, which can be executed by a receiving device, or by a chip or circuit for the receiving device, which is not limited in this application. For ease of description, the following description is based on an example of execution by a receiving device.

[0057] The method includes: determining K codewords, the K codewords corresponding one-to-one to K codebooks, the positions of non-zero coefficients contained in the K codewords being related, and K being an integer greater than 1; receiving a first symbol; and determining K clusters of modulated data based on the first symbol and the K codewords, the K clusters of modulated data corresponding one-to-one to the K codewords.

[0058] According to the solution provided in the present application, K clusters of modulated data are determined based on K codewords and a first symbol with a low PAPR, wherein the positions of the non-zero coefficients contained in the K codewords are correlated, thereby reducing the possibility of conflict when the transmitting device transmits a signal, while improving the demodulation performance of the receiving device.

[0059] Optionally, the K codebooks can be predefined, configured, preconfigured, or indicated by signaling. For example, if the transmitting device is configured with K codebooks at the factory, no signaling is required. The K codebooks correspond one-to-one to the K clusters of modulated data. Each of the K codebooks contains N codewords, and the N codewords contain the same number of elements, where N is an integer greater than 1. For another example, the receiving device sends configuration information to the transmitting device to indicate the K codebooks, where the configuration information includes the number of K codebooks, the length of each codeword, and the values ​​of the elements contained in each codebook.

[0060] In conjunction with the second aspect, in certain implementations of the second aspect, a first codeword index is sent, where the first codeword index is one of N codeword indexes, the N codeword indexes correspond one-to-one to the N codewords contained in each of the K codebooks, and the first codeword index is used to determine K codewords from the K codebooks.

[0061] In combination with the second aspect, in certain implementations of the second aspect, determining the K codewords includes: determining the K codewords from K codebooks.

[0062] In conjunction with the second aspect, in certain implementations of the second aspect, determining K codewords from the K codebooks includes: determining a first codeword index, where the first codeword index is a codeword index from N codeword indexes, and the N codeword indexes correspond one-to-one to the N codewords included in each codebook; and determining the K codewords from the K codebooks based on the first codeword index.

[0063] In combination with the second aspect, in certain implementations of the second aspect, K clusters of modulated data are determined based on the first symbol and K code words, including: performing Fourier transform, resource demapping, and inverse Fourier transform on the first symbol in sequence to obtain K clusters of first data; and de-expanding the K clusters of first data based on the K code words to obtain K clusters of modulated data.

[0064] Furthermore, the receiving device combines the K clusters of modulated data to obtain first modulated data.

[0065] In conjunction with the second aspect, in certain implementations of the second aspect, the positions of the non-zero coefficients included in the K codewords are related, including: when L nonzero ≤L, L nonzero The positions of any two non-zero coefficients are different; or, when L nonzero >L, L nonzeroThe non-zero coefficients include L non-zero coefficients, and the positions of any two non-zero coefficients in the L non-zero coefficients are different. nonzero represents the sum of the number of non-zero coefficient elements contained in K codewords determined from the K codebooks based on the first codeword index, where the first codeword index is one of the N codeword indexes, and the N codeword indexes correspond one-to-one to the N codewords contained in each codebook. L represents the number of elements contained in any codeword among the K codewords.

[0066] In combination with the second aspect, in some implementations of the second aspect, the length of the kth cluster of modulation data in the K clusters of modulation data is related to the number of non-zero coefficients contained in the codeword corresponding to the kth cluster of modulation data, k=0,…,K-1.

[0067] In conjunction with the second aspect, in certain implementations of the second aspect, K codebook indices corresponding one-to-one to the K clusters of modulated data are determined based on a pseudo-random sequence, and the K codebook indices correspond one-to-one to the K codebooks. The pseudo-random sequence is initialized based on an identifier of the transmitting device.

[0068] In conjunction with the second aspect, in certain implementations of the second aspect, a first codeword index corresponding to K clusters of modulated data is determined based on a pseudorandom sequence, where the first codeword index is one of N codeword indexes, and the N codeword indexes correspond one-to-one to the N codewords contained in each of the K codebooks. The pseudorandom sequence is initialized based on an identifier of the transmitting device.

[0069] In combination with the second aspect, in certain implementations of the second aspect, the K cluster modulation data corresponds one-to-one to the K cluster frequency positions, the K cluster frequency positions are determined based on a bitmap, or the K cluster frequency positions are determined based on a combination number system.

[0070] In combination with the second aspect, in certain implementations of the second aspect, the k'th cluster of modulated data in the K clusters of modulated data corresponds to the k"th codebook in the K codebooks. The codebook index of the k"th codebook is determined based on the identifier of the transmitting device, k'=0,...,K-1, k"=0,...,K-1.

[0071] In combination with the second aspect, in certain implementations of the second aspect, the k'th cluster of modulation data in the K clusters of modulation data corresponds to the j'th cluster of modulation data in the k"th codebook in the K codebooks. cw,1 Code words, j cw,1 is the first codeword index, which is one of the N codeword indices, and the N codeword indices correspond one-to-one to the N codewords contained in each codebook. The first codeword index is determined based on the identifier of the transmitting device, k′=0,…,K-1, k″=0,…,K-1, j cw,1 ∈{0,…,N-1}.

[0072] In conjunction with the second aspect, in certain implementations of the second aspect, each frequency position in the K cluster frequency positions includes a starting frequency position and a cutoff frequency position, and the K cluster frequency positions are determined based on a combination number system, including: determining a signaling indication value I idx According to the signaling indication value I idx and the first relationship, determine the K cluster frequency position; wherein the first relationship represents the signaling indication value I idx The first relationship between the start frequency position and the cutoff frequency position of each cluster frequency position satisfies:

[0073] The frequency position of the kth cluster corresponds to the kth cluster modulation data in the K cluster modulation data, S 2k Indicates the starting frequency position of the kth cluster frequency position, S 2k+1 -1 represents the cutoff frequency position of the kth cluster frequency position, s 2K-1 >s 2K-2 >…>s1>s0, k=0,…,K-1.

[0074] The beneficial effects of the above-mentioned second aspect and certain implementation methods of the second aspect can be referred to the corresponding description of the first aspect, and will not be repeated here.

[0075] In a third aspect, a communication device is provided, including: a processing unit, used to determine K codewords, the K codewords corresponding one-to-one to K codebooks, the positions of the non-zero coefficients contained in the K codewords are related, and K is an integer greater than 1; the processing unit, also used to generate a first symbol based on the K codewords and K clusters of modulated data, the K codewords corresponding one-to-one to the K clusters of modulated data; and a transceiver unit, used to send the first symbol.

[0076] In combination with the third aspect, in certain implementations of the third aspect, K clusters of modulated data correspond one-to-one to K codebooks, each of the K codebooks contains N codewords, the N codewords contain the same number of elements, and N is an integer greater than 1.

[0077] In combination with the third aspect, in certain implementations of the third aspect, the processing unit is further configured to determine K codewords from K codebooks.

[0078] In conjunction with the third aspect, in certain implementations of the third aspect, the processing unit is further configured to determine a first codeword index, where the first codeword index is one of N codeword indexes, and the N codeword indexes correspond one-to-one to the N codewords contained in each codebook; and the processing unit is further configured to determine K codewords from the K codebooks based on the first codeword index.

[0079] In conjunction with the third aspect, in certain implementations of the third aspect, the i-th codebook S in the K codebooksi satisfy:

[0080] in, represents the jth codeword in the i-th codebook, L represents the number of elements contained in the jth codeword, At least one of the L elements contained has a value of 0, represents the mth element in the jth codeword, m=0,…,L-1, i and j are integers, i=0,…,K-1, j=0,…,N-1,

[0081] In conjunction with the third aspect, in certain implementations of the third aspect, the positions of the non-zero coefficients included in the K codewords are related, including: when Lnonzero≤L, the positions of any two non-zero coefficients in the positions of the Lnonzero non-zero coefficients are different; or when L nonzero >L, L nonzero The non-zero coefficients include L non-zero coefficients, and the positions of any two non-zero coefficients in the L non-zero coefficients are different. nonzero represents the sum of the number of elements of non-zero coefficients contained in K codewords determined from K codebooks based on a first codeword index, where the first codeword index is one of N codeword indexes, and the N codeword indexes correspond one-to-one to the N codewords contained in each codebook. L represents the number of elements contained in any codeword among the K codewords.

[0082] It should be understood that for all non-zero coefficients included in the K codewords, any non-zero coefficient corresponds to one of the K codewords, and the position of any non-zero coefficient among all the non-zero coefficients included in the K codewords is the position in the corresponding codeword.

[0083] In combination with the third aspect, in certain implementations of the third aspect, the first symbol is obtained by merging K first sub-symbols, and the K first sub-symbols are generated based on K clusters of first data.

[0084] In combination with the third aspect, in certain implementations of the third aspect, the length of the kth cluster of modulation data in the K clusters of modulation data is related to the number of non-zero coefficients contained in the codeword corresponding to the kth cluster of modulation data, k=0,…,K-1.

[0085] In combination with the third aspect, in certain implementations of the third aspect, the K clusters of modulated data are obtained by dividing the first modulated data, and the first modulated data is bit data obtained based on a modulation method.

[0086] In combination with the third aspect, in certain implementations of the third aspect, the processing unit is further used to expand K clusters of modulated data based on K codewords to obtain K clusters of first data; the processing unit is further used to generate a first symbol based on the K clusters of first data.

[0087] In combination with the third aspect, in certain implementations of the third aspect, the processing unit is further configured to: cw,1 codewords, expand the kth cluster modulated data to obtain the kth cluster first data, j cw,1 is the first codeword index, which is one of the N codeword indices. The N codeword indices correspond one-to-one to the N codewords contained in each codebook, k=0,…,K-1, j=0,…,N-1, j cw,1 ∈{0,…,N-1}, N is the number of codewords contained in each of the K codebooks.

[0088] In combination with the third aspect, in certain implementations of the third aspect, the k'th cluster of modulated data in the K clusters of modulated data corresponds to the k"th codebook in the K codebooks. The codebook index of the k"th codebook is determined based on an identifier of the transmitting device, k'=0,...,K-1, k"=0,...,K-1.

[0089] In conjunction with the third aspect, in certain implementations of the third aspect, the k'th cluster of modulation data in the K clusters of modulation data corresponds to the j'th cluster of modulation data in the k"th codebook in the K codebooks. cw,1 Code words, j cw,1 is the first codeword index, which is one of the N codeword indices, and the N codeword indices correspond one-to-one to the N codewords contained in each codebook. The first codeword index is determined based on the identifier of the transmitting device, k′=0,…,K-1, k″=0,…,K-1, j cw,1 ∈{0,…,N-1}.

[0090] In conjunction with the third aspect, in certain implementations of the third aspect, the processing unit is further configured to determine, based on a pseudo-random sequence, K codebook indices corresponding one-to-one to the K clusters of modulated data, the K codebook indices corresponding one-to-one to the K codebooks. The initialization of the pseudo-random sequence is determined based on an identifier of the transmitting device.

[0091] In conjunction with the third aspect, in certain implementations of the third aspect, the processing unit is further configured to determine, based on a pseudorandom sequence, a first codeword index corresponding to the K clusters of modulated data, where the first codeword index is one of N codeword indexes, and the N codeword indexes correspond one-to-one to the N codewords included in each codebook. The pseudorandom sequence is initialized based on an identifier of the transmitting device.

[0092] In combination with the third aspect, in certain implementations of the third aspect, the K cluster modulation data corresponds one-to-one to the K cluster frequency positions, the K cluster frequency positions are determined based on a bitmap, or the K cluster frequency positions are determined based on a combination number system.

[0093] In conjunction with the third aspect, in certain implementations of the third aspect, each frequency position in the K cluster frequency positions includes a starting frequency position and a cutoff frequency position, and the K cluster frequency positions are determined based on a combination number system, including: determining a signaling indication value I idx According to the signaling indication value I idx and the first relationship, determine the K cluster frequency position; wherein the first relationship represents the signaling indication value I idx The first relationship between the start frequency position and the cutoff frequency position of each cluster frequency position satisfies:

[0094] The frequency position of the kth cluster corresponds to the kth cluster modulation data in the K cluster modulation data, S 2k Indicates the starting frequency position of the kth cluster frequency position, S 2k+1 -1 represents the cutoff frequency position of the k-th cluster frequency position, k=0,…,K-1.

[0095] In a fourth aspect, a communication device is provided, including: a processing unit for determining K codewords, the K codewords corresponding one-to-one to K codebooks, the positions of the non-zero coefficients contained in the K codewords are related, and K is an integer greater than 1; a transceiver unit for receiving a first symbol; the processing unit is also used to determine K clusters of modulated data based on the first symbol and the K codewords, and the K clusters of modulated data corresponding one-to-one to the K codewords.

[0096] In conjunction with the fourth aspect, in certain implementations of the fourth aspect, the transceiver unit is further configured to send a first codeword index, where the first codeword index is one of N codeword indexes, the N codeword indexes corresponding one-to-one to the N codewords contained in each of the K codebooks, and the first codeword index is used to determine K codewords from the K codebooks, where N is an integer greater than 1.

[0097] In combination with the fourth aspect, in certain implementations of the fourth aspect, the processing unit is further configured to determine K codewords from K codebooks.

[0098] In conjunction with the fourth aspect, in certain implementations of the fourth aspect, the processing unit is further configured to determine a first codeword index, where the first codeword index is one of N codeword indexes, and the N codeword indexes correspond one-to-one to the N codewords contained in each codebook; and the processing unit is further configured to determine K codewords from the K codebooks based on the first codeword index.

[0099] In combination with the fourth aspect, in certain implementations of the fourth aspect, the processing unit is further used to perform Fourier transform, resource demapping, and inverse Fourier transform on the first symbol in sequence to obtain K clusters of first data; the processing unit is further used to despread the K clusters of first data based on K codewords to obtain K clusters of modulated data.

[0100] Furthermore, the processing unit is further configured to merge the K clusters of modulated data to obtain first modulated data.

[0101] In conjunction with the fourth aspect, in certain implementations of the fourth aspect, the positions of the non-zero coefficients included in the K codewords are related, including: when L nonzero ≤L, L nonzero The positions of any two non-zero coefficients are different; or, when L nonzero >L, L nonzero The non-zero coefficients include L non-zero coefficients, and the positions of any two non-zero coefficients in the L non-zero coefficients are different. nonzero represents the sum of the number of elements of non-zero coefficients contained in K codewords determined from K codebooks based on a first codeword index, where the first codeword index is one of N codeword indexes, and the N codeword indexes correspond one-to-one to the N codewords contained in each codebook. L represents the number of elements contained in any codeword among the K codewords.

[0102] In combination with the fourth aspect, in certain implementations of the fourth aspect, the length of the kth cluster of modulation data in the K clusters of modulation data is related to the number of non-zero coefficients contained in the codeword corresponding to the kth cluster of modulation data, k=0,…,K-1.

[0103] In conjunction with the fourth aspect, in certain implementations of the fourth aspect, the processing unit is further configured to determine, based on a pseudo-random sequence, K codebook indices corresponding one-to-one to the K clusters of modulated data, the K codebook indices corresponding one-to-one to the K codebooks. The initialization of the pseudo-random sequence is determined based on an identifier of the transmitting device.

[0104] In conjunction with the fourth aspect, in certain implementations of the fourth aspect, the processing unit is further configured to determine, based on a pseudorandom sequence, a first codeword index corresponding to the K clusters of modulated data, where the first codeword index is one of N codeword indexes, and the N codeword indexes correspond one-to-one to the N codewords contained in each of the K codebooks. The pseudorandom sequence is initialized based on an identifier of the transmitting device.

[0105] In combination with the fourth aspect, in certain implementations of the fourth aspect, the K cluster modulation data corresponds one-to-one to the K cluster frequency positions, the K cluster frequency positions are determined based on a bitmap, or the K cluster frequency positions are determined based on a combination number system.

[0106] In combination with the fourth aspect, in certain implementations of the fourth aspect, the k'th cluster of modulated data in the K clusters of modulated data corresponds to the k"th codebook in the K codebooks. The codebook index of the k"th codebook is determined based on the identifier of the transmitting device, k'=0,...,K-1, k"=0,...,K-1.

[0107] In conjunction with the fourth aspect, in certain implementations of the fourth aspect, the k'th cluster of modulation data in the K clusters of modulation data corresponds to the j'th cluster of modulation data in the k"th codebook in the K codebooks. cw,1 Code words, j cw,1 is the first codeword index, which is one of the N codeword indices, and the N codeword indices correspond one-to-one to the N codewords contained in each codebook. The first codeword index is determined based on the identifier of the transmitting device, k′=0,…,K-1, k″=0,…,K-1, jcw ,1 ∈{0,…,N-1}.

[0108] In conjunction with the fourth aspect, in certain implementations of the fourth aspect, each frequency position in the K cluster frequency positions includes a starting frequency position and a cutoff frequency position, and the K cluster frequency positions are determined based on a combination number system, including: determining a signaling indication value I idx According to the signaling indication value I idx and the first relationship, determine the K cluster frequency position; wherein the first relationship represents the signaling indication value I idx The first relationship between the start frequency position and the cutoff frequency position of each cluster frequency position satisfies:

[0109] The frequency position of the kth cluster corresponds to the kth cluster modulation data in the K cluster modulation data, S 2k Indicates the starting frequency position of the kth cluster frequency position, S 2k+1 -1 represents the cutoff frequency position of the kth cluster frequency position, s 2K-1 >s 2K-2 >…>s1>s0, k=0,…,K-1.

[0110] In a fifth aspect, a communication device is provided, comprising a transceiver, a processor and a memory, wherein the processor is used to control the transceiver to transmit and receive signals, the memory is used to store a computer program, and the processor is used to call and run the computer program from the memory, so that the communication device executes the method in any possible implementation of the first aspect or the second aspect mentioned above.

[0111] Optionally, there are one or more processors and one or more memories.

[0112] Optionally, the memory may be integrated with the processor, or the memory may be provided separately from the processor.

[0113] Optionally, the communication device further includes: a transmitter (emitter) and a receiver (receiver).

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

[0115] In a seventh aspect, a communication system is provided, comprising a transmitting device and a receiving device, wherein the transmitting device is configured to perform the method of any possible implementation of the first aspect, and the receiving device is configured to perform the method of any possible implementation of the second aspect. Optionally, the communication system may further include other devices used in conjunction with the transmitting device and / or the receiving device.

[0116] In an eighth aspect, a computer-readable storage medium is provided, wherein the computer-readable storage medium stores a computer program or code, and when the computer program or code is run on a computer, the computer executes the method in any possible implementation of the first aspect or the second aspect above.

[0117] In a ninth aspect, a chip is provided, comprising at least one processor coupled to a memory, the memory being configured to store a computer program, the processor being configured to retrieve and execute the computer program from the memory, so that a device equipped with the chip system performs the method of any possible implementation of the first or second aspects described above. The chip may include an input circuit or interface for sending information or data, and an output circuit or interface for receiving information or data.

[0118] In a tenth aspect, a computer program product is provided, comprising: a computer program code, which, when executed by a device, enables the device to execute a method in any possible implementation of the first or second aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0119] FIG1 is a schematic structural diagram of a communication system 100 applicable to an embodiment of the present application;

[0120] FIG2 is a schematic diagram of a time-frequency resource provided in an embodiment of the present application;

[0121] FIG3 is a flow chart of a communication method 300 provided in an embodiment of the present application;

[0122] FIG4 is a schematic diagram of a complementary codebook provided in an embodiment of the present application;

[0123] FIG5 is a schematic diagram of a partially complementary codebook provided in an embodiment of the present application;

[0124] FIG6 is a schematic diagram of another partially complementary codebook provided in an embodiment of the present application;

[0125] FIG7 is a schematic flow chart of a method 700 for generating a first symbol according to an embodiment of the present application;

[0126] FIG8 is a flow chart of a communication method 800 provided in an embodiment of the present application;

[0127] FIG9 is a schematic structural diagram of a communication device 1000 provided in an embodiment of the present application;

[0128] FIG10 is a schematic structural diagram of a communication device 2000 provided in an embodiment of the present application;

[0129] FIG11 is a schematic structural diagram of a chip system 3000 provided in an embodiment of the present application. DETAILED DESCRIPTION

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

[0131] The technical solutions provided in this application can be applied to various communication systems, such as: fifth generation (5G) or new radio (NR) systems, long term evolution (LTE) systems, LTE frequency division duplex (FDD) systems, LTE time division duplex (TDD) systems, etc. The technical solutions provided in this application can also be applied to future communication systems, such as sixth generation (6G) mobile communication systems. The technical solutions provided in this application can also be applied to device to device (D2D) communication, vehicle-to-everything (V2X) communication, machine to machine (M2M) communication, machine type communication (MTC), and Internet of Things (IoT) communication systems or other communication systems.

[0132] As an example, V2X communication may include: vehicle-to-vehicle (V2V) communication, vehicle-to-roadside infrastructure (V2I) communication, vehicle-to-pedestrian (V2P) communication, and vehicle-to-network (V2N) communication. V2V refers to communication between vehicles. V2P refers to communication between vehicles and people (including pedestrians, cyclists, drivers, or passengers, etc.). V2I refers to communication between vehicles and infrastructure, such as road side units (RSU) or network equipment. Among them, RSU includes two types: terminal-type RSU, which is in a non-mobile state because it is located on the roadside and does not need to consider mobility; base station-type RSU, which can provide timing synchronization and resource scheduling to vehicles communicating with it. V2N refers to communication between vehicles and network equipment. It can be understood that the above is an exemplary description and the embodiments of the present application are not limiting. For example, V2X can also include the current 3GPP Rel-16 and subsequent versions of V2X communications based on the NR system.

[0133] The terminal device in the embodiments of the present application may also be referred to as user equipment (UE), access terminal, user unit, user station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent or user device.

[0134] The terminal device can be a device that provides voice / data to users, for example, a handheld device or vehicle-mounted device with a wireless connection function. At present, some examples of terminals are: mobile phones, tablet computers, laptop computers, PDAs, mobile internet devices (MIDs), wearable devices, virtual reality (VR) devices, augmented reality (AR) devices, wireless terminals in industrial control, wireless terminals in self-driving, wireless terminals in remote medical surgery, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, wireless terminals in smart homes, cellular phones, cordless phones, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, personal digital assistants (PDAs), handheld devices with wireless communication capabilities, computing devices or other processing devices connected to wireless modems, wearable devices, terminal devices in 5G networks or 6G and future evolved public land mobile communication networks (PLMNs). The terminal equipment in the network (PLMN), etc., is not limited to this in the embodiments of the present application.

[0135] As an example and not a limitation, in the embodiment of the present application, the terminal device may also be a wearable device. Wearable devices may also be called wearable smart devices, which are a general term for wearable devices that are intelligently designed and developed using wearable technology for daily wear, such as glasses, gloves, watches, clothing, and shoes. A wearable device is a portable device that is worn directly on the body or integrated into the user's clothes or accessories. Wearable devices are not only hardware devices, but also achieve powerful functions through software support, data interaction, and cloud interaction. Broadly speaking, wearable smart devices include those that are fully functional, large in size, and can achieve complete or partial functions without relying on smartphones, such as smart watches or smart glasses, as well as those that only focus on a certain type of application function and need to be used in conjunction with other devices such as smartphones, such as various smart bracelets and smart jewelry for vital sign monitoring.

[0136] In the embodiments of the present application, the device for implementing the function of the terminal device, i.e., the terminal device, can be the terminal device, or a device capable of supporting the terminal device to implement the function, such as a chip system or chip, which can be installed in the terminal device. In the embodiments of the present application, the chip system can be composed of a chip, or can include a chip and other discrete devices.

[0137] The network device in the embodiments of the present application may be a device for communicating with a terminal device, and may also be referred to as an access network device or a radio access network device. For example, the network device may be a base station. The network device in the embodiments of the present application may refer to a radio access network (RAN) node (or device) that connects a terminal device to a wireless network. A base station may broadly cover various names as follows, or replace the following names, such as: NodeB, evolved NodeB (eNB), next generation NodeB (gNB), relay station, access point, transmitting and receiving point (TRP), transmitting point (TP), master station, secondary station, multi-standard radio (motor slide retainer, MSR) node, home base station, network controller, access node, wireless node, access point (AP), transmission node, transceiver node, baseband unit (BBU), remote radio unit (RRU), active antenna unit (AAU), remote radio head (RRH), central unit (CU), distributed unit (DU), positioning node, etc. A base station may be a macro base station, a micro base station, a relay node, a donor node, or the like, or a combination thereof. A base station may also refer to a communication module, modem, or chip used to be set in the aforementioned device or apparatus. A base station may also be a mobile switching center and a device that performs base station functions in D2D, V2X, and M2M communications, a network-side device in a 6G network, or a device that performs base station functions in future communication systems. A base station may support networks with the same or different access technologies. The embodiments of this application do not limit the specific technology and specific device form used by network devices.

[0138] Base stations can be fixed or mobile. For example, a helicopter or drone can be configured to act as a mobile base station, and one or more cells can move based on the location of the mobile base station. In other examples, a helicopter or drone can be configured to act as a device that communicates with another base station.

[0139] In some deployments, the network device mentioned in the embodiments of the present application may be a device including a CU, or a DU, or a device including a CU and a DU, or a control plane CU node (central unit control plane (central unit-control plane, CU-CP)) and a user plane CU node (central unit user plane (central unit-user plane, CU-UP)) and a DU node.

[0140] In the embodiments of the present application, the apparatus for implementing the function of the network device can be the network device, or it can be an apparatus capable of supporting the network device to implement the function, such as a chip system or chip, which can be installed in the network device. In the embodiments of the present application, the chip system can be composed of a chip, or it can include a chip and other discrete devices.

[0141] The network equipment and terminal devices can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; they can also be deployed in the air on aircraft, balloons, and satellites. The embodiments of this application do not limit the scenarios in which the network equipment and terminal devices are located.

[0142] It should be noted that the technical solution of the present application is mainly used in side transmission scenarios, and the frequency bands used include but are not limited to unlicensed spectrum, which includes frequency bands near 2.4 GHz and 5.8 GHz. In an embodiment of the present application, the terminal device and the access network device can use unlicensed spectrum resources for wireless communication (for example, transmitting uplink information or transmitting downlink information). The communication system can adopt licensed-assisted access (LAA), dual connectivity (DC), unlicensed assisted access (standalone) technology, etc.

[0143] The following briefly introduces a communication system applicable to an embodiment of the present application in conjunction with FIG1 , as follows.

[0144] Figure 1 is a schematic diagram of the structure of a communication system applicable to an embodiment of the present application. As shown in Figure 1, the communication system of the embodiment of the present application may include a network device (e.g., a gNB) and terminal devices (e.g., UE1-UE6). The network device may include one antenna or multiple antennas. In addition, the network device may additionally include a transmitter chain and a receiver chain. Those skilled in the art will understand that each of them may include multiple components related to signal transmission and reception (e.g., a processor, modulator, multiplexer, demodulator, demultiplexer, or antenna, etc.). Figure 1 is a simplified schematic diagram for example only. The number of terminal devices in the communication system of Figure 1 is for illustration only. The number of terminal devices in the communication system may be other numbers. In addition, the communication system may also include other communication devices, which are not shown in Figure 1. In this communication system, the terminal devices (e.g., UE1-UE6) can determine a frequency resource from a frequency resource set and send an uplink signal to the network device (e.g., a gNB) on the frequency resource. In response, the network device (e.g., gNB) receives the uplink signal. Similarly, in this communication system, the network device (e.g., gNB) can also send downlink signals to the terminal devices (e.g., UE1 to UE6) on the determined frequency resources.

[0145] It should be noted that the embodiments of the present application do not specifically limit the specific structure of the execution subject of the method provided by the embodiments of the present application. As long as it is possible to communicate according to the method provided by the embodiments of the present application by running a program that records the code of the method provided by the embodiments of the present application, for example, the execution subject of the method provided by the embodiments of the present application may be a sending device, or it may be a functional module in the sending device that can call and execute the program, or it may be a module or unit (for example, a chip, or a chip system, or a circuit) in the sending device that corresponds one-to-one to the method or operation or step or action described in the first aspect, or it may be other devices that can be used in conjunction with the sending device.

[0146] To facilitate understanding of the embodiments of the present application, a brief description of the terms or technologies involved in the present application is first given.

[0147] 1. Time domain unit and frequency domain unit

[0148] Data or information can be carried by time-frequency resources, which include time domain resources and / or frequency domain resources.

[0149] In the time domain, the time domain resources may include one or more time domain units (or, may also be referred to as time units). In an embodiment of the present application, a time unit may include several time domain resources. The time domain unit is, for example, a radio frame (RF), and the time domain resources included in the time domain unit are, for example, a subframe, a frame, a half subframe or a half frame, a slot, a sub-slot, a mini-slot, a partial slot, or an orthogonal frequency division multiplexing (OFDM) symbol, etc. Alternatively, the time domain unit may also be a collection of one or more time domain resources, for example, the time domain unit is one or more OFDM symbols in a time slot, for example, the number of the one or more is 6, 7, 12 or 14, etc. One or more time units may be continuous or discrete in time, or time units of other lengths. Optionally, in an embodiment of the present application, the time domain resources may also be referred to as sub-time domain units, or "time domain resources" and "sub-time domain units" may be the same concept and the two are interchangeable. In addition, the duration of a time slot can be related to the subcarrier spacing. For example, when the subcarrier spacing is 15 kHz, the duration of a time slot is 1 millisecond (ms); when the subcarrier spacing is 30 kHz, the duration of a time slot is 0.5 ms; and when the subcarrier spacing is 60 kHz, the duration of a time slot is 0.25 ms. Similarly, when the subcarrier spacing is 15*2μKHz, the duration of a time slot is 2-μms, where μ = 0, 1, 2, etc.

[0150] In the frequency domain, frequency domain resources may include one or more frequency domain units. Optionally, frequency domain resources may be replaced by frequency resources, indicating resources used to carry frequency data. A frequency domain unit may be a resource element (RE), a resource block (RB), a sub-channel, a resource pool, a resource set, a bandwidth, a bandwidth part (BWP), a carrier, a channel, or an interlace RB, etc. Optionally, a carrier may include one or more BWPs. Optionally, a BWP may include one or more resource pools. A BWP may include one or more RB sets, each RB set containing one or more RBs. Optionally, a resource pool may include one or more RBs or sub-channels. Optionally, a sub-channel may include one or more RBs. An RB may include one or more REs. Optionally, in the embodiment of the present application, RE and subcarrier may be equivalent, that is, one RE is one subcarrier, or one subcarrier is one RE. A subcarrier can generally carry a complex signal, such as a modulation symbol.

[0151] That is to say, data can be transmitted between network devices and terminal devices through time and frequency resources.

[0152] Figure 2 is a schematic diagram of a time-frequency resource provided by an embodiment of the present application. Taking the time domain resource as a time slot and the frequency domain resource as an RB as an example, a time slot can include 14 time domain symbols, and an RB can include 12 subcarriers. An RE can be regarded as the minimum resource unit for data transmission, or an RE is the minimum resource unit for resource mapping of data to be transmitted. As shown in Figure 2, an RE corresponds to a symbol in the time domain, such as an orthogonal frequency division multiplexing (OFDM) symbol, or a discrete Fourier transform spread orthogonal frequency division multiplexing (DFT-s-OFDM) symbol. An RE corresponds to a subcarrier in the frequency domain, and an RE can be used to map a complex symbol, such as a complex symbol obtained by modulation, or a complex symbol obtained by precoding, and the present application does not limit this. It should be understood that Figure 2 is only a schematic diagram of a possible time-frequency resource given for ease of understanding, and the present application does not limit the specific form of the time-frequency resource.

[0153] The above briefly explains the terms involved in this application, which will not be repeated in the following embodiments. In addition, the above explanation of the terms is only for the purpose of facilitating understanding and does not limit the scope of protection of the embodiments of this application.

[0154] In a grant-free system, multiple terminal devices select a portion of the shared time-frequency resources to transmit data. The time-frequency resources selected by different terminal devices may completely or partially overlap, meaning that data transmission by different terminal devices may interfere with each other, potentially impacting the performance of network equipment in demodulating data. Especially in large-scale access scenarios, as the number of access devices (terminal devices) increases, the probability of overlap in the time-frequency resources selected by the terminal devices for data transmission increases, leading to greater interference between different terminal devices when transmitting data simultaneously. For example, when data transmitted by different terminal devices partially overlaps (e.g., data in half the bandwidth is interfered with), the system's demodulation performance may be significantly impacted. In this case, the transmitted data can be divided into multiple clusters and mapped to frequency resources. Each cluster is mapped continuously, and the frequency resources mapped to different clusters do not overlap. Interference between transmitted data can be reduced by designing the locations where multiple clusters of data corresponding to different transmitting devices are mapped to frequency resources. However, the peak-to-average power ratio (PAPR) of the SC-FDMA symbols generated based on multiple clusters of data increases, potentially reducing the energy of the transmitted data and degrading demodulation performance. For example, the LTE system supports SC-FDMA symbol generation for dual-cluster data, which slightly improves the peak-to-average ratio (PAPR) compared to traditional SC-FDMA symbols.

[0155] In view of this, the present application provides a communication method and a communication device, which generate a first symbol with low PAPR based on K codewords and K cluster modulation data. The positions of the non-zero coefficients contained in the K codewords are correlated, which can reduce the possibility of conflict when the sending device transmits the signal, while improving the demodulation performance of the receiving device.

[0156] To facilitate understanding of the embodiments of the present application, the following points are explained:

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

[0158] 2) In this application, "at least one" means one or more, and "more" means two or more. "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural. In the text description of this application, the character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "At least one of the following items" or similar expressions refers to any combination of these items, including any combination of single items or plural items. For example, at least one of a, b and c can mean: a, or b, or c, or a and b, or a and c, or b and c, or a, b and c. Where a, b and c can be single or multiple, respectively.

[0159] 3) Throughout this application, the terms "first," "second," and various numerical references are used for descriptive purposes only and are not intended to limit the scope of the embodiments of this application. For example, they are used to distinguish between different messages, rather than to describe a specific order or precedence. It should be understood that such references are interchangeable, where appropriate, to allow for the description of scenarios beyond the embodiments of this application.

[0160] 4) In this application, the terms "comprise" and "have" and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product or apparatus that includes a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such process, method, product or apparatus.

[0161] 5) In this application, "used to indicate" can include being used for direct indication and being used for indirect indication. When describing that a certain indication information is used to indicate A, it can include that the indication information directly indicates A or indirectly indicates A, and it does not mean that the indication information must carry A.

[0162] 6) In this application, "protocol" may refer to a standard protocol in the field of communications, such as 5G protocol, NR protocol, and related protocols used in 6G protocol or future communication systems, which is not limited in this application. "Predefined" may include pre-definition, such as protocol definition. "Preconfiguration" can be implemented by pre-saving corresponding codes, tables or other methods that can be used to indicate relevant information in the device, and this application does not limit its specific implementation method.

[0163] 7) In this application, configuration may refer to signaling configuration, and may also be described as configuration signaling. For example, signaling configuration includes configuration by signaling sent by a base station, and these signalings may be radio resource control (RRC) messages, downlink control information (DCI), or system information blocks (SIB). For another example, signaling configuration may be pre-configured signaling sent to a transmitting device, or configured to a transmitting device in a pre-configured manner. The pre-configuration here means defining or configuring the values ​​of corresponding parameters in advance in a protocol manner, and storing them in the transmitting device when communicating with the transmitting device.

[0164] 8) In this application, "communication" may also be described as "data transmission", "information transmission", "data processing", etc. "Transmission" includes "sending" and "receiving".

[0165] 9) In this application, "*" is an operator symbol representing a product, i.e., a*b represents the multiplication of two numbers. Optionally, unless otherwise specified, a*b may be replaced by ab, or axb, or a·b, and this application does not limit this.

[0166] The communication method provided by the embodiment of the present application will be described in detail below with reference to the accompanying drawings. The embodiment provided by the present application can be applied to any communication scenario in which a transmitting device and a receiving device communicate, such as the communication system shown in FIG1 above.

[0167] It should be understood that the embodiments of the present application can be applied to any communication scenario in which a transmitting device and a receiving device communicate. In other words, the embodiments of the present application can be applied to uplink or downlink communication scenarios. For example, uplink communication is communication between a terminal device and a network device, in which case the transmitting device is the terminal device and the receiving device is the network device; downlink communication is communication between a network device and a terminal device, in which case the transmitting device is the network device and the receiving device is the terminal device. Therefore, the transmitting device can be a network device or a terminal device, and the receiving device can also be a network device or a terminal device, and this application does not limit this.

[0168] Without loss of generality, for ease of understanding and description, in the embodiments of the present application, the uplink communication scenario in the scheduling-free system is taken as an example to illustrate the present application solution. For example, the transmitting device may be a UE and the receiving device may be a base station. It should be understood that the implementation method in the downlink communication scenario can refer to the relevant description of the uplink communication scenario, and this application does not elaborate on this.

[0169] Figure 3 is a flow chart of a communication method 300 provided in an embodiment of the present application. As shown in Figure 3, this method flow can be executed by a transmitting device and a receiving device, or by modules and / or devices (e.g., chips or integrated circuits) with corresponding functions installed in the transmitting device and the receiving device, and this application is not limited thereto. The following description uses the transmitting device and the receiving device as the execution entities, and includes the following steps.

[0170] S310: The sending device determines K codewords.

[0171] In a first implementation manner, the sending device determines the K codewords from K codebooks.

[0172] The K codewords correspond one-to-one to the K codebooks, and the K codewords correspond one-to-one to the K clusters of modulated data. That is, the K clusters of modulated data also correspond one-to-one to the K codebooks. Furthermore, the positions of the non-zero coefficients contained in the K codewords are related, and K is an integer greater than 1.

[0173] Exemplarily, the K codewords correspond to the K codebooks in a one-to-one manner, which can be understood as: each codeword corresponds to a codebook, and the codebooks corresponding to each codeword are different from each other.

[0174] Exemplarily, the one-to-one correspondence between the K codewords and the K clusters of modulated data can be understood as follows: each cluster of modulated data corresponds to a codeword, and the codewords corresponding to each cluster of modulated data are different. In other words, each cluster of modulated data in the K clusters of modulated data is mapped to a resource corresponding to any one of the K codewords, and the codewords mapped to each cluster of modulated data are different.

[0175] Therefore, the K clusters of modulated data correspond one-to-one to the K codebooks. This means that each cluster of modulated data corresponds to a codebook, and each codebook corresponds to a different codebook. In other words, there is a one-to-one correspondence between the K codebooks, K codewords, and K clusters of modulated data.

[0176] In a second implementation, the transmitting device determines a first codeword index and determines the K codewords from K codebooks based on the first codeword index. The first codeword index is one of N codeword indexes, and the N codeword indexes correspond one-to-one to the N codewords included in each codebook, where N is an integer greater than 1.

[0177] In one example, the first codeword index may be predefined, configured, preconfigured, or indicated by signaling. For example, a receiving device sends indication information to a sending device, and the receiving device receives indication information from the sending device, where the indication information indicates the first codeword index. Optionally, the indication information directly or indirectly indicates the first codeword index, such as by carrying the first codeword index in the indication information.

[0178] In another example, the transmitting device determines the first codeword index by: determining the first codeword index corresponding to the K-cluster modulated data based on a pseudo-random sequence, where the pseudo-random sequence is initialized based on an identifier of the transmitting device. Optionally, the pseudo-random sequence may be a Gold sequence or an m-sequence.

[0179] It should be understood that the identifier of the sending device can be used to indicate, identify, or correspond to the identifier of the corresponding terminal device. For example, the identifier of the sending device can be an index or number used to uniquely identify the terminal device. This identifier can be signaling configured, pre-configured, or pre-defined. For example, the identifier of the sending device can be any of the following: the medium access control (MAC) address of the sending device, the subscriber identity module (SIM) card number, the international mobile equipment identity (IMEI), etc.

[0180] It should also be understood that the identifier of the sending device can also be an identifier used to indicate, identify or correspond to the corresponding terminal device during transmission. This identifier can be signaling configured, pre-configured, or predefined. For example, the Internet Protocol Address (IP) address, the radio network temporary identifier (RNTI), the source identifier of the sending device, and the destination identifier of the receiving device. Optionally, the source identifier of the sending device can be an identifier associated with a specific service or message to be sent. Optionally, the destination identifier of the receiving device can be an identifier associated with a specific service or message to be received.

[0181] In an embodiment of the present application, the positions of the non-zero coefficients contained in the K codewords are related, which can be described as: the non-zero coefficients contained in the K codewords are complementary. In an embodiment of the present application, the positions of the non-zero coefficients contained in the K codewords are related, including: the positions of all the non-zero coefficients contained in the K codewords are related, or the positions of some of the non-zero coefficients contained in the K codewords are related. Similarly, the non-zero coefficients contained in the K codewords are complementary, including: all the non-zero coefficients contained in the K codewords are complementary (which can be called fully complementary), or some of the non-zero coefficients contained in the K codewords are complementary (which can be called partially complementary). In other words, the positions of the non-zero coefficients contained in the K codewords are completely different or partially different.

[0182] Optionally, all non-zero coefficients included in the K codewords are complementary, indicating that the number of all non-zero coefficients included in the K codewords is equal to the length of the codewords, and the positions of the non-zero coefficients included in the K codewords are completely different.

[0183] Optionally, all non-zero coefficients included in the K codewords are not complementary, indicating that the number of all non-zero coefficients included in the K codewords is not equal to the length of the codewords. When the number of all non-zero coefficients included in the K codewords is greater than the length of the codewords, it can be understood that the positions of the non-zero coefficients included in the K codewords are partially different, that is, there are two non-zero coefficients with the same position.

[0184] Optionally, when the number of all non-zero coefficients included in the K codewords is less than the length of the codewords, and the positions of the non-zero coefficients included in the K codewords are completely different, it can be said that all non-zero coefficients included in the K codewords are partially complementary.

[0185] Optionally, when the number of all non-zero coefficients included in the K codewords is greater than the length of the codewords, and the positions of some non-zero coefficients included in the K codewords are completely different, it can be said that all non-zero coefficients included in the K codewords are partially complementary.

[0186] The following combines FIGS. 4 and 5 to specifically illustrate the meaning that the positions of the non-zero coefficients included in the K codewords are related for two cases of L nonzero ≤L and when L nonzero >L.

[0187] In one example, when L nonzero ≤L, any two of the positions of the L nonzero non-zero coefficients are different.

[0188] Among them, L nonzero represents the sum of the number of elements of the non-zero coefficients included in the K codewords determined by the transmitting device in step S310, and L represents the number of elements included in any one of the K codewords.

[0189] It should be understood that when L nonzero <L, based on the same codeword index, the number of all non-zero coefficients of the K codewords determined from the K codebooks is less than the length L of the codewords. At this time, any two of the L nonzero non-zero coefficients are different, so it can be understood that the positions of the L nonzero non-zero coefficients are L nonzero values from 0 to L-1. Since L nonzeroThe positions of the non-zero coefficients do not traverse 0 to L-1, that is, they do not traverse all positions of a codeword. Therefore, it can be said that the positions of all non-zero coefficients of the K codewords determined from the K codebooks based on the same codeword index are non-complementary or partially complementary.

[0190] It should be understood that when L nonzero = L, based on the same codeword index, the number of all non-zero coefficients of the K codewords determined from the K codebooks is the codeword length L. In this case, the positions of any two of the L non-zero coefficients are different, so it can be understood that the positions of the L non-zero coefficients exactly traverse from 0 to L-1. At the same time, traversing all possible codeword indices ensures that the positions of the L non-zero coefficients exactly traverse from 0 to L-1, that is, traversing all positions of a codeword. Therefore, the positions of all non-zero coefficients of the K codewords determined from the K codebooks based on the same codeword index are complementary, and the K codebooks can also be called complementary codebooks.

[0191] In another example, when L nonzero >L, L nonzero The non-zero coefficients include L non-zero coefficients, and positions of any two non-zero coefficients among the L non-zero coefficients are different.

[0192] It should be understood that when L nonzero >L, based on the same codeword index, the number of all non-zero coefficients of the K codewords determined from the K codebooks is greater than the codeword length L. At this time, the positions of any two non-zero coefficients in the L non-zero coefficients included in the L non-zero coefficients are different, so it can be understood that the positions of the L non-zero coefficients just traverse from 0 to L-1, but there are at least two non-zero coefficients with the same position. Therefore, L nonzero The positions of the non-zero coefficients are non-complementary or partially complementary.

[0193] In other words, L nonzero The non-zero coefficients include L bound non-zero coefficients, the L bound The positions of any two non-zero coefficients are different. bound ≤L nonzero , L bound Is a positive integer.

[0194] It can be understood that when there are two codeword indices and the numbers of all non-zero coefficients of K codewords determined from K codebooks based on the two codeword indices are different, it indicates that the K codebooks are not complementary codebooks.

[0195] It should be understood that for all non-zero coefficients L contained in K codewords nonzero, where any non-zero coefficient corresponds to one of the K codewords, and a codeword contains one or more non-zero coefficients. In other words, the position of any non-zero coefficient among all the non-zero coefficients contained in the K codewords corresponds to its position in the corresponding codeword.

[0196] Optionally, the number of all non-zero coefficients L nonzero Can be related to the codeword index j. At this time, the number of all non-zero coefficients of the K codewords determined from the K codebooks based on the j-th codeword index can be expressed as but:

[0197] In one example, when When The positions of any two non-zero coefficients are different.

[0198] In another example, when When The non-zero coefficients include L non-zero coefficients, and positions of any two non-zero coefficients among the L non-zero coefficients are different (ie, positions in the L elements of the codeword).

[0199] It should be noted that the above is nonzero When compared with L, it can also be described as: when L nonzero When L nonzero The positions of any two non-zero coefficients are different; or, when L nonzero ≥L, L nonzero The non-zero coefficients include L non-zero coefficients, and the positions of any two non-zero coefficients in the L non-zero coefficients are different, which is not limited in this application. Similarly, When comparing with L, you can also refer to the above L nonzero For the sake of brevity, the relevant descriptions of L are not repeated here.

[0200] Exemplarily, the length of the kth cluster of modulation data in K clusters of modulation data is related to the number of non-zero coefficients contained in the codeword corresponding to the kth cluster of modulation data, k = 0, ..., K-1. That is, the number of elements in the kth cluster of modulation data is determined based on the number of non-zero coefficients contained in the corresponding codeword, as shown in the following formula (25). This is because each cluster of modulation data corresponds to a codeword, and the size or length of each cluster of modulation data is adapted to the number of non-zero coefficients contained in the corresponding codeword.

[0201] Figure 4 is a schematic diagram of a complementary codebook provided by an embodiment of the present application. As shown in Figure 4, it includes K=3 codebooks, numbered as codebook 0, codebook 1 and codebook 2, and each codebook includes N codewords, numbered as codeword 0, codeword 1, ..., codeword N-1. The number of elements L contained in each codeword is the same, or the codeword length is the same, L=6. For example, the shaded squares in each codeword can be regarded as non-zero elements, and the white squares can be regarded as zero elements. The position of each shaded square in the L=6 squares is the position of the non-zero coefficient in the codeword. Where L nonzero The value of is 6, that is, the three codebooks are complementary codebooks. Optionally, codeword 0, codeword 1, ..., codeword N-2 and codeword N-1 can be called codeword indices of corresponding codewords. Therefore, based on any codeword index, a codeword can be determined from each of the three codebooks. The number of all non-zero coefficients of these three codewords is L. nonzero = 6, and any two of the six non-zero coefficients are in different positions. For example, the positions of the shaded portions of the three codewords in codebooks 1, 2, and 1 corresponding to codeword 0 do not overlap at all. This shows that the three codebooks are complementary.

[0202] Based on this implementation, the K codebooks are complementary, and the K cluster modulated data is expanded based on the K codebooks to determine the K cluster first data, and the SC-FDMA symbols are generated based on the K cluster first data. This can be understood as follows: first, the SC-FDMA symbols corresponding to each cluster of first data are generated based on the first data of different clusters, and then the first symbols, i.e., SC-FDMA symbols, are merged. The SC-FDMA symbols corresponding to the first data of different clusters are complementary and superimposed, i.e., where the energy of the SC-FDMA symbols corresponding to the first data of a certain cluster is large, the energy of the SC-FDMA symbols corresponding to the first data of other clusters at the same position is small, so that the PAPR of the superimposed SC-FDMA symbols is low, thereby improving the energy of the data sent by the sending device and improving the demodulation performance. At the same time, the K codewords corresponding to the K cluster modulated data of different sending devices can be different, thereby reducing the transmission interference between users and improving the demodulation performance.

[0203] FIG. 5 is a schematic diagram of a partially complementary codebook provided by an embodiment of the present application. As shown in FIG. 5, it includes K = 3 codebooks, numbered codebook 0, codebook 1, and codebook 2 respectively. Each codebook includes N codewords, numbered codeword 0, codeword 1, …, codeword N-1 respectively. The number of elements L included in each codeword is the same, or in other words, the codeword lengths are the same, and L = 6. For example, the shaded squares in each codeword can be regarded as non-zero elements, and the white squares can be regarded as zero elements. The position of each shaded square in the L = 6 squares is the position of the non-zero coefficient in the codeword. Optionally, codeword 0, codeword 1, …, codeword P, codeword P+1, …, codeword N-1 can be called the codeword indices of the corresponding codewords. Therefore, based on any codeword index, a codeword can be determined from these 3 codebooks respectively. As shown in FIG. 5, the positions of the non-zero coefficients L nonzero included in the 3 codewords corresponding to any one of the first P+1 codeword indices are related. That is, the number of non-zero coefficients included in the 3 codewords determined based on any one of the first P+1 codeword indices is 6, that is, L nonzero has a value of 6, and the positions of any two of the 6 non-zero coefficients are different. The number of non-zero coefficients included in the 3 codewords corresponding to any one of the last N-P-1 codeword indices is 5, that is, L nonzero has a value of 5, and the positions of any two of the 5 non-zero coefficients are different. It can be seen from this that these 3 codebooks are not complementary, or in other words, the 3 codebooks corresponding to any one of the codeword indices from codeword index 0 to codeword index P are complementary, and the 3 codebooks corresponding to any one of the codeword indices from codeword index P+1 to codeword N-1 are not complementary (or partially complementary).

[0204] Based on this implementation, the K codebooks are not complementary, but L nonzero (L nonzero <L) the positions of all non-zero elements among the non-zero coefficients are different (that is, the positions of any two non-zero coefficients are different). Therefore, it can be understood as partially complementary. At this time, there is still a partial complementary superposition characteristic between the SC-FDMA symbols corresponding to the first data of different clusters. Compared with the design without constraints between the K codebooks, the PAPR after superposition of the SC-FDMA symbols corresponding to the first data of different clusters can be reduced. Compared with the complementary K codebooks shown in FIG. 4, the partially complementary K codebooks have more flexibility, can design more codeword numbers, and support scenarios where more sending devices transmit data simultaneously, especially large-scale access scenarios.

[0205] Figure 6 is a schematic diagram of another partially complementary codebook provided by an embodiment of the present application. As shown in Figure 6, it includes K = 3 codebooks, numbered as codebook 0, codebook 1, and codebook 2, and each codebook includes N codewords, numbered as codeword 0, codeword 1, ..., codeword N-1, and the number of elements contained in each codeword is the same, or the codeword length is the same, L = 6. The non-zero coefficients L contained in the three codewords corresponding to any codeword index in the first P+1 codeword indices are nonzero The position of is related, that is, the number of non-zero coefficients contained in the three codewords determined based on any codeword index in the first P+1 codeword indexes is 6, that is, L nonzero The value of is 6, and the positions of any two non-zero coefficients in the 6 non-zero coefficients are different. The number of non-zero coefficients contained in the 3 codewords corresponding to any codeword index in the last NP-1 codeword indexes is 7, that is, L nonzero The value of is 7, and among the 7 non-zero coefficients, 6 are non-zero, and any two of the 6 non-zero coefficients are in different positions. Therefore, it can be seen that the three codebooks are not complementary, or in other words, the three codebooks corresponding to any codeword index from codeword index 0 to codeword index P are complementary, while the three codebooks corresponding to any codeword index from codeword index P+1 to codeword index N-1 are not complementary.

[0206] Based on this implementation, the K codebooks are not complementary, but L nonzero (L nonzero >L) non-zero coefficients include L non-zero coefficients, and the positions of the L non-zero coefficients are different (that is, the positions of any two non-zero coefficients are different), so they can be understood as partially complementary. At this time, the SC-FDMA symbols corresponding to the first data of different clusters still have a partial complementary superposition characteristic. Compared with the design without constraints between the K codebooks, the PAPR after the superposition of the SC-FDMA symbols corresponding to the first data of different clusters can be reduced. Compared with the complementary K codebooks shown in Figure 4, the partially complementary K codebooks have more flexibility, can design a larger number of codewords, and support scenarios where more sending devices transmit data simultaneously, especially large-scale access scenarios.

[0207] Optionally, the method 300 further includes: the sending device determining K codebooks.

[0208] In one implementation, the K codebooks may be predefined, or configured or preconfigured, or indicated by signaling.

[0209] Exemplarily, a receiving device (e.g., a base station) sends indication information to a transmitting device (e.g., a UE), and correspondingly, the transmitting device receives indication information from the receiving device, where the indication information is used to indicate K codebooks corresponding to K clusters of modulated data. Optionally, the indication information includes directly or indirectly indicating the first K codebooks.

[0210] Exemplarily, the receiving device sends configuration information to the sending device. Correspondingly, the receiving device receives the configuration information from the sending device. The configuration information is used to configure the K codebooks. For specific implementation, please refer to the description of method 800 shown in Figure 8 below.

[0211] For example, there may be multiple groups of K codebooks, each group of K codebooks may be referred to as a codebook set, i.e., a codebook set includes K codebooks. A receiving device (e.g., a base station) sends indication information to a sending device (e.g., a UE), where the indication information is used to indicate the K codebooks of a codebook set (i.e., a group of K codebooks) selected by the sending device.

[0212] In the embodiment of the present application, each of the K codebooks contains the same number of codewords, which is N. The codewords contained in each codebook have the same length, which is L. In other words, each codeword contains the same number of elements, that is, the codeword contains L elements. For example, assuming there are three codebooks, each codebook contains 10 codewords, and the length of each codeword (or the number of elements contained in each codeword) is the same, for example, the number of elements contained in each codeword is 5, then the positions of the non-zero coefficients in the three codewords determined by the transmitting device are related, or the non-zero coefficients in the three codewords determined by the transmitting device are complementary.

[0213] For example, the i-th codebook S among the K codebooks i satisfy:

[0214] in, represents the jth codeword in the i-th codebook, L represents the number of elements contained in the jth codeword, At least one of the L elements contained has a value of 0, Represents the mth element in the jth codeword, where m = 0, ..., L-1, i and j are integers, i = 0, ..., K-1, j = 0, ..., N-1.

[0215] Exemplarily, the value of each codeword element in each codebook is 0 or 1, or the value of each codeword element in each codebook is 0 or 1 or -1. The value of is 0 or 1, or the value is 0 or 1 or -1, which is not limited in this application. It should be understood that the codewords in each codebook in the embodiment of the present application are sparse codewords, that is, any codeword in each codebook has at least one element with a value of 0. That is, the above formula (1) At least one element in the array has a value of 0.

[0216] S320: The transmitting device generates a first symbol according to K codewords and K clusters of modulated data.

[0217] In one implementation, the transmitting device expands K clusters of modulated data based on K codewords to obtain K clusters of first data. Further, the transmitting device generates a first symbol according to the K clusters of first data.

[0218] Optionally, the sending device performs Fourier transform on each cluster of K clusters of first data to obtain K clusters of frequency data, and the sending device generates the first symbol according to the K clusters of frequency data.

[0219] Optionally, the transmitting device performs resource mapping on the K cluster frequency data and then performs inverse Fourier transform to generate a first symbol.

[0220] It can be understood that the K clusters of modulation data correspond to the K clusters of first data in a one-to-one manner, and the K clusters of modulation data correspond to the K clusters of frequency data in a one-to-one manner.

[0221] Wherein, K clusters of modulated data are expanded based on K code words to obtain K clusters of first data, including: based on the jth kth codebook cw,1 codewords, expand the kth cluster modulated data to obtain the kth cluster first data, j cw,1 is the first codeword index, which is one of the N codeword indices. The N codeword indices correspond one-to-one to the N codewords contained in each codebook, k=0,…,K-1, j cw,1 ∈{0,…,N-1}, N is the number of codewords contained in each of the K codebooks.

[0222] It should be noted that the K codewords here refer to codewords determined by the transmitting device from each of the K codebooks based on the same codeword index (eg, the first codeword index).

[0223] Optionally, the first symbol is an SC-FDMA symbol. It should be understood that an SC-FDMA symbol can be viewed as a linear combination of symbols generated at the same time based on different modulated data. For example, the first symbol is obtained by combining K first sub-symbols, which are generated based on K clusters of first data.

[0224] In the embodiment of the present application, K cluster modulation data can be understood as: the first modulation data is divided into K cluster modulation data. Similarly, K cluster first data can be understood as: the first data is divided into K cluster first data. Below, K cluster modulation data is taken as an example for explanation. When the first modulation data contains K>1 cluster modulation data, the frequency data corresponding to each cluster modulation data is continuously mapped, that is, the frequency position of the frequency data mapping corresponding to each cluster modulation data is continuous, and the frequency positions of different cluster frequency data mappings corresponding to different cluster modulation data do not overlap, then K cluster modulation data can correspond to K cluster frequency resources. Similarly, the frequency position can contain K cluster frequency positions, which can be understood as dividing the frequency position into K cluster frequency positions, and the K cluster frequency positions and K cluster frequency resources correspond one to one. For example, when a frequency position contains K>1 cluster frequency positions, the frequency resources determined based on each cluster frequency position are continuous, and the frequency resources of different clusters do not overlap.

[0225] It should be understood that the K cluster frequency positions correspond to the K cluster modulation data in a one-to-one manner, that is, the k-th cluster frequency position corresponds to the k-th cluster modulation data (k=0, ..., K-1), or in other words, the frequency data corresponding to the k-th cluster modulation data (i.e., the k-th cluster frequency data) is mapped to the k-th cluster frequency resource corresponding to the k-th cluster frequency position. The k-th cluster frequency position may include the starting position of the k-th cluster frequency data (i.e., the starting position of the frequency resource mapped by the k-th cluster frequency data), or the ending position of the k-th cluster frequency position (i.e., the ending position of the frequency resource mapped by the k-th cluster frequency data), or the position of the frequency resource mapped by each element of the k-th cluster frequency data.

[0226] Optionally, K clusters of modulation data may be replaced by K modulation data blocks, or K groups of modulation data, etc., which is not limited in this application.

[0227] Optionally, the number K of clusters may be predefined or configured by higher layer signaling (eg, RRC).

[0228] Optionally, the number of clusters K can be any one of 2, 3, 4, or 5.

[0229] Exemplarily, the K-cluster modulated data is obtained by segmenting the first modulated data, where the first modulated data is bit data obtained based on a modulation scheme, wherein the modulation scheme includes any one of the following: BPSK modulation, Pi / 2-BPSK modulation, or QPSK modulation, which is not limited in this application.

[0230] Exemplarily, the K clusters of modulated data correspond one-to-one to the K clusters of frequency positions, and the K clusters of frequency positions are determined based on a bitmap, or the K clusters of frequency positions are determined based on a combinatorial number system. The one-to-one correspondence between the K clusters of modulated data and the K clusters of frequency positions can be understood as K clusters of first data being obtained by expanding the K clusters of modulated data based on K codewords, and each cluster of first data of the K clusters of first data being Fourier transformed to obtain K clusters of frequency data. The K clusters of frequency data are mapped one-to-one to the K clusters of frequency positions, and then inverse Fourier transformed to obtain SC-FDMA symbols.

[0231] Optionally, the K cluster frequency positions are predefined, or indicated by higher layer signaling, or indicated by DCI.

[0232] The following describes in detail how to determine the frequency positions of the K clusters based on a bit-map or a combination number system.

[0233] In a first implementation manner, the sending device indicates the location of the frequency resource mapped with K clusters of frequency data in a bit-map manner, where the K clusters of frequency data are obtained by Fourier transforming each cluster of first data of the K clusters of first data.

[0234] Specifically, the transmitting device divides the allocatable frequency resources into at least one frequency unit based on the frequency unit, and then indicates the position of the frequency unit mapped by the K cluster frequency data based on a bit-map method, thereby determining the position of the subcarrier mapped by the K cluster frequency data.

[0235] The bandwidth corresponding to the allocatable frequency resources may be the system bandwidth or the bandwidth of the BWP. The transmitting device may select some or all of the allocatable frequency resources for data transmission. The position of the subcarrier to which the K-cluster frequency data is mapped may be the position of the subcarrier to which the K-cluster frequency data is mapped in the allocatable frequency resources.

[0236] For example, when the granularity is expressed as resource block (RB), the allocable frequency resources may include RBs; the number of subcarriers contained in a resource block is Therefore, the allocable frequency resources can include subcarriers. The transmitting device can allocate the frequency resources The subcarrier index (or number) is defined as 0 to The position of the subcarrier mapped by the K-cluster frequency data may be the position of the subcarrier mapped by the K-cluster frequency data in the allocable frequency resources. The index of the subcarriers.

[0237] Among them, the frequency unit can contain RBs, that is subcarriers. It can be predefined or indicated by higher layer signaling. For example, The value can be 2, 3 or 4.

[0238] Exemplary, including The allocable frequency resources of subcarriers can be divided into N unit The location of the frequency unit of the K-cluster frequency data mapping is indicated based on the bit-map method, that is, N unit bits are respectively unit The positions of the frequency units correspond one to one, when N unit The i-th bit (i=0,…,N unit -1) bit value is 1, indicating N unit The ith frequency resource of the frequency unit is used to map frequency data. unit bits 0 to N unit -1 bit indicates the order from low bit to high bit.

[0239] Optionally, the number of elements N1 in each cluster of frequency data satisfies: Is a positive integer.

[0240] Optionally, the mapping position of the 0th cluster frequency data to the K-1th cluster frequency data is in the Nth bit-map. unit The bits are arranged from low to high. For example, if the allocable frequency resource is 12 RB, the frequency unit contains 1 RB, 1 RB contains 12 subcarriers, and the bit-map has 12 bits. The number of elements in each cluster of frequency data is 12, that is, 1 RB, and the number of clusters is K = 4. The 12 bits of the bit-map indicate the value 001100100100 from low to high bits (that is, bits 0 to 11), then the frequency data of clusters 0 to 3 are mapped to the 2nd, 3rd, 6th, and 9th frequency units respectively.

[0241] For example, the allocable frequency resources are 24RB, the frequency unit contains 1RB, 1RB contains 12 subcarriers, and the number of bits in the bit-map is 24 bits. The number of elements in each cluster of frequency data is 24, that is, 2RB, and the number of clusters K=4, so it can be known that each cluster of frequency data is mapped to 2 consecutive frequency units. The value indicated by the 24 bits of the bit-map from the low bit to the high bit (that is, the 0th bit to the 23rd bit) is 001100110011000001100000. Then the 0th cluster of frequency data is mapped to the 2nd and 3rd frequency units, the 1st cluster of frequency data is mapped to the 6th and 7th frequency units, the 2nd cluster of frequency data is mapped to the 10th and 11th frequency units, and the 3rd cluster of frequency data is mapped to the 17th and 18th frequency units.

[0242] Optionally, the mapping position of the 0th cluster frequency data to the K-1th cluster frequency data is in the Nth bit-map. unit The bits are arranged from high bit to low bit.

[0243] Optionally, each cluster of data corresponds to a different bit-map N unit bits. For example, the sending device can use N unit bits indicate the position of the frequency unit mapped by the kth cluster of frequency data, and then use KN unit bits may indicate the position of the frequency unit mapped by the K cluster frequency data.

[0244] Optional, The allocable frequency resources of subcarriers are divided into N unit frequency units, the N unit The number of RBs (or subcarriers) contained in each frequency unit can be different. unit The number of RBs (or the number of subcarriers) contained in each frequency unit in the frequency units may be predefined or indicated by higher layer signaling.

[0245] Optionally, the bandwidth of each frequency unit is not less than the bandwidth of each cluster of frequency data. In this case, a cluster of frequency data is continuously mapped within a frequency unit, and a cluster of frequency data can be mapped sequentially starting from the starting subcarrier of a frequency unit; the last element of a cluster of frequency data can also be mapped to the last subcarrier of a frequency unit.

[0246] In a second implementation manner, the transmitting device determines the location of the frequency resource to which the K cluster frequency data is mapped based on a combination number system.

[0247] Based on the definitions of the allocatable frequency domain resources and frequency units in the above example, the transmitting device may systematically determine the positions of the frequency units to which the K-cluster frequency data is mapped based on the number of combinations.

[0248] Optionally, the sending device determines the starting frequency unit position and the ending frequency unit position of each cluster of frequency data in the K clusters of frequency data. The starting frequency unit position of the kth cluster of frequency data is represented by s 2k , the cutoff frequency unit position of the kth cluster frequency position mapped by the kth cluster frequency data is expressed as s 2k+1 -1.

[0249] It is understandable that the sending device is from N unit 2K positions (K starting frequency unit positions and K cutoff frequency unit positions) are determined in the frequency units.

[0250] Optionally, the K cluster frequency data is mapped sequentially from the subcarrier with a smaller index to the subcarrier with a larger index, that is, satisfying: 2K-1 >s 2K-2 >…>s1>s0 (2)

[0251] Optional, s0≥0.

[0252] Optionally, the sending device may use signaling (such as RRC) to indicate the 2K positions, and the number of bits included in the signaling is in, represents a ceiling function, for example It represents the number of possible combinations of B different values ​​from A different values ​​(that is, the B different values ​​taken out form a combination), Specifically, 2K positions can form a combination <s0,…,s 2K-1 >, the value indicated by the signaling (expressed as I idx ) and the relationship between the 2K positions satisfies:

[0253] or,

[0254] The bandwidth of each cluster of frequency data is the same, for example, each cluster of frequency data includes N1 subcarriers.

[0255] Optional, s k The value ranges from 0 to N unit An integer from -1.

[0256] Optionally, the transmitting device determines the starting frequency unit position of each cluster of frequency data mapped in the K clusters of frequency data and the cutoff frequency unit position of any cluster of frequency data, and thus the position of the frequency resource mapped by the K clusters of frequency data. Since the bandwidth of each cluster of frequency data is the same, knowing the starting frequency unit position and cutoff frequency unit position of any cluster of frequency data can determine the bandwidth of each cluster of frequency data, and then determine the cutoff frequency unit position of other frequency data based on the starting frequency unit position of other frequency data.

[0257] Wherein, based on the starting frequency unit position of each cluster of frequency data in the K clusters of frequency data and the cutoff frequency unit position of any cluster of frequency data, the positions of the frequency resources mapped by the K clusters of frequency data are determined to be non-overlapping.

[0258] It is understandable that the sending device is from N unit K+1 positions (K starting frequency unit positions and 1 cutoff frequency unit position) are determined in the frequency units.

[0259] Exemplarily, the transmitting device determines the starting frequency unit position of each cluster of frequency data mapped in K clusters of frequency data and the cutoff frequency unit position of the 0th cluster of frequency data, and the starting frequency unit positions of the 0th cluster to the K-1th cluster of frequency data mapping are respectively represented as w0, w2, w3, ..., w K , the cutoff frequency unit position of the 0th cluster frequency data mapping is represented as w1.

[0260] Optionally, the K cluster frequency data is mapped sequentially from the subcarrier with a smaller index to the subcarrier with a larger index, that is, satisfying: K >…>w1>w0

[0261] Optionally, the sending device may use signaling (such as RRC) to indicate the K+1 positions, and the number of bits included in the signaling is in, represents a ceiling function, for example It represents the number of possible combinations of B different values ​​from A different values ​​(that is, the B different values ​​taken out form a combination), Specifically, K+1 positions can form a combination <w0,w1,…,w K >, the value indicated by the signaling (expressed as I idx ) and the K+1 positions satisfy the following relationship:

[0262] or,

[0263] Exemplarily, the transmitting device determines the starting frequency unit position of each cluster of frequency data mapped in K clusters of frequency data and the cutoff frequency unit position of the K-1 cluster of frequency data, and the starting frequency unit positions of the frequency data mapped from the 0th cluster to the K-1th cluster are respectively represented as w0, w1, w2, ..., w K-1 , the cutoff frequency unit position of the K-1th cluster frequency data mapping is represented by w K The relationship between the value indicated by the signaling and the K+1 positions satisfies formula (5).

[0264] The following specifically describes codebook hopping and / or codeword hopping for K-cluster modulation data.

[0265] For example, the base station may indicate to the UE whether to perform codebook hopping through indication information (e.g., RRC or DCI signaling). For example, a 1-bit signaling is used, where when the value of the bit is 1, codebook hopping is enabled; and when the value of the bit is 0, codebook hopping is not enabled.

[0266] For example, the base station may indicate to the UE whether to perform codeword hopping through indication information (e.g., RRC or DCI signaling), for example, using 1-bit signaling, where when the value of the bit is 1, codeword hopping is enabled; and when the value of the bit is 0, codeword hopping is not enabled.

[0267] In a first implementation, the k'th cluster of modulation data in K clusters of modulation data corresponds to the k"th codebook in K codebooks, wherein the codebook index of the k"th codebook is determined based on the identifier of the transmitting device, k'=0,...,K-1, k"=0,...,K-1.

[0268] Optionally, the codebooks corresponding to different clusters of modulated data may be determined based on an identifier of the transmitting device. Specifically, the codebook index of the k″th codebook corresponding to the k′th cluster of modulated data may be determined based on an identifier of the transmitting device.

[0269] Optionally, the codebook index of the k″th codebook corresponding to the k′th cluster modulated data may be determined based on an identifier of the transmitting device and the cluster index k′.

[0270] Optionally, the codebook index of the k″th codebook corresponding to the k′th cluster modulated data may be determined based on an identifier of the transmitting device, the cluster index k′ and the time domain position of the data.

[0271] Exemplarily, the transmitting device transmits data within at least one symbol, such as an SC-FDMA symbol.

[0272] Optionally, the time domain position of the data can be the index of the symbol or the index of the time slot. symbWhen data is transmitted within 1 symbol, the index of the codebook corresponding to the k'th cluster of modulated data can be determined based on the identifier of the transmitting device, the cluster index k' and the index of the symbol. slot When data is transmitted within >1 time slot, the index of the codebook corresponding to the k'th cluster of modulated data can be determined based on the identifier of the transmitting device, the cluster index k' and the index of the time slot. slot When data is transmitted within >1 time slot, the index of the codebook corresponding to the k'th cluster of modulated data may be determined based on the identifier of the transmitting device, the cluster index k', the symbol index and the time slot index.

[0273] Exemplarily, the codebook index k″ can be expressed as:

[0274] or,

[0275] or,

[0276] in, Indicates the identifier of the sending device, l symb Indicates the index of the symbol, n s represents the index of the time slot, Δ hop,1 , Δ hop,2 , Δ hop,3 and Δ hop,4 is the offset. hop,1 , Δ hop,2 , Δ hop,3 and Δ hop,4 It can be predefined or indicated by signaling.

[0277] Optionally, the index of the codebook corresponding to the k'th cluster of modulated data may be determined based on a pseudo-random sequence, wherein the initialization of the pseudo-random sequence is determined based on an identifier of the transmitting device.

[0278] For example, the codebook index k″ can be expressed as: k″=(f cb，hop +Δ hop,1 +k′)mod K (10)

[0279] or,

[0280] Among them, f cb,hop Based on a pseudo-random sequence.

[0281] For example, f cb,hop It can be expressed as:

[0282] or,

[0283] or,

[0284] Among them, M bit is an integer and can be predefined. bit,1 , Δ bit,2 and Δ bit,3 is the offset, which can be predefined or indicated by signaling. bit,1 *n s +Δ bit,2 *l symb +Δ bit,3 +i) represents the Δth pseudo-random sequence bit,1 *n s +Δ bit,2 *l symb +Δ bit,3 +i values.

[0285] For example, the initialization value c of the pseudo-random sequence is init It can be expressed as:

[0286] or,

[0287] in, It can be the cell identifier or indicated by signaling.

[0288] In the second implementation, the k'th cluster of modulation data in the K clusters of modulation data corresponds to the j'th cluster of modulation data in the k"th codebook in the K codebooks. cw,1 Code words, j cw,1 is the first codeword index, which is one of the N codeword indices, and the N codeword indices correspond one-to-one to the N codewords contained in each codebook, wherein the first codeword index is determined based on the identifier of the transmitting device, k′=0,…,K-1, k″=0,…,K-1, j cw,1 ∈{0,…,N-1}.

[0289] Optionally, the codeword index corresponding to the same codeword index of different clusters of modulated data may be determined based on the identifier of the transmitting device, that is, the codeword index corresponding to K clusters of modulated data may be determined based on the identifier of the transmitting device.

[0290] Optionally, the same codeword index corresponding to modulated data of different clusters is irrelevant to the cluster index k'.

[0291] Optionally, the codeword index corresponding to different cluster modulation data can be determined based on the identifier of the transmitting device and the time domain position of the data. symbWhen data is transmitted within 1 symbol, the codeword index corresponding to the K-cluster modulated data can be determined based on the identifier of the transmitting device and the index of the symbol. slot When data is transmitted within >1 time slot, the codeword index corresponding to the K cluster modulated data can be determined based on the identifier of the transmitting device and the index of the time slot. slot When data is transmitted within >1 time slot, the codeword index corresponding to the K-cluster modulated data can be determined based on the identifier of the transmitting device, the symbol index and the time slot index.

[0292] For example, the first codeword index j cw,1 It can be expressed as:

[0293] or,

[0294] or,

[0295] in, Indicates the identifier of the sending device, l symb Indicates the index of the symbol, n s represents the index of the time slot, Δ hop,1 , Δ hop,2 , Δ hop,3 and Δ hop,4 is the offset. hop,1 , Δ hop,2 , Δ hop,3 and Δ hop,4 It can be predefined or indicated by signaling.

[0296] Optionally, the codeword index corresponding to the k'th cluster of modulated data may be determined based on a pseudo-random sequence, wherein the initialization of the pseudo-random sequence is determined based on an identifier of the transmitting device.

[0297] For example, the first codeword index j cw,1 It can be expressed as: cw,1 =(f cw,hop +Δ hop,1 )mod N (20)

[0298] or,

[0299] Among them, f cw,hop Based on a pseudo-random sequence.

[0300] For example, f cw,hop It can be expressed as:

[0301] or,

[0302] or,

[0303] Among them, M bit is an integer and can be predefined. bit,1 , Δ bit,2 and Δ bit,3 is the offset, which can be predefined or indicated by signaling. bit,1 *n s +Δ bit,2 *l symb +Δ bit,3 +i) represents the Δth pseudo-random sequence bit,1 *n s +Δ bit,2 *l symb +Δ bit,3 +i values.

[0304] The initialization of the pseudo-random sequence may refer to the initialization of the pseudo-random sequence in the codebook jump, which will not be described in detail here.

[0305] Based on the above scheme, the sending device can perform codebook hopping and codeword hopping according to the identification of the sending device. When multiple sending devices send data within the same time-frequency resource segment, since the codebook hopping and / or codeword hopping patterns selected by different sending devices are different, the interference between the sent data of different sending devices can be randomized, thereby improving the demodulation performance of the receiving device.

[0306] S330: The sending device sends a first symbol to the receiving device. Correspondingly, the receiving device receives the first symbol from the sending device.

[0307] In an embodiment of the present application, a transmitting device sends a first symbol to a receiving device, which can be understood as the destination end of the first symbol being the receiving device, and can include the transmitting device directly or indirectly sending the first symbol to the receiving device. Similarly, a receiving device receives a first signal from a transmitting device, or a receiving device receives information from a transmitting device, which can be understood as the source end of the first signal being the transmitting device, and can include the receiving device directly or indirectly receiving the first signal from the transmitting device. Optionally, the first signal may be subjected to necessary processing between the transmitting source and the destination, such as format changes, etc., or the first signal may be forwarded or transparently transmitted by one or more devices (such as relay devices, terminal devices or network devices, etc.) between the transmitting source and the destination, but it should be understood that the destination can understand the valid information from the source.

[0308] For example, taking the uplink communication scenario in the scheduling-free system as an example, the sending device is UE1 and the receiving device is base station #1. UE1 can send the first signal directly to base station #1, or it can be sent to base station #1 through other devices, such as UE2 or base station #2. This application does not limit this.

[0309] S340: The receiving device determines K codewords.

[0310] The specific implementation manner in which the receiving device determines K codewords may refer to the relevant description in the above step S310, which will not be repeated here for the sake of brevity.

[0311] It should be noted that the present application does not limit the order in which the above steps S330 and S340 are executed, that is, the receiving device may determine the K codewords after receiving the first symbol or before receiving the first symbol.

[0312] S350: The receiving device determines K clusters of modulated data according to the first symbol and the K codewords.

[0313] Exemplarily, the receiving device sequentially performs Fourier transform, resource demapping, and inverse Fourier transform on the first symbol to obtain K clusters of first data. The specific implementation of sequentially performing Fourier transform, resource demapping, and inverse Fourier transform on the first symbol can be referenced in existing protocols and will not be further described here.

[0314] Furthermore, the receiving device despreads K clusters of first data based on K codewords to obtain K clusters of modulated data, and combines the K clusters of modulated data to obtain first modulated data.

[0315] FIG7 is a flow chart of a method for generating a first symbol provided by an embodiment of the present application. Taking the sending device as the execution subject, as shown in FIG7, the method includes the following steps. For details, please refer to the relevant descriptions of FIG3 to FIG6 above.

[0316] S710: Modulate bit data to generate first modulated data.

[0317] Exemplarily, the bit data is modulated based on a modulation method, such as Pi / 2-BPSK modulation, BPSK modulation, or QPSK modulation, to generate first modulated data. The bit data can be determined based on the service of the transmitting device, and the bit data can be encoded data, which is not limited in this application.

[0318] S720: Split the first modulated data to obtain K clusters of modulated data.

[0319] Exemplarily, the first modulation data is represented as d1, and the first modulation data includes N 1,qamelements, it can also be said that the first modulated data contains N 1,qam modulation symbols. The kth (k=0,…,K-1) cluster of modulation data in K clusters of modulation data is expressed as

[0320] The length or size of the kth cluster of modulated data in the K clusters of modulated data is related to the codeword used by the kth cluster of modulated data and determined based on the first codeword index. cw,1 The number of non-zero coefficients contained in the codeword is related.

[0321] For the convenience of description, the first symbol generation process of the present application is described below by taking the k-th cluster of modulated data corresponding to the k-th codebook as an example.

[0322] For example, taking the kth cluster of modulated data corresponding to the kth codebook as an example, the number of elements contained in the kth cluster of modulated data is for:

[0323] Among them, N1 represents the number of elements contained in the first data of each cluster, j c w ,1 The index of the codeword of the kth codebook used to generate the first data of the kth cluster is the first codeword index, is the jth value of the kth codebook cw,1 The number of non-zero elements contained in the codeword. Optionally, N1 / L is an integer.

[0324] It can be understood that when the k'th cluster of modulated data corresponds to the k'th codebook in the K codebooks, the number of elements contained in the k'th cluster of modulated data is for:

[0325] In one implementation, the transmitting device sequentially divides the first modulated data into K clusters of modulated data, satisfying:

[0326] in, represents the nth element corresponding to the kth cluster of modulation data,

[0327] S730 , expand K clusters of modulated data based on K codewords to determine K clusters of first data.

[0328] In one implementation, the sending device sends the code based on the same index (ie, the first codeword index j cw,1 ) Determine K codewords from K codebooks, use the K codewords to expand K clusters of modulated data, and obtain K clusters of first data. For example, the transmitting device determines the jth codeword in the kth codebook based on the kth codeword. cw,1 The k-th cluster of modulated data is expanded using a codeword to obtain the k-th cluster of first data.

[0329] Take the kth cluster of modulated data corresponding to the kth codebook as an example. Optionally, the kth cluster of modulated data can be The elements are divided into N1 / L groups of modulation data, each group of modulation data contains The elements are modulation symbols; the kth cluster of first data can be divided into N1 / L groups of first data, each group of first data containing L elements. The pth group of first data corresponds to the pth group of modulation data, that is, the pth group of first data is obtained based on the pth group of modulation data, p = 0, ..., N1 / L-1.

[0330] Optionally, when the element value of the codeword is 0 or 1, based on the jth cw,1 The codewords are used to expand the kth cluster of modulated data, which means mapping the pth group of modulated data to the jth group in sequence. cw,1 The pth group of first data is obtained by positioning the non-zero elements of the code words.

[0331] Optionally, when the element value of the codeword is 0 or non-zero, based on the jth cw,1 The codewords are used to expand the kth cluster of modulated data, which means mapping the pth group of modulated data to the jth group in sequence. cw,1 The non-zero element positions of the code words are multiplied by the non-zero elements of the mapped positions to obtain the pth group of first data.

[0332] For example, assume that the first data of the kth cluster is represented by x k , the kth cluster of first data contains N1 elements, then the kth cluster of first data and the kth cluster of modulated data after expansion satisfy:

[0333] in, p=0,…,N1 / L-1, represents the jth value of the kth codebook cw,1 Code words, represents the jth value of the kth codebook cw,1 codewords The position of non-zero elements in, N1 / L is an integer, x k The elements at other positions in are 0.

[0334] Optionally, the jth cw,1 When the value of the non-zero element in the codeword is 1, the k-th cluster first data and the k-th cluster modulated data after expansion satisfy:

[0335] in, p=0,…,N1 / L-1, represents the jth value of the kth codebookcw,1 Code words, represents the jth value of the kth codebook cw,1 codewords The position of non-zero elements in, N1 / L is an integer, x k The elements at other positions in are 0.

[0336] S740 , performing Fourier transform on each cluster of the K clusters of first data to obtain K clusters of frequency data.

[0337] For example, the frequency data of the kth cluster is represented by X k ,satisfy:

[0338] Where m = 0,…,N1-1,X k (m) represents the mth element of the kth cluster frequency data, X k =[X k (0),…,X k (N1-1)].

[0339] S750 , performing resource mapping on the K cluster frequency data and then performing inverse Fourier transform to generate SC-FDMA symbols.

[0340] Exemplarily, K clusters of frequency data are mapped to corresponding frequency resources through resource mapping. It should be understood that each cluster of frequency data is mapped to continuous frequency resources, and frequency resources mapped to different clusters of data do not overlap.

[0341] For example, assume that the data obtained by sequentially splicing K cluster frequency data is represented as X, that is, X = [X0, ..., X K-1 ], X contains KN1 elements. The location of the frequency resource mapped by the kth cluster frequency data is represented by A k The result of sequentially splicing the positions of the frequency resources mapped by the K cluster frequency data is expressed as: A=[A0,…,A K-1 ], the values ​​of any two elements in A are different.

[0342] It can be understood that the location of the frequency resource corresponds to the frequency resource.

[0343] Optionally, the position of the frequency resource mapped by K cluster frequency data can be the position of the subcarrier mapped by K cluster frequency data. N1 elements of each cluster frequency data are mapped to N1 subcarriers, wherein one element is mapped to one subcarrier (i.e., one element corresponds to one subcarrier). At this time, the position of the frequency resource mapped by the kth cluster frequency data represents the position of the N1 subcarrier mapped by the kth cluster frequency data. k Contains N1 elements.

[0344] Optional, Ak The mth element A k (m) corresponds to the position of the subcarrier mapped to the mth element of the kth cluster of frequency data.

[0345] Exemplarily, the transmitting device determines the location of the frequency resources mapped to the K cluster frequency data, that is, determines each element of A.

[0346] Optionally, the location of the frequency resource to which the K cluster frequency data is mapped is predefined or indicated by higher layer signaling or DCI.

[0347] The location of the frequency resource mapped by the K-cluster frequency data may be indicated based on a bit-map or determined based on a combination number system. For the specific implementation, reference may be made to the relevant description of the above method 300 and will not be repeated here.

[0348] Furthermore, the transmitting device performs an inverse Fourier transform on the K cluster frequency data (mapping position A) after resource mapping to generate SC-FDMA symbols. The specific implementation method can refer to the process of inverse Fourier transform processing in the LTE system or NR system, and this application does not limit this.

[0349] According to the solution provided in the present application, a first symbol with low PAPR is generated based on K codewords and K clusters of modulated data. The positions of the non-zero coefficients contained in the K codewords are correlated, which can reduce the possibility of conflict when the transmitting device transmits a signal, while improving the demodulation performance of the receiving device.

[0350] Figure 8 is a flow chart of a communication method 800 provided in an embodiment of the present application. As shown in Figure 8, the network device (such as the receiving device of the above method 300) is mainly used to configure K codebooks for the terminal device (such as the sending device of the above method 300) for specific description. This method can be a further refinement of the implementation method of "the sending device determines K codebooks" in the above method 300. The method flow can be executed by the network device and the terminal device, or by a module and / or device (such as a chip or an integrated circuit, etc.) with corresponding functions installed in the network device and the terminal device, and this application is not limited to this. The following description is based on the network device and the terminal device as the execution subject, including the following multiple steps. It should be understood that the relevant descriptions in the embodiments shown in Figures 3 and 7 above are also applicable to this implementation method. The same or similar technical means may exist between Figures 3, 7 and 8, and the contents described in the embodiments shown in Figures 8 and 3 and 7 will not be repeated.

[0351] S810: The network device determines configuration information.

[0352] The configuration information indicates K codebooks and includes the number of K codebooks, the length of each codeword, and the values ​​of the elements contained in each codebook. As shown in Figure 4, K = 3, and the length of each codeword, L = 6, or the number of elements contained in each codeword is 6. For example, taking the three codewords determined by codeword 0 from three codebooks as an example, the values ​​of the elements contained in the codeword corresponding to codeword 0 in codebook 0 are 1, 0, 1, 0, 1, 0, respectively. The values ​​of the elements contained in the codeword corresponding to codeword 0 in codebook 1 are 0, 1, 0, 0, 0, 1, respectively. The values ​​of the elements contained in the codeword corresponding to codeword 0 in codebook 2 are 0, 0, 0, 1, 0, 0, respectively. The resource locations corresponding to the elements with a value of 1 are the data mapping locations.

[0353] In the embodiment of the present application, the K codebooks are different from each other.

[0354] S820, the network device sends configuration information to the terminal device, and correspondingly, the terminal device receives the configuration information from the network device.

[0355] S830: The terminal device determines K codebooks according to the configuration information.

[0356] Exemplarily, based on the acquired configuration information, the terminal device determines, for example, that the number of codebooks K=3 and the length of each codeword L=6, or that the number of elements contained in each codeword is 6. For example, taking the three codewords determined by codeword 0 from three codebooks as an example, the values ​​of the elements contained in the codeword corresponding to codeword 0 in codebook 0 are 1, 0, 1, 0, 1, 0, in sequence; the values ​​of the elements contained in the codeword corresponding to codeword 0 in codebook 1 are 0, 1, 0, 0, 0, 1, and the values ​​of the elements contained in the codeword corresponding to codeword 0 in codebook 2 are 0, 0, 0, 1, 0, 0, in sequence. Thus, the codebook shown in FIG. 4 can be determined.

[0357] Optionally, the present application does not limit the number of codebook groups, for example, there may be one or more groups of K codebooks.

[0358] For example, when there is only a set of K codebooks, these K codebooks may be determined through steps S810 to S830 above, i.e., the network device configures the K codebooks for the terminal device through configuration information, or the K codebooks are indicated by signaling. Optionally, these K codebooks may also be predefined or preconfigured. For example, if the terminal device is configured with K codebooks at the factory, no signaling is required.

[0359] For another example, when there are multiple groups of K codebooks, such as two groups, the two groups of K codebooks may be predefined, configured or preconfigured, or indicated by signaling. In this case, the network device may send indication information to indicate to the terminal device that one of the K codebooks is used for data transmission, and the network device indicates to the terminal device the correspondence between the K clusters of modulated data and the K codebooks (or K codebook indices), so that the terminal device can perform data mapping based on the determined K codebooks.

[0360] Optionally, for multiple groups of K codebooks, before sending indication information to the terminal device, the network device may consider the transmission requirements of the terminal device and the capabilities of the terminal device, and then select K adapted codebooks for data transmission. For example, assuming that the capability of UE1 is low, when selecting K codebooks for configuration, the network device may give priority to selecting a group of K codebooks with a small codebook bandwidth, simple modulation, and codewords containing elements with values ​​of only 0 and 1 for use by UE1. This application is not limited to this.

[0361] The above description, in conjunction with Figures 1 to 8 , details the communication method embodiment of the present application. The following description, in conjunction with Figures 9 to 11 , details the communication device embodiment of the present application. It should be understood that the description of the device embodiment corresponds to the description of the method embodiment. Therefore, for portions not described in detail, reference can be made to the preceding method embodiment.

[0362] Figure 9 is a schematic block diagram of a communication device 1000 provided in an embodiment of the present application. As shown in Figure 9, the communication device 1000 may include a transceiver unit 1010 and a processing unit 1020. The transceiver unit 1010 can communicate with the outside world, and the processing unit 1020 is used for data processing. The transceiver unit 1010 may also be referred to as a communication interface or a transceiver unit.

[0363] In one possible design, the communication device 1000 can implement steps or processes corresponding to those performed by the sending device in the above method embodiment, wherein the processing unit 1020 is used to perform processing-related operations of the sending device in the above method embodiment, and the transceiver unit 1010 is used to perform transceiver-related operations of the sending device in the above method embodiment.

[0364] In another possible design, the communication device 1000 can implement steps or processes corresponding to those performed by the receiving device in the above method embodiment, wherein the processing unit 1020 is used to perform processing-related operations of the receiving device in the above method embodiment, and the transceiver unit 1010 is used to perform transceiver-related operations of the receiving device in the above method embodiment.

[0365] It should be understood that the communication device 1000 here is embodied in the form of a functional unit. The term "unit" here may refer to an application specific integrated circuit (ASIC), an electronic circuit, a processor (such as a shared processor, a dedicated processor or a group processor, etc.) and a memory for executing one or more software or firmware programs, a merging logic circuit and / or other suitable components that support the described functions. In an optional example, those skilled in the art will understand that the communication device 1000 can be specifically the transmitting end in the above embodiment, and can be used to execute the various processes and / or steps corresponding to the transmitting end in the above method embodiment, or the device 1000 can be specifically the receiving end in the above embodiment, and can be used to execute the various processes and / or steps corresponding to the receiving end in the above method embodiment. To avoid repetition, it will not be repeated here.

[0366] The apparatus 1000 of each of the above-mentioned solutions has the function of implementing the corresponding steps performed by the transmitting end in the above-mentioned method, or the apparatus 1000 of each of the above-mentioned solutions has the function of implementing the corresponding steps performed by the receiving end in the above-mentioned method. The functions can be implemented by hardware, or can be implemented by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above-mentioned functions; for example, the transceiver unit can be replaced by a transceiver (for example, the transmitting unit in the transceiver unit can be replaced by a transmitter, and the receiving unit in the transceiver unit can be replaced by a receiver), and other units, such as the processing unit, can be replaced by a processor to respectively perform the transceiver operations and related processing operations in each method embodiment.

[0367] In addition, the above-mentioned transceiver unit can also be a transceiver circuit (for example, it can include a receiving circuit and a transmitting circuit), and the processing unit can be a processing circuit. In an embodiment of the present application, the device in Figure 9 can be the receiving end or the transmitting end in the aforementioned embodiment, or it can be a chip or a chip system, such as a system on chip (SoC). Among them, the transceiver unit can be an input and output circuit or a communication interface. The processing unit is a processor or microprocessor or integrated circuit integrated on the chip. This is not limited here.

[0368] Figure 10 is a schematic block diagram of a communication device 2000 provided in an embodiment of the present application. As shown in Figure 10, the device 2000 includes a processor 2010 and a transceiver 2020. The processor 2010 and the transceiver 2020 communicate with each other via an internal connection path. The processor 2010 is configured to execute instructions to control the transceiver 2020 to transmit and / or receive signals.

[0369] Optionally, the apparatus 2000 may further include a memory 2030, which communicates with the processor 2010 and the transceiver 2020 via an internal connection path. The memory 2030 is used to store instructions, and the processor 2010 may execute the instructions stored in the memory 2030.

[0370] In a possible implementation, the apparatus 2000 is used to implement various processes and steps corresponding to the sending device in the above method embodiment.

[0371] In another possible implementation, the apparatus 2000 is used to implement various processes and steps corresponding to the receiving device in the above method embodiment.

[0372] It should be understood that the device 2000 can be specifically the transmitting end or receiving end in the above-mentioned embodiments, or can also be a chip or chip system. Correspondingly, the transceiver 2020 can be the transceiver circuit of the chip, which is not limited here. Specifically, the device 2000 can be used to perform the various steps and / or processes corresponding to the transmitting end or receiving end in the above-mentioned method embodiments.

[0373] Optionally, the memory 2030 may include a read-only memory and a random access memory, and provide instructions and data to the processor. A portion of the memory may also include a non-volatile random access memory. For example, the memory may also store device type information. The processor 2010 may be configured to execute instructions stored in the memory, and when the processor 2010 executes the instructions stored in the memory, the processor 2010 is configured to perform the various steps and / or processes of the above-described method embodiments corresponding to the transmitting end or the receiving end.

[0374] During implementation, each step of the above method can be completed by an integrated logic circuit of the hardware in the processor or by instructions in the form of software. The steps of the method disclosed in conjunction with the embodiments of the present application can be directly embodied as being executed by a hardware processor, or can be executed by a combination of hardware and software modules in the processor. The software module can be located in a storage medium mature in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in conjunction with its hardware. To avoid repetition, it will not be described in detail here.

[0375] It should be noted that the processor in the embodiments of the present application can be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above-described method embodiment can be completed by hardware integrated logic circuits in the processor or by software instructions. The above-described processor can be a general-purpose 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, or a discrete hardware component. The processor in the embodiments of the present application can implement or execute the various methods, steps, and logic block diagrams disclosed in the embodiments of the present application. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the method disclosed in the embodiments of the present application can be directly implemented and executed by a hardware decoding processor, or by a combination of hardware and software modules in the decoding processor. The software module can be located in a storage medium well-known in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, etc. The storage medium is located in the memory, and the processor reads the information in the memory and, in conjunction with its hardware, completes the steps of the above-described method.

[0376] It is understood that the memory in the embodiments of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM), which is used as an 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), synchronous link DRAM (SLDRAM), and direct RAM bus RAM (DR RAM). It should be noted that the memory of the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0377] FIG11 is a schematic block diagram of a chip system 3000 according to an embodiment of the present application. As shown in FIG11 , the chip system 3000 (or also referred to as a processing system) includes a logic circuit 3010 and an input / output interface 3020 .

[0378] Logic circuit 3010 may be a processing circuit in chip system 3000. Logic circuit 3010 may be coupled to a storage unit and call instructions in the storage unit, so that chip system 3000 can implement the methods and functions of various embodiments of the present application. Input / output interface 3020 may be an input / output circuit in chip system 3000, outputting information processed by chip system 3000 or inputting data or signaling information to be processed into chip system 3000 for processing.

[0379] As a solution, the chip system 3000 is used to implement the operations performed by the sending device in the above various method embodiments.

[0380] For example, the logic circuit 3010 is used to implement the processing-related operations performed by the sending device in the above method embodiment, such as the processing-related operations performed by the sending device in the embodiment shown in Figure 3 or Figure 7; the input / output interface 3020 is used to implement the sending and / or receiving-related operations performed by the first terminal device in the above method embodiment, such as the sending and / or receiving-related operations performed by the sending device in the embodiment shown in Figure 3 or Figure 7.

[0381] As another solution, the chip system 3000 is used to implement the operations performed by the receiving device in the above various method embodiments.

[0382] For example, the logic circuit 3010 is used to implement the processing-related operations performed by the receiving device in the above method embodiments, such as the processing-related operations performed by the receiving device in the embodiments shown in Figures 3 or 7; the input / output interface 3020 is used to implement the sending and / or receiving-related operations performed by the receiving device in the above method embodiments, such as the sending and / or receiving-related operations performed by the receiving device in the embodiments shown in Figures 3 or 7.

[0383] An embodiment of the present application also provides a computer-readable storage medium on which computer instructions are stored for implementing the methods executed by a terminal device (such as a sending device or a receiving device) in the above-mentioned method embodiments.

[0384] An embodiment of the present application also provides a computer program product, comprising instructions, which, when executed by a computer, implement the methods performed by a terminal device (such as a sending device or a receiving device) in the above-mentioned method embodiments.

[0385] An embodiment of the present application further provides a communication system, which includes the sending device or the receiving device in the above embodiments.

[0386] The explanation of the relevant contents and beneficial effects of any of the above-mentioned devices can be referred to the corresponding method embodiments provided above, which will not be repeated here.

[0387] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0388] Those skilled in the art will clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0389] In the several embodiments provided in this application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0390] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

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

[0392] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, server, or device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory, a random access memory, a magnetic disk, or an optical disk.

[0393] The above description is merely a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this application should be included in the scope of protection of this application. Therefore, the scope of protection of this application should be based on the scope of protection of the claims.

Claims

1. A communication method, characterized in that: include: Determine K codewords, where positions of non-zero coefficients included in the K codewords are related, and K is an integer greater than 1; Generate a first symbol according to the K code words and the K clusters of modulated data, wherein the K code words and the K clusters of modulated data correspond one to one; The first symbol is transmitted.

2. The method according to claim 1, characterized in that The K codewords correspond one-to-one to the K codebooks, each of the K codebooks includes N codewords, each of the N codewords includes the same number of elements, and N is an integer greater than 1.

3. The method according to claim 2, characterized in that The determining of K code words comprises: The K codewords are determined from the K codebooks.

4. The method according to claim 3, characterized in that Determining the K codewords from the K codebooks includes: Determine a first codeword index, where the first codeword index is a codeword index among N codeword indexes, and the N codeword indexes correspond one-to-one to the N codewords included in each codebook; The K codewords are determined from the K codebooks based on the first codeword index.

5. The method according to any one of claims 2 to 4, characterized in that The i-th codebook S among the K codebooks i satisfy: in, represents the jth codeword in the i-th codebook, L represents the number of elements contained in the j-th codeword, At least one of the L elements contained has a value of 0, Represents the mth element in the jth codeword, m=0,…,L-1, i and j are integers, i=0,…,K-1, j=0,…,N-1.

6. The method according to any one of claims 2 to 5, characterized in that The positions of the non-zero coefficients contained in the K codewords are related, including: When L nonzero ≤L, the L nonzero The positions of any two non-zero coefficients are different among the positions of the non-zero coefficients; or, When L nonzero >L, the L nonzero The non-zero coefficients include L non-zero coefficients, and positions of any two non-zero coefficients among the L non-zero coefficients are different; Among them, L nonzero represents the sum of the numbers of elements of non-zero coefficients contained in K codewords determined from the K codebooks based on a first codeword index, where the first codeword index is a codeword index among N codeword indexes, and the N codeword indexes correspond one-to-one to the N codewords contained in each codebook, and L represents the number of elements contained in any codeword among the K codewords.

7. The method according to any one of claims 1 to 6, characterized in that The first symbol is obtained by combining K first sub-symbols, and the K first sub-symbols are generated based on K clusters of first data.

8. The method according to any one of claims 1 to 7, characterized in that The length of the kth cluster of modulation data in the K clusters of modulation data is related to the number of non-zero coefficients contained in the codeword corresponding to the kth cluster of modulation data, k=0, ..., K-1.

9. The method according to any one of claims 1 to 8, characterized in that The K-cluster modulation data is obtained by dividing the first modulation data, and the first modulation data is bit data obtained based on a modulation method.

10. The method according to any one of claims 1 to 9, characterized in that The step of generating a first symbol according to the K codewords and the K clusters of modulated data includes: Expanding the K clusters of modulated data based on the K codewords to obtain K clusters of first data; The first symbol is generated according to the K clusters of first data.

11. The method according to claim 10, characterized in that The step of expanding the K clusters of modulated data based on the K code words to obtain K clusters of first data includes: Based on the jth k-th codebook cw,1 codewords, expand the k-th cluster of modulated data, and obtain the k-th cluster of first data, j cw,1 is a first codeword index, wherein the first codeword index is one of the N codeword indexes, and the N codeword indexes correspond one-to-one to the N codewords contained in each codebook, k=0,…,K-1, j cw,1 ∈{0,…,N-1}, N is the number of codewords contained in each of the K codebooks.

12. The method according to any one of claims 2 to 11, characterized in that The k'th cluster of modulation data in the K clusters of modulation data corresponds to the k"th codebook in the K codebooks; The codebook index of the k″th codebook is determined based on the identifier of the sending device, k ′ =0,…,K-1, k″=0,…,K-1.

13. The method according to any one of claims 2 to 12, characterized in that The k'th cluster of modulation data in the K clusters of modulation data corresponds to the j'th cluster of modulation data in the k"th codebook in the K codebooks. cw,1 Code word, j cw,1 is a first codeword index, where the first codeword index is a codeword index among N codeword indexes, and the N codeword indexes correspond one-to-one to the N codewords included in each codebook; The first codeword index is determined based on the identifier of the transmitting device, k′=0,…,K-1, k″=0,…,K-1, j cw,1 ∈{0,…,N-1}.

14. The method according to any one of claims 2 to 13, characterized in that The method further comprises: Based on a pseudo-random sequence, determining K codebook indexes corresponding one-to-one to the K clusters of modulated data, wherein the K codebook indexes correspond one-to-one to the K codebooks; and / or, Determine, based on a pseudo-random sequence, a first codeword index corresponding to the K cluster modulated data, where the first codeword index is a codeword index among N codeword indexes, and the N codeword indexes correspond one-to-one to the N codewords included in each codebook; The initialization of the pseudo-random sequence is determined based on the identification of the sending device.

15. The method according to any one of claims 1 to 14, characterized in that The K cluster modulation data corresponds to the K cluster frequency position one by one, and the K cluster frequency position is determined based on a bitmap, or the K cluster frequency position is determined based on a combination number system.

16. The method according to claim 15, characterized in that Each frequency position of the K cluster frequency positions includes a starting frequency position and a cutoff frequency position, and the K cluster frequency positions are determined based on a combination number system, including: Determine the signaling indication value I idx ; According to the signaling indication value I idx and the first relationship, determining the K cluster frequency positions; Among them, the first relationship represents the signaling indication value I idx The relationship between the starting frequency position and the cutoff frequency position of each cluster frequency position satisfies: The kth cluster frequency position corresponds to the kth cluster modulation data in the K cluster modulation data, S 2k represents the starting frequency position of the kth cluster frequency position, S 2k+1 -1 represents the cutoff frequency position of the kth cluster frequency position, s 2K-1 >s 2K-2 >…>s1>s0, k=0,…,K-1.

17. The method according to any one of claims 1 to 16, characterized in that The first symbol is a single carrier frequency division multiple access (SC-FDMA) symbol.

18. A communication method, characterized in that: include: Determine K codewords, where positions of non-zero coefficients included in the K codewords are related, and K is an integer greater than 1; receiving a first symbol; K clusters of modulation data are determined according to the first symbol and the K codewords, and the K clusters of modulation data correspond one-to-one to the K codewords.

19. The method according to claim 18, characterized in that The method further comprises: A first codeword index is sent, where the first codeword index is a codeword index among N codeword indexes, where the N codeword indexes correspond one-to-one to N codewords included in each codebook in K codebooks, where the K codewords correspond one-to-one to the K codebooks, and where the first codeword index is used to determine the K codewords from the K codebooks.

20. The method according to claim 19, characterized in that The determining of K code words comprises: The K codewords are determined from the K codebooks.

21. The method according to claim 20, characterized in that Determining the K codewords from the K codebooks includes: Determine a first codeword index, where the first codeword index is a codeword index among N codeword indexes, and the N codeword indexes correspond one-to-one to the N codewords included in each codebook; The K codewords are determined from the K codebooks based on the first codeword index.

22. The method according to any one of claims 18 to 21, characterized in that The determining K clusters of modulation data according to the first symbol and the K codewords includes: Performing Fourier transform, resource demapping and inverse Fourier transform on the first symbol in sequence to obtain K clusters of first data; The K clusters of first data are despread based on the K codewords to obtain the K clusters of modulated data.

23. The method according to any one of claims 19 to 22, characterized in that The positions of the non-zero coefficients contained in the K codewords are related, including: When L nonzero ≤L, the L nonzero The positions of any two non-zero coefficients are different among the positions of the non-zero coefficients; or, When L nonzero >L, the L nonzero The non-zero coefficients include L non-zero coefficients, any two of the positions of the L non-zero coefficients The positions of non-zero coefficients are different; Among them, L nonzero represents the sum of the numbers of elements of non-zero coefficients contained in K codewords determined from the K codebooks based on a first codeword index, where the first codeword index is a codeword index among N codeword indexes, and the N codeword indexes correspond one-to-one to the N codewords contained in each codebook, and L represents the number of elements contained in any codeword among the K codewords.

24. The method according to any one of claims 18 to 23, characterized in that The length of the kth cluster of modulation data in the K clusters of modulation data is related to the number of non-zero coefficients contained in the codeword corresponding to the kth cluster of modulation data, k=0, ..., K-1.

25. The method according to any one of claims 19 to 24, characterized in that The method further comprises: Based on a pseudo-random sequence, determining K codebook indexes corresponding one-to-one to the K clusters of modulated data, wherein the K codebook indexes correspond one-to-one to the K codebooks; and / or, Determine, based on a pseudo-random sequence, a first codeword index corresponding to the K cluster modulated data, where the first codeword index is a codeword index among N codeword indexes, and the N codeword indexes correspond one-to-one to N codewords included in each codebook among the K codebooks; The initialization of the pseudo-random sequence is determined based on the identification of the sending device.

26. The method according to any one of claims 18 to 25, characterized in that The K cluster modulation data corresponds to the K cluster frequency position one by one, and the K cluster frequency position is determined based on a bitmap, or the K cluster frequency position is determined based on a combination number system.

27. The method according to claim 26, characterized in that Each frequency position of the K cluster frequency positions includes a starting frequency position and a cutoff frequency position, and the K cluster frequency positions are determined based on a combination number system, including: Determine the signaling indication value I idx ; According to the signaling indication value I idx and the first relationship, determining the K cluster frequency positions; Among them, the first relationship represents the signaling indication value I idx The relationship between the starting frequency position and the cutoff frequency position of each cluster frequency position satisfies: The kth cluster frequency position corresponds to the kth cluster modulation data in the K cluster modulation data, S 2k represents the starting frequency position of the kth cluster frequency position, S 2k+1 -1 represents the cutoff frequency position of the kth cluster frequency position, s 2K-1 >s 2K-2 >…>s1>s0, k=0,…,K-1.

28. The method according to any one of claims 18 to 27, characterized in that The first symbol is a single carrier frequency division multiple access (SC-FDMA) symbol.

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

30. A communication device, characterized in that: The communication device includes a processor, the processor is coupled to a memory, the memory stores instructions, and when the instructions are executed by the processor, the communication device executes the method according to any one of claims 1 to 17, or the communication device executes the method according to any one of claims 18 to 28.

31. A computer-readable storage medium, characterized in that: The computer-readable storage medium is used to store a computer program, which, when executed on a computer, enables the computer to execute the method according to any one of claims 1 to 17, or enables the communication device to execute the method according to any one of claims 18 to 28.

Images