Systems, methods, and apparatus for multiplexing control information over physical channels.

Abstract

Systems, methods, and apparatus for multiplexing control information over a physical channel. The method may include: multiplexing control information over a physical channel in a communication system, wherein the control information includes a retransmission request acknowledgment (RTA) portion, and allocating an amount of resources for the physical channel for the RTA portion based on an amount of acknowledgment type included in the RTA portion. The RTA type may include acknowledgments for dynamically licensed traffic. The amount of resources may include an amount of reserved resources based on the RTA amount being less than a threshold. Another method may include: multiplexing control information over a physical channel in a communication system, wherein the control information includes a RTA portion; and allocating an amount of resources for the physical channel for the RTA portion based on a threshold, wherein the threshold is variable.

Description

[0001] This application claims priority and benefit to U.S. Provisional Patent Application No. 63 / 057,280, filed July 27, 2020, entitled “Methods for Hybrid Automatic Repeat Request (HARQ)”, and U.S. Serving Patent Application No. 17 / 367,310, filed July 2, 2021, entitled “Systems, Methods, and Apparatus for Multiplexing Control Information on a Physical Channel”, which are incorporated herein by reference. Technical Field

[0002] This disclosure generally relates to communication systems, and more particularly to systems, methods and apparatus for multiplexing control information over physical channels. Background Technology

[0003] Communication systems can multiplex control information (such as positive acknowledgment (ACK) or negative acknowledgment (NACK)) on channels (such as the Physical Uplink Shared Channel (PUSCH)).

[0004] The information disclosed in the background section is only intended to enhance the understanding of the background art of the present invention, and therefore may contain information that does not constitute prior art. Summary of the Invention

[0005] A method may include: multiplexing control information on a physical channel in a communication system, wherein the control information includes a retransmission request acknowledgment portion, and allocating a resource amount of the physical channel for the retransmission request acknowledgment portion based on an amount of acknowledgment type included in the acknowledgment portion. The acknowledgment type may include acknowledgments for dynamically licensed traffic. The step of allocating the resource amount may include: allocating a variable amount of resource based on an amount of acknowledgments for dynamically licensed traffic exceeding a threshold. The multiplexing step may include rate matching. The step of allocating the resource amount may include allocating a reserved amount of resource based on an amount of acknowledgments for dynamically licensed traffic being less than a threshold. The amount of acknowledgments may include the number of acknowledgment bits. The multiplexing step may include puncturing. The retransmission request acknowledgment portion may include a codebook. The physical channel may include a Physical Uplink Shared Channel (PUSCH), and the codebook may include a Type-2 Hybrid Automatic Repeat Request Acknowledgment (HARQ-ACK) codebook.

[0006] A method may include: multiplexing control information on a physical channel in a communication system, wherein the control information may include a retransmission request acknowledgment portion; and allocating a resource amount for the retransmission request acknowledgment portion of the physical channel based on a threshold, wherein the threshold is variable. The threshold may be based on a type of acknowledgment included in the acknowledgment portion. The threshold may include a first component based on a first type of acknowledgment and a second component based on a second type of acknowledgment. The first component may include a variable based on one or more acknowledgments for semi-persistent scheduling traffic, and the second component may include a fixed amount based on one or more acknowledgments for dynamically licensed traffic. The first component may be based on one or more configurations for semi-persistent scheduling traffic, and the second component may include an amount based on one or more acknowledgments for dynamically licensed traffic. The first component may include an amount based on one or more acknowledgments for semi-persistent scheduling traffic, and the second component may include an amount based on an allocation index. The first component may include an amount based on one or more acknowledgments for semi-persistent scheduling traffic, and the second component may include an amount based on a Radio Resource Control (RRC) configuration. The threshold may be based on changes in the amount of acknowledgments for semi-persistent scheduling traffic. The step of allocating the resource amount may include allocating a reserved resource amount based on the threshold and the size of the acknowledgment portion. The step of allocating the resource amount may include allocating a variable resource amount based on the threshold and the size of the acknowledgment portion, and the multiplexing step may include rate matching. The threshold may be based on the error probability of the retransmission request acknowledgment portion size. The error probability may be based on the number of downlink control information (DCI) transmissions.

[0007] An apparatus may include a transceiver and a controller, wherein the transceiver is configured to multiplex a retransmission request acknowledgment payload over a physical channel, and the controller is configured to allocate a resource amount of the physical channel to the retransmission request acknowledgment payload based on the number of acknowledgments for dynamically licensed traffic included in the payload. The controller may also be configured to allocate reserved resources based on the number of acknowledgments for dynamically licensed traffic included in the payload and the number of acknowledgments for semi-persistent scheduling traffic included in the payload. Attached Figure Description

[0008] The accompanying drawings are not necessarily drawn to scale, and throughout the drawings, for illustrative purposes, elements with similar structures or functions are generally indicated by the same reference numerals or portions thereof. The drawings are intended only to facilitate the description of the various embodiments described herein. The drawings do not describe every aspect of the teachings disclosed herein and do not limit the scope of the claims. To prevent obscurity, not all components, connections, etc., may be shown, and not all components have reference numerals. However, the pattern of component configurations is readily apparent from the drawings. The drawings, together with the specification, illustrate exemplary embodiments of this disclosure and, together with the description, serve to explain the principles of this disclosure.

[0009] Figure 1 An example of multiplexing UCI on PUSCH is shown according to an exemplary embodiment of the present disclosure.

[0010] Figure 2 An example embodiment of a method for reusing UCI on a PUSCH using a fixed number of reserved resource elements and perforation multiplexing technology, according to the present disclosure, is shown.

[0011] Figure 3 An example embodiment of a method for multiplexing UCI on a PUSCH using a variable number of resource elements and rate matching multiplexing techniques, according to the present disclosure, is shown.

[0012] Figure 4 An example embodiment of the SPS PDSCH sequence according to this disclosure is shown.

[0013] Figure 5 An example embodiment of time slots for multiple SPS configurations that can overlap serving cells is shown according to this disclosure.

[0014] Figure 6 An example of the Type-2 HARQ-ACK CB error probability as a function of the number of participating codebooks is shown according to this disclosure.

[0015] Figure 7 Example embodiments of user equipment (UE) according to this disclosure are shown.

[0016] Figure 8 An example embodiment of a base station according to this disclosure is shown.

[0017] Figure 9 An embodiment of a method for reusing control information according to the present disclosure is shown.

[0018] Figure 10 An embodiment of another method for reusing control information according to the present disclosure is shown. Detailed Implementation

[0019] Overview

[0020] In some communication systems according to exemplary embodiments of this disclosure, control information (such as retransmission request ACK / NACK information) may be multiplexed with other data onto a channel (e.g., a Physical Uplink Shared Channel (PUSCH)). To provide reliable reception of the control information, the base station and user equipment (UE) may use a predetermined scheme to multiplex the control information onto the channel. The predetermined scheme may specify, for example, the size of the ACK / NACK payload (e.g., the number of bits and whether that number is fixed or variable), and a multiplexing technique (e.g., puncturing or rate matching). Thus, based on the predetermined technique, the UE may use the specified multiplexing scheme to send a specified number of ACK / NACK bits during PUSCH transmission. Because the base station knows the payload size and the multiplexing technique, it can decode the ACK / NACK bits with a high probability of success.

[0021] However, in some cases, the UE may send an ACK / NACK payload of a different size than the size expected by the base station, resulting in more frequent decoding failures. The difference between the size of the ACK / NACK payload sent by the UE and the size of the ACK / NACK payload expected by the base station can be referred to as the ACK / NACK payload size error. In some embodiments, the ACK / NACK payload size error can be caused by one or more of the following factors.

[0022] In some embodiments, if the ACK / NACK payload is less than or equal to a specific fixed threshold (e.g., 2 bits), the communication specification may require the base station and UE to use a fixed number of reserved ACK / NACK bits (and puncturing multiplexing techniques) in multiplexed PUSCH transmissions. However, if the ACK / NACK payload is greater than the fixed threshold, the specification may require the base station and UE to use a variable number of ACK / NACK bits (and rate-matched multiplexing techniques).

[0023] In some embodiments, using a payload size with a fixed number of reserved ACK / NACK bits can be more robust than using a payload size with a variable number of ACK / NACK bits (e.g., tolerating ACK / NACK payload size errors).

[0024] Furthermore, in some embodiments, different types of bits in the ACK / NACK payload may be associated with different types of downlink traffic, and the number of each type of bit in the payload can determine the probability of an ACK / NACK payload size error. For example, in some embodiments, the base station may send both Dynamic Grant (DG) downlink transmissions and Semi-Persistent Scheduling (SPS) downlink transmissions to the UE. However, depending on the implementation details, an ACK / NACK payload with a relatively low number of DG ACK / NACK bits may have a relatively high probability of causing an ACK / NACK payload size error.

[0025] Therefore, in some embodiments, when the ACK / NACK payload has a relatively low number of DG ACK / NACK bits, it may be beneficial to use a fixed number of reserved ACK / NACK bits in the multiplexed PUSCH transmission to reduce payload size errors and thus reduce decoding failures.

[0026] However, in some embodiments, stringent requirements of the communication specification may prevent the base station and / or UE from using more advantageous techniques to determine the size and / or type of ACK / NACK bits in multiplexed PUSCH transmissions. For example, in some embodiments, the specification may allow the ACK / NACK payload to include a relatively large number (e.g., 9) of SPS ACK / NACK bits and a relatively small number (e.g., 1) of DG ACK / NACK bits. Therefore, it may be beneficial to use a scheme with a fixed number of reserved ACK / NACK bits in multiplexed PUSCH transmissions to reduce payload size errors. However, if the specification has a relatively low fixed threshold (e.g., 2 bits), it may require the UE to use a variable number of ACK / NACK bits because the total ACK / NACK payload (10 bits in this example) exceeds the threshold.

[0027] Some communication systems and / or methods according to exemplary embodiments of this disclosure may use a variable threshold to determine whether a fixed number of reserved ACK / NACK bits or a variable number of ACK / NACK bits are used in a multiplexed PUSCH transmission. In some embodiments, the variable threshold may be based on the number of DG ACK / NACK bits. For example, in some embodiments, the variable threshold (T) may include a first component (T) equal to the number of SPS ACK / NACK bits. SPS The second component (T) is equal to any fixed number (e.g., 1, 2, etc.) of DG ACK / NACK bits. DGIn the case described above, with 9 SPS ACK / NACK bits and 1 DGACK / NACK bit, the total ACK / NACK payload can be 10 bits. However, if in T... DG When the variable threshold is set to 2, the variable threshold (T) can be 9 + 2 = 11. Therefore, since the total ACK / NACK payload does not exceed the threshold, the UE can use a fixed number of reserved ACK / NACK bits. This, in turn, prevents decoding failures due to errors in the size of the ACK / NACK payload.

[0028] This disclosure covers many inventive principles related to the reuse of control information. These principles may have independent utility and may be presented individually, and not every embodiment can utilize every principle. Furthermore, the principles may be presented in various combinations, some of which may synergistically amplify the benefits of the individual principles.

[0029] Example Implementation

[0030] This document describes some example embodiments of systems, devices, apparatuses, processes, methods, etc., illustrating some possible implementation details according to this disclosure. These examples are provided for the purpose of illustrating the principles of this disclosure, but the principles are not limited to or limited by these embodiments, implementation details, etc. For example, some embodiments may be described in the context of 5G and / or New Radio (NR) wireless communication systems, but the principles can also be applied to any other type of wired and / or wireless systems including 3G, 4G, and / or next-generation wireless networks, and / or any other communication system that can implement the multiplexing of control information. As another example, some embodiments may be described in the context of a hybrid Automatic Repeat Request Acknowledgment (HARQ-ACK) scheme and / or a specific multiplexing technique, but the principles can also be applied to any other type of acknowledgment and / or multiplexing technique.

[0031] UCI multiplexing on PUSCH

[0032] In some NR systems, the UE may send uplink control information (UCI) to the base station (which may be referred to as gNodeB or gNB). In some systems according to exemplary embodiments of this disclosure, the UCI may contain any type of information that can support one or more uplinks and / or associated downlinks. For example, in an NR system, the UCI may include one or more of the following: a scheduling request (SR) for scheduling uplink shared channel (UL-SCH) transmissions; channel state information (CSI) that may report one or more channel attributes, such as enabling the gNB and / or UE to adjust channel parameters; acknowledgment (ACK / NACK) information; and / or similar items.

[0033] Some embodiments of NR systems implement a HARQ-ACK scheme, in which the UE can provide feedback to the gNB regarding the failure or success of each downlink transmission. This feedback to the gNB can be provided in the form of HARQ-ACK bits sent in the UCI. For example, the gNB can retransmit a specific data transmission in response to receiving a UCI with a NACK corresponding to that specific data transmission.

[0034] In some embodiments of NR systems, UCIs are typically transmitted from the UE to the gNB on the Physical Uplink Control Channel (PUCCH). However, in certain situations, UCIs can be multiplexed onto the PUSCH along with other data. For example, if the network schedules UCIs on a PUCCH that overlaps with the PUSCH, or if a semi-statically configured PUSCH exists (such as a configured grant (CG) PUSCH), the UE can discard the PUCCH transmission and multiplex the UCIs onto the PUSCH. In some embodiments, this may be referred to as piggybacking the UCIs on the PUSCH.

[0035] Figure 1 An example of multiplexing UCI on a PUSCH is shown according to an exemplary embodiment of this disclosure. For example... Figure 1 As shown on the left, the network can initially schedule PUCCH 102, which includes UCI 104, to overlap with PUSCH 106. This is done for one or more reasons, such as reducing UE complexity. Figure 1 As shown on the right, the UE can discard PUCCH 102 and multiplex UCI 104 onto PUSCH 106.

[0036] In some embodiments, when UCI is multiplexed on a PUSCH, different portions of the UCI can be encoded separately. For example, different types of UCI (such as CSI portion 1, CSI portion 2, and / or HARQ-ACK) can be encoded separately. As an example, the number of resource elements (REs) available for different portions of the UCI (such as HARQ-ACK and / or CSI) can be determined based on one or more of the following: HARQ-ACK payload size; CSI payload size; the total number of REs available in the PUSCH (e.g., in a PUSCH time slot); one or more control parameters (such as β offset and α offset that can be configured for the UE via Radio Resource Control (RRC) and indicated to the UE via Downlink Control Information (DCI); and / or similar items.

[0037] In some embodiments, the number of REs (Q′) available for the HARQ-ACK payload can be given by the following equations (1), (2), and (3), respectively. ACK), the number of REs available for CSI Part 1 payload (Q′) CSI-1 ) and the number of REs available for CSI Part 2 payload (Q′) CSI-2 ),

[0038]

[0039]

[0040]

[0041] in:

[0042] O ACK It can indicate the ACK / NACK payload size;

[0043] L ACK It can indicate the CRC size;

[0044] K r It can indicate the size of the r-th codebook (CB);

[0045] O UL-SCH The quantity of CB can be indicated;

[0046] It can indicate the number of REs available for UCI in an Orthogonal Frequency Division Multiplexing (OFDM) symbol l;

[0047] as well as

[0048] α and β can indicate RRC control parameters.

[0049] After calculating the number of bits available for HARQ-ACK, CSI Part 1, and / or CSI Part 2, the encoded bits for HARQ-ACK, CSI Part 1, and / or CSI Part 2 can be placed in REs at locations such as those shown below in the PUSCH. In some embodiments, multiplexing UCIs (such as HARQ-ACK and / or CSI) can reduce the number of REs available for other data (such as UL-SCH data bits). Therefore, as explained in more detail below, a subset of other data symbols can be selected to be included in the available REs of the PUSCH.

[0050] In some embodiments, the reduced number of REs available for other data (such as UL-SCH data bits) may affect the reliability of transmitting other data. Therefore, in some embodiments, equations (1), (2), and (3), along with the parameters used with them, can be adjusted to provide acceptable reliability for other data while accommodating UCI data multiplexed on the PUSCH.

[0051] In some embodiments, the number of REs that can be allocated to a code bit PUSCH can be determined as shown in Table 1 below:

[0052] Table 1

[0053]

[0054] In some embodiments, no UCI may be mapped to any symbol carrying a demodulation reference signal (DMRS). In some embodiments, the HARQ-ACK bit may be mapped to a RE following a set of consecutive DMRS symbols. In some embodiments, a fixed threshold may be implemented, for example, T1 = 2.

[0055] In some embodiments, the method for multiplexing UCI and other data on a PUSCH according to this disclosure can implement one of two different schemes based on whether the size of the HARQ-ACK payload exceeds a fixed threshold T1. For example, if the size of the HARQ-ACK payload is less than or equal to the fixed threshold T1, a fixed number of REs can be allocated to the HARQ-ACK payload, and perforation multiplexing techniques can be used. In some embodiments, this may be referred to as reserving REs for the HARQ-ACK payload. However, if the size of the HARQ-ACK payload is greater than the fixed threshold T1, a variable number of REs can be allocated to the HARQ-ACK payload, and rate-matched multiplexing techniques can be used. In some embodiments, this may be referred to as mapping REs for the HARQ-ACK payload.

[0056] Table 2 illustrates two schemes for multiplexing UCI with other data on the PUSCH according to example embodiments of this disclosure. When the size of the HARQ-ACK payload is less than or equal to a fixed threshold T1, the method shown in the left column can be used, while when the size of the HARQ-ACK payload is greater than the fixed threshold T1, the method shown in the right column can be used. The schemes shown in Table 2 can use, for example, the bit allocation shown in Table 1. In the schemes shown in the left column of Table 2, operation 1 may be referred to as reserving REs for the HARQ-ACK payload. In the schemes shown in the right column of Table 2, operation 2 may be referred to as mapping REs for the HARQ-ACK payload.

[0057] Table 2

[0058]

[0059] A fixed number of reserved resource elements with perforations

[0060] Figure 2An example embodiment of a method for reusing UCI on a PUSCH using a fixed number of reserved resource elements and perforation multiplexing technology, according to the present disclosure, is shown. Figure 2 The embodiments shown can be used to implement, for example, schemes similar to those shown in the left column of Table 2, wherein the HARQ-ACK payload length is less than or equal to T1.

[0061] exist Figure 2 In the illustrated embodiment, the PUSCH slot is shown as resource grid 200, which has OFDM symbols along a horizontal axis and subcarriers along a vertical axis. REs may occupy each rectangle at the intersection of a subcarrier and an OFDM symbol. A vertical column of 12 REs at an OFDM symbol may form a resource block. One or more DMRS symbols (indicated by solid shading) may be located at a fixed OFDM symbol (e.g., Figure 2 In the resource blocks at positions 2, 5, 8, and 11 in the example shown.

[0062] Resource grid 200 may initially not have any allocated REs other than DMRS symbols. The method then locates and retains a fixed number of reserved REs, indicated by thick rectangle 202. In this example, eight REs may be reserved at symbol 3 and subcarriers 0 through 7. The method then assigns REs to CSI section 1 by mapping CSI section 1 code bits to positions indicated by diagonal single shading. The method then assigns REs to CSI section 2 by mapping CSI section 2 code bits to positions indicated by vertical and horizontal cross shading.

[0063] Then, the method can allocate the remaining REs plus the eight reserved REs to the sequence starting at g0 and extending to g. 69 (where g) i Can be equal to The UL-SCH data bits. Therefore, eight REs can be reserved at symbol 3 and subcarriers 0 to 7, and these eight REs can initially be assigned to UL-SCH bits g0 to g7 respectively.

[0064] Then, Figure 2 The method shown punctures the UL-SCH data bits located at symbols 3 and subcarriers 0 to 7 by replacing the HARQ-ACK bits located at symbols 3 and subcarriers 0 to 7 with the HARQ-ACK bits as shown by the diagonal cross-shading. Therefore, UL-SCH bits g0 to g7 can be replaced by HARQ-ACK bits, and only UL-SCH data bits g8 to g7 can be retained. 80 .

[0065] In some embodiments, although eliminating some UL-SCH data bits may slightly reduce the reliability of data transmission, redundancy, error correction, and / or other techniques for decoding UL-SCH data bits provide sufficient reliability, and the result is still a relatively high probability of successful decoding.

[0066] In addition, Figure 2 In the illustrated embodiment, because the positions of the remaining UL-SCH data bits may not change, the size error of the HARQ-ACK payload is relatively unlikely to cause decoding failure regardless of the actual size of the HARQ-ACK payload. For example, even if the UE sends a HARQ-ACK payload with only 4 bits, and the gNB expects 8 bits, the gNB can still successfully decode the remaining UL-SCH data bits (and / or CSI bits) because the positions of the remaining UL-SCH data bits (and / or CSI bits) may not change based on the number of REs used for the HARQ-ACK payload. In other words, the HARQ-ACK payload size error may not affect the position of the remaining UL-SCH data bits.

[0067] A variable number of resource elements with rate matching

[0068] Figure 3 An example embodiment of a method for multiplexing UCI on a PUSCH using a variable number of resource elements and a rate-matching multiplexing technique, according to this disclosure, is shown. For example, it can be used in... Figure 3 The embodiments shown implement a scheme similar to the one shown in the right column of Table 2, wherein the HARQ-ACK payload length is greater than T1.

[0069] exist Figure 3 In the illustrated embodiment, the PUSCH slot may have a resource grid 300, which has a similar structure to... Figure 2 The initial coverage area of ​​the embodiment shown is wherein the DMRS symbols are located in resource blocks at fixed OFDM symbols 2, 5, 8 and 11.

[0070] Resource grid 300 may initially not have any allocated REs other than DMRS symbols. However, instead of retaining a fixed number of reserved REs, Figure 3The method shown assigns REs to HARQ-ACK bits by mapping a variable number of HARQ-ACK bits (10 bits in this example) to REs located at symbol 3 and subcarriers 0 to 9, as shown by thick rectangle 302. The method then assigns REs to CSI part 1 by mapping CSI part 1 code bits to positions indicated by diagonal shading. The method then assigns REs to CSI part 2 by mapping CSI part 2 code bits to positions indicated by vertical and horizontal cross shading.

[0071] Then, the method can allocate the remaining REs in resource grid 300 to those starting at g0 and extending to g. 68 (where g) i Can be equal to ) UL-SCH data bits.

[0072] and Figure 2 Compared to the embodiments shown, in Figure 3 In the illustrated embodiment, because the position of the remaining UL-SCH data bits may change depending on the number of REs allocated to the variable number of HARQ-ACK bits, HARQ-ACK payload size errors may be more likely to cause decoding failures.

[0073] Multiple active SPS PDSCH configurations for each serving cell

[0074] In some NR systems according to exemplary embodiments of this disclosure, downlink traffic can be carried on different physical channels, such as the DG Physical Downlink Shared Channel (PDSCH) and / or the SPS PDSCH. The DG PDSCH can be scheduled via a scheduled Physical Downlink Control Channel (PDCCH) that can transmit downlink control information (DCI) to the UE. The DCI may include various information, such as time and / or frequency resources available to the UE for receiving the PDSCH. In some embodiments, the UE may receive the DG PDSCH simply by receiving the scheduled DCI associated with the DG PDSCH.

[0075] In some embodiments, SPS PDSCH can allow the UE to receive PDSCH without incurring the overhead associated with scheduling DCI. For example, with SPS PDSCH, the gNB can configure one or more SPS configurations for the UE, for example, via one or more RRC messages. For example, as shown in Table 3, the SPS configuration information element (IE) for each bandwidth portion (BWP) of each serving cell can include periodicity, PUCCH resource information, and / or other information related to SPS operation.

[0076] Table 3

[0077]

[0078] In some embodiments, the SPS PDSCH configuration can be activated by an instance of DCI activation, wherein the activated DCI can use any DCI format that can be used to schedule DG PDSCH. In some embodiments, activating the SPS PDSCH configuration may involve one or more additional verification mechanisms. For example, the DCI used for SPS activation can be scrambled using a configured Scheduled Radio Network Temporary Identifier (CS-RNTI). Some DCI fields may be specifically used for identifying SPS activation. These fields may include, for example, a New Data Indicator (NDI), a HARQ Processing Number (HPN), and / or a Redundancy Version (RV).

[0079] SPS Activation DCI can schedule the first SPS PDSCH timing in a manner similar to DG PDSCH. Subsequent SPS timings can then be determined based on the periodicity specified in the IE in the SPS configuration and the time-domain and / or frequency-domain resources indicated by the Activation DCI.

[0080] Figure 4 An example embodiment of the SPS PDSCH sequence according to this disclosure is shown. For illustrative purposes, in Figure 4 In the illustrated embodiment, the periodicity can be set to a single time slot. In contrast, the IE shown in Table 3 can specify a minimum period of 10 ms (e.g., 10 time slots for a subcarrier spacing of 15 kHz).

[0081] Refer again Figure 4 The first SPS PDSCH opportunity (opportunity 0) can be scheduled as a DG PDSCH in slot m that may include SPS-activated DCI. Subsequent SPS PDSCH opportunities (opportunity 1 in slot m+1, opportunity 2 in slot m+2, etc.) can be scheduled based on the SPS configuration provided via RRC, wherein RRC can specify periodicity, resource allocation, etc. for subsequent SPS PDSCH opportunities. In some embodiments, time and / or frequency resources may be after the time and / or frequency resources of the first SPS PDSCH opportunity.

[0082] In some embodiments, the DCI can be released, for example, via an instance of release in slot n. Figure 4The SPS PDSCH sequence is shown. Although releasing the DCI may not technically schedule any resources, in some embodiments, releasing the DCI may be associated with the last PDSCH timing in slot n. In some embodiments, the last PDSCH timing in slot n may be used, for example, in a semi-static HARQ-ACK codebook architecture. However, in some embodiments, the UE may assume that there is no SPS PDSCH reception in the last timing of slot n.

[0083] In some embodiments, each bandwidth portion (BWP) of the serving cell may have at most one active SPS configuration. To provide greater flexibility to the gNB in ​​scheduling ultra-reliable low-latency communication (uRLLC) and / or meeting the latency requirements of uRLLC, some embodiments may allow multiple active SPS configurations for each BWP of each serving cell. However, in embodiments that allow multiple active SPS configurations for each BWP of the serving cell, such as... Figure 5 As shown, multiple active SPS opportunities can overlap in time and / or frequency within a single time slot.

[0084] Figure 5 An example embodiment of time slots for multiple SPS configurations that can overlap serving cells is shown according to this disclosure. Figure 5 In the embodiments shown, overlapping active SPS timings may cause HARQ-ACK payload errors in the multiplexing process, which can be mitigated or eliminated by one or more multiplexing methods described herein.

[0085] HARQ-ACK report on PUSCH

[0086] In some embodiments, if the network schedules a DGPDSCH that overlaps with a PUCCH carrying a HARQ-ACK payload, it may include a Total Downlink Allocation Index (T-DAI) field in the DCI of the scheduled PUSCH. Depending on the implementation details, the T-DAI value can provide improved reliability for multiplexing on the PUSCH. For example, in some embodiments, the UE may loop through c and m outside of two while loops for the serving cell index (c) and the monitoring timing (MO) index (m). When the UE loops through the indexes, the UE may use the T-DAI field to replace the last detected (if any) T-DAI in the DCI. Depending on the implementation details, for example, if some or all of the DCIs in the DCI on the last MO index are lost, the T-DAI can help improve the reliability of the codebook (CB). However, in some embodiments, this type of reliability improvement may not be applied to the CG PUSCH.

[0087] As described above, in some embodiments, for relatively small HARQ-ACK payload sizes (e.g., less than or equal to 2), a fixed number of reserved REs and perforation multiplexing techniques for HARQ-ACK bits can be used to multiplex the UCI onto the PUSCH.

[0088] Depending on the implementation details, a potential advantage of using a fixed number of reserved REs for HARQ-ACK bits is that it is more robust (e.g., tolerating HARQ-ACK payload size errors, which may be referred to as HARQ-ACK CB error probabilities).

[0089] In some embodiments, when using puncturing multiplexing, PUSCH data symbols (e.g., UL-SCH data) can be punctured with HARQ-ACK bits at reserved REs. Depending on the implementation details, this type of puncturing technique can be more advantageous than rate matching because puncturing is more robust (e.g., tolerating incorrect HARQ-ACK payload sizes). Furthermore, even when puncturing is used with a variable number of REs, it is inherently more robust (e.g., tolerating HARQ-ACK CB error probabilities).

[0090] Conversely, in some embodiments, rate matching and a variable number of REs may be susceptible to HARQ-ACK payload size errors. For example, refer to Figure 3 In the illustrated embodiment, if the HARQ-ACK payload size is incorrect, data symbols may be shifted to different REs, which could lead to different interpretations of the data allocation by the gNB and UE. As a result, PUSCH decoding may fail.

[0091] In some embodiments, if a fixed number of reserved REs are used in both ACK / NACK reporting and puncturing and rate matching techniques, both puncturing and rate matching implementations can be robust (e.g., tolerating HARQ-ACK payload size errors). Depending on the implementation details, puncturing and rate matching techniques can be equally robust. Therefore, if a fixed number of reserved REs are used in ACK / NACK reporting, the choice between puncturing and rate matching techniques can depend on the performance of individual puncturing and / or rate matching PUSCH transmissions.

[0092] However, in some embodiments, if a variable number of REs are used for ACK / NACK reporting, and (e.g., as...) Figure 3If the CSI (as shown) is present in the multiplexed UCI, then neither puncturing nor rate matching is robust (e.g., tolerating HARQ-ACKCB errors). However, if the CSI is not present in the multiplexed UCI (e.g., the HARQ-ACK bit is the only type of UCI multiplexed only on the PUSCH), then puncturing may be more robust than rate matching when used with a variable number of REs. This is likely because even with ACK / NACK payload size errors, the position of the PUSCH data REs (e.g., UL-SCH data) can be fixed, thus making PUSCH decoding more likely to succeed. However, with ACK / NACK payload size errors, the use of rate matching techniques may cause the position of the PUSCH data REs (e.g., UL-SCH data) to shift, and therefore, PUSCH decoding may be more likely to fail at gNB.

[0093] HARQ-ACK error probability

[0094] In some embodiments, if the HARQ-ACK error probability is relatively high and rate-matched multiplexing is used, it may be beneficial to use a fixed number of reserved REs for the HARQ-ACK bits. However, if puncturing is used when the HARQ-ACK error probability is relatively high, using a variable number of REs for the HARQ-ACK bits may also provide acceptable results. In some embodiments, if the HARQ-ACK error probability is relatively high, using a fixed number of REs for the HARQ-ACK bits may provide acceptable results regardless of whether puncturing or rate-matching is used.

[0095] In some embodiments, the UE can be configured for Type-2 HARQ-ACK CB. Depending on the implementation details, the reliability of Type-2 CB can be determined by the number of DCI events that result in the loss of the participating codebook. Examples of DCI events (which may be referred to as DCIs) may include DCIs that schedule PDSCHs, DCIs that indicate the release of SPS PDSCHs, DCIs that indicate SCell sleep, and / or similar items.

[0096] Figure 6 An example of the Type-2 HARQ-ACK CB error probability as a function of the number of participating codebooks is shown, according to this disclosure. Figure 6In the illustrated embodiment, for a given PDCCH loss detection probability and 2-bit C-DAI and T-DAI fields, when the actual number of PDCCHs participating in the codebook is less than or equal to 4, the UE can correctly determine the CB payload size if at least one PDCCH is received. However, if all PDCCHs are lost, the CB payload size may be incorrect. Figure 6 In the illustrated embodiment, the lowest error probability can occur at four PDCCHs. As the number of PDCCHs increases beyond four, the HARQ-ACK CB error probability may increase because there may be more possible instances of four consecutive PDCCH loss. However, in Figure 6 In the examples shown, the HARQ-ACK error probability is likely to be highest for a relatively small number of actual PDCCHs (e.g., 1, 2, or 3). In these cases, if rate-matched multiplexing is used along with a variable number of REs for HARQ-ACK reporting, PUSCH decoding may fail (e.g., as mentioned above regarding...). Figure 3 The above).

[0097] Refer again Figure 6 In some embodiments, the Type-2 HARQ-ACK codebook error probability may be highest for a PDCCH with the minimum number of participating codebooks (e.g., for the minimum number of DG ACK / NACK bits). In these cases, using rate matching and a variable number of REs for HARQ-ACK reporting may result in a relatively high PUSCH decoding failure rate. Therefore, when there are relatively few DG ACK / NACK bits in the ACK / NACK payload, using rate-matched multiplexing with a fixed number of reserved REs or puncturing multiplexing with a fixed number of reserved REs may be advantageous.

[0098] In some embodiments, communication specifications (e.g., version 15 of the 5G-NR specification of the 3rd Generation Partnership Project (3GPP)) may allow only one SPS ACK / NACK bit to participate in the HARQ codebook. Therefore, when a relatively small number of DG ACK / NACK bits exist, the total HARQ-ACK payload size may still be relatively small because only a single SPS ACK / NACK bit can be included in the total. That is, the HARQ-ACK payload size closely reflects the number of DG ACK / NACK bits. Therefore, using a relatively small, fixed HARQ-ACK payload size threshold (e.g., T1 = 2) is sufficient to ensure the use of a fixed number of reserved REs and puncturing multiplexing techniques when a relatively small number of DG ACK / NACK bits exist. Thus, a more robust (e.g., fault-tolerant) scheme can be used when the HARQ-ACK codebook error probability is likely to be highest.

[0099] However, in some other embodiments, the communication specification (e.g., version 16 of the 5G-NR specification) allows for a relatively large number of SPS PDSCH configurations per serving cell (e.g., 8 configurations per cell). Furthermore, multiple cells can be configured with SPS configurations. Therefore, a relatively large number of SPS ACK / NACK bits can be involved in the HARQ codebook. Consequently, the HARQ-ACK payload size may not closely reflect the number of DG ACK / NACK bits. For example, a HARQ-ACK payload with a total of 20 bits may include 19 SPS ACK / NACK bits and 1 DG ACK / NACK bit. However, if a relatively small, fixed payload size threshold (e.g., T1 = 2) is used in this case, rate-matched multiplexing techniques with a variable number of REs can be used. This can lead to HARQ-ACK payload size errors and PUSCH decoding failures.

[0100] To mitigate this problem, some embodiments of the systems and / or methods according to this disclosure may select a scheme for allocating channel resources for acknowledgment reporting based on the number of DG ACK / NACK bits in the ACK / NACK payload rather than the total number of bits in the ACK / NACK payload. (In some embodiments, for example, when the payload may also include SPSACK / NACK bits, the final implementation may still be based on the total number of bits in the ACK / NACK payload. However, in these cases, the selection of a scheme for allocating channel resources for acknowledgment reporting may still be based on the number of DG ACK / NACK bits in the payload.)

[0101] Variable threshold

[0102] Some communication systems and / or methods according to exemplary embodiments of this disclosure may use a variable threshold to select a scheme for allocating channel resources for acknowledgment reporting (e.g., in multiplexed PUSCH transmissions). In some embodiments, the selected scheme may use a fixed number of reserved ACK / NACK bits, a variable number of ACK / NACK bits, and / or any other suitable configuration of ACK / NACK bits. In some embodiments, the selected scheme may use puncturing multiplexing, rate-matched multiplexing, and / or any other suitable multiplexing technique.

[0103] In some embodiments, the systems and / or methods according to this disclosure may be based on the observation that: (1) in some embodiments, the HARQ-ACK CB error probability can generally be relatively high for a small number of DG ACK / NACK bits; and (2) if the HARQ-ACK CB error probability is relatively high given any payload size and the number of DG or SPS ACK / NACK bits (e.g., the UE may determine an incorrect payload size), then using a fixed number of reserved REs (in conjunction with puncturing or rate-matched multiplexing techniques) for HARQ-ACK reporting can reduce the probability of decoding failure. Furthermore, in some embodiments, and depending on implementation details, using puncturing multiplexing techniques for HARQ-ACK reporting can reduce the probability of decoding failure.

[0104] For illustrative purposes, the following embodiments provide examples of a method according to this disclosure for determining a variable threshold T for selecting a scheme for allocating channel resources for acknowledgment reporting. The following examples can be applied to any system and / or method disclosed herein, for example. For instance, as provided in the following examples, the variable threshold T can be used instead of the above references to Table 2 and... Figure 2 and Figure 3 The illustrated embodiment uses a fixed threshold T1. However, the principle is not limited to any of these applications or any of the implementation details in the following examples. In the following example embodiments, T... SPS It can indicate the number of SPS ACK / NACK bits.

[0105] Example 1-1: (T DG (As a fixed number) If the UE multiplexes HARQ-ACK bits on the PUSCH, the UE can determine the threshold T for the number of REs used to reserve the PUSCH as follows: T can be determined based on the number of SPS ACK / NACK bits and the number of DG ACK / NACK bits in the HARQ-ACK payload, such that T = number of SPS ACK / NACK bits + T DG , among which, T DG It can be 1, 2, or any other fixed number. If the HARQ-ACK payload size is less than or equal to T, one of the following two schemes can be used: puncturing with a fixed number of reserved REs determined by assuming T ACK / NACK bits, or rate matching with a fixed number of reserved REs determined by assuming T ACK / NACK bits.

[0106] Table 4 provides a comparison of example results that can be provided by Method 1, such as Table 2 and T1=2. DG=2. Implementation method 1 is described in Example 1-1. As can be clearly seen from Table 4, the method provided by Example 1-1 can implement punched multiplexing technology and reserve a fixed number of REs for ACK / NACK payloads with a relatively large number of SPS ACK / NACK bits and a relatively small number of DGACK / NACK bits. Depending on the implementation details, this can reduce the probability of decoding failure.

[0107] Table 4

[0108]

[0109]

[0110] In some embodiments, the number of active SPS configurations or the total number of configured SPS configurations may also be used, regardless of the activation status, as described below.

[0111] Example 1-2: (T DG If the UE reuses HARQ-ACK bits on the PUSCH (as a fixed number), the UE can determine the threshold for the number of REs used to reserve the PUSCH as follows: T can be determined based on the number of SPS configurations or the number of active SPS configurations and the number of DGACK / NACK bits in the HARQ-ACK payload as T = (number of SPS configurations) + TD. G Or T = (Number of active SPS configurations) + T DG , among which, T DG It can be 1, 2, or any other fixed number. If the HARQ-ACK payload size is less than or equal to T, one of the following two schemes can be used: puncturing with a fixed number of reserved REs determined by assuming T ACK / NACK bits, or rate matching with a fixed number of reserved REs determined by assuming T ACK / NACK bits.

[0112] Example 1-1 (Alternative): If the UE multiplexes HARQ-ACK bits on the PUSCH, and if the number of DG ACK / NACK bits is less than or equal to 1, 2, or any fixed number, one of the following two schemes can be used: puncturing with a fixed number of reserved REs determined by assuming T = the number of SPS ACK / NACK bits + 2 as the total ACK / NACK payload size; or rate matching with a fixed number of reserved REs determined by assuming T = the number of SPS ACK / NACK bits + 2 as the total ACK / NACK payload size.

[0113] In some embodiments, the Type-2 HARQ-ACK CB error probability may be correlated with the bit width of the DAI field in the DCI. If the bit width of the DAI field increases, the HARQ CB provides better error correction capability. As an example, with a DAI bit width of 2, losing four consecutive DCIs in a row (e.g., in the same MO index) may result in a CB error event, while with a DAI bit width of 3, it may require eight consecutive lost DCIs to cause a CB error. Therefore, in some embodiments, the four actual DCIs in the HARQ CB are more prone to error for a bit width of 2 than for a bit width of 3. Therefore, in some embodiments, as illustrated in the following two examples, the threshold for selecting a scheme using a fixed number of REs may take into account the bit width of the DAI field.

[0114] Example 1-3: (T DG If the UE multiplexes HARQ-ACK bits on the PUSCH (as a function of the DAI bit width), the UE can determine the threshold for the number of REs used to reserve the PUSCH as follows: T can be determined based on the number of SPS ACK / NACK bits and the number of DG ACK / NACK bits in the HARQ-ACK payload, such that T = the number of SPS ACK / NACK bits + the number of DG ACK / NACK bits. In some embodiments, T DG It can be determined as a non-incrementing function of the bit width of the DAI field in the participating codebook. If the HARQ-ACK payload size is less than or equal to T, one of the following two schemes can be used: puncturing with a fixed number of reserved REs determined by assuming T ACK / NACK bits; or rate matching with a fixed number of reserved REs determined by assuming T ACK / NACK bits.

[0115] Example 1-4: (T DG If the UE multiplexes HARQ-ACK bits on the PUSCH (as a function of the DAI bit width), the UE can determine the threshold for the number of REs used to reserve the PUSCH as follows: T can be determined based on the number of SPS configurations or the number of active SPS configurations and the number of DGACK / NACK bits in the HARQ-ACK payload, such that T = (number of SPS configurations) + T DG Or T = (Number of active SPS configurations) + T DG In some embodiments, T can be DGThe bit width of the DAI field in the DCI of the participating codebook is determined as a decreasing function. If the HARQ-ACK payload size is less than or equal to T, one of the following two schemes can be used: puncturing with a fixed number of reserved REs assumed to be determined by T ACK / NACK bits; or rate matching with a fixed number of reserved REs assumed to be determined by T ACK / NACK bits.

[0116] In some embodiments, the network may determine T based on the number of SPS bits in the codebook. DG The value of . For example, if the network intends to use a relatively small number of SPS bits in the codebook, it can configure a smaller T for the UE. DG The value of T is determined by the number of SPS bits used in the codebook, and if it intends to use a relatively large number of SPS bits, it can be configured with a larger number of T bits. DG In this type of embodiment, it can also configure different T values ​​based on the configuration bit width of the DAI field in the DCI. DG The value of .

[0117] Example 1-5: If the UE multiplexes HARQ-ACK bits on the PUSCH, the UE can determine the threshold for the number of REs used to reserve the PUSCH as follows: T can be determined based on the number of SPS ACK / NACK bits and the number of DG ACK / NACK bits in the HARQ-ACK payload, such that T = number of SPS ACK / NACK bits + T DG In some embodiments, T can be determined based on the RRC configuration. DG Among them, the network can utilize T DG Configure the UE with the value of T. If the HARQ-ACK payload size is less than or equal to T, one of the following two schemes can be used: puncturing and a fixed number of reserved REs determined by assuming T ACK / NACK bits; or rate matching and a fixed number of reserved REs determined by assuming T ACK / NACK bits.

[0118] Example 1-6: If the UE multiplexes HARQ-ACK bits on the PUSCH, the UE can determine the threshold T for the number of REs used to reserve the PUSCH as follows: T can be determined based on the number of SPS configurations or the number of active SPS configurations and the number of DG ACK / NACK bits in the HARQ-ACK payload, such that T = (number of SPS configurations) + T DG Or T = (Number of active SPS configurations) + T DG In some embodiments, T can be determined based on the RRC configuration. DG Among them, the network can utilize T DGThe value is used to configure the UE. If the HARQ-ACK payload size is less than or equal to T, one of the following two schemes can be used: puncturing and a fixed number of reserved REs determined by assuming T ACK / NACK bits; or rate matching and a fixed number of reserved REs determined by assuming T ACK / NACK bits.

[0119] In some of the examples above, the value of the threshold T can be determined by considering the number of DG ACK / NACK bits in the HARQ CB. Alternatively, as illustrated in the following examples, a fixed number can be used for the total number of ACK / NACK bits participating in the CB without distinguishing between SPS bits and DG bits.

[0120] Example 2-1: If the UE multiplexes HARQ-ACK bits on the PUSCH, the UE can determine the threshold T for the number of REs used to reserve the PUSCH as follows: T can be determined based on the number of SPSACK / NACK bits. T can be a non-decreasing function of the number of SPSACK / NACK bits. If the HARQ-ACK payload size is less than or equal to T, one of the following two schemes can be used: puncturing and a fixed number of reserved REs determined by assuming T ACK / NACK bits; or rate matching and a fixed number of reserved REs determined by assuming T ACK / NACK bits.

[0121] Example 2-2: If the UE multiplexes HARQ-ACK bits on the PUSCH, the UE can determine the threshold T for the number of REs used to reserve the PUSCH as follows: T can be determined based on the number of SPS configurations or the number of active SPS configurations. T can be a non-decreasing function of the number of SPS configurations or the number of active SPS configurations. If the HARQ-ACK payload size is less than or equal to T, one of the following two schemes can be used: puncturing and a fixed number of reserved REs determined by assuming T ACK / NACK bits; or rate matching and a fixed number of reserved REs determined by assuming T ACK / NACK bits.

[0122] Example 2-3: If the UE multiplexes HARQ-ACK bits on the PUSCH, the UE can determine the threshold for the number of REs used to reserve the PUSCH as follows. T can be determined as a non-decreasing function of the bit width of the DAI field in the participating codebook's DCI. If the HARQ-ACK payload size is less than or equal to T, one of the following two schemes can be used: puncturing with a fixed number of reserved REs determined by assuming T ACK / NACK bits; or rate matching with a fixed number of reserved REs determined by assuming T ACK / NACK bits.

[0123] Example 2-4: If the UE multiplexes HARQ-ACK bits on the PUSCH, the UE can determine the threshold for the number of REs used to reserve the PUSCH as follows. The UE's value can be determined based on the RRC configuration, where the network can use the value of T to configure the UE. If the HARQ-ACK payload size is less than or equal to T, one of the following two schemes can be used: puncturing with a fixed number of reserved REs determined by assuming T ACK / NACK bits; or rate matching with a fixed number of reserved REs determined by assuming T ACK / NACK bits.

[0124] In some embodiments, the choice of multiplexing scheme may be related to the reliability of the HARQ-ACK codebook. In some embodiments, Type-1 CB is generally more reliable than Type-2 CB. However, the methods disclosed herein can be used with Type-1 CB, Type-2 CB, or any other type of CB.

[0125] In some embodiments, HARQ CB can be more reliable when used with DG PDSCH having a DAI field compared to CG PUSCH (or DG PDSCH without a DAI field). For example, when a UE multiplexes a DG ACK / NACK on a CG PUSCH, the CB size may be incorrect if the UE loses the DCI. However, when a UE multiplexes a DG ACK / NACK on a DG PDSCH with a DAI field, even if the UE misses the DCI, the T-DAI from the DCI of the scheduling PUSCH can be used to determine the correct payload size. Therefore, in some embodiments, any of the examples above can be applied to DG PDSCH with a DAI field. Depending on the implementation details, this can further improve the reliability of the multiplexing confirmation report.

[0126] The following examples illustrate in detail the applicability of Examples 1-1 to 2-4 to different PUSCH and HARQ-ACK types.

[0127] Example 3-1: (Type-2 CB and CG PUSCH or DG PDSCH without DAI field) If the UE is configured with a Type-2 HARQ-ACK codebook and the UE will multiplex HARQ-ACK bits on CGPUSCH or DG PDSCH without DAI field, the UE can determine a threshold for the number of REs used to reserve the PUSCH in a manner similar to any of the examples in Examples 1-1 to 2-4, and apply puncturing or rate-matched multiplexing techniques.

[0128] Example 3-2: (Type-2 CB and DG PDSCH with DAI field) If the UE is configured with a Type-2 HARQ-ACK codebook and the UE will multiplex the HARQ-ACK bits on a dynamically licensed PUSCH with a DAI field, the UE can determine a threshold for the number of REs used to reserve the PUSCH in a manner similar to any of the examples in Examples 1-1 to 2-4, and apply puncturing or rate-matched multiplexing techniques.

[0129] Example 3-3: (Type-1 CB and CG PUSCH or DG PDSCH without DAI field) If the UE is configured with a Type-1 HARQ-ACK codebook and the UE will multiplex HARQ-ACK bits on CG PUSCH or DG PDSCH without DAI field, the UE can determine the threshold for the number of REs used to reserve the PUSCH in a manner similar to any of the examples in Examples 1-1 to 2-4, and apply puncturing or rate-matched multiplexing techniques.

[0130] Example 3-4: (Type-1 CB and DG PDSCH with DAI field) If the UE is configured with a Type-1 HARQ-ACK codebook and the UE will multiplex the HARQ-ACK bits on a dynamically licensed PUSCH with a DAI field, the UE can determine a threshold for the number of REs used to reserve the PUSCH in a manner similar to any of the examples in Examples 1-1 to 2-4, and apply puncturing or rate-matched multiplexing techniques.

[0131] User equipment

[0132] Figure 7 Example embodiments of user equipment (UE) according to this disclosure are shown. Figure 7 The UE 700 shown may include a radio transceiver 702 and a controller 704, wherein the controller 704 can control the operation of the transceiver 702 and / or any other components of the UE 700. The UE 700 may be used to implement, for example, any of the functions described in this disclosure, including multiplexing control information on physical channels in a communication system, allocating the amount of resources for the retransmission request acknowledgment portion of the physical channel, selecting a scheme for determining the resources to be used for multiplexing ACK / NACK payloads (e.g., a fixed number of reserved REs, a variable number of REs, puncturing multiplexing, rate matching multiplexing, etc.) and / or similar items.

[0133] Transceiver 702 can transmit one or more signals to / receive one or more signals from a base station, and may include interface units for such transmission / reception. For example, transceiver 702 can transmit PDCCH, PDSCH, PUCCH and / or PUSCH signals to / receive PDCCH, PDSCH, PUCCH and / or PUSCH signals from a base station.

[0134] The controller 704 may include, for example, one or more processors 706 and a memory 708, the memory 708 storing instructions for the one or more processors 706 to execute code to implement any of the functions described in this disclosure. For example, the controller 704 may be used to implement any of the functions described in this disclosure, including: multiplexing control information on a physical channel in a communication system, allocating the amount of resources on the physical channel for the retransmission request acknowledgment portion, selecting a scheme for determining the resources to be used for the multiplexed ACK / NACK payload (e.g., a fixed number of reserved REs, a variable number of REs, puncturing multiplexing, rate-matched multiplexing, etc.).

[0135] base station

[0136] Figure 8 An example embodiment of a base station according to this disclosure is shown. Figure 8 The base station 800 shown may include a radio transceiver 802 and a controller 804, wherein the controller 804 can control the operation of the transceiver 802 and / or any other component in the base station 800. For example, the base station 800 may be used to implement any of the functions described in this disclosure, including: multiplexing control information on physical channels in a communication system, allocating the amount of resources on the physical channels for retransmission request acknowledgment portions, and selecting a scheme for determining the resources to be used for multiplexing ACK / NACK payloads (e.g., a fixed number of reserved REs, a variable number of REs, puncturing multiplexing, rate-matched multiplexing, etc.).

[0137] Transceiver 802 may transmit one or more signals to / receive one or more signals from the UE, and may include interface units for such transmission / reception. For example, transceiver 802 may transmit PDCCH, PDSCH, PUCCH and / or PUSCH signals to / receive PDCCH, PDSCH, PUCCH and / or PUSCH signals from the UE.

[0138] The controller 804 may include, for example, one or more processors 806 and a memory 808, wherein the memory 808 may store instructions for the one or more processors 806 to execute code to implement any base station function described in this disclosure. For example, the controller 804 may be used to implement any of the functions described in this disclosure, including: multiplexing control information on physical channels in a communication system, allocating the amount of resources on physical channels for retransmission request acknowledgment portions, selecting a scheme for determining the resources to be used for multiplexing ACK / NACK payloads (e.g., a fixed number of reserved REs, a variable number of REs, puncturing multiplexing, rate-matched multiplexing, etc.).

[0139] exist Figure 7 and Figure 8 In the illustrated embodiments, transceivers 702 and 802 may be implemented using various components for receiving and / or transmitting RF signals (e.g., amplifiers, filters, modulators and / or demodulators, A / D and / or DA converters, antennas, switches, phase shifters, detectors, couplers, conductors, transmission lines, etc.). Controllers 704 and 804 may be implemented using hardware, software, and / or any combination thereof. For example, a fully hardware implementation or a partially hardware implementation may include combinational logic, sequential logic, timers, counters, registers, gate arrays, amplifiers, synthesizers, multiplexers, modulators, demodulators, filters, vector processors, complex programmable logic devices (CPLDs), field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), system-on-a-chip (SOCs), state machines, data converters (such as ADCs and DACs), and / or the like. A fully software implementation or a partially software implementation may include one or more processor cores, memories, programs, data storage devices, and / or the like, which may be located locally and / or remotely and can be programmed to execute instructions for performing one or more functions of the controller. Some embodiments may include one or more CPUs that execute instructions stored in any type of memory, such as Complex Instruction Set Computer (CISC) processors (e.g., x86 processors) and / or Reduced Instruction Set Computer (RISC) processors (e.g., ARM processors), graphics processing units (GPUs), neural processing units (NPUs), tensor processing units (TPUs), and / or the like.

[0140] Additional Examples

[0141] Some embodiments may implement systems and / or methods for HARQ-ACK multiplexing on a PUSCH for multiple active SPS PDSCH configurations. Some embodiments may involve multiple active SPS PDSCH configurations for each bandwidth portion, and may accordingly implement one or more UE procedures to multiplex HARQ-ACK bits into the PUSCH. In some embodiments, a threshold may determine the number of REs used for UCI multiplexing on the PUSCH. In some embodiments, the threshold may be a function of the number of SPSACK / NACK bits that the UE must multiplex. Some embodiments may provide one or more methods to determine UE behavior when multiplexing ACK / NACK bits into the PUSCH. Some embodiments may consider the error probability of having multiple ACK / NACK bits in the HARQ-ACK codebook payload and / or the payload size. In some embodiments, the threshold may be defined as a function of the number of SPS A / N bits.

[0142] Figure 9 An embodiment of a method for multiplexing control information according to the present disclosure is shown. The method may begin at operation 902. At operation 904, the method may multiplex control information over a physical channel in a communication system, wherein the control information includes a retransmission request acknowledgment portion. At operation 906, the method may allocate a certain amount of resources on the physical channel for the retransmission request acknowledgment portion based on the amount of the type of acknowledgment included in the acknowledgment portion. The method may end at operation 908.

[0143] Figure 10 An embodiment of another method for multiplexing control information according to this disclosure is shown. The method may begin at operation 1002. At operation 1004, the method may multiplex control information over a physical channel in a communication system, wherein the control information includes a retransmission request acknowledgment portion. At operation 1006, the method may allocate a certain amount of resources for the retransmission request acknowledgment portion of the physical channel based on a threshold, wherein the threshold is variable. The method may end at operation 1008.

[0144] exist Figure 9 and Figure 10 In the embodiments shown, the components and / or operations illustrated are merely exemplary. Some embodiments may involve various additional components and / or operations not shown, and some embodiments may omit certain components and / or operations. Furthermore, in some embodiments, the arrangement of components and / or the temporal order of operations may be changed. Although some components and / or operations may be shown as separate components and / or operations, in some embodiments, some components and / or operations shown separately may be integrated into a single component and / or operation, and / or some components and / or operations shown as single components and / or operations may be implemented using multiple components and / or operations.

[0145] The embodiments disclosed herein may be described in the context of various implementation details, but the principles of this disclosure are not limited to these or any other specific details. Some functions have been described as being implemented by certain components, but in other embodiments, functions may be distributed among different systems and components in different locations. References to components or elements may refer only to a portion of the component or element. The term "based on" may mean at least partially based on. Unless explicitly stated otherwise from the context, the use of terms such as "first" and "second" in this disclosure and the claims may be used only for the purpose of distinguishing what they modify and may not indicate any spatial or temporal order. In some cases, "first" and "second" may refer to the same thing and / or different things. A reference to a first thing may not indicate the existence of a second thing. Furthermore, the various details and embodiments described above may be combined to produce additional embodiments based on the inventive principles disclosed herein. For convenience, various organizational aids such as chapter headings may be provided, but the subject matter arranged according to these aids and the principles of this disclosure are not limited or restricted by these organizational aids.

[0146] Since the inventive principles disclosed in this patent can be modified in terms of arrangement and details without departing from the inventive concept, such changes and modifications are considered to fall within the scope of the appended claims.

Claims

1. A method for multiplexing control information, comprising: multiplexing control information on a physical channel in a communication system, wherein the control information comprises a retransmission request acknowledgement part; and allocating an amount of resources of the physical channel for the retransmission request acknowledgement part based on an amount of acknowledgements for dynamically granted traffic included in the retransmission request acknowledgement part, wherein the step of allocating the amount of resources comprises allocating a variable amount of resources based on the amount of acknowledgements for dynamically granted traffic exceeding a first threshold for dynamically granted traffic, and allocating a reserved amount of resources based on the amount of acknowledgements for dynamically granted traffic being less than the first threshold for dynamically granted traffic.

2. The method of claim 1, wherein, The step of multiplexing comprises rate matching based on the amount of acknowledgements for dynamically granted traffic exceeding the first threshold for dynamically granted traffic.

3. The method of claim 1, wherein, The amount of acknowledgements comprises a number of acknowledgement bits.

4. The method of claim 1, wherein, The step of multiplexing comprises puncturing based on the amount of acknowledgements for dynamically granted traffic being less than the first threshold for dynamically granted traffic.

5. The method of claim 1, wherein, The retransmission request acknowledgement part comprises a codebook. 6.The method of claim 5, wherein: the physical channel comprises a physical uplink shared channel, PUSCH; and the codebook comprises a Type-2 hybrid automatic retransmission request acknowledgement, HARQ-ACK, codebook. 7.A method for multiplexing control information, comprising: multiplexing control information on a physical channel in a communication system, wherein the control information comprises a retransmission request acknowledgement part; and allocating an amount of resources of the physical channel for the retransmission request acknowledgement part based on a threshold; wherein the threshold is variable, and wherein the step of allocating the amount of resources comprises allocating a variable amount of resources based on an amount of acknowledgements for dynamically granted traffic included in the retransmission request acknowledgement part exceeding a first threshold for dynamically granted traffic included in the threshold, and allocating a reserved amount of resources based on the amount of acknowledgements for dynamically granted traffic being less than the first threshold for dynamically granted traffic.

8. The method of claim 7, wherein, The threshold is determined based on an amount of a type of acknowledgement included in the retransmission request acknowledgement part.

9. The method of claim 7, wherein, The threshold is a sum of a first component based on a first type of acknowledgement and a second component based on a second type of acknowledgement, wherein the second component is a first threshold for dynamically granted traffic. 10.The method of claim 9, wherein: the first component comprises a variable amount of one or more acknowledgements for semi-persistent scheduled traffic; and the second component comprises a fixed amount of one or more acknowledgements for dynamically granted traffic. 11.The method of claim 9, wherein: the first component is determined based on one or more configurations of acknowledgements for semi-persistent scheduled traffic; and the second component is determined based on an amount of one or more acknowledgements for dynamically granted traffic.

12. The method of claim 7, wherein, The step of allocating the amount of resources further comprises allocating a reserved amount of resources based on the threshold and a size of the retransmission request acknowledgement part. 13.The method of claim 12, wherein: The step of allocating the amount of resources further comprises allocating a variable amount of resources based on the threshold and a size of the retransmission request acknowledgement portion; and The step of multiplexing comprises rate matching.

14. The method of claim 7, wherein, The threshold is determined based on an error probability of a size of the retransmission request acknowledgement portion.

15. The method of claim 14, wherein, The error probability is determined based on a number of downlink control information, DCI, transmissions.

16. An apparatus for multiplexing control information, comprising: a transceiver configured to multiplex a retransmission request acknowledgement payload on a physical channel; and a controller configured to allocate an amount of resources of the physical channel to the retransmission request acknowledgement payload based on a number of acknowledgements of amounts of communications for dynamic grants included in the retransmission request acknowledgement payload, wherein the controller is configured to allocate the amount of resources of the physical channel to the retransmission request acknowledgement payload by allocating a variable amount of resources based on the number of acknowledgements of amounts of communications for dynamic grants exceeding a first threshold for dynamic grants and allocating a reserved amount of resources based on the number of acknowledgements of amounts of communications for dynamic grants being less than the first threshold for dynamic grants.

17. The apparatus of claim 16, wherein, The controller is further configured to allocate a reserved amount of resources based on the number of acknowledgements of amounts of communications for dynamic grants included in the retransmission request acknowledgement payload and a number of acknowledgements of amounts of communications for semi-persistent scheduling included in the retransmission request acknowledgement payload.

Images