Base station and wireless communication method
By processing UCI bits based on downlink and uplink grants, the method optimizes UCI multiplexing on PUSCH, addressing inefficiencies and enhancing user throughput and system performance in NR.
Patent Information
- Application Number
- JP2023064793
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Filing Date
- 2023-04-12
- Publication Date
- 2024-11-06
- Estimated Expiration
- 2038-01-04
AI Technical Summary
The issue of multiplexing uplink control information (UCI) within the physical uplink shared channel (PUSCH) in NR has not been fully resolved, leading to inefficiencies in user throughput and system performance.
A method for processing UCI bits based on downlink and uplink grants, involving a circuit that compares and adjusts the number of UCI bits to be transmitted according to configured coding rates and resource availability, allowing for efficient multiplexing on PUSCH.
This approach enhances user throughput and improves system performance by optimizing the transmission of UCI bits, ensuring efficient resource utilization and accurate decoding at the base station.
Smart Images

Figure 0007578749000001 
Figure 0007578749000002 
Figure 0007578749000003
Abstract
Description
[Technical field]
[0001] The present invention relates to the field of wireless communication, and more particularly to a Physical Uplink Shared Channel (PUSCH) in New Radio access technology (NR). The present invention relates to a user equipment (UE), a base station (gNB), and a wireless communication method, which are related to multiplexing of uplink control information (UCI) in a mobile station. [Background technology]
[0002] As known in the art, UCI is reported from a UE to a base station (BS), which may be a Hybrid Automatic Repeat request - Acknowledgement (HARQ-ACK) or Channel State Information (CSI), such as a Channel Quality Indicator (CQI), Rank Indication (RI), or Precoding Matrix Indicator (PMI). UCI can be transmitted in a Physical Uplink Control Channel (PUCCH) or a PUSCH. When UCI is transmitted in a PUSCH, it occupies a certain amount of data channel resource elements (RE). Multiplexing UCI in a PUSCH is a topic that has been discussed in the early NR standardization phase (Release 15), but this issue has not been fully resolved. Summary of the Invention [Means for solving the problem]
[0003] One non-limiting example embodiment facilitates multiplexing of UCI in PUSCH in NR to increase user throughput and improve system performance.
[0004] In a first aspect of the present disclosure, there is provided a user equipment including: a circuit for processing uplink control information (UCI) to be transmitted according to a comparison of a number M of UCI bits generated based on downlink (DL) assignments (DL assignment(s)) before an uplink (UL) grant from a base station and a number N of UCI bits generated based on a DL assignment after the UL grant, with a number P of UCI bits indicated in the UL grant and / or a maximum number Q of bits calculated based on at least a set coding rate, where each of M, N, P, and Q is an integer greater than or equal to 0; and a transmitter for transmitting the processed UCI bits to the base station on a physical uplink shared channel (PUSCH) at a transmission time interval (TTI) indicated in the UL grant.
[0005] In a second aspect of the present disclosure, a base station is provided that includes a receiver for receiving uplink control information (UCI) bits transmitted from a user equipment in a transmission time interval (TTI) indicated in an uplink (UL) grant on a physical uplink shared channel (PUSCH), and a circuit for decoding the UCI bits in accordance with a UCI multiplexing rule, wherein the UCI bits prior to these transmissions are processed in the user equipment according to a comparison of a number M of UCI bits generated based on a downlink (DL) allocation before a UL grant from the base station and a number N of UCI bits generated based on a DL allocation after the UL grant, with a number P of UCI bits indicated in the UL grant and / or a maximum number Q of bits calculated based on a coding rate set in accordance with at least the UCI multiplexing rule, wherein each of M, N, P, and Q is an integer greater than or equal to 0.
[0006] In a third aspect of the present disclosure, a wireless communication method for a user equipment is provided, the method including: a step of processing uplink control information (UCI) to be transmitted according to a comparison of a number M of bits of UCI generated based on a downlink (DL) allocation before an uplink (UL) grant from a base station and a number N of bits of UCI generated based on a DL allocation after the UL grant, with a number P of bits of UCI indicated in the UL grant and / or a maximum number Q of bits calculated based on at least a set coding rate, where each of M, N, P, and Q is an integer greater than or equal to 0; and a step of transmitting the processed UCI bits to the base station on a physical uplink shared channel (PUSCH) at a transmission time interval (TTI) indicated in the UL grant.
[0007] In a fourth aspect of the present disclosure, a wireless communication method for a base station is provided, the method including: receiving, on a physical uplink shared channel (PUSCH), uplink control information (UCI) bits transmitted from a user equipment at a transmission time interval (TTI) indicated in an uplink (UL) grant; and decoding the UCI bits according to a UCI multiplexing rule, wherein the UCI bits before these transmissions are processed in the user equipment according to a comparison of a number M of UCI bits generated based on a downlink (DL) allocation before the UL grant from the base station and a number N of UCI bits generated based on a DL allocation after the UL grant, with a number P of UCI bits indicated in the UL grant and / or a maximum number Q of bits calculated based on at least a coding rate set according to the UCI multiplexing rule, wherein each of M, N, P, and Q is an integer greater than or equal to 0.
[0008] These comprehensive or specific aspects may be realized as a system, a method, an integrated circuit, a computer program, or a recording medium, or may be realized as any combination of a system, a method, an integrated circuit, a computer program, and a recording medium.
[0009] Further advantages and benefits of an embodiment of the present disclosure will become apparent from the specification and drawings. Such advantages and / or benefits may be provided by some of the embodiments and features described in the specification and drawings, respectively, but not necessarily all of them may be provided to obtain one or more identical features.
[0010] The foregoing and other features of the present disclosure will become more fully apparent from the following description and claims, taken in conjunction with the accompanying drawings, in which: The present disclosure will be described with additional specificity and detail through the use of the accompanying drawings, with the understanding that these drawings represent only some embodiments according to the present disclosure, and therefore are not to be considered as limiting the scope of the disclosure. [Brief description of the drawings]
[0011] [Figure 1] 1 illustrates an example scenario of UCI multiplexing in PUSCH in NR. [Diagram 2] 2 illustrates a block diagram of a portion of a user device according to one embodiment of the present disclosure. [Diagram 3] 1 illustrates an option for counting Downlink Assignment Indicators (DAIs) in an UL grant from a base station in NR. [Figure 4] 13 illustrates diagrammatically another option for counting DAI in a UL grant from a base station in NR. [Diagram 5] 2 illustrates a block diagram of a portion of a base station according to one embodiment of the present disclosure. [Figure 6] 2 illustrates a block diagram of a detail of a user device according to one embodiment of the present disclosure. [Figure 7] 2 illustrates a detailed block diagram of a base station according to one embodiment of the present disclosure. [Figure 8] 2 illustrates an example of a flowchart of communication between a base station and a user equipment according to an embodiment of the present disclosure. [Figure 9]1 illustrates a flowchart of a wireless communication method for a user device according to one embodiment of the present disclosure. [Figure 10] 1 illustrates a flowchart of a wireless communication method for a base station according to one embodiment of the present disclosure. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0012] In the following detailed description, reference is made to the accompanying drawings, which form a part hereof, in which like numerals generally identify like components, unless the context dictates otherwise. It will be understood that the aspects of the present disclosure can be arranged, substituted, combined, and designed in a wide variety of configurations, all of which are expressly intended to form part of this disclosure.
[0013] As mentioned above, multiplexing of UCI in PUSCH is adopted in NR (e.g., Release 15). Figure 1 shows an example scenario of UCI multiplexing in PUSCH in NR. In Figure 1, the right-pointing axis represents the time axis, on which several transmission time intervals (TTIs) are shown, blocks filled with left-pointing slashes represent downlink (DL) allocations from a base station (gNB), blocks filled with right-pointing slashes represent UL grants from a base station, and blocks filled with dots represent PUSCH transmissions from a UE to a base station. Here, the gNB is a node that includes a protocol termination for the NR user plane and the control plane toward the user and is connected to the 5G Core (5GC: 5G Core) via an NG interface.
[0014] More specifically, as shown in Figure 1, an UL grant is received by the UE from the base station at TTI #4. From the instruction in the UL grant, the UE can determine the transmission timing for the PUSCH. For example, as shown in Figure 1, the UL grant indicates that TTI #8 is the transmission timing for the PUSCH, i.e., the UE will transmit PUSCH at TTI #8.
[0015] Furthermore, UCI bits will also be transmitted in TTI#8 by multiplexing UCI in PUSCH. The UL grant received by the UE in TTI#4 can also indicate a downlink allocation indicator (DAI) that is used to calculate the required UCI resources. For ease of explanation, we take HARQ-ACK as an example of UCI in FIG. 1. As already agreed in NR, before the UL grant is received, the HARQ bits for DL allocations 1-3 received in TTI#1-3 are multiplexed in PUSCH in TTI#8. In principle, the number of HARQ bits indicated by DAI may be larger or smaller than the number of HARQ bits actually generated, for example, for DL allocations 1-3.
[0016] Furthermore, based on the NR agreement, for slot-based scheduling, for HARQ-ACK with more than 2 bits, the PUSCH is rate-matched, while for HARQ-ACK with up to 2 bits, the PUSCH is punctured.
[0017] As shown in Figure 1, in addition to DL allocations 1-3, there are DL allocations 4-5 received at TTIs #5-6 after the UL grant is received, and HARQ bits for DL allocations 4-5 also need to be sent to the base station, but they will not be handled in Release 15 NR, i.e., how to handle them is still unclear in current NR. Furthermore, the HARQ-ACK bits indicated in the UL grant (e.g., for DAI) may not be accurate to cover all feedback bits for DL allocations before and after the UL grant. Therefore, some rules are needed to handle HARQ-ACK bits generated for DL allocations after the UL grant (e.g., DL allocations 4 and 5) in NR.
[0018] In view of the above, in one embodiment of the present disclosure, a user equipment as shown in FIG. 2 is provided. FIG. 2 shows a block diagram of a part of the user equipment 200 according to one embodiment of the present disclosure. As shown in FIG. 2, the UE 200 may include a circuit 210 and a transmitter 220. The circuit 210 processes UCI bits to be transmitted according to a comparison between a number M of bits of uplink control information (UCI) generated based on a downlink (DL) allocation before an uplink (UL) grant from a base station and a number N of bits of UCI generated based on a DL allocation after an UL grant, and a number P of bits of UCI indicated in the UL grant and / or a maximum number Q of bits calculated based on at least a set coding rate, where each of M, N, P, and Q is an integer equal to or greater than 0. The transmitter 220 transmits the processed UCI bits to the base station on a physical uplink shared channel (PUSCH) at a transmission time interval (TTI) indicated in the UL grant.
[0019] Specifically, further taking FIG. 1 as an example, M may mean the number of UCI bits (e.g., HARQ bits) actually generated based on DL allocations 1-3, N may mean the number of UCI bits (e.g., HARQ bits) actually generated based on DL allocations 4-5, P may mean the number of UCI bits indicated (e.g., by DAI) in the UL grant (shown by the block filled with right slashes in FIG. 1), Q may mean the maximum number of bits for UCI, which may be calculated based on the configured coding rate and other factors, which will be described in detail below.
[0020] Before transmitting the UCI bits on the PUSCH, circuit 210 processes these UCI bits according to a comparison of M and N with P, a comparison of M and N with Q, or a comparison of M and N with P and Q. Transmitter 220 then transmits the UCI bits processed by circuit 210 to the base station on the PUSCH, for example, at TTI #8 in FIG.
[0021] Naturally, a DL allocation after a UL grant refers to a DL allocation (e.g., DL allocations 4-5) received by the UE after the UL grant is received by the UE and before the transmission timing of the PUSCH transmission (e.g., TTI#8).
[0022] Furthermore, the DL allocation before the UL grant refers to the DL allocation (e.g., DL allocations 1-3) received by the UE before the UL grant is received by the UE. In other words, the DL allocation before the UL grant may correspond to the DL allocation received by the UE in a time window before the timing of the UL grant reception (e.g., TTI#4). The size of this time window can be dynamically set by the base station, for example, via RRC signaling. Alternatively, the size of the time window may be predefined or specified in a standard. Also, the size of this time window may be unlimited. It is obvious to those skilled in the art that the size of this time window may be determined according to specific requirements.
[0023] For the user equipment 200 shown in Fig. 2, the UCI bits based on the DL allocation after the UL grant from the base station are taken into account and transmitted in the PUSCH together with the UCI bits based on the DL allocation before the UL grant, so that the user throughput can be increased and the system performance can be improved.
[0024] According to an embodiment of the present disclosure, in UE200 shown in FIG. 2, when (M + N) ≤ P, circuit 210 multiplexes the N-bit UCI and the M-bit UCI without any compression; when M < P < (M + N), circuit 210 compresses the N-bit UCI into an (N - X1)-bit UCI and compresses the M-bit UCI into an (M - X2)-bit UCI, and then multiplexes the (N - X1)-bit UCI and the (M - X2)-bit UCI, where (X1 + X2) = M + N - P in the above, and both X1 and X2 are integers greater than or equal to 0; when P ≤ M, circuit 210 compresses the N-bit UCI into an (N - Y1)-bit UCI and compresses the M-bit UCI into an (M - Y2)-bit UCI, and then multiplexes the (N - Y1)-bit UCI and the (M - Y2)-bit UCI, where (Y1 + Y2) = M + N - P in the above, and both Y1 and Y2 are integers greater than or equal to 0.
[0025] Specifically, in this embodiment, circuit 210 processes the UCI bits to be transmitted according to the comparison between M and N and P. This can be divided into the following three cases according to the comparison between M and N and P, for example. For ease of explanation, as an example, HARQ-ACK is further taken as an example of UCI.
[0026] Case 1 where (M + N) ≤ P, that is, for the case where there is sufficient resource in the PUSCH to transmit both the M bits of HARQ-ACK corresponding to the DL allocation before the UL grant and the N bits of HARQ-ACK corresponding to the DL allocation after the UL grant, the M bits of HARQ-ACK and the N bits of HARQ-ACK can be multiplexed without any compression. For example, assuming that the M bits of HARQ-ACK are "01" and the N bits of HARQ-ACK are 10, these can be directly multiplexed as "0110" and transmitted in the PUSCH.
[0027] Case 2 where M < P < (M + N), that is, it is sufficient to transmit M bits of HARQ-ACK corresponding to the DL allocation before the UL grant, but there is not enough resource to transmit both M bits of HARQ-ACK corresponding to the DL allocation before the UL grant and N bits of HARQ-ACK corresponding to the DL allocation after the UL grant. For this case, some operation is required to reduce the total number of bits of HARQ-ACK actually generated, which is "M + N".
[0028] The first option for Case 2 to reduce the total number of bits of HARQ-ACK actually generated, which is "M + N", is to reduce the number of bits N of HARQ-ACK corresponding to the DL allocation after the UL grant while maintaining the M bits of HARQ-ACK corresponding to the DL allocation before the UL grant as they are. In this case, the N bits of HARQ-ACK are compressed to (N - X1), where X1 is an integer greater than 0 and X2 is 0. Then, these (N - X1) bits of HARQ-ACK are multiplexed with the M bits of HARQ-ACK. As is well known in the art, this compression means an AND operation. For example, assume that the M bits of HARQ-ACK are "101111" (i.e., M = 6), the N bits of HARQ-ACK are "0101" (i.e., N = 4), and P = 8, that is, only 8 bits are available for transmitting HARQ-ACK in PUSCH. According to the first option for Case 2, X1 = M + N - P = 6 + 4 - 8 = 2, that is, it is necessary to reduce 2 bits of the N bits of HARQ-ACK by compression. For example, "0101" is compressed to "00". In this compression, an AND operation is performed between the first bit "0" and the second bit "1" to obtain "0", and an AND operation is performed between the third bit "0" and the fourth bit "1" to obtain "0". Then, the "00" obtained after compression is directly multiplexed with "101111" as "10111100".
[0029] This first option for case 2 is merely an example of reducing the total number of bits of the actually generated HARQ-ACK "M+N", and the present disclosure is not limited thereto. A second option for case 2 to reduce the total number of bits of the actually generated HARQ-ACK "M+N" is to reduce the number M of bits of the HARQ-ACK corresponding to DL assignments before the UL grant, while keeping the N bits of the HARQ-ACK corresponding to DL assignments after the UL grant. In this case, the M bits of the HARQ-ACK are compressed to (M-X2), where X2 is an integer greater than 0 and X1 is 0. These (M-X2) bits of the HARQ-ACK are then multiplexed with the N bits of the HARQ-ACK. For example, again assume that the M bits of the HARQ-ACK are "101111" (i.e., M=6) and the N bits of the HARQ-ACK are "0101" (i.e., N=4), and P=8, i.e., only 8 bits are available to transmit the HARQ-ACK in the PUSCH. According to the second option for case 2, X2=M+NP=6+4-8=2, i.e., M bits of HARQ-ACK need to be reduced by 2 through compression. For example, "101111" is compressed to "0111", which involves ANDing the first bit "1" with the second bit "0" to get "0", and ANDing the third bit "1" with the fourth bit "1" to get "1". Then the "0111" obtained after compression is directly multiplexed with "0101" as "01110101".
[0030] In addition to the above first and second options for this case, there may be some intermediate solution between these two options. Specifically, the third option for case 2 to reduce the total number of actually generated bits of HARQ-ACK "M+N" is to reduce both the number of bits N of HARQ-ACK corresponding to DL allocation after UL grant and the number of bits M of HARQ-ACK corresponding to DL allocation before UL grant. More specifically, N bits of HARQ-ACK are compressed to (N-X1) bits, and M bits of HARQ-ACK are compressed to (M-X2) bits, where X1 and X2 are integers greater than 0, and X1+X2=M+NP. Then, the (N-X1)-bit UCI and the (M-X2)-bit UCI are directly multiplexed. For example, again, assume that the M bits of HARQ-ACK are "101111" (i.e., M=6), the N bits of HARQ-ACK are "0101" (i.e., N=4), and P=8, i.e., only 8 bits are available for transmitting HARQ-ACK in PUSCH. According to the third option for case 2, X1+X2=6+4-8=2, and X1=X2=1. "101111" can be compressed to "01111", in which an AND operation is performed between the first bit "0" and the second bit "1" to obtain "0". Furthermore, "0101" can be compressed to "001", in which an AND operation is performed between the first bit "0" and the second bit "1" to obtain "0". Then, "01111" and "001" obtained after compression, respectively, are directly multiplexed as "01111001".
[0031] For case 3, where P≦M, i.e., there are not enough resources to transmit both M bits of HARQ-ACK corresponding to DL allocation before UL grant and N bits of HARQ-ACK corresponding to DL allocation after UL grant when N is greater than 0. In this case, like the third option for case 2 described above, the number of bits N of HARQ-ACK corresponding to DL allocation after UL grant and the number of bits M of HARQ-ACK corresponding to DL allocation before UL grant need to be reduced by compression. More specifically, the N bits of HARQ-ACK are compressed to (N-Y1) bits, and the M bits of HARQ-ACK are compressed to (M-Y2) bits. Then, the (N-Y1) bits and (M-Y2) bits are directly multiplexed, where Y1 and Y2 above are integers greater than 0, and Y1+Y2=M+NP. The principle of operation in this case is similar to the third option for case 2, so to avoid redundancy, no further examples will be described here.
[0032] Note that the above case 3 may be performed based on the operation of the network, and further compression of the M-bit UCI may be performed to meet the resource requirements and maximize the coding rate.
[0033] In the above embodiment, the circuit 210 processes the UCI bits according to a comparison of M and N with P, but the present disclosure is not limited thereto.
[0034] According to one embodiment of the present disclosure, in UE 200 shown in FIG. 2, when (M+N)≦Q, circuit 210 multiplexes N-bit UCI and M-bit UCI without any compression, and when Q<(M+N), circuit 210 compresses N-bit UCI to (N-Z1)-bit UCI, compresses M-bit UCI to (M-Z2)-bit UCI, and multiplexes the (N-Z1)-bit UCI and (M-Z2)-bit UCI, where (Z1+Z2)≧M+NQ, and both Z1 and Z2 are integers equal to or greater than 0.
[0035] Specifically, in this embodiment, the circuit 210 processes the UCI bit to be transmitted according to the comparison of M and N with Q instead of P. This embodiment can be divided into, for example, the following two cases according to the comparison of M and N with Q. For ease of explanation, we further take HARQ-ACK as an example of UCI.
[0036] For case 1 where (M+N)≦Q, i.e. there are enough resources to transmit both M bits of HARQ-ACK corresponding to DL allocation before UL grant and N bits of HARQ-ACK corresponding to DL allocation after UL grant, M bits of HARQ-ACK and N bits of HARQ-ACK may be multiplexed without any compression. This case is similar to case 1 for the previous embodiment, and further examples will not be described to avoid redundancy.
[0037] For case 2 where Q<(M+N), i.e., there are not enough resources to transmit both M bits of HARQ-ACK corresponding to DL allocation before UL grant and N bits of HARQ-ACK corresponding to DL allocation after UL grant, the total number of bits of HARQ-ACK actually generated "M+N" needs to be reduced to not exceed Q. Therefore, based on the value of Q, one or both of the number of bits N of HARQ-ACK corresponding to DL allocation after UL grant and the number of bits M of HARQ-ACK corresponding to DL allocation before UL grant need to be reduced by compression. More specifically, the N bits of HARQ-ACK are compressed to (N-Z1), and the M bits of HARQ-ACK are compressed to (M-Z2). Then, the (N-Z1) bits and the (M-Z2) bits are directly multiplexed. In the above, Z1+Z2≧M+NQ, and both Z1 and Z2 are integers greater than 0. This case is similar to the combination of Case 2 and Case 3 in the previous embodiment, which compares M and N with P. The principle of operation in this case is similar to that in Case 2 and Case 3 for the previous embodiment, so to avoid redundancy, no further examples will be described here.
[0038] In general, the number of UCI bits P indicated in the UL grant is smaller than the maximum number of bits Q calculated based on the set coding rate. This embodiment of processing UCI bits according to a comparison of M and N with Q instead of P can accommodate cases where resources are poorly utilized.
[0039] According to one embodiment of the present disclosure, the set coding rate is the maximum coding rate of the UCI bits, and Q is calculated based on this maximum coding rate of the UCI bits, the assumed resource size, and the assumed modulation order.
[0040] Specifically, the calculation of Q may be based on three factors: the maximum coding rate, the size of the assumed resource, and the assumed modulation order.
[0041] More specifically, according to one embodiment of the present disclosure, the expected resource size is the entire allocated PUSCH resources excluding resource elements (RE) for the Reference Signal (RS) and is calculated based on an indication in the downlink control information for the UL allocation and a semi-static configuration or is calculated based on the semi-static configuration only.
[0042] Furthermore, according to one embodiment of the present disclosure, the assumed modulation order is the same as that of the PUSCH.
[0043] For ease of understanding, some examples are given below to illustrate the calculation of Q.
[0044] As mentioned before, option 1 for the assumed resource size is the total allocated PUSCH resources, excluding the REs for the RS. An example is for the gNB (base station) to allocate 6 Physical Resource Blocks (PRBs), each with 120 REs (excluding the REs for the RS), resulting in a total of 6×120=720 REs. Assuming a maximum coding rate of 0.1 and a modulation order of 16QAM (same as for the PUSCH), the maximum number of bits supported Q is 720×0.1×4=288 bits in this case.
[0045] As mentioned above, option 2 for the assumed resource size is based on the indication in the Downlink Control Information (DCI) for UL allocation and semi-static configuration (e.g., Radio Resource Control (RRC)), which is the same as the case where, for example, a beta factor offset field is available in the DCI. More specifically, one resource size is selected by the DCI from a range of resource sizes (indexes) given by the RRC. For example, assuming that the assigned PUSCH is 720RE (6 PRBs), the offset of the beta factor is set by the RRC as {0.1, 0.2, 0.5, 1.0}, from which the DCI indicates the first index (0.1), and the assumed resource size is 720×0.1=72. Based on the same assumptions as the coding rate and modulation order (16QAM) in option 1, in this case the maximum number of bits supported Q is 720×0.1×0.1×4=29.
[0046] As mentioned before, option 3 for the assumed resource size is based only on semi-static configuration (e.g., RRC), which is the same as, for example, the fallback DCI case for resource calculation. More specifically, in this case, the resource size is calculated only by RRC without any DCI indication. For example, the beta value is indicated by RRC as, for example, 0.1, with no additional indication from DCI. Based on the same assumptions for the allocated PUSCH (720 REs), maximum coding rate (0.1), and modulation order (16QAM) of option 2, the maximum number of supported bits Q is in this case 720 x 0.1 x 0.1 x 4 = 29 bits.
[0047] According to one embodiment of the present disclosure, the maximum coding rate of UCI bits is set separately for multiplexing of UCI in PUSCH and multiplexing of Physical Uplink Control Channel (PUCCH), but the Radio Resource Control (RRC) parameter set for PUSCH and PUCCH is common.
[0048] Specifically, taking HARQ-ACK as an example of UCI, the maximum coding rate of HARQ-ACK bits is set separately for UCI multiplexing of PUSCH and UCI multiplexing of PUCCH, but the RRC parameters used for UCI multiplexing of PUCCH may be reused for UCI multiplexing of PUSCH. For example, an RRC parameter set {0.1, 0.2, 0.3, 0.4} for coding rate may be common to PUSCH and PUCCH, but 0.1 in this set may be set for PUSCH, while 0.2 in this set may be set for PUCCH.
[0049] In the above-described embodiments, the circuit 210 processes the UCI bits according to a comparison of M and N with P or a comparison of M and N with Q, but the present disclosure is not limited thereto.
[0050] According to one embodiment of the present disclosure, in the UE 200 shown in FIG. 2, when P<(M+N)≦Q, the circuit 210 multiplexes the N-bit UCI and the M-bit UCI without any compression.
[0051] Specifically, in this embodiment, the UCI bits are processed based on all of M, N, P, and Q. As mentioned above, generally, P is smaller than Q. Of course, when (M+N)≦P, that is, the designated “P” is sufficient to carry all of the UCI bits, the N-bit UCI and the M-bit UCI may be directly multiplexed without any compression, as in the case 1 of the embodiment in which the circuit 210 processes the bits to be transmitted according to the comparison of M and N with P. To avoid redundancy, this detail will not be described here.
[0052] Unlike the case 2 or 3 of the embodiment in which the circuit 210 processes the UCI bits to be transmitted according to the comparison of M and N with P, in this embodiment, there is no need to perform compression on the N-bit UCI and / or the M-bit UCI when P<(M+N), i.e., when the indicated "P" is not enough to carry all the UCI bits. Instead, a further comparison of M and N with Q will be performed, and if (M+N)≦Q, the N-bit UCI and the M-bit UCI will be directly multiplexed without any compression.
[0053] In this embodiment, the UE can utilize the additional resources (bits) obtained from the maximum coding rate, which can improve the accuracy of decoding of the UCI bits at the base station.
[0054] According to one embodiment of the present disclosure, in the UE 200 shown in FIG. 2, when a UCI bit is used for a first UCI, and a difference between a transmission coding rate of the first UCI taking into account a DL allocation after a UL grant and a transmission coding rate of the first UCI not taking into account a DL allocation after a UL grant is higher than a predetermined value, the circuit 210 pre-empts resources used for a second UCI having a lower priority than the first UCI in the PUSCH to provide additional bits for the first UCI.
[0055] Specifically, the difference between the transmission coding rate of the first UCI considering the DL allocation after the UL grant minus the transmission coding rate of the first UCI not considering the DL allocation after the UL grant being higher than a predetermined value means that there are not enough resources in the PUSCH to transmit both the UCI bits corresponding to the DL allocation before the UL grant and the UCI bits corresponding to the DL allocation after the UL grant for the first UCI, when the UCI bits corresponding to the DL allocation after the UL grant for the first UCI are further considered. In addition to compressing some of the UCI bits for the first UCI itself as in the above embodiment, another option is to interrupt resources used for UCIs other than the first UCI, if there are UCIs with a lower priority than the first UCI. That is, interrupt resources intended for the lower priority UCIs in the PUSCH to provide additional resources (bits) for the higher priority UCIs, to ensure that the UCI bits of the higher priority UCIs are not compressed.
[0056] According to one embodiment of the present disclosure, the first UCI is a Hybrid Automatic Repeat Request Acknowledgement (HARQ-ACK) and the second UCI is Channel State Information (CSI).
[0057] Specifically, assume that the first UCI is a HARQ-ACK and the second UCI is a CSI. Since the priority of the HARQ-ACK is higher than the priority of the CSI, resources intended for the CSI in the PUSCH can be preempted to be used for the bits of the HARQ-ACK.
[0058] It should be noted that the HARQ-ACK and CSI are merely examples, and the present disclosure is not limited thereto. The first UCI and the second UCI may be any other suitable type of UCI depending on the specific environment.
[0059] According to one embodiment of the present disclosure, this predetermined value is set or defined in a standard.
[0060] Specifically, the predetermined value is a threshold value for determining whether resources used for a second UCI having a lower priority than the first UCI in the PUSCH need to be interrupted to provide additional bits for the first UCI, and may be set by the base station, for example, via RRC signaling, or may be specified in a standard.
[0061] According to an embodiment of the present disclosure, in the UE 200 shown in FIG. 2, the circuit 210 interrupts resources used for the second UCI in the PUSCH by compressing and / or dropping the second UCI, and the dropping of the second UCI includes one of dropping some REs for the second UCI without changing the coding rate of the second UCI, changing the coding rate of the second UCI to leave some REs used for the first UCI, and dropping all REs for the second UCI.
[0062] Specifically, for ease of understanding, HARQ-ACK and CSI are further taken as examples of the first UCI and the second UCI, respectively. In order to interrupt the resources used for CSI in PUSCH, compression can be performed on the bits of CSI. As mentioned above, the principle of compression on the bits of CSI is similar to that on the bits of HARQ-ACK, so the details will not be described here to avoid redundancy. In addition to compression, dropping CSI is also an option.
[0063] More specifically, dropping of CSI can be implemented by dropping some REs for CSI in the PUSCH while keeping the coding rate of CSI as it is, so that some REs can be provided as additional resources for transmitting HARQ-ACK. Alternatively, dropping of CSI can be implemented by changing the coding rate of CSI to leave some REs used for HARQ-ACK. Or even dropping all REs for CSI can be implemented so that these REs can be provided as additional resources for transmitting HARQ-ACK.
[0064] Furthermore, the resources used for CSI in the PUSCH may also be interrupted by a combination of compressing bits of CSI and dropping REs of CSI.
[0065] It should be noted that the above implementation of the interrupt to the resources used for the second UCI is merely an example, and the interrupt to the resources used for the second UCI can be implemented in any other suitable manner depending on the particular environment.
[0066] According to one embodiment of the present disclosure, the compression is performed first in the spatial domain, then in the frequency domain, and finally in the time domain, or first in the spatial domain, then in the time domain, and finally in the frequency domain, as per the RRC configuration or as specified in the standard.
[0067] Specifically, DL allocations can be distributed across different carriers, TTIs, or beams. Whether compressing HARQ-ACK or CSI as described above, compression rules need to be determined for the spatial domain (for DL allocations before and after UL grant), frequency / carrier / BWP (Bandwidth part) domain, and time domain. For example, the compression rules can dictate that compression is performed first in the spatial domain, then in the frequency domain, and finally in the time domain. Alternatively, the compression rules can dictate that compression is performed first in the spatial domain, then in the time domain, and finally in the frequency domain. It should be noted that the present disclosure is not limited to the above, and the compression rules may be different from the above examples depending on the specific environment.
[0068] Furthermore, the compression rule can be dynamically configured by the base station, for example via RRC signaling, i.e., the compression rule may be set by the base station via RRC signaling to initially indicate that compression is to be performed first in the spatial domain, then in the frequency domain, and finally in the time domain, and may subsequently be further set by the base station via further RRC signaling to indicate that compression is to be performed first in the spatial domain, then in the time domain, and finally in the frequency domain.
[0069] Alternatively, the compression rules may be defined in the standard, which will not be dynamically changed, i.e., the compression rules may be defined in the standard, for example, to indicate that compression is first performed in the spatial domain, then in the frequency domain, and finally in the time domain, which will not be changed midway. Alternatively, the compression rules may be defined in the standard, for example, to indicate that compression is first performed in the spatial domain, then in the time domain, and finally in the frequency domain, which will also not be changed midway.
[0070] According to one embodiment of the present disclosure, the UCI bits are used for one of HARQ-ACK, CSI part 1, and CSI part 2, and the coding rate for each of HARQ-ACK, CSI part 1, and CSI part 2 is set separately.
[0071] Specifically, the above describes a case where HARQ-ACK is taken as an example of UCI. Note that HARQ-ACK for DL Semi-persistent Scheduling (SPS) may also be included in this. That is, HARQ-ACK may include both HARQ-ACK for DL SPS and HARQ-ACK for dynamic data.
[0072] Furthermore, although the above provides an example of HARQ-ACK, the present disclosure is not limited thereto. Also, UCI bits may be used for CSI part 1 or CSI part 2. As is well known in the art, in NR, CSI part 1 is CSI such as RI, layer indicator, and wideband CQI, and CSI part 2 is CSI such as PMI. The size of CSI part 2 is determined by CSI part 1.
[0073] More specifically, if UCI bits are used for CSI, reporting of CSI after PUSCH allocation (when based on DL allocation) uses a similar mechanism as for HARQ-ACK. For example, if the number of CSI bits generated after UL grant (A) and the number of CSI bits generated before UL grant (B) exceed the maximum coding rate limit, some compression operation is required to reduce the bits of "A+B".
[0074] It should be noted that, when multiple types of UCI are transmitted in the PUSCH, UCI bits for each type of UCI are processed separately. The coding rates for each type of UCI, such as HARQ-ACK, CSI part 1, and CSI part 2, can be set separately. For example, the bits of HARQ-ACK are processed by circuit 210 in UE 200 shown in FIG. 2 according to a comparison of M and N specific to HARQ-ACK with P and / or Q. The bits for CSI part 1 are processed by circuit 210 in UE 200 shown in FIG. 2 according to a comparison of M and N specific to CSI part 1 with P and / or Q. The bits for CSI part 2 are processed by circuit 210 in UE 200 shown in FIG. 2 according to a comparison of M and N specific to CSI part 2 with P and / or Q.
[0075] Furthermore, for example, in the above example shown in FIG. 1, the bits of UCI (e.g., HARQ-ACK) are generated based on DL allocation before and after the UL grant is received by the UE, but the present disclosure is not limited thereto. There may be a Physical Downlink Shared Channel (PDSCH) (e.g., Semi-Persistent Scheduling (SPS)) and no DL allocation. In this case, the bits of HARQ-ACK will be generated based on PDSCH, which also needs to be fed back to the base station. M bits of UCI (e.g., HARQ-ACK) may be generated based on PDSCH before the UL grant is received by the UE, and N bits of UCI (e.g., HARQ-ACK) may be generated based on PDSCH after the UL grant is received by the UE.
[0076] Furthermore, regarding how to count the DAI in the UL grant, two options are possible, as shown in Figures 3 and 4.
[0077] FIG. 3 illustrates one option for counting DAIs in an UL grant from a base station in NR. As in FIG. 1, in FIG. 3, the right-pointing axis represents the time axis and several TTIs shown thereon, the block filled with right-pointing slashes represents the UL grant received from the base station (gNB) in TTI#4, the three blocks filled with left-pointing slashes in TTI#1-3 represent DL allocations received from the base station before the UL grant, the two blocks filled with left-pointing slashes in TTI#5-6 represent DL allocations received from the base station after the UL grant, and the blocks filled with dots represent PUSCH transmissions from the UE to the base station. From the indication in the UL grant, the UE can determine the transmission timing for the PUSCH, e.g., TTI#8.
[0078] As mentioned before, the UL grant received by the UE in TTI#4 may also indicate a DAI to be used to calculate the required UCI resources. As shown in Figure 3, for the DL assignment received in TTI#1, the DAI value=1, for the DL assignment received in TTI#2 the DAI value is incremented to 2, and for the DL assignment received in TTI#3 the DAI value is incremented to 3. However, for the DL assignment received in TTI#5 the DAI value is reset to 1, and for the DL assignment received in TTI#6 the DAI value is incremented to 2. That is, the option shown in Figure 3 is to not count the DL assignment after the UL grant, but to count the DL assignment before the UL grant.
[0079] Figure 4 shows another option for counting the DAI in a UL grant from a base station in NR. Figure 4 is the same as Figure 3 except for the way in which the DAI is counted, and the same parts will not be described to avoid redundancy. As shown in Figure 4, for a DL assignment received in TTI#1, the DAI value is 1, for a DL assignment received in TTI#2, the DAI value is incremented to 2, for a DL assignment received in TTI#3, the DAI value is incremented to 3, for a DL assignment received in TTI#5, the DAI value is still incremented to 4, and for a DL assignment received in TTI#6, the DAI value is incremented to 5. That is, the option shown in Figure 4 is to count both DL assignments before the UL grant and DL assignments after the UL grant.
[0080] It should be noted that the counting of DAI described above with reference to Figures 3 and 4 is merely an example, and the present disclosure is not limited thereto. Those skilled in the art can use the above counting method or any other suitable DAI counting method depending on the specific environment.
[0081] The UE 200 has been described in detail above with reference to Figures 1 to 4. Further multiplexing of UCI bits in the PUSCH corresponding to DL allocation after UL grant in the UE 200 can increase user throughput and improve system performance.
[0082] In another embodiment of the present disclosure, a base station shown in FIG. 5 is provided. FIG. 5 shows a block diagram of a part of a base station 500 according to an embodiment of the present disclosure. As shown in FIG. 5, BS500 includes a receiver 510 and a circuit 520. The receiver 510 receives bits of uplink control information (UCI) transmitted from a user equipment at a transmission time interval (TTI) indicated by an uplink (UL) grant via a physical uplink shared channel (PUSCH). The circuit 520 decodes those UCI bits according to UCI multiplexing rules. These UCI bits are processed by the user equipment according to a comparison with the number of bits M of UCI generated based on a previous downlink (DL) allocation of the UL grant from the base station before transmission, the number of bits N of UCI generated based on a DL allocation after the UL grant, the number of bits P of UCI indicated by the UL grant, and / or at least the maximum number of bits Q calculated based on a set coding rate according to the UCI multiplexing rules. Also, each of M, N, P, and Q above is an integer of 0 or more. For example, this user equipment may be the UE200 shown in FIG. 2.
[0083] According to an embodiment of the present disclosure, when (M + N) ≤ P, the N-bit UCI and the M-bit UCI are multiplexed by the user equipment without any compression according to the UCI multiplexing rules. When M < P < (M + N), the N-bit UCI is compressed into (N - X1)-bit UCI, and the M-bit UCI is compressed into (M - X2)-bit UCI. The (N - X1)-bit UCI and the (M - X2)-bit UCI are multiplexed, and (X1 + X2) = M + N - P, and both X1 and X2 are integers of 0 or more. Also, when P ≤ M, the N-bit UCI is compressed into (N - Y1)-bit UCI, and the M-bit UCI is compressed into (M - Y2)-bit UCI. The (N - Y1)-bit UCI and the (M - Y2)-bit UCI are multiplexed. In the above, (Y1 + Y2) = M + N - P, and both Y1 and Y2 are integers of 0 or more.
[0084] According to an embodiment of the present disclosure, when (M+N)≦Q, according to the UCI multiplexing rule, the N-bit UCI and the M-bit UCI are multiplexed without any compression in the user equipment. Also, when Q<(M+N), the N-bit UCI is compressed to a (N-Z1)-bit UCI, and the M-bit UCI is compressed to a (M-Z2)-bit UCI in the user equipment. The (N-Z1)-bit UCI and the (M-Z2)-bit UCI are multiplexed. In the above, (Z1+Z2)≧M+NQ, and both Z1 and Z2 are integers equal to or greater than 0.
[0085] According to one embodiment of the present disclosure, the set coding rate is the maximum coding rate of the UCI bits, and Q is calculated based on this maximum coding rate of the UCI bits, the assumed resource size, and the assumed modulation order.
[0086] According to one embodiment of the present disclosure, the expected resource size is the entire allocated PUSCH resources excluding resource elements (RE) for reference signals (RS) and is calculated based on an indication in the downlink control information for UL allocation and semi-static configuration or based only on semi-static configuration.
[0087] According to one embodiment of the present disclosure, the maximum coding rate of UCI bits is set separately for multiplexing of UCI in PUSCH and multiplexing of Physical Uplink Control Channel (PUCCH), but the Radio Resource Control (RRC) parameter set for PUSCH and PUCCH is common.
[0088] According to one embodiment of the present disclosure, the modulation order assumed is the same as that of the PUSCH.
[0089] According to an embodiment of the present disclosure, when P<(M+N)≦Q, the N-bit UCI and the M-bit UCI are multiplexed in the user equipment according to the UCI multiplexing rule without any compression.
[0090] According to one embodiment of the present disclosure, when a UCI bit is used for a first UCI, and a difference between a transmission coding rate of the first UCI taking into account a DL allocation after a UL grant minus a transmission coding rate of the first UCI not taking into account a DL allocation after a UL grant is higher than a predetermined value, a preemption of resources used for a second UCI having a lower priority than the first UCI in the PUSCH is performed according to a multiplexing rule of the UCI to provide additional bits for the first UCI.
[0091] According to an embodiment of the present disclosure, resources used for the second UCI in the PUSCH are interrupted by compressing and / or dropping the second UCI according to a multiplexing rule of UCI multiplexing, and the dropping of the second UCI includes one of dropping some REs for the second UCI without changing the coding rate of the second UCI, changing the coding rate of the second UCI to leave some REs used for the first UCI, and dropping all REs for the second UCI.
[0092] According to one embodiment of the present disclosure, the predetermined value is set or defined in a standard.
[0093] According to one embodiment of the present disclosure, the first UCI is a Hybrid Automatic Repeat Request Acknowledgement (HARQ-ACK) and the second UCI is Channel State Information (CSI).
[0094] According to one embodiment of the present disclosure, the compression is performed first in the spatial domain, then in the frequency domain, and finally in the time domain, or first in the spatial domain, then in the time domain, and finally in the frequency domain, as per the RRC configuration or as specified in the standard.
[0095] According to one embodiment of the present disclosure, the UCI bits are used for one of HARQ-ACK, CSI Part 1, and CSI Part 2, and the coding rate for each of HARQ-ACK, CSI Part 1, and CSI Part 2 is set separately.
[0096] Further multiplexing of UCI bits in the PUSCH at the BS 500, which correspond to DL allocations after UL grants, can increase user throughput and improve system performance.
[0097] FIG. 6 illustrates a detailed block diagram of a user device 600, according to one embodiment of the present disclosure.
[0098] The user device 600 includes n coding and modulation units 610-1 to 610-n, each of which includes a coding unit 601 (601-1 to 601-n) and a modulation unit 602 (602-1 to 602-n) for transmission data #1 to transmission data #n. In the coding and modulation units 610-1 to 610-n, the coding units 601-1 to 601-n perform coding processing on the transmission data #1 to #n, respectively, and the modulation units 602-1 to 602-n perform modulation processing on the transmission data after data coding to generate respective data symbols. The coding rate and modulation scheme used at this time may depend on MCS (Modulation and Coding Scheme) information input from the adaptive control unit 624. The n coding and modulation units 610-1 to 610-n may be regarded as being for the PUSCH.
[0099] The resource allocation unit 611 allocates data symbols to PRBs under the control of the adaptive control unit 624, and outputs the allocated data symbols to the PRBs to the multiplexing unit 612. The resource allocation unit 611 can also output resource allocation information to the control information generation unit 613.
[0100] The control information generating unit 613 generates control information including UCI, and determines how to process the UCI bits to be transmitted based on the information input from the adaptive control unit 624 and the resource allocation unit 611. Specifically, as described above, the control information generating unit 613 determines how to process the UCI bits to be transmitted according to a comparison between M and N and P and / or Q. Next, the control information generating unit 613 outputs the generated control information to the encoding unit 614.
[0101] The encoding unit 614 performs encoding processing on the control information (eg, UCI), and the modulation unit 615 performs modulation processing on the encoded control information and outputs the control information to the multiplexing unit 612.
[0102] The multiplexing unit 612 multiplexes control information (e.g., UCI) and the data symbols input from the resource allocation unit 611, and outputs the resulting signal to an IFFT (Inverse Fast Fourier Transform) unit 616. The control information is multiplexed, for example, on a subframe-by-subframe basis. Note that time domain multiplexing or frequency domain multiplexing can be used to multiplex the control information.
[0103] The IFFT unit 616 performs IFFT processing on multiple subcarriers in the PRB to which the control information and data symbols are mapped, in order to generate OFDM (Orthogonal Frequency Division Multiplexing) symbols, which are multicarrier signals. A CP (Cyclic Prefix) adding unit 617 adds, as a CP, a signal that is the same as that at the end of the OFDM, to the beginning of the OFDM. A radio transmitting unit 618 performs transmission processing such as D / A conversion, amplification, and up-conversion on the OFDM symbols after the CP is added, and transmits them from an antenna 619 to the base station.
[0104] On the other hand, the radio receiving unit 620 receives the n OFDM symbols transmitted from the base station via the antenna 619, and performs receiving processes such as down-conversion and A / D conversion on these OFDM symbols. The CP removing unit 621 removes the CP from the OFDM symbols after the receiving process.
[0105] An FFT (Fast Fourier Transform) unit 622 performs FFT processing on the OFDM symbols after CP removal in order to obtain a signal multiplexed in the frequency domain.
[0106] In the demodulation and decoding units 623-1 to 623-n, the demodulation units 604-1 to 604-n perform demodulation processing on the signals after FFT, and the decoding units 603-1 to 603-n perform decoding processing on the signals after demodulation. In this manner, received data is obtained. Reception control information (e.g., DCI) in the received data is input to the adaptive control unit 624. The adaptive control unit 624 performs adaptive control on the transmission data based on the reception control information, and performs frequency scheduling for the resource allocation unit 611 to determine which PRB each data is assigned to. More specifically, the UE 600 can receive DL allocation and UL grant from the base station (e.g., as shown in FIG. 1). After being demodulated and decoded by the demodulation and decoding units 623-1 to 623-n, the DL allocation may be provided to the adaptive control unit 624 and then to the control information generation unit 613, for example to generate UCI.
[0107] The user equipment 600 shown in Fig. 6 can function as the UE 200 shown in Fig. 2. Specifically, the radio transmission unit 618 may correspond to the transmitter 220. The circuit 210 may include coding and modulation units 610-1 to 610-n, a resource allocation unit 611, a multiplexing unit 612, a control information generation unit 613, a coding unit 614, a modulation unit 615, an IFFT unit 616, a CP addition unit 617, a CP removal unit 621, an FFT unit 622, demodulation and decoding units 623-1 to 623-n, and an adaptive control unit 624. Of course, one or more of these components may be separated from the circuit 210 depending on specific requirements.
[0108] FIG. 7 illustrates a detailed block diagram of a base station 700 in accordance with one embodiment of the present disclosure.
[0109] In the base station 700 shown in FIG. 7, a radio receiving unit 711 receives an OFDM symbol transmitted from a user device via an antenna 710, and performs receiving processing such as up-conversion and A / D on the OFDM symbol. A CP removing unit 712 removes the CP from the OFDM symbol after the receiving processing. An FFT unit 713 performs FFT processing on the OFDM symbol after the CP removal in order to obtain a received signal in which control information (including UCI) and data symbols are multiplexed. A demultiplexing unit 714 demultiplexes the received signal after FFT into a control signal and a data symbol. Next, the demultiplexing unit 714 outputs the control signal to a demodulation and decoding unit 715, and outputs the data symbol to a demapping unit 716.
[0110] In the demodulation / decoding unit 715, the demodulation unit 701 performs demodulation processing on the control signal, and the decoding unit 702 performs decoding processing on the demodulated signal. This control information may include UCI. As described above, the demodulation / decoding unit 715 can demodulate and decode the UCI bits according to the UCI multiplexing rule, which may be preset in the BS 700 and notified to the user equipment, or may be specified in a standard. In the user equipment, the UCI bits to be transmitted are processed according to the comparison of M and N with P and / or Q in accordance with the UCI multiplexing rule.
[0111] In addition, the control information may also include resource allocation information, which the demodulator / decoder 715 then outputs to the demapping unit 716.
[0112] The demapping unit 716 extracts data symbols from the PRBs based on the resource allocation information input from the demodulation and decoding unit 715. Next, the demapping unit 716 outputs the extracted data symbols to the demodulation and decoding unit 717.
[0113] In the demodulation / decoding unit 717, the demodulator 703 performs demodulation processing on the data symbols input from the demapping unit 716, and the decoder 704 performs decoding processing on the demodulated signal. In this manner, received data is obtained.
[0114] Meanwhile, in the coding and modulation unit 718, the coding unit 705 performs coding processing on the transmission data, and the modulation unit 706 performs modulation processing on the coded transmission data to generate data symbols. The IFFT unit 719 performs IFFT processing on multiple subcarriers in the PRB to which the data symbols input from the coding and modulation unit 718 are assigned, to generate an OFDM symbol that is a multicarrier signal. The CP adding unit 720 adds, as a CP, the same signal as that at the end of the OFDM to the beginning of the OFDM. The wireless transmitting unit 721 performs transmission processing such as D / A conversion, amplification, and up-conversion on the OFDM symbol after the CP is added, and transmits it from the antenna 710 to the user device.
[0115] Although not shown in FIG. 7, it will be appreciated that the BS 700 can similarly transmit DCI to the user equipment using the coding and modulation unit 718, the IFFT unit 719, the CP adding unit 720, and the antenna 710.
[0116] It should be noted that the base station 700 shown in Fig. 7 can function as the BS 500 shown in Fig. 5. Specifically, the radio receiving unit 711 may correspond to the receiver 510. The circuit 520 may include a CP removing unit 712, an FFT unit 713, a demultiplexing unit 714, demodulation and decoding units 715 and 717, a demapping unit 716, a coding and modulation unit 718, an IFFT unit 719, and a CP adding unit 720. Of course, one or more of these components may be separated from the circuit 520 depending on specific requirements.
[0117] As is known in the art, current NR supports both Cyclic Prefix - Orthogonal Frequency Division Multiplexing (CP-OFDM) waveforms and Discrete Fourier Transform - spread - Orthogonal Frequency Division Multiplexing (DFT-S-OFDM) waveforms for the uplink. Different waveforms will affect the mapping of UCI in NR. DFT-S-OFDM and CP-OFDM are well known in the related art and will not be described in detail here. The main difference between them is the presence or absence of an additional DFT operation. For example, although Figures 6 and 7 above show the case where the PUSCH uses a CP-OFDM waveform (in which there is no additional DFT operation), the present disclosure is not limited thereto. Of course, the present disclosure is also applicable to the case where the PUSCH uses a DFT-S-OFDM waveform.
[0118] 8 is a schematic diagram illustrating an example of a flowchart of communication between a BS 810 and a UE 820 according to an embodiment of the present disclosure. For example, the BS 810 may be the BS 500 illustrated in FIG. 5 or the base station 700 illustrated in FIG. 7, and the UE 820 may be the UE 200 illustrated in FIG. 2 or the user equipment 600 illustrated in FIG. 6.
[0119] In step ST101, the UE 820 uses a connection procedure to connect to the BS 810. This connection can be established by executing a known or future developed method, the details of which are omitted in this specification.
[0120] In step ST102, the UE 820 multiplexes UCI in the PUSCH. Specifically, the UE 820 processes the UCI bits to be transmitted according to a comparison between M and N and P and / or Q. As described above, the UE 820 may include the circuit 210 as the UE 200 shown in FIG. 2, and step ST102 may be performed by the circuit 210.
[0121] In step ST103, the UE 820 transmits the UCI bits in the PUSCH to the BS 810. As described above, the UE 820 may also include a transmitter 220 like the UE 200 shown in Fig. 2. Step ST103 is performed by this transmitter 220. Correspondingly, the BS 810 may include a receiver 510 like the BS 500 shown in Fig. 5, and the receiver 510 receives the UCI bits transmitted from the UE 820 in step ST103.
[0122] In step ST104, the BS 810 decodes the UCI bits according to a UCI multiplexing rule that indicates how to process the transmitted UCI bits. The BS 810 may also include a circuit 520 like the BS 500 shown in FIG. 5, and step ST104 may be performed by the circuit 520.
[0123] Note that, although not shown in FIG. 8, data can be transmitted in the PUSCH from the UE 820 to the BS 810 and then decoded by the BS 810.
[0124] In a further embodiment of the present disclosure, a wireless communication method for a user device is provided, as shown in Fig. 9. Fig. 9 shows a flowchart of a wireless communication method 900 for a user device according to one embodiment of the present disclosure. For example, the wireless communication method 900 can be applied to the UE 200 / 600 shown in Fig. 2 and Fig. 6.
[0125] As shown in FIG. 9, the wireless communication method 900 starts in step S901, in which uplink control information (UCI) bits to be transmitted are processed according to a comparison of a number M of UCI bits generated based on a downlink (DL) allocation before an uplink (UL) grant from a base station and a number N of UCI bits generated based on a DL allocation after an UL grant with a number P of UCI bits indicated in the UL grant and / or a maximum number Q of bits calculated based on at least a set coding rate. Each of the above M, N, P, and Q is an integer equal to or greater than 0. Then, in step S902, the processed UCI bits are transmitted to the base station in a physical uplink shared channel (PUSCH) at a transmission time interval (TTI) indicated in the UL grant. After step S902, the wireless communication method 900 ends. The base station may be, for example, the BS 500 / 700 shown in FIG. 5 and FIG. 7.
[0126] The wireless communication method 900 may further multiplex UCI bits corresponding to DL allocations after UL grants in the PUSCH, thereby increasing user throughput and improving system performance.
[0127] It should be noted that the wireless communication method 900 may also incorporate other technical features in the user equipment 200 described above, which will not be described here to avoid redundancy.
[0128] In a further embodiment of the present disclosure, a wireless communication method for a base station is provided, as shown in Figure 10. Figure 10 shows a flowchart of a wireless communication method 1000 for a base station according to one embodiment of the present disclosure. For example, the wireless communication method 1000 can be applied to the BS 500 / 700 shown in Figures 5 and 7.
[0129] As shown in FIG. 10, the wireless communication method 1000 starts in S1001, in which uplink control information (UCI) bits transmitted in a physical uplink shared channel (PUSCH) are received from a user equipment at a transmission time interval (TTI) indicated in an uplink (UL) grant. Then, in step S1002, the UCI bits are decoded according to a UCI multiplexing rule. After step S1002, the wireless communication method 1000 ends. The UCI bits before transmission are processed in the user equipment according to a comparison of a number M of UCI bits generated based on a downlink (DL) allocation before the UL grant from the base station and a number N of UCI bits generated based on a DL allocation after the UL grant with a number P of UCI bits indicated in the UL grant and / or a maximum number Q of bits calculated based on a coding rate set according to at least the UCI multiplexing rule, where each of M, N, P, and Q is an integer equal to or greater than 0. The user equipment may be, for example, the UE 200 / 600 shown in FIG. 2 and FIG. 6.
[0130] The wireless communication method 1000 may further multiplex UCI bits corresponding to DL allocations after UL grants in the PUSCH, thereby increasing user throughput and improving system performance.
[0131] It should be noted that the wireless communication method 1000 may also incorporate other technical features in the base station 500 described above, which will not be described here to avoid redundancy.
[0132] Although the above description focuses on multiplexing of UCI in PUSCH, the present disclosure is not limited thereto. As described in the background art, UCI can be transmitted in PUCCH as well. Therefore, the ideas disclosed above can be applied to multiplexing of UCI in PUCCH as well. For example, when there are not enough resources in PUCCH to transmit all of the UCI bits to be transmitted in PUCCH, compression can be performed on some of the UCI bits to reduce the total number of UCI bits to be transmitted in PUCCH. Of course, the considerations on how to perform compression as described above for the PUSCH case are equally applicable to the PUCCH case.
[0133] The present disclosure can be realized by software, hardware, or software linked to hardware. Each functional block used in the description of each embodiment may be realized as an LSI, which is an integrated circuit, and each process described in each embodiment may be controlled by the LSI. The LSI may be composed of individual chips, or may be composed of one chip to include some or all of the functional blocks. The LSI may have input and output of data. Depending on the degree of integration, the LSI may be called an IC, a system LSI, a super LSI, or an ultra LSI. In addition, the method of integration is not limited to LSI, and it can be realized by a dedicated circuit or a general-purpose processor. In addition, it may be realized as an FPGA (Field Programmable Gate Array) that can be programmed after LSI manufacture, or a reconfigurable processor that can reconfigure the connection and settings of the circuit cells inside the LSI.
[0134] It is intended that the present disclosure may be modified or altered in various ways by those skilled in the art based on the description presented in this specification and known techniques without departing from the contents and scope of the present disclosure, and such modifications and applications are included within the scope of what is claimed. Furthermore, the components of the above-described embodiments may be combined in any manner without departing from the contents of the present disclosure.
[0135] Embodiments of the present disclosure can provide at least the following subject matter.
[0136] (1) A circuit that processes uplink control information (UCI) to be transmitted according to a comparison between the number of bits M of UCI generated based on a downlink (DL) allocation before an uplink (UL) grant from a base station, the number of bits N of UCI generated based on a DL allocation after the UL grant, the number of bits P of UCI indicated in the UL grant, and / or the maximum number of bits Q calculated based on at least a set coding rate, where each of M, N, P, and Q is an integer greater than or equal to 0; and A transmitter that transmits the processed UCI bits to the base station at a transmission time interval (TTI) indicated in the UL grant in a physical uplink shared channel (PUSCH). A user equipment including the same.
[0137] (2) When (M + N) ≤ P, the circuit multiplexes the N-bit UCI and the M-bit UCI without any compression. When M < P < (M + N), the circuit compresses the N-bit UCI to an (N - X1)-bit UCI, compresses the M-bit UCI to an (M - X2)-bit UCI, and multiplexes the (N - X1)-bit UCI and the (M - X2)-bit UCI, where (X1 + X2) = M + N - P in the above, and both X1 and X2 are integers greater than or equal to 0. Also, When P ≤ M, the circuit compresses the N-bit UCI to an (N - Y1)-bit UCI, compresses the M-bit UCI to an (M - Y2)-bit UCI, and multiplexes the (N - Y1)-bit UCI and the (M - Y2)-bit UCI, where (Y1 + Y2) = M + N - P in the above, and both Y1 and Y2 are integers greater than 0. The user equipment according to (1).
[0138] (3) When (M + N) ≤ Q, the circuit multiplexes the N-bit UCI and the M-bit UCI without any compression. A user device as described in (1), wherein, when Q<(M+N), the circuit compresses N-bit UCI into (N-Z1)-bit UCI, compresses M-bit UCI into (M-Z2)-bit UCI, and multiplexes the (N-Z1)-bit UCI and the (M-Z2)-bit UCI, wherein (Z1+Z2)≧M+NQ, and both Z1 and Z2 are integers greater than or equal to 0.
[0139] (4) A user device as described in (1), wherein the set coding rate is a maximum coding rate of UCI bits, and Q is calculated based on the maximum coding rate of UCI bits, the expected resource size, and the expected modulation order.
[0140] (5) A user equipment as described in (4), wherein the expected resource size is the entire allocated PUSCH resource excluding resource elements (RE) for reference signals (RS) and is calculated based on an indication in downlink control information for UL allocation and semi-static configuration, or is calculated based only on semi-static configuration.
[0141] (6) A user equipment as described in (4), in which the maximum coding rate of UCI bits is set separately for multiplexing of UCI of PUSCH and multiplexing of a physical uplink control channel (PUCCH), but a radio resource control (RRC) parameter set for PUSCH and PUCCH is common.
[0142] (7) The user equipment according to (4), wherein the assumed modulation order is the same as that of the PUSCH.
[0143] (8) The user equipment according to (1), wherein when P<(M+N)≦Q, the circuit multiplexes the N-bit UCI and the M-bit UCI without any compression.
[0144] (9) The UCI bit is used for the first UCI. The user equipment of (1), wherein when a difference between a transmission coding rate of the first UCI taking into account a DL allocation after the UL grant and a transmission coding rate of the first UCI not taking into account a DL allocation after the UL grant is higher than a predetermined value, the circuit preempts resources used for a second UCI having a lower priority than the first UCI in the PUSCH to provide additional bits for the first UCI.
[0145] (10) The circuit interrupts resources used for the second UCI in the PUSCH by compressing and / or dropping the second UCI; This second UCI drop, Dropping some REs for the second UCI without changing the coding rate of the second UCI; Changing the coding rate of the second UCI to leave some RE used for the first UCI; and Drop all REs for the 2nd UCI, The user device according to (9) includes one of the following:
[0146] (11) The user device according to (9), wherein the predetermined value is set or specified in a standard.
[0147] (12) The user equipment according to (9), wherein the first UCI is a hybrid automatic repeat request acknowledgement (HARQ-ACK) and the second UCI is channel state information (CSI).
[0148] (13) A user device as described in any one of (2) to (3) and (10), wherein compression is performed first in the spatial domain, then in the frequency domain, and finally in the time domain, or first in the spatial domain, then in the time domain, and finally in the frequency domain, which is based on RRC settings or specified in a standard.
[0149] (14) The UCI bit is used for one of HARQ-ACK, CSI part 1, and CSI part 2; The user equipment described in (1), wherein the coding rate for each of HARQ-ACK, CSI part 1, and CSI part 2 is set separately.
[0150] (15). In a physical uplink shared channel (PUSCH), a receiver that receives uplink control information (UCI) bits transmitted from a user equipment at a transmission time interval (TTI) indicated in an uplink (UL) grant, A circuit that decodes UCI bits according to UCI multiplexing rules, including, The UCI bits before these transmissions are processed in the user equipment according to a comparison with the number of bits M of UCI generated based on a downlink (DL) allocation before a UL grant from a base station, the number of bits N of UCI generated based on a DL allocation after the UL grant, the number of bits P of UCI indicated in the UL grant, and / or the maximum number of bits Q calculated based on at least the coding rate set according to UCI multiplexing rules. Each of M, N, P, and Q above is an integer greater than or equal to 0. The base station.
[0151] (16). According to UCI multiplexing rules, When (M + N) ≤ P, in the user equipment, the N-bit UCI and the M-bit UCI are multiplexed without any compression. When M < P < (M + N), in the user equipment, the N-bit UCI is compressed into (N - X1)-bit UCI, the M-bit UCI is compressed into (M - X2)-bit UCI, and then the (N - X1)-bit UCI and the (M - X2)-bit UCI are multiplexed. In the above, (X1 + X2) = M + N - P, both X1 and X2 are integers greater than or equal to 0, and When P≦M, in the user equipment, N-bit UCI is compressed to (N-Y1)-bit UCI, M-bit UCI is compressed to (M-Y2)-bit UCI, and then the (N-Y1)-bit UCI and the (M-Y2)-bit UCI are multiplexed. The base station according to (15), wherein (Y1+Y2)=M+NP, and both Y1 and Y2 are integers greater than 0.
[0152] (17) In accordance with UCI multiplexing rules, When (M+N)≦Q, in the user equipment, the N-bit UCI and the M-bit UCI are multiplexed without any compression; When Q<(M+N), in the user device, N-bit UCI is compressed to (N-Z1)-bit UCI, M-bit UCI is compressed to (M-Z2)-bit UCI, and the (N-Z1)-bit UCI and (M-Z2)-bit UCI are multiplexed. In the above, (Z1+Z2)≧M+NQ, and both Z1 and Z2 are integers equal to or greater than 0. (15) A base station according to (15).
[0153] (18) The base station described in (15), wherein the set coding rate is a maximum coding rate of UCI bits, and Q is calculated based on the maximum coding rate of UCI bits, an assumed resource size, and an assumed modulation order.
[0154] (19) A base station as described in (18), wherein the expected resource size is the entire allocated PUSCH resource excluding resource elements (RE) for reference signals (RS) and is calculated based on an indication in downlink control information for UL allocation and semi-static configuration, or is calculated based only on semi-static configuration.
[0155] (20) A base station as described in (18), in which the maximum coding rate of UCI bits is set separately for multiplexing of UCI of PUSCH and multiplexing of a physical uplink control channel (PUCCH), but a radio resource control (RRC) parameter set for PUSCH and PUCCH is common.
[0156] (21) The base station according to (18), wherein the assumed modulation order is the same as that of the PUSCH.
[0157] (22) The base station according to (15), wherein when P<(M+N)≦Q, in the user equipment, N-bit UCI and M-bit UCI are multiplexed without any compression according to a UCI multiplexing rule.
[0158] (23) The UCI bit is used for the first UCI. 16. The base station according to claim 15, wherein, when a difference between a transmission coding rate of the first UCI taking into account a DL allocation after the UL grant and a transmission coding rate of the first UCI not taking into account a DL allocation after the UL grant is higher than a predetermined value, in the user equipment, resources used for a second UCI having a lower priority than the first UCI in a PUSCH are preempted according to a UCI multiplexing rule to provide additional bits for the first UCI.
[0159] (24) In the user equipment, a resource used for a second UCI in the PUSCH is interrupted by compressing and / or dropping the second UCI according to a UCI multiplexing rule; This second UCI drop, Dropping some REs for the second UCI without changing the coding rate of the second UCI; Changing the coding rate of the second UCI to leave some RE used for the first UCI; and Drop all REs for the 2nd UCI, The base station according to (23), comprising one of the following:
[0160] (25) The base station according to (23), wherein the predetermined value is set or specified in a standard.
[0161] (26) The base station according to (23), wherein the first UCI is a hybrid automatic repeat request acknowledgement (HARQ-ACK) and the second UCI is channel state information (CSI).
[0162] (27) A base station as described in any one of (16) to (17) and (24), wherein compression is performed first in the spatial domain, then in the frequency domain, and finally in the time domain, or first in the spatial domain, then in the time domain, and finally in the frequency domain, based on RRC settings or as specified in a standard.
[0163] (28) The UCI bit is used for one of HARQ-ACK, CSI part 1, and CSI part 2; The base station according to (15), wherein coding rates for HARQ-ACK, CSI Part 1, and CSI Part 2 are set separately.
[0164] (29) A step of processing uplink control information (UCI) to be transmitted according to a comparison of a number M of bits of UCI generated based on a downlink (DL) allocation before an uplink (UL) grant from a base station and a number N of bits of UCI generated based on a DL allocation after an UL grant with a number P of bits of UCI indicated in the UL grant and / or a maximum number Q of bits calculated based on at least a set coding rate, where each of M, N, P, and Q is an integer equal to or greater than 0; transmitting the processed UCI bits to a base station on a physical uplink shared channel (PUSCH) at a transmission time interval (TTI) indicated in the UL grant; A wireless communication method for a user device, comprising:
[0165] (30) The step of processing uplink control information (UCI) to be transmitted, when (M+N)≦P, multiplexing the N-bit UCI and the M-bit UCI without any compression; When M < P < (M + N), compressing an N-bit UCI into an (N - X1)-bit UCI, compressing an M-bit UCI into an (M - X2)-bit UCI, and then multiplexing the (N - X1)-bit UCI and the (M - X2)-bit UCI, where (X1 + X2) = M + N - P in the above, and both X1 and X2 are integers greater than or equal to 0, the step of multiplexing; When P ≤ M, compressing an N-bit UCI into an (N - Y1)-bit UCI, compressing an M-bit UCI into an (M - Y2)-bit UCI, and then multiplexing the (N - Y1)-bit UCI and the (M - Y2)-bit UCI, where (Y1 + Y2) = M + N - P in the above, and both Y1 and Y2 are integers greater than 0, the step of multiplexing; including the step of multiplexing, the wireless communication method according to (29).
[0166] (31). The step of processing the uplink control information (UCI) to be transmitted is When (M + N) ≤ Q, multiplexing the N-bit UCI and the M-bit UCI without any compression; When Q < (M + N), compressing an N-bit UCI into an (N - Z1)-bit UCI, compressing an M-bit UCI into an (M - Z2)-bit UCI, and multiplexing the (N - Z1)-bit UCI and the (M - Z2)-bit UCI, where (Z1 + Z2) ≥ M + N - Q in the above, and both Z1 and Z2 are integers greater than or equal to 0, the step of multiplexing; including the step of multiplexing, the wireless communication method according to (29).
[0167] (32). The set coding rate is the maximum coding rate of the UCI bits, and Q is calculated based on the maximum coding rate of the UCI bits, the size of the assumed resource, and the assumed modulation order, the wireless communication method according to (29).
[0168] (33) The wireless communication method according to (32), wherein the expected resource size is the entire allocated PUSCH resource excluding resource elements (RE) for reference signals (RS) and is calculated based on an indication in downlink control information for UL allocation and semi-static configuration, or is calculated based only on semi-static configuration.
[0169] (34) The wireless communication method according to (32), wherein the maximum coding rate of UCI bits is set separately for multiplexing of UCI of PUSCH and multiplexing of a physical uplink control channel (PUCCH), but a radio resource control (RRC) parameter set for PUSCH and PUCCH is common.
[0170] (35) The wireless communication method according to (32), wherein the assumed modulation order is the same as that of the PUSCH.
[0171] (36) The step of processing uplink control information (UCI) to be transmitted, The wireless communication method according to (29), further comprising: when P<(M+N)≦Q, multiplexing an N-bit UCI and an M-bit UCI without performing any compression.
[0172] (37). A UCI bit is used for the first UCI, and the step of processing uplink control information (UCI) to be transmitted includes: When a difference between a transmission coding rate of the first UCI taking into account a DL allocation after the UL grant and a transmission coding rate of the first UCI not taking into account a DL allocation after the UL grant is higher than a predetermined value, preempting resources used for a second UCI having a lower priority than the first UCI in a PUSCH to provide additional bits for the first UCI.
[0173] (38) A resource used for the second UCI in the PUSCH is interrupted by compressing and / or dropping the second UCI; The step to drop this second UCI is: dropping some REs for the second UCI without changing the coding rate of the second UCI; changing the coding rate of the second UCI to leave some RE used for the first UCI; Dropping all REs for the second UCI; The wireless communication method according to (37), comprising one of the following:
[0174] (39) The wireless communication method according to (37), wherein the predetermined value is set or specified in a standard.
[0175] (40) The wireless communication method according to (37), wherein the first UCI is a hybrid automatic repeat request acknowledgement (HARQ-ACK) and the second UCI is channel state information (CSI).
[0176] (41) A wireless communication method according to any one of (30) to (31) and (38), in which compression is performed first in the spatial domain, then in the frequency domain, and finally in the time domain, or first in the spatial domain, then in the time domain, and finally in the frequency domain, based on an RRC setting or as specified in a standard.
[0177] (42) The UCI bit is used for one of HARQ-ACK, CSI part 1, and CSI part 2; 29. The wireless communication method of claim 29, wherein coding rates for HARQ-ACK, CSI Part 1, and CSI Part 2 are set separately.
[0178] (43) receiving, on a physical uplink shared channel (PUSCH), uplink control information (UCI) bits transmitted from the user equipment at a transmission time interval (TTI) indicated in the UL grant; decoding UCI bits according to a UCI multiplexing rule; A wireless communication method for a base station, comprising: Before these transmissions, the UCI bits are processed in the user equipment according to a comparison with the number of bits M of UCI generated based on a downlink (DL) allocation before a UL grant from the base station, the number of bits N of UCI generated based on a DL allocation after the UL grant, the number of bits P of UCI indicated in the UL grant, and / or the maximum number of bits Q calculated based on an encoding rate set at least according to UCI multiplexing rules, where each of M, N, P, and Q is an integer greater than or equal to 0. A wireless communication method for a base station.
[0179] (44). According to the UCI multiplexing rules, When (M + N) ≤ P, in the user equipment, the N-bit UCI and the M-bit UCI are multiplexed without any compression. When M < P < (M + N), in the user equipment, the N-bit UCI is compressed to an (N - X1)-bit UCI, the M-bit UCI is compressed to an (M - X2)-bit UCI, and then the (N - X1)-bit UCI and the (M - X2)-bit UCI are multiplexed, where (X1 + X2) = M + N - P, and both X1 and X2 are integers greater than or equal to 0. When P ≤ M, in the user equipment, the N-bit UCI is compressed to an (N - Y1)-bit UCI, the M-bit UCI is compressed to an (M - Y2)-bit UCI, and then the (N - Y1)-bit UCI and the (M - Y2)-bit UCI are multiplexed, where (Y1 + Y2) = M + N - P, and both Y1 and Y2 are integers greater than 0. The wireless communication method according to (43).
[0180] (45). According to the UCI multiplexing rules, When (M + N) ≤ Q, the N-bit UCI and the M-bit UCI are multiplexed without any compression. (43), wherein, when Q<(M+N), in a user device, N-bit UCI is compressed to (N-Z1)-bit UCI, M-bit UCI is compressed to (M-Z2)-bit UCI, and the (N-Z1)-bit UCI and the (M-Z2)-bit UCI are multiplexed, where (Z1+Z2)≧M+NQ, and both Z1 and Z2 are integers equal to or greater than 0.
[0181] (46) A wireless communication method as described in (43), wherein the set coding rate is a maximum coding rate of UCI bits, and Q is calculated based on the maximum coding rate of UCI bits, an expected resource size, and an expected modulation order.
[0182] (47) The wireless communication method according to (46), wherein the expected resource size is the entire allocated PUSCH resource excluding resource elements (RE) for reference signals (RS) and is calculated based on an indication in downlink control information for UL allocation and semi-static configuration, or is calculated based only on semi-static configuration.
[0183] (48) The wireless communication method according to (46), wherein the maximum coding rate of UCI bits is set separately for multiplexing of UCI of PUSCH and multiplexing of a physical uplink control channel (PUCCH), but a radio resource control (RRC) parameter set for PUSCH and PUCCH is common.
[0184] (49) The wireless communication method according to (46), wherein the assumed modulation order is the same as that of the PUSCH.
[0185] (50) The wireless communication method according to (43), wherein, when P<(M+N)≦Q, in the user equipment, N-bit UCI and M-bit UCI are multiplexed without any compression in accordance with the UCI multiplexing rule.
[0186] (51) The UCI bit is used for the first UCI. The wireless communication method according to (43), wherein, when a difference between a transmission coding rate of a first UCI taking into account a DL allocation after a UL grant and a transmission coding rate of a first UCI not taking into account a DL allocation after a UL grant is higher than a predetermined value, in a user equipment, in accordance with a UCI multiplexing rule, a resource used for a second UCI having a lower priority than the first UCI in a PUSCH is preempted.
[0187] (52) In the user equipment, according to a UCI multiplexing rule, a resource used for a second UCI in the PUSCH is interrupted by compressing and / or dropping the second UCI; This second UCI drop, dropping some REs for the second UCI without changing the coding rate of the second UCI; changing the coding rate of the second UCI to leave some RE used for the first UCI; Dropping all REs for the second UCI; The wireless communication method according to (51), comprising one of the following:
[0188] (53) The wireless communication method according to (51), wherein the predetermined value is set or specified in a standard.
[0189] (54) The wireless communication method according to (51), wherein the first UCI is a hybrid automatic repeat request acknowledgement (HARQ-ACK) and the second UCI is channel state information (CSI).
[0190] (55) A wireless communication method according to any one of (44) to (45) and (52), in which compression is performed first in the spatial domain, then in the frequency domain, and finally in the time domain, or first in the spatial domain, then in the time domain, and finally in the frequency domain, based on RRC settings or as specified in a standard.
[0191] (56) The UCI bit is used for one of HARQ-ACK, CSI part 1, and CSI part 2; 43. The wireless communication method of claim 43, wherein coding rates for HARQ-ACK, CSI Part 1, and CSI Part 2 are set separately.
Claims
1. a receiver for receiving uplink control information (UCI) bits transmitted from a user equipment on a physical uplink shared channel (PUSCH) in a transmission time interval (TTI) indicated in an uplink (UL) grant; a circuit for decoding the UCI bits according to a UCI multiplexing rule; Including, the circuit decodes the UCI bits obtained by processing the UCI bits before transmission in the user equipment according to the UCI multiplexing rule, in accordance with a comparison of a number M of UCI bits generated based on a downlink (DL) allocation before the UL grant from a base station and a number N of UCI bits generated based on a DL allocation after the UL grant, with a number P of UCI bits indicated in the UL grant and / or a maximum number Q of bits calculated based on at least a coding rate set according to the UCI multiplexing rule, each of M, N, P, and Q being an integer equal to or greater than 0; The UCI bits are used for the first UCI, The circuit decodes the UCI bits while considering that, in the UCI multiplexing rule, when a difference between a transmission coding rate of the first UCI taking into account a DL allocation after the UL grant and a transmission coding rate of the first UCI not taking into account a DL allocation after the UL grant is higher than a predetermined value, a resource used for a second UCI having a lower priority than the first UCI is preempted in a PUSCH to provide additional bits for the first UCI. Base station.
2. interrupting resources used for the second UCI in a PUSCH by compressing and / or dropping the second UCI; The drop of the second UCI is dropping some REs for the second UCI without changing the coding rate of the second UCI; modifying the coding rate of the second UCI to leave some REs used for the first UCI; and Dropping all REs for the second UCI; including one of The base station according to claim 1 .
3. The first UCI is a hybrid automatic repeat request acknowledgement (HARQ-ACK), and the second UCI is channel state information (CSI). The base station according to claim 1 .
4. receiving uplink control information (UCI) bits transmitted by a user equipment on a physical uplink shared channel (PUSCH) in a transmission time interval (TTI) indicated in an uplink (UL) grant; decoding the UCI bits according to a UCI multiplexing rule; Including, In the UCI multiplexing rule, in the user equipment, the UCI bits before transmission are decoded according to a comparison between a number M of UCI bits generated based on a downlink (DL) allocation before the UL grant from a base station and a number N of UCI bits generated based on a DL allocation after the UL grant, and a number P of UCI bits indicated in the UL grant and / or a maximum number Q of bits calculated based on at least a coding rate set according to the UCI multiplexing rule, wherein each of M, N, P, and Q is an integer equal to or greater than 0; The UCI bits are used for the first UCI, In the UCI multiplexing rule, when a difference between a transmission coding rate of the first UCI taking into account a DL allocation after the UL grant and a transmission coding rate of the first UCI not taking into account a DL allocation after the UL grant is higher than a predetermined value, the UCI bits are decoded taking into account that a resource used for a second UCI having a lower priority than the first UCI is preempted in a PUSCH to provide additional bits for the first UCI. A wireless communication method.
5. interrupting resources used for the second UCI in a PUSCH by compressing and / or dropping the second UCI; The drop of the second UCI is dropping some REs for the second UCI without changing the coding rate of the second UCI; modifying the coding rate of the second UCI to leave some REs used for the first UCI; and Dropping all REs for the second UCI; including one of The wireless communication method according to claim 4.
6. The first UCI is a hybrid automatic repeat request acknowledgement (HARQ-ACK), and the second UCI is channel state information (CSI). The wireless communication method according to claim 4.
Citation Information
Patent Citations
Mobile station device, base station device, wireless communication system, wireless communication method, and integrated circuit
WO2012063754A1
