Communication method, electronic device, readable storage medium and computer program product

Abstract

The invention relates to the technical field of communication, and discloses a communication method, electronic equipment, a readable storage medium and a computer program product. In the communication method, user equipment and a base station can configure a first codebook with a large difference degree between codewords. In the process of transmitting the uplink control information data to the base station, the user equipment can encode the uplink control information data based on the first codebook and transmit the encoded uplink control information data to the base station. Accordingly, after receiving the encoded uplink control information data, the base station can decode the received encoded uplink control information data based on the first codebook to obtain the uplink control information data. Therefore, the uplink control information data is coded by using the codebook with a relatively large difference degree between the code words, and the difference of the coded uplink control information data can be increased, so that the error rate can be reduced.

Description

Technical Field

[0001] This application relates to the field of communication technology, and in particular to a communication method, electronic device, readable storage medium, and computer program product. Background Technology

[0002] During communication, user equipment (UE) can select different physical uplink control channel (PUCCH) formats to send UCI data to the base station, depending on the type of uplink control information (UCI) data it needs to send. Different PUCCH formats have different carrying capacities and modulation schemes.

[0003] In the New Radio (NR) interface of fifth-generation mobile communication systems, PUCCH formats are defined as PUCCH Format 1, PUCCH Format 2, PUCCH Format 3, and PUCCH Format 4. These four formats use coherent transmission for channel estimation based on demodulation reference signal (DMRS) data. For example, in PUCCH Format 4, the number of orthogonal frequency division multiplexing (OFDM) symbols used for UCI data is greater than the number of OFDM symbols used for DMRS data. However, if the number of OFDM symbols used for DMRS data is too small, the number of samples used for channel estimation in the time domain is insufficient, leading to reduced accuracy in channel estimation. Conversely, if the number of OFDM symbols used for DMRS data is too large, it will affect the amount of UCI data that PUCCH can carry, thus degrading PUCCH transmission performance. It is evident that the coherent transmission methods of PUCCH Format 1, PUCCH Format 2, PUCCH Format 3, and PUCCH Format 4, which rely on DMRS data for channel estimation, result in reduced PUCCH transmission performance. Summary of the Invention

[0004] To address the issue of reduced PUCCH transmission performance caused by the coherent transmission methods of PUCCH Format 1, PUCCH Format 2, PUCCH Format 3, and PUCCH Format 4, which rely on DMRS data for channel estimation, embodiments of this application provide a communication method, an electronic device, a readable storage medium, and a computer program product.

[0005] In a first aspect, this application provides a communication method applied to a user equipment, comprising: detecting uplink control information data to be transmitted; transmitting a modulated signal corresponding to the uplink control information data to a base station, wherein the modulated signal is obtained by modulating the uplink control information data based on a first codebook, wherein the distance between codewords in the first codebook is greater than a distance threshold, and the distance threshold is a positive integer greater than 0.

[0006] Based on the above scheme, using a first codebook with a large degree of difference between codewords to encode uplink control information data can increase the difference of the encoded uplink control information data, thereby reducing the bit error rate.

[0007] It can be understood that the first codebook is the constant-weight sparse regression codebook mentioned below. In some specific implementations, the distance between codewords in the first codebook can refer to Hamming distance, Levenstein distance, minimum code distance, etc.

[0008] In some specific implementations of the first aspect, the first codebook is a first constant-repetition codebook in which the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for the uplink control information data, and the number of columns is equal to the amount of data corresponding to each codeword.

[0009] Specifically, the first codebook can be generated in the following way: from multiple constant-repetition codebooks, determine a first constant-repetition codebook in which the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for uplink control information data, and the number of columns is equal to the amount of data required to be transmitted for each codeword; use the first constant-repetition codebook as the first codebook.

[0010] For example, the uplink control information data sent by the user equipment to the base station occupies one resource block in each time slot, uses 4 OFDM symbols in the time domain, and each codeword needs to transmit 9 bits of data. To ensure that each 9 bits of uplink control information data can be modulated using a unique codeword in the codebook, a first codebook can be selected from multiple pre-set constant-repetition codebooks based on the number of OFDM symbols required for the uplink control information data. This first codebook has the same number of rows as the number of OFDM symbols required for the uplink control information data and the same number of columns as the amount of data to be transmitted per codeword.

[0011] In this embodiment, the distance between codewords in the constant-similarity codebase is greater than a distance threshold, which is a positive integer greater than 0. Thus, by using a constant-similarity codebase with significant differences between codewords to encode uplink control information data, the diversity of the encoded uplink control information data can be increased, thereby reducing the bit error rate.

[0012] In some specific implementations of the first aspect, the first codebook is obtained by expanding the second constant-repetition codebook among multiple constant-repetition codebooks. The second constant-repetition codebook is a constant-repetition codebook among multiple constant-repetition codebooks in which the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for the uplink control information data, and the number of columns is less than the amount of data corresponding to each codeword. Furthermore, the number of columns in the first codebook is different from that in the second constant-repetition codebook.

[0013] Specifically, the first codebook can be generated as follows: From multiple constant-repetition codebooks, determine a second constant-repetition codebook where the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for uplink control information data, and the number of columns is less than the amount of data required to be transmitted for each codeword; generate a first extended sequence based on a multi-level digital phase-shift keying modulation symbol set; and extend the second constant-repetition codebook based on the first extended sequence to obtain the first codebook. It can be understood that the first codebook here is the constant-repetition codebook extended below.

[0014] For example, uplink control information data sent by a user equipment to a base station occupies one resource block per time slot, uses four OFDM symbols in the time domain, and each codeword requires the transmission of 9 bits of data. To ensure that each 9-bit uplink control information data can be modulated using a unique codeword from the codebook, a second constant-repetition codebook can be selected from a set of pre-set constant-repetition codebooks. This second constant-repetition codebook has the same number of rows as the number of OFDM symbols required for the uplink control information data and the same number of columns as the amount of data required per codeword. Since the larger the dimension of the codeword, the greater the difference between codewords, an extension sequence can be used to extend the second constant-repetition codebook to obtain the first codebook.

[0015] In this embodiment, the distance between codewords in the constant-similarity codebase is greater than a distance threshold, which is a positive integer greater than 0. Thus, by expanding the constant-similarity codebase with significant differences between codewords before encoding the uplink control information data, the diversity of the encoded uplink control information data can be further increased, thereby further reducing the bit error rate.

[0016] In some specific implementations of the first aspect, the first codebook is obtained by sparse processing of the second codebook. The second codebook is obtained by expanding the second constant codebook among multiple constant code base codebooks. The second constant code base codebook is a constant code base codebook among multiple constant code base codebooks in which the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for the uplink control information data, and the number of columns is less than the amount of data corresponding to each codeword.

[0017] Specifically, the first codebook can be generated as follows: From multiple constant-repetition codebooks, determine a second constant-repetition codebook where the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for uplink control information data, and the number of columns is less than the amount of data required to be transmitted for each codeword; generate a first extended sequence based on a multi-level digital phase-shift keying modulation symbol set; extend the second constant-repetition codebook based on the first extended sequence to obtain the second codebook; and perform sparse processing on the second codebook based on a ZC sequence to obtain the first codebook. It can be understood that the first codebook here is the constant-repetition codebook sparse regression codebook mentioned below.

[0018] For example, uplink control information data sent by a user equipment to a base station occupies one resource block per time slot, uses four OFDM symbols in the time domain, and each codeword requires the transmission of 9 bits of data. To ensure that each 9-bit uplink control information data can be modulated using a unique codeword from the codebook, a second constant-repetition codebook can be selected from a set of pre-set constant-repetition codebooks. This second constant-repetition codebook has the same number of rows as the number of OFDM symbols required for the uplink control information data and the same number of columns as the amount of data transmitted per codeword. Since the larger the dimension of the codewords, the greater the difference between codewords, an extension sequence can be used to extend the second constant-repetition codebook to obtain the second codebook. Since the fewer non-zero elements in the codebook, the greater the difference between codewords, a ZC sequence matrix can be used to sparsify the second codebook, for example, by making the columns of the second codebook orthogonal to obtain the first codebook.

[0019] In this embodiment, the distance between codewords in the constant-similarity codebase is greater than a distance threshold, which is a positive integer greater than 0. Thus, by expanding the constant-similarity codebase with significant differences between codewords, followed by sparsity processing, and then encoding the uplink control information data, the diversity of the encoded uplink control information data can be increased again, thereby further reducing the bit error rate.

[0020] In some specific implementations of the first aspect, the second constant-multiplication codebase can be expanded using the following formula:

[0021]

[0022] Among them, S j It can represent the codeword in the second constant-repetition codebook. It can represent the codeword in the first codebook. It can represent tensor product calculation, e j％k It can represent an extended sequence, and j%k can represent the remainder when j is divided by k.

[0023] In some specific implementations of the first aspect, sparse processing includes any one of ZC sequence matrix, Fourier matrix, or complex Hamad matrix.

[0024] In some specific implementations of the first aspect, the distance between codewords in the first codebook is the Hamming distance.

[0025] It is understood that the distance between codewords in the first codebook can also be the Levenstein distance, the minimum code distance, etc., and this application does not make specific limitations in the embodiments.

[0026] It is understandable that the base station can decode the modulated signal based on the first codebook to obtain uplink control information data.

[0027] Secondly, embodiments of this application provide a communication method applied to a base station. The method includes: receiving a modulated signal transmitted by a user equipment, wherein the modulated signal is obtained by the user equipment modulating uplink control information data based on a first codebook, wherein the distance between codewords in the first codebook is greater than a distance threshold, and the distance threshold is greater than 0; the first codebook is used to decode the modulated signal to obtain the uplink control information data.

[0028] In some specific implementations of the second aspect, the first codebook is a first constant-repetition codebook in which the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for the uplink control information data, and the number of columns is equal to the amount of data corresponding to each codeword.

[0029] In some specific implementations of the second aspect, the first codebook is obtained by expanding the second constant-repetition codebook among multiple constant-repetition codebooks. The second constant-repetition codebook is a constant-repetition codebook among multiple constant-repetition codebooks in which the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for the uplink control information data, and the number of columns is less than the amount of data corresponding to each codeword. Furthermore, the number of columns in the first codebook is different from that in the second constant-repetition codebook.

[0030] In some specific implementations of the second aspect, the first codebook is obtained by sparse processing of the second codebook. The second codebook is obtained by expanding the second constant codebook among multiple constant code base codebooks. The second constant code base codebook is a constant code base codebook among multiple constant code base codebooks in which the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for the uplink control information data, and the number of columns is less than the amount of data corresponding to each codeword.

[0031] In some specific implementations of the second aspect, the second constant-multiplication codebase is expanded using the following formula:

[0032]

[0033] Among them, S j It can represent the codeword in the second constant-repetition codebook. It can represent the codeword in the first codebook. It can represent tensor product calculation, e j％k It can represent an extended sequence, and j%k can represent the remainder when j is divided by k.

[0034] In some specific implementations of the second aspect, sparse processing includes any one of ZC sequence matrix, Fourier matrix, or complex Hamad matrix.

[0035] In some specific implementations of the second aspect, the distance between codewords in the first codebook is the Hamming distance.

[0036] Thirdly, embodiments of this application provide a communication method applied to a communication system, the communication system including a user equipment and a base station, and the method including: the user equipment detecting uplink control information data to be transmitted; the user equipment transmitting a modulation signal corresponding to the uplink control information data to the base station; the base station receiving the modulation signal transmitted by the user equipment; wherein the modulation signal is obtained by modulating the uplink control information data based on a first codebook, the distance between codewords in the first codebook is greater than a distance threshold, the distance threshold is greater than 0, and the first codebook is used to decode the modulation signal to obtain the uplink control information data.

[0037] In some specific implementations of the third aspect, the first codebook is a first constant-repetition codebook in which the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for the uplink control information data, and the number of columns is equal to the amount of data corresponding to each codeword.

[0038] In some specific implementations of the third aspect, the first codebook is obtained by expanding the second constant-repetition codebook among multiple constant-repetition codebooks. The second constant-repetition codebook is a constant-repetition codebook among multiple constant-repetition codebooks in which the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for the uplink control information data, and the number of columns is less than the amount of data corresponding to each codeword. Furthermore, the number of columns in the first codebook is different from that in the second constant-repetition codebook.

[0039] In some specific implementations of the third aspect, the first codebook is obtained by sparse processing of the second codebook. The second codebook is obtained by expanding the second constant codebook among multiple constant code base codebooks. The second constant code base codebook is a constant code base codebook among multiple constant code base codebooks in which the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for the uplink control information data, and the number of columns is less than the amount of data corresponding to each codeword.

[0040] In some specific implementations of the third aspect, the second constant-multiplication codebase is expanded using the following formula:

[0041]

[0042] Among them, S j It can represent the codeword in the second constant-repetition codebook. It can represent the codeword in the first codebook. It can represent tensor product calculation, e j％k It can represent an extended sequence, and j%k can represent the remainder when j is divided by k.

[0043] In some specific implementations of the third aspect, sparse processing includes any one of ZC sequence matrix, Fourier matrix, or complex Hamad matrix.

[0044] In some specific implementations of the third aspect, the distance between codewords in the first codebook is the Hamming distance.

[0045] Fourthly, this application provides an electronic device, including: a memory for storing instructions executed by one or more processors of the electronic device, and a processor, which is one of the one or more processors of the electronic device, for executing the communication method mentioned in the first aspect or any one of the first aspects of this application.

[0046] Fifthly, this application provides a readable storage medium storing instructions that, when executed on an electronic device, cause the electronic device to perform the communication method mentioned in the first aspect or any of the first aspects of this application.

[0047] In a sixth aspect, embodiments of this application provide a computer program product, which includes computer instructions. When executed by an electronic device, the electronic device executes the computer program code of the communication method mentioned in the first aspect or any one of the first aspects of this application.

[0048] The beneficial effects of the second to sixth aspects mentioned above can be referred to the relevant descriptions in the first aspect and its various possible implementations, which will not be repeated here. Attached Figure Description

[0049] Figure 1 A schematic diagram of a wireless communication system 100 is shown according to some embodiments of this application;

[0050] Figure 2 According to some embodiments of this application, a schematic diagram of a resource block using non-coherent transmission in PUCCH Format0 is shown;

[0051] Figure 3A According to some embodiments of this application, a schematic diagram of a resource block using coherent transmission in PUCCH Format 1 is shown;

[0052] Figure 3B According to some embodiments of this application, a schematic diagram of a resource block using coherent transmission in PUCCH Format 4 is shown;

[0053] Figure 4 According to some embodiments of this application, a schematic diagram of a resource block using non-coherent transmission in PUCCH Format 4 is shown;

[0054] Figure 5 According to some embodiments of this application, a flowchart of a communication method is shown;

[0055] Figure 6A According to some embodiments of this application, a partial schematic diagram of a constant-repetition codebase is shown;

[0056] Figure 6B According to some embodiments of this application, a schematic diagram of another part of a constant-repetition codebase is shown;

[0057] Figure 7 According to some embodiments of this application, a schematic diagram of a constant-weight code extension codebook is shown;

[0058] Figure 8 According to some embodiments of this application, a partial schematic diagram of a constant-repetition code extension codebook is shown;

[0059] Figure 9 According to some embodiments of this application, a schematic diagram of a constant-weight sparse regression codebook is shown;

[0060] Figure 10 According to some embodiments of this application, a schematic diagram of performance comparison curves for modulating UCI data to be transmitted based on different codebooks is shown.

[0061] Figure 11 According to some embodiments of this application, a schematic diagram of the architecture of a communication system is shown;

[0062] Figure 12According to some embodiments of this application, a schematic diagram of the hardware structure of an electronic device is shown. Detailed Implementation

[0063] The illustrative embodiments of this application include, but are not limited to, a communication method, an electronic device, a readable storage medium, and a computer program product.

[0064] It is understood that the technical solutions involved in this application can be applied to any electronic device with wireless communication capabilities. In some optional examples, the electronic device may also be referred to as a terminal, user equipment (UE), mobile station (MS), mobile terminal (MT), etc. For ease of explanation, the following description uses user equipment as an example.

[0065] Among them, user equipment can be mobile phones, smart TVs, wearable devices, tablets, computers with wireless transceiver capabilities, virtual reality (VR) terminal devices, augmented reality (AR) terminal 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, and so on.

[0066] Before introducing the technical solutions mentioned in the embodiments of this application, the terms included in the embodiments of this application will be explained first.

[0067] (1) Physical uplink control channel: The channel through which user equipment sends uplink control information data to the base station. Uplink control information is also called uplink control information.

[0068] (2) Slot: The unit of data transmission. In the fifth-generation mobile communication standard, the length of one slot is 14 OFDM symbols.

[0069] (3) Resource block (RB): In the time domain, the smallest resource granularity is an orthogonal frequency division multiplexing symbol; in the frequency domain, the smallest granularity is a subcarrier. In the new radio technology of fifth-generation mobile communication systems, all OFDM symbols and 12 subcarriers in a time slot constitute a resource block.

[0070] (4) Codebook: A set of predefined codes or signal patterns that can be used to modulate UCI data.

[0071] (5) Channel estimation: By analyzing and processing the signal, the channel effects that the signal suffers during transmission are estimated, such as signal attenuation, phase shift, multipath delay, etc.

[0072] (6) Constant weight code basic codebook: A codebook used for encoding, in which codewords have the same importance or weight, and the minimum Hamming distance between codewords is fixed and greater than 0.

[0073] (7) Hamming distance between codewords: The number of different bits between two codewords, used to measure the degree of difference between the two codewords. For example, the larger the Hamming distance between two codewords, the greater the degree of difference between the two codewords, and the lower the correlation between the two codewords. Specifically, the least significant bit "0" in codeword "0000" is different from the least significant bit "1" in codeword "0001", so the Hamming distance between codewords "0000" and codeword "0001" is 1. The least significant bit "0" in codeword "0000" is different from the least significant bit "1" in codeword "0011", and the second least significant bit "0" in codeword "0000" is different from the second least significant bit "1" in codeword "0011", so the Hamming distance between codewords "0000" and codeword "0011" is 2. The difference between codewords “0000” and “0001” is less than the difference between codewords “0000” and “0011”, and the correlation between codewords “0000” and “0001” is higher than the correlation between codewords “0000” and “0011”.

[0074] (8) Bit error rate: The ratio of the amount of data that is erroneous to the total amount of data transmitted during data transmission.

[0075] The following describes the scenarios in which the communication methods mentioned in the embodiments of this application are applied.

[0076] For reference Figure 1The wireless communication system 100 shown includes a user equipment 110 and a base station 120. During communication, the user equipment 110 can select different physical uplink control channel formats to send UCI data to the base station 120, depending on the type of UCI data it needs to send. Different PUCCH formats have different carrying capacities and different modulation schemes.

[0077] In some specific implementations, UCI data may include: acknowledgment / negative acknowledgement (ACK / NACK) feedback for demodulation of the physical downlink shared channel (PDSCH), measurement results of the channel state information reference signal (CSI-RS) for feedback, and scheduling request (SR) for requesting scheduling resources for the physical uplink shared channel (PUSCH).

[0078] In the New Radio (NR) interface of fifth-generation mobile communication systems, the defined PUCCH formats include PUCCH Format0, PUCCH Format1, PUCCH Format2, PUCCH Format3, and PUCCH Format4. PUCCH Format0 uses incoherent transmission, while PUCCH Format1, PUCCH Format2, PUCCH Format3, and PUCCH Format4 use coherent transmission based on channel estimation using a demodulation reference signal.

[0079] The following section introduces the data transmission methods for PUCCH Format 0, PUCCH Format 1, PUCCH Format 2, PUCCH Format 3, and PUCCH Format 4 as defined by 5G-NR.

[0080] First, the specific implementation method of using non-coherent transmission in PUCCH Format0 will be introduced.

[0081] It is understood that in incoherent transmission, the modulated signal sent by user equipment 110 to base station 120 includes UCI data but does not include DMRS data. The UCI data can be modulated and demodulated based on a codebook. As mentioned earlier, a codebook is a set of predefined coding or signal patterns that can be used to modulate UCI. For example, user equipment 110 uses the codebook to modulate UCI data, obtains a modulated signal, and sends the modulated signal to base station 120. After receiving the modulated signal, base station 120 can demodulate the modulated signal based on a pre-stored codebook to obtain the UCI data. The codebook pre-stored by base station 120 is the same as the codebook used by user equipment 110 to modulate UCI.

[0082] like Figure 2 As shown, during the communication process, the UCI data sent by a single user equipment 110 to the base station 120 occupies one resource block in each time slot and one OFDM symbol in the time domain, that is, it occupies 12 OFDM symbols on 12 subcarriers.

[0083] Assuming that user equipment 110 sends 1 bit of UCI data to base station 120, the codebook can be written as follows: (i.e., codebook A is a complex matrix of size 12×2), where each column of codebook A can be generated based on different cyclic shifts (i.e., columns are orthogonal) of the ZC sequence (a special linear frequency modulated pulse compression sequence proposed by Zadoff and Chu). User equipment 110 can select any column in codebook A to modulate UCI data and send the modulated signal to base station 120.

[0084] After receiving the modulated signal, the base station 120 can perform correlation detection on each column of the modulated signal and codebook A (for example, calculate the vector inner product of the modulated signal and each column of codebook A). When the correlation between the modulated signal and a certain column of codebook A is greater than the correlation threshold, the modulated signal can be demodulated based on that column of codebook A to demodulate the UCI data sent by the user equipment 110.

[0085] Secondly, taking PUCCH Format 1 and PUCCH Format 4 as examples, we will introduce specific implementation methods for coherent transmission using DMRS-based channel estimation.

[0086] It is understood that in coherent transmission, the data sent by user equipment 110 to base station 120 includes UCI data and DMRS data. For example, when user equipment 110 sends UCI data and DMRS data to base station 120, after base station 120 receives the UCI data and DMRS data, it can perform channel estimation based on pre-stored demodulation reference signals and the received demodulation reference signals to estimate the channel effects on the UCI data during transmission, such as signal attenuation, phase shift, and multipath delay. Then, based on signal attenuation, phase shift, and multipath delay, the received UCI data can be recovered to obtain the UCI data sent by user equipment 110.

[0087] like Figure 3A As shown, PUCCH Format 1 can support user equipment 110 to send 2 bits of UCI data to base station 120. UCI data occupies 4 to 14 OFDM symbols in the time domain, and each OFDM symbol occupies one resource block in the frequency domain. Furthermore, according to the 3rd Generation Partnership Project (3GPP) definition, OFDM symbols can carry both UCI data and DMRS data, with UCI data and DMRS data placed alternately, and the number of OFDM symbols occupied by UCI data and DMRS data being distributed as evenly as possible.

[0088] like Figure 3B As shown, PUCCH formats 1, 2, 3, and 4 can support user equipment 110 to send more than 2 bits of UCI data to base station 120. UCI data occupies 4–14 OFDM symbols in the time domain, and each OFDM symbol occupies one resource block in the frequency domain. Similar to PUCCH Format 1, OFDM symbols can carry both UCI data and DMRS data. To transmit more UCI data, the number of OFDM symbols occupied by UCI data (hereinafter referred to as UCI data symbols) is greater than the number of OFDM symbols occupied by DMRS data (hereinafter referred to as DMRS symbols).

[0089] Assume that there are N DMRS symbols. p =24, denoted as UCI data symbols include N d =144, denoted as If base station 120 is equipped with N M There are one receiving antenna, and the channel coherence condition is satisfied within one resource block (denoted as ). If the channel transmission characteristics remain stable within one resource block, then the DMRS data and UCI data received by base station 120 can be expressed in the forms shown in formula (1) and formula (2), respectively:

[0090]

[0091] Among them, Y p "Can" can represent the DMRS symbols received by base station 120, and the dimension can be N. M ×N p H can represent the channel transmission characteristics, X P This can represent the DMRS symbol sent by user equipment 110. T "Can represent the transpose of a vector or matrix, for example, X P T X represents P The transpose of .

[0092] It is understandable that, since the DMRS data carried by PUCCH Format 4 has known characteristics, such as being a specific sequence, the base station 120 can perform channel estimation based on the known characteristics of the DMRS data carried by PUCCH Format 4 and the characteristics of the received DMRS data, i.e., based on Y... p and X p Estimate the transmission characteristics of PUCCH, for example

[0093] Y d =HX d T Formula (2)

[0094] Among them, Y d H can represent the UCI data received by base station 120, H can represent the channel transmission characteristics, and X can represent the channel transmission characteristics. d This can represent the UCI data sent by user equipment 110. T "Can represent the transpose of a vector or matrix, for example, X d T X represents d The transpose of .

[0095] It is understandable that after estimating the transmission characteristics of PUCCH, base station 120 can determine the transmission characteristics based on the received UCI data Y. d and PUCCH transmission characteristics Demodulate the UCI data X sent by user equipment 110 d .

[0096] It is evident that in the coherent transmission methods of PUCCH formats 1, 2, 3, and 4, the density of DMRS symbols has a significant impact on PUCCH transmission performance. If the DMRS symbols are sparse, the number of samples used for channel estimation in the time domain decreases, leading to reduced accuracy in channel estimation. Conversely, if the DMRS symbols are dense, the amount of UCI data carried decreases. Therefore, the coherent transmission methods of PUCCH formats 1, 2, 3, and 4 based on DMRS for channel estimation result in reduced data transmission performance.

[0097] Therefore, in some specific implementations, non-coherent transmission can be used in PUCCH Format 1, Format 2, Format 3, and Format 4 to improve PUCCH transmission performance. Specifically, the N-sequence codebook can be used to modulate UCI data to obtain a modulated signal, which is then sent to the base station 120, thereby enabling non-coherent transmission in PUCCH Format 1, PUCCH Format 2, PUCCH Format 3, and PUCCH Format 4. However, since each codeword in the N-sequence codebook is obtained by randomly selecting multiple (e.g., 2, 3, or 4) codewords from a random sequence codebook (i.e., concatenating them), for example, it can be obtained by randomly selecting multiple codewords from several M-sequence codewords. Since different N-sequence codewords can happen to select the same M-sequence codewords for combination, this may result in a Hamming distance of 0 between the newly combined codewords, meaning that the correlation between the new codewords is high. The smaller the Hamming distance between codewords in the codebook, the weaker the anti-interference capability of the modulated signal obtained using that codebook. Therefore, the high correlation between codewords in the N-sequence codebook results in weak anti-interference capability of the modulated signal obtained by modulating with the N-sequence codebook, which can easily lead to errors when the base station 120 decodes the modulated signal, thereby increasing the bit error rate.

[0098] For example, some of the codewords included in the random sequence codebook are shown in the table below:

[0099]

[0100] It can be seen that the Hamming distance between each pair of the three sequences in columns 1, i, and j is 2. Next, combining the codeword "1000" in column 1 and the codeword "0100" in column i yields the first new codeword "10000100". Combining "1000" in column 1 and the codeword "0001" in column j yields the second new codeword "10000001". Combining "0001" in column j and the codeword "0100" in column 1 yields the third new codeword "00011000". Combining "1000" in column 1 and the codeword "0100" in column i yields the fourth new codeword "10000100". The Hamming distance between the third new codeword "00011000" and the other three new codewords is 4. However, the Hamming distance between the first new codeword "10000100" and the second new codeword "10000001" is still 2. That is, the Hamming distance between the first new codeword "10000011" and the second new codeword "10000001" is small because the first sequence in the combination is repeated. In addition, the fourth new codeword "10000100" is completely repeated with the first new codeword "10000100", that is, the Hamming distance is 0, the degree of difference is low and the correlation is high.

[0101] like Figure 4 As shown, user equipment 110 divides 14 OFDM symbols within a resource block into two equal parts in the time domain, each part having N c =7 × 12 = 84 OFDM symbols, and the UCI data is modulated through the following steps:

[0102] First, generate a random sequence codebook. (i.e., the size of the random sequence codebook B is N) C ×N L The binary matrix), each column of the random sequence codebook B is an M-sequence (also called a codeword), where an M-sequence is a pseudo-random sequence, and an M-sequence is infinitely larger than its own inner length and infinitely smaller than the inner length of another M-sequence.

[0103] Secondly, to improve channel bandwidth utilization and reduce interference from adjacent channels, the random sequence codebook B can be modulated. In some specific examples, the random sequence codebook B can be modulated according to... Modulation (i.e., replacing 0 and 1 with) and ), thus obtaining the π / 2-BPSK-M codebook.

[0104] Finally, since the longer the codeword, the more difficult it is to crack, to increase the security of UCI data, an N-sequence codebook can be generated based on the π / 2-BPSK-M codebook. In some specific examples, two columns can be randomly selected from the π / 2-BPSK-M codebook and combined to obtain a codebook of length N. d =2N C The codewords are used to obtain a new N-sequence codebook. in Indicates from N L The number of combinations of randomly selecting 2 columns from N. L When b = 65, b = 11, that is, N sequence codebook A N It is a device that can use N d = 144 OFDM symbols, with a transmission length of 11 bits for the incoherent transmission codebook.

[0105] It is understandable that using the N sequence codebook A N The non-coherent transmission method, compared to the coherent transmission method in the existing 5G standard (which uses 144 OFDM symbols to transmit 11 bits of UCI data), can achieve the same performance with a 1-2.7 dB reduction in user equipment transmit power. This proves that non-coherent transmission can be extended from PUCCH Format 0 to PUCCH Format 1, PUCCH Format 2, PUCCH Format 3 and PUCCH Format 4, which can improve PUCCH coverage distance, or increase the amount of UCI data that PUCCH can carry at the same distance.

[0106] However, since the Hamming distance between codewords in the random sequence codebook B may be 0, the Hamming distance between codewords in the N-sequence codebook constructed based on the random sequence codebook B may also be 0. As a result, the correlation between codewords in the N-sequence codebook is high, and the anti-interference capability of the modulated signal obtained by modulating using the N-sequence codebook is weak. This can easily lead to errors when the base station 120 decodes the modulated signal, thereby increasing the bit error rate.

[0107] Therefore, to address the issue of increased bit error rate when using an N-sequence codebook for UCI data transmission, this application provides a communication method. In this method, a first codebook can be configured where the differences between codewords are relatively large (e.g., the minimum distance between codewords (e.g., Hamming distance) is greater than a preset distance threshold, where the preset distance threshold is any value greater than 0). During the transmission of UCI data to the base station, the user equipment can encode the UCI data based on this first codebook and transmit the encoded UCI data to the base station. Correspondingly, after receiving the encoded UCI data, the base station can decode the received encoded UCI data based on the first codebook to obtain the UCI data. Thus, by using a codebook with a large difference between codewords to encode the UCI data, the diversity of the encoded UCI data can be increased, thereby reducing the bit error rate.

[0108] In some specific implementations, when a user equipment (UE) needs to transmit UCI data, it can generate a first codebook based on the number of OFDM symbols required for the UCI data, and modulate the UCI data using the generated first codebook. It then transmits information to the base station indicating the method for generating the first codebook (e.g., the number of OFDM symbols required for the UCI data). The base station can then generate the first codebook based on the received information indicating the method for generating the first codebook, and demodulate the received modulated signal using the first codebook.

[0109] In some implementations, since the minimum Hamming distance between codewords in the constant-double code base codebook is greater than 0, that is, the degree of difference between codewords is large, the first codebook can be a constant-double code base codebook where the minimum Hamming distance between codewords is greater than a preset Hamming distance threshold.

[0110] In other implementations, the first codebook can be obtained by expanding each codeword in the constant-similarity codebase (e.g., increasing the dimension of the codewords). For example, the M-PSK modulation symbol set can be used to expand each codeword in the constant-similarity codebase. Since the larger the dimension of the codeword, the greater the difference between codewords, expanding each codeword in the constant-similarity codebase can further increase the difference between codewords, thereby further increasing the diversity of the encoded UCI data and reducing the bit error rate.

[0111] In other implementations, the first codebook can be obtained by expanding (e.g., increasing the dimension of the codewords) of the constant-similarity codebase and then performing sparse processing. For example, the user equipment can use ZC sequence matrices, Fourier matrices, complex Hamadal matrices, etc., to perform sparse processing on the expanded codebook. Since sparse processing can reduce the number of non-zero elements in the codebook, and the fewer the number of non-zero elements in the codebook, the greater the difference between codewords, expanding the codewords in the constant-similarity codebase and then performing sparse processing can further increase the difference between codewords, thereby further increasing the diversity of the encoded UCI data and reducing the bit error rate.

[0112] In some implementations, the degree of difference between codewords can be represented by Hamming distance, or by other distances, such as Levenstein distance, minimum code distance, etc.

[0113] In some implementations, the degree of difference between codewords can be represented in ways other than distance, such as code weight.

[0114] The communication methods mentioned in the embodiments of this application will be described in detail below. For example... Figure 5 The diagram illustrates a flowchart of a communication method, which can be executed by a user equipment. Specifically, the method may include:

[0115] 501: Uplink control information data to be transmitted has been detected.

[0116] 502: Transmit the modulated signal corresponding to the uplink control information data to the base station. The modulated signal is obtained by modulating the uplink control information data based on the first codebook. The distance between codewords in the first codebook is greater than a distance threshold, and the distance threshold is greater than 0.

[0117] In some specific implementations, the first codebook is a first constant-repetition codebook among multiple constant-repetition codebooks, in which the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for uplink control information data, and the number of columns is equal to the amount of data corresponding to each codeword.

[0118] Specifically, the first codebook can be generated in the following way: from multiple constant-repetition codebooks, determine a first constant-repetition codebook in which the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for uplink control information data, and the number of columns is equal to the amount of data required to be transmitted for each codeword; use the first constant-repetition codebook as the first codebook.

[0119] In some specific implementations, the first codebook is obtained by expanding the second constant codebook among multiple constant codebooks. The second constant codebook is a constant codebook among multiple constant codebooks in which the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for uplink control information data, and the number of columns is less than the amount of data corresponding to each codeword. Furthermore, the number of columns in the first codebook and the second constant codebook are different.

[0120] Specifically, the first codebook can be generated in the following way: from multiple constant-repetition codebooks, determine a second constant-repetition codebook where the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for uplink control information data, and the number of columns is less than the amount of data required to be transmitted for each codeword; generate a first extended sequence based on a multi-level digital phase shift keying modulation symbol set; and extend the second constant-repetition codebook based on the first extended sequence to obtain the first codebook.

[0121] In some specific implementations, the first codebook is obtained by sparse processing of the second codebook. The second codebook is obtained by expanding the second constant codebook among multiple constant code base codebooks. The second constant code base codebook is a constant codebook among multiple constant code base codebooks in which the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for uplink control information data, and the number of columns is less than the amount of data corresponding to each codeword.

[0122] Specifically, the first codebook can be generated in the following way: from multiple constant-repetition codebooks, determine a second constant-repetition codebook where the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for uplink control information data, and the number of columns is less than the amount of data required to be transmitted for each codeword; generate a first extended sequence based on a multi-level digital phase shift keying modulation symbol set; extend the second constant-repetition codebook based on the first extended sequence to obtain the second codebook; and perform sparse processing on the second codebook based on the ZC sequence to obtain the first codebook.

[0123] In some specific implementations, sparse processing includes any one of ZC sequence matrices, Fourier matrices, and complex Hamad matrices.

[0124] In some specific implementations, the distance between codewords in the first codebook is the Hamming distance, but it can also be the Levenstein distance, minimum code distance, etc. The embodiments of this application do not make specific limitations.

[0125] It is understandable that the base station can decode the modulated signal based on the first codebook to obtain uplink control information data.

[0126] In some specific implementations, since the larger the dimension of the codeword, the fewer the number of non-zero elements in the codebook, and the greater the difference between codewords, each codeword in the constant-duplication codebook can be expanded to increase the dimension of the codeword, and then the expanded codebook can be sparsely processed to obtain the first codebook.

[0127] The following example illustrates how user equipment 110 sends UCI data to base station 120 using PUCCH Format 4. Figure 5 The method for determining the first codebook, as described in the previous section, will be explained in detail. In some specific implementations, the first codebook (hereinafter referred to as the constant-weight sparse regression codebook) can be generated in the following way:

[0128] Suppose that the UCI data to be transmitted sent by user equipment 110 to base station 120 occupies one resource block in each time slot, occupies 4 OFDM symbols in the time domain, and each codeword needs to transmit 9 bits of data.

[0129] The first step, to ensure that each 9-bit UCI data to be transmitted can be modulated using unique codewords from the codebook, is to select a constant-repetition codebook from a set of pre-set constant-repetition codebooks that matches the number of OFDM symbols required for the UCI data to be transmitted. For example, when the codebook is represented by a matrix, the rows of the matrix can represent the number of codewords, and the columns of the matrix can represent the dimensions of the codewords. Thus, a constant-repetition codebook with the same number of rows as the number of OFDM symbols required for the UCI data to be transmitted can be selected.

[0130] In some optional implementations, the size of the constant-weight sparse regression codebook to be generated can be determined based on the number of OFDM symbols required for the UCI data to be transmitted and the amount of data to be transmitted for each codeword.

[0131] For example, when the UCI data to be transmitted occupies 4 OFDM symbols in the time domain, the size of the constant-weight sparse regression codebook to be generated can be determined based on the following formulas (3) and (4):

[0132] B = n × 12 (Formula 3)

[0133] Where B can represent the number of rows of the constant-weight sparse regression codebook to be generated, the number of rows can represent the number of codewords in the constant-weight sparse regression codebook, and n can represent the number of OFDM symbols occupied by the UCI data to be transmitted in the time domain. For example, when the number of OFDM symbols occupied by the UCI data to be transmitted in the time domain is 4, B can be 48.

[0134] log2N=m formula (4)

[0135] Where N can represent the number of columns in the constant-weight sparse regression codebook to be generated, the number of columns can represent the dimension of each codeword in the constant-weight sparse regression codebook, and m can represent the amount of data that needs to be transmitted for each codeword. For example, when the amount of data that needs to be transmitted for each codeword m is 9, N can be 512.

[0136] Thus, from multiple constant-weight codebases, a constant-weight codebase can be selected where the number of rows equals the number of rows in the desired constant-weight sparse regression codebase, and the number of columns is less than the number of columns in the desired constant-weight sparse regression codebase. For example, a codebase with B = 48 rows and D = 2 columns can be selected. 6 =64 is the basic codebook of constant-similarity codes. The basic codebook of constant-similarity codes can take the following format:

[0137] C (B,d,w) ∈{0,1} B×D =[c0,c1,…c D-1 ]

[0138] Where B can represent the number of rows in the desired constant-weight sparse regression codebook, and d can represent the minimum Hamming distance between two constant-weight codewords in the constant-weight codebook. For example, the minimum Hamming distance d can be 8, i.e. w can represent the number of non-zero elements in each constant-weight codeword. For example, the number of non-zero elements in a constant-weight codeword can be 6, i.e., ||c i ||0=w=6, where Thus, the fundamental codebook of constant-duplication codes can be divided into w = 6 fundamental codebooks (e.g. Figure 6A and Figure 6B As shown), to facilitate subsequent processing, i.e., C (B,d,w) =S0+S1+…+S w-1 .

[0139] exist Figure 6A and 6B In the diagram, the horizontal axis represents the number of columns in the basic codebook, the vertical axis represents the number of rows in the basic codebook, and the color represents the real part of the code element in each codeword in the basic codebook. The real part of the code element has two values: 0 and 1.

[0140] In some specific implementations, a constant-weight codebase can be selected from multiple constant-weight codebases, where the number of rows equals the number of rows in the desired constant-weight sparse regression codebase, and the number of columns equals the number of columns in the desired constant-weight sparse regression codebase. For example, a codebase with B = 48 rows and D = 2 columns can be selected. 9 =512 is the basic codebook of constant-repetition codes. To avoid repetition, it will not be elaborated here.

[0141] The second step is to expand the basic codebook of constant-repetition codes to obtain the extended codebook of constant-repetition codes.

[0142] In some optional instances, since the greater the dimension of the codewords, the greater the difference between codewords, an extended sequence can be used to extend the basic codebook of constant-similarity codes, resulting in an extended codebook of constant-similarity codes in the following format:

[0143]

[0144] Where M can represent the modulation order, such as 2 mentioned above, k can represent the expansion dimension, such as 3 mentioned above, B can represent the number of rows of the constant-weight sparse regression codebook to be generated, such as 48 mentioned above, d can represent the minimum Hamming distance between two constant-weight codewords in the constant-weight codebook, w can represent the number of non-zero elements in each constant-weight codeword, and N can represent the number of columns of the constant-weight sparse regression codebook to be generated, such as 512 mentioned above.

[0145] In some specific implementations, extended sequences The following algorithm can be used to generate it:

[0146] First, input the modulation order M and the expansion dimension k.

[0147] In some optional instances, the modulation order M can be set to 2 and the expansion dimension to 3.

[0148] Secondly, initialize the multiple phase shift keying (M-PSK) modulation symbol set. For example, the M-PSK can be initialized based on the input modulation order, such that M=2.

[0149] Specifically, the multi-level digital phase-shift keying modulation symbol set can adopt the following format:

[0150]

[0151] When M=2, the binary phase shift keying (BPSK) modulation symbol set can be in the following format:

[0152] d = [1, -1]

[0153] Then, p is set to 0, 1, ... k-1 in sequence, and the calculation shown in formula (5) is performed:

[0154]

[0155] When l is set to 0, each element M in d is repeated. p =2 0 Next, we can get d a = [1, -1].

[0156] When l is set to 1, each element M in d is repeated. p =2 1 Next, we can get d a = [1, 1, -1, -1].

[0157] When l is set to 2, each element M in d is repeated. p =2 2 Next, we can get d a = [1, 1, 1, 1, -1, -1, -1, -1, -1].

[0158] Finally, repeat d. a element M k-p-1 This process yields the extended sequence.

[0159] Next, when p is set to 0, repeat d. a Overall M k-p-1 =2 2 This yields e0 = [1, -1, 1, -1, 1, -1, 1, -1, -1].

[0160] When p is set to 1, repeat d. a Overall M k-p-1 =2 1 This yields e1 = [1, 1, -1, -1, 1, 1, -1, -1].

[0161] When p is set to 2, repeat d. a Overall M k-p-1 =2 0 This yields e2 = [1, 1, 1, 1, -1, -1, -1, -1, -1].

[0162] Thus, the following extended sequence can be generated:

[0163] e0 = [1 -1 1 -1 1 -1 1 -1]

[0164] e1 = [1 1 -1 -1 1 1 -1 -1]

[0165] e2 = [1 1 1 1 -1 -1 -1 -1]

[0166] Finally, the basic codebook of the constant-repetition code can be expanded based on the extended sequence. Specifically, the basic codebook of the constant-repetition code can be expanded using formula (6) to obtain the following: Figure 7 The extended codebook of constant-duplication codes is shown. Figure 7In the diagram, the horizontal axis represents the number of columns in the constant-repetition code extension codebook, the vertical axis represents the number of rows, and the color represents the real part of the code elements in each codeword within the constant-repetition code extension codebook. Since the binary phase-shift keying modulation symbol set is [1, -1] when M is 2, the real part of the code elements has three possibilities: -1, 0, and 1. When M is other values, the multi-level phase-shift keying modulation symbol set has other values, and correspondingly, the real part of the code elements in each codeword within the constant-repetition code extension codebook has other possibilities. This embodiment does not impose specific limitations on these possibilities.

[0167]

[0168] in, It can represent the calculation of the tensor product (Kronecker product), and j%k can represent the remainder when j is divided by k.

[0169] For example, some codewords from the third basic codebook in the constant-duplication codebook are shown in the table below:

[0170]

[0171] The corresponding codewords obtained in the constant-multiplication codebook are shown below:

[0172]

[0173] For example, the above formula (6) can be used to split multiple sparse matrices obtained by splitting the constant-weight codebase (e.g. Figure 6A and Figure 6B Expanding upon Sparse Set 0, Sparse Set 2, and Sparse Set 4, we can obtain, as follows: Figure 8 The extended codebook shown.

[0174] Thirdly, since the fewer non-zero elements in the codebook, the greater the difference between codewords, a ZC sequence matrix can be used to sparsify the constant-double-code extended codebook, for example, by making the columns of the constant-double-code extended codebook orthogonal. This yields, as shown below. Figure 9 The example shown is a sparse regressive codebook with constant-weight codes. Figure 9 In the diagram, the horizontal axis represents the number of columns in the constant-repetition code sparse regression codebook, the vertical axis represents the number of rows in the constant-repetition code sparse regression codebook, and the color represents the real part of the code elements in each codeword in the constant-repetition code sparse regression codebook. When using the ZC sequence matrix to perform sparsity processing on the constant-repetition code extended codebook, the real part of the code elements can be within the interval [-2.4, 2.4].

[0175] For any codeword in the codebook (e.g., constant-repetition extended codebook, constant-repetition sparse regressive codebook, etc.) Define peak-to-average power (PAPR):

[0176]

[0177] Among them, PAPR j Max can represent the peak-to-average power ratio (PAPR) of codeword j in the codebook. b (|s j,b | 2 () can represent the maximum value of the square of the real part of the codeword j, mean b (|s j,b | 2 ) can represent the maximum value of the average value of the real part of the codeword j.

[0178] like Figure 7 The peak-to-average power ratio (PAPR) of each codeword in the constant-repetition extended codebook shown can be 64, while... Figure 9 The peak-to-average power ratio (PAPR) of each codeword in the constant-weight code sparse regression codebook shown is within the range [4.96, 7.43]. It is understandable that the smaller the PAPR of the codewords in the codebook, the more uniform the energy distribution of the codebook. Furthermore, due to the nonlinear characteristics of devices, there are strict requirements for the PAPR of wireless signals. Therefore, it is understandable that the constant-weight code sparse regression codebook obtained by using the ZC sequence to sparsely process the constant-weight codebook has a large PAPR and a uniform energy distribution, which better meets the requirements of wireless communication.

[0179] It is understandable that Fourier matrices, complex Hamadal matrices, etc., can also be used to perform sparse processing on the constant-repetition code extension codebook. This application embodiment will not provide a detailed description of the methods for performing sparse processing on the constant-repetition code extension codebook.

[0180] The following sections describe the Sparse Regression Code (SRC) codebook (dashed line), π / 2-BPSK-M codebook (dashed line), and user equipment 110 codebook based on SRC. Figure 9 The constant weight sparse regression codebook shown (solid line) is sent to base station 120 after modulating the UCI data to be transmitted. The bit error rate of base station 120 when demodulating the modulated signal is compared and explained.

[0181] Assume that user equipment 110 transmits UCI data to base station 120 with a subcarrier spacing of 30 kHz. The UCI data occupies 4 OFDM symbols in the time domain and each OFDM symbol occupies one resource block in the frequency domain.

[0182] All three codebooks are 48×512 in size, i.e., the code length is 48. Each codeword transmits 9 bits of UCI data and uses the 3GPP TDL-C channel (RMS delay spread 300ns, maximum Doppler shift 11Hz).

[0183] like Figure 10 As shown, at a bit error rate of 10 -2 Based on Figure 9 The signal-to-noise ratio (SNR) of the signal obtained by constant-weight sparse regression codebook modulation is 1 dB better than that of the signal obtained by SRC codebook modulation. Figure 9 The signal-to-noise ratio (SNR) of the signal obtained by constant-weight sparse regression codebook modulation is 0.6 dB better than that of the signal obtained by π / 2-BPSK-M codebook modulation.

[0184] The system architecture of the user equipment 110 and base station 120 involved in the embodiments of this application is described below, such as... Figure 11 As shown, a constant repetition code extension unit can be added to the existing system architecture of user equipment 110, and a constant repetition code extension unit and a constant repetition sparse regression decoding unit can be added to the existing system architecture of base station 120. This enables wireless communication system 100 to support the transmission of UCI data using non-coherent transmission methods for PUCCH Format 1, PUCCH Format 2, PUCCH Format 3, and PUCCH Format 4, thereby increasing the PUCCH coverage distance or increasing the amount of data that PUCCH can carry at the same distance.

[0185] Thus, the system architecture of user equipment 110 may include pilot generation and coherent transmission unit 111, non-coherent transmission unit 112, ZC sequence generation unit 113, and constant repetition code extension unit 114.

[0186] The system architecture of base station 120 may include pilot channel estimation and coherent decoding unit 121, ZC sequence generation unit 122, non-coherent decoding unit 123, constant repetition code expansion unit 124, and constant repetition sparse regression decoding unit 125.

[0187] Continue as Figure 11As shown, the units of user equipment 110 and base station 120 used to support the transmission of UCI data can be divided into pilot generation (i.e., coherent transmission unit 111) and non-coherent transmission unit 112. For the non-coherent transmission unit 112 originally used to support PUCCH Format 0, user equipment 110 and base station 120 can ensure the consistency of the codebook generated by ZC sequence generation units (e.g., ZC sequence generation unit 113 and ZC sequence generation unit 122) by exchanging random factors. Furthermore, uplink communication of UCI data can be completed through non-coherent transmission unit 112 and non-coherent decoding unit 123.

[0188] In some specific implementations, the constant code extension unit 114 can be used to extend the constant code base codebook to obtain the constant code extended codebook.

[0189] The constant-repetition code extension unit 124 can be used to generate a constant-repetition code extension codebook and can be cascaded with the existing ZC sequence generation unit 122 to generate a constant-repetition codebook sparse regression codebook.

[0190] The constant-weight sparse regression decoding unit 125 can be used to synthesize the modulation signal and the constant-weight sparse regression codebook, and perform correlation detection on each column of the modulation signal and the constant-weight sparse regression codebook (e.g., calculate the vector inner product of the modulation signal and each column of the constant-weight sparse regression codebook). When the correlation between the modulation signal and a certain column of the constant-weight sparse regression codebook is greater than the correlation threshold, the modulation signal can be demodulated based on that column of the constant-weight sparse regression codebook to demodulate the UCI data sent by the user equipment 110.

[0191] In practical applications, on the base station 120 side, the ZC sequence generation unit 122 and the incoherent decoding unit 123 need to be modified in both software and hardware through the constant-repetition code extension unit 124 and the constant-repetition sparse regression decoding unit 125, respectively. Simultaneously, on the user equipment 110 side, the ZC sequence generation unit 113 needs to be modified in both software and hardware through the constant-repetition code extension unit 114. It should be emphasized that although the constant-repetition sparse regression decoding unit 125 on the base station 120 side can be modified in software, considering that the incoherent decoding unit 123 in the existing wireless communication system 100 is only used to support the 1-2 bits of UCI data required for PUCCH Format 0, and the hardware's computing power is limited, if it is necessary to support the 2-11 bits of UCI data required for PUCCH Format 4, hardware modification of the incoherent decoding unit 123 may be required to meet the requirements.

[0192] It is understood that the communication method provided in this application embodiment can be applied to electronic devices. The hardware structure of the electronic device to which the communication method provided in this application embodiment is applicable will be described exemplarily below.

[0193] like Figure 12 As shown, the electronic device 1200 may include a processor 1210, an external memory interface 1220, an internal memory 1221, a universal serial bus (USB) interface 1230, a charging management module 1240, a power management module 1241, a battery 1242, an antenna 1, an antenna 2, a mobile communication module 1250, a wireless communication module BT / WLAN / GNSS / NFC / IR / FM 1260, an audio module 1270, a speaker 1270A, a receiver 1270B, a microphone 1270C, a headphone jack 1270D, a sensor module 1280, buttons 1290, a motor 1291, an indicator 1292, a camera 1293, a display screen 1294, and a subscriber identification module (SIM) card interface 1295, etc.

[0194] It is understood that the structures illustrated in the embodiments of the present invention do not constitute a specific limitation on the electronic device. In other embodiments of this application, the electronic device 1200 may include more or fewer components than illustrated, or combine some components, or split some components, or have different component arrangements. The illustrated components may be implemented in hardware, software, or a combination of software and hardware.

[0195] Processor 1210 may include one or more processing units, such as application processor (AP), modem processor, graphics processing unit (GPU), image signal processor (ISP), controller, video codec, digital signal processor (DSP), baseband processor, and / or neural network processing unit (NPU). Different processing units may be independent devices or integrated into one or more processors.

[0196] In some optional implementations, the processor 1210 can execute the communication method mentioned in the embodiments of this application. Specifically, the modem processor can select a constant-repetition codebase from a plurality of pre-set constant-repetition codebases that matches the number of OFDM symbols required for the UCI data to be transmitted, based on the number of OFDM symbols required. Then, the constant-repetition codebase can be extended to obtain a constant-repetition codebase extension. Finally, the constant-repetition codebase extension can be sparsified, for example, by making the columns of the constant-repetition codebase orthogonal to obtain a constant-repetition codebase sparse regression codebase. The codewords in this constant-repetition codebase sparse regression codebase have a large degree of difference. During the transmission of UCI data to the base station, the modem processor can encode the UCI data based on this constant-repetition codebase sparse regression codebase and transmit the encoded UCI data to the base station.

[0197] Accordingly, after receiving the encoded UCI data, the base station can decode the received encoded UCI data based on a constant-repetition sparse regression codebook to obtain the UCI data. In this way, by using a codebook with a large degree of difference between codewords to encode the UCI data, the difference of the encoded UCI data can be increased, thereby reducing the bit error rate.

[0198] The controller can generate operation control signals based on the instruction opcode and timing signals to complete the control of instruction fetching and execution.

[0199] The processor 1210 may also include a memory for storing instructions and data. In some embodiments, the memory in the processor 1210 is a cache memory. This memory can store instructions or data that the processor 1210 has just used or that are used repeatedly. If the processor 1210 needs to use the instruction or data again, it can retrieve it directly from the memory. This avoids repeated accesses, reduces the waiting time of the processor 1210, and thus improves the efficiency of the system.

[0200] In some optional implementations, the memory may store instructions or data of the communication methods mentioned in the embodiments of this application.

[0201] The wireless communication function of electronic devices can be implemented through antenna 1, antenna 2, mobile communication module 1250, wireless communication module BT / WLAN / GNSS / NFC / IR / FM1260, modem processor, and baseband processor.

[0202] Antenna 1 and antenna 2 are used to transmit and receive electromagnetic wave signals. Each antenna in the electronic device can be used to cover one or more communication frequency bands. Different antennas can also be reused to improve antenna utilization. For example, antenna 1 can be reused as a diversity antenna for a wireless local area network. In some other embodiments, the antennas can be used in conjunction with a tuning switch.

[0203] The mobile communication module 1250 can provide solutions for wireless communication applications including 2G / 3G / 4G / 5G in electronic devices. The mobile communication module 1250 may include at least one filter, switch, power amplifier, low noise amplifier (LNA), etc. The mobile communication module 1250 can receive electromagnetic waves via antenna 1, and perform filtering, amplification, and other processing on the received electromagnetic waves before transmitting them to a modem processor for demodulation. The mobile communication module 1250 can also amplify the signal modulated by the modem processor and convert it into electromagnetic waves for radiation via antenna 1. In some embodiments, at least some functional modules of the mobile communication module 1250 may be housed in the processor 1210. In some embodiments, at least some functional modules of the mobile communication module 1250 and at least some modules of the processor 1210 may be housed in the same device.

[0204] The modem processor may include a modulator and a demodulator. The modulator modulates the low-frequency baseband signal to be transmitted into a mid-to-high frequency signal. The demodulator demodulates the received electromagnetic wave signal into a low-frequency baseband signal. The demodulator then transmits the demodulated low-frequency baseband signal to the baseband processor for processing. After processing by the baseband processor, the low-frequency baseband signal is transmitted to the application processor. The application processor outputs sound signals through an audio device (not limited to speaker 1270A, receiver 1270B, etc.) or displays images or videos through the display screen 1294. In some embodiments, the modem processor may be a separate device. In other embodiments, the modem processor may be independent of the processor 1210 and may be housed in the same device as the mobile communication module 1250 or other functional modules.

[0205] The BT / WLAN / GNSS / NFC / IR / FM1260 wireless communication module can provide solutions for wireless communication applications in electronic devices, including wireless local area networks (WLAN) (such as wireless fidelity (Wi-Fi) networks), Bluetooth (BT), global navigation satellite system (GNSS), frequency modulation (FM), near field communication (NFC), and infrared (IR) technologies. The BT / WLAN / GNSS / NFC / IR / FM1260 can be one or more devices integrating at least one communication processing module. The BT / WLAN / GNSS / NFC / IR / FM1260 receives electromagnetic waves via antenna 2, performs frequency modulation and filtering of the electromagnetic wave signal, and sends the processed signal to processor 1210. The BT / WLAN / GNSS / NFC / IR / FM1260 can also receive signals to be transmitted from processor 1210, perform frequency modulation and amplification, and convert them into electromagnetic waves for radiation via antenna 2.

[0206] In some embodiments, antenna 1 of the electronic device is coupled to mobile communication module 1250, and antenna 2 is coupled to wireless communication module BT / WLAN / GNSS / NFC / IR / FM 1260, enabling the electronic device to communicate with networks and other devices via wireless communication technology. The wireless communication technology may include Global System for Mobile Communications (GSM), General Packet Radio Service (GPRS), Code Division Multiple Access (CDMA), Wideband Code Division Multiple Access (WCDMA), Time Division Code Division Multiple Access (TD-SCDMA), Long Term Evolution (LTE), BT, GNSS, WLAN, NFC, FM, and / or IR technologies, etc. The GNSS may include the Global Positioning System (GPS), the Global Navigation Satellite System (GLONASS), the BeiDou Navigation Satellite System (BDS), the Quasi-Zenith Satellite System (QZSS), and / or satellite-based augmentation systems (SBAS).

[0207] In some cases, the embodiments disclosed in this application may be implemented in hardware, firmware, software, or any combination thereof.

[0208] The embodiments disclosed in this application can also be implemented as instructions carried or stored thereon on one or more temporary or non-temporary machine-readable (e.g., computer-readable) storage media, which can be read and executed by one or more processors. For example, the instructions can be distributed via a network or via other computer-readable media. Therefore, machine-readable media can include any mechanism for storing or transmitting information in a machine-readable (e.g., computer-readable) form, including but not limited to floppy disks, optical disks, magnetic disks, magneto-optical disks, read-only memory (ROM), random access memory (RAM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), magnetic cards or optical cards, flash memory, or tangible machine-readable storage for transmitting information (e.g., carrier waves, infrared signals, digital signals, etc.) using the Internet in the form of electrical, optical, acoustic, or other propagation signals. Therefore, machine-readable media includes any type of machine-readable medium suitable for storing or transmitting electronic instructions or information in a machine-readable (e.g., computer-readable) form.

[0209] Embodiments of this application can be implemented as computer programs or program code that execute on a programmable system, the programmable system including at least one processor, a storage system (including volatile and non-volatile memory and / or storage elements), at least one input device, and at least one output device.

[0210] Program code can be applied to input instructions to execute the functions described in this application and generate output information. The output information can be applied to one or more output devices in a known manner. For the purposes of this application, the processing system includes any system having a processor such as, for example, a digital signal processor (DSP), a microcontroller, an application-specific integrated circuit (ASIC), or a microprocessor.

[0211] The program code can be implemented using a high-level procedural language or an object-oriented programming language to communicate with the processing system. Assembly language or machine language can also be used when needed. In fact, the mechanisms described in this application are not limited to any particular programming language. In either case, the language can be a compiled language or an interpreted language.

[0212] The above describes the possible hardware structures of electronic devices. It is understood that the structures illustrated in the embodiments of this application do not constitute a specific limitation on the electronic device. In other embodiments of this application, the electronic device may include more or fewer components than illustrated, or combine certain components, or split certain components, or have different component arrangements. The illustrated components may be implemented in hardware, software, or a combination of both.

[0213] In the accompanying drawings, some structural or methodological features may be shown in a specific arrangement and / or order. However, it should be understood that such a specific arrangement and / or order may not be necessary. Rather, in some embodiments, these features may be arranged in a manner and / or order different from that shown in the illustrative drawings. Furthermore, the inclusion of structural or methodological features in a particular figure does not imply that such features are required in all embodiments, and in some embodiments, these features may be omitted or may be combined with other features.

[0214] It should be noted that in the examples and description of this patent, relational terms such as "first" and "second" are used merely to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one" does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0215] Although this application has been illustrated and described with reference to certain embodiments thereof, those skilled in the art will understand that various changes in form and detail may be made thereto without departing from the scope of this application.

Claims

1. A communication method applied to a user equipment, characterized in that, The method comprises: Uplink control information data to be transmitted has been detected; A modulated signal corresponding to the uplink control information data is transmitted to the base station, wherein the modulated signal is obtained by modulating the uplink control information data based on a first codebook, wherein the distance between codewords in the first codebook is greater than a distance threshold, and the distance threshold is greater than 0.

2. The method according to claim 1, characterized in that, The first codebook is a first constant-repetition codebook among multiple constant-repetition codebooks, in which the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for the uplink control information data, and the number of columns is equal to the amount of data corresponding to each codeword.

3. The method according to claim 1, characterized in that, The first codebook is obtained by expanding the second constant-multiple ... The second constant-repetition codebase is a constant-repetition codebase among multiple constant-repetition codebases, in which the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for the uplink control information data, and the number of columns is less than the amount of data corresponding to each codeword. Furthermore, the number of columns in the first codebook is different from that in the second constant-weight codebook.

4. The method according to claim 1, characterized in that, The first codebook is obtained by sparse processing of the second codebook. The second codebook is obtained by expanding the second constant-multiple codebook from multiple constant-multiple base codebooks. The second constant-repetition code base codebook is a constant-repetition code base codebook in which the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for the uplink control information data, and the number of columns is less than the amount of data corresponding to each codeword.

5. The method according to claim 3 or 4, characterized in that, The second constant-multiplication code base codebook is expanded using the following formula: Among them, S j This represents the codeword in the second constant-repetition codebook. This represents the codeword in the first codebook. e represents the tensor product calculation. j％k This represents an extended sequence, and j%k represents the remainder when j is divided by k.

6. The method according to claim 4, characterized in that, The sparse processing includes any one of ZC sequence matrix, Fourier matrix, and complex Hamad matrix.

7. The method according to claim 1, characterized in that, The distance between codewords in the first codebook is the Hamming distance.

8. A communication method applied to a base station, characterized in that, The method comprises: Receive modulated signals transmitted by user equipment. The modulation signal is obtained by the user equipment modulating uplink control information data based on a first codebook, wherein the distance between codewords in the first codebook is greater than a distance threshold, and the distance threshold is greater than 0. The first codebook is used to decode the modulated signal to obtain the uplink control information data.

9. The method according to claim 8, characterized in that, The first codebook is a first constant-repetition codebook among multiple constant-repetition codebooks, in which the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for the uplink control information data, and the number of columns is equal to the amount of data corresponding to each codeword.

10. The method according to claim 8, characterized in that, The first codebook is obtained by expanding the second constant-multiple ... The second constant-repetition codebase is a constant-repetition codebase among multiple constant-repetition codebases, in which the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for the uplink control information data, and the number of columns is less than the amount of data corresponding to each codeword. Furthermore, the number of columns in the first codebook is different from that in the second constant-weight codebook.

11. The method according to claim 8, characterized in that, The first codebook is obtained by sparse processing of the second codebook. The second codebook is obtained by expanding the second constant-multiple codebook from multiple constant-multiple base codebooks. The second constant-repetition code base codebook is a constant-repetition code base codebook in which the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for the uplink control information data, and the number of columns is less than the amount of data corresponding to each codeword.

12. The method according to claim 10 or 11, characterized in that, The second constant-multiplication code base codebook is expanded using the following formula: Among them, S j This represents the codeword in the second constant-repetition codebook. This represents the codeword in the first codebook. e represents the tensor product calculation. j％k This represents an extended sequence, and j%k represents the remainder when j is divided by k.

13. The method according to claim 11, characterized in that, The sparse processing includes any one of ZC sequence matrix, Fourier matrix, and complex Hamad matrix.

14. The method according to claim 8, characterized in that, The distance between codewords in the first codebook is the Hamming distance.

15. A communication method, characterized in that, It is applied to a communication system, which includes user equipment and base stations. And the method includes: The user equipment detected uplink control information data to be transmitted; The user equipment transmits a modulated signal corresponding to the uplink control information data to the base station; The base station receives modulated signals transmitted by user equipment; The modulation signal is obtained by modulating the uplink control information data based on a first codebook. The distance between codewords in the first codebook is greater than a distance threshold, and the distance threshold is greater than 0. The first codebook is used to decode the modulation signal to obtain the uplink control information data.

16. The method according to claim 15, characterized in that, The first codebook is a first constant-repetition codebook among multiple constant-repetition codebooks, in which the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for the uplink control information data, and the number of columns is equal to the amount of data corresponding to each codeword.

17. The method according to claim 15, characterized in that, The first codebook is obtained by expanding the second constant-multiple ... The second constant-repetition codebase is a constant-repetition codebase among multiple constant-repetition codebases, in which the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for the uplink control information data, and the number of columns is less than the amount of data corresponding to each codeword. Furthermore, the number of columns in the first codebook is different from that in the second constant-weight codebook.

18. The method according to claim 15, characterized in that, The first codebook is obtained by sparse processing of the second codebook. The second codebook is obtained by expanding the second constant-multiple codebook from multiple constant-multiple base codebooks. The second constant-repetition code base codebook is a constant-repetition code base codebook in which the number of rows is equal to the number of orthogonal frequency division multiplexing symbols required for the uplink control information data, and the number of columns is less than the amount of data corresponding to each codeword.

19. The method according to claim 17 or 18, characterized in that, The second constant-multiplication code base codebook is expanded using the following formula: Among them, S j This represents the codeword in the second constant-repetition codebook. This represents the codeword in the first codebook. e represents the tensor product calculation. j％k This represents an extended sequence, and j%k represents the remainder when j is divided by k.

20. The method according to claim 18, characterized in that, The sparse processing includes any one of ZC sequence matrix, Fourier matrix, and complex Hamad matrix.

21. The method according to claim 15, characterized in that, The distance between codewords in the first codebook is the Hamming distance.

22. An electronic device, characterized in that, include: A memory for storing instructions executed by one or more processors of the electronic device, and a processor, being one of one or more processors of the electronic device, for executing the communication method according to any one of claims 1-21.

23. A readable storage medium, characterized in that, The readable storage medium stores instructions that, when executed on an electronic device, cause the electronic device to perform the communication method according to any one of claims 1-21.

24. A computer program product, characterized in that, The computer program product includes computer instructions that, when executed by an electronic device, enable the electronic device to perform the communication method as described in any one of claims 1-21.

Images