Cascaded partitioned hybrid automatic repeat request acknowledgement (HARQ-ACK) bits and two-part HARQ-ACK compression

Abstract

A method of wireless communication by a user equipment (UE) includes converting blocks of hybrid automatic repeat request acknowledgement (HARQ-ACK) bits from an original HARQ-ACK codebook to partitions, a plurality of partitions for a plurality of blocks corresponding to quantized HARQ-ACK bits. The method further includes transforming the quantized HARQ-ACK bits into a two part HARQ-ACK payload. The method further includes separately encoding the first portion and the second portion of the two-portion HARQ-ACK payload. The method further includes transmitting the encoded first portion and the encoded second portion to a network node.

Description

[0001] Cross-reference to related applications

[0002] This application claims priority to U.S. Patent Application No. 18 / 471,245, filed September 20, 2023, entitled “CONCATENATING PARTITIONEDHYBRID AUTOMATIC REPEAT REQUEST ACKNOWLEDGEMENT (HARQ-ACK) BITS WITH TWO PARTHARQ-ACK COMPRESSION,” the entire disclosure of which is expressly incorporated herein by reference. Technical Field

[0003] This disclosure relates in general to hybrid automatic repeat request acknowledgment (HARQ-ACK) feedback during wireless communication, and more specifically to the cascading of HARQ-ACK bit partitions and two-part HARQ-ACK compression. Background Technology

[0004] Wireless communication systems are widely deployed to provide a variety of telecommunications services such as telephone, video, data, messaging, and broadcasting. Typical wireless communication systems employ multiple access technologies that can support communication with multiple users by sharing available system resources (e.g., bandwidth, transmit power, etc.). Examples of such multiple access technologies include Code Division Multiple Access (CDMA) systems, Time Division Multiple Access (TDMA) systems, Frequency Division Multiple Access (FDMA) systems, Orthogonal Frequency Division Multiple Access (OFDMA) systems, Single Carrier Frequency Division Multiple Access (SC-FDMA) systems, Time Division Synchronous Code Division Multiple Access (TD-SCDMA) systems, and Long Term Evolution (LTE). LTE / LTE-Advanced is an enhancement set of the Universal Mobile Telecommunications System (UMTS) mobile standard released by the 3rd Generation Partnership Project (3GPP). Narrowband (NB) Internet of Things (IoT) and Enhanced Machine-Type Communications (eMTC) are enhancement sets of LTE for machine-type communications.

[0005] A wireless communication network may include multiple base stations (BSs) capable of supporting communication for multiple user equipment (UEs). UEs can communicate with the base stations (BSs) via downlinks and uplinks. A downlink (or forward link) refers to the communication link from the BS to the UE, and an uplink (or reverse link) refers to the communication link from the UE to the BS. As will be described in more detail, a BS may be referred to as a Node B, Evolved Node B (eNB), gNB, Access Point (AP), Radio Headend, Transmit and Receive Point (TRP), New Radio (NR) BS, 5G Node B, etc.

[0006] The above multiple access technologies have been adopted in various telecommunications standards to provide a common protocol that enables different user equipment to communicate at the city, country, region, and even global levels. New Radio (NR) (also known as 5G) is an enhancement set of the LTE mobile standard released by the 3rd Generation Partnership Project (3GPP). NR is designed to better support mobile broadband internet access by using Orthogonal Frequency Division Multiplexing (OFDM) with a Cyclic Prefix (CP) on the downlink (DL), and CP-OFDM and / or SC-FDM (e.g., also known as Discrete Fourier Transform Extended OFDM (DFT-s-OFDM)) on the uplink (UL), as well as supporting beamforming, multiple-input multiple-output (MIMO) antenna technologies and carrier aggregation to improve spectral efficiency, reduce costs, improve service, utilize new spectrum, and better integrate with other open standards. Summary of the Invention

[0007] In various aspects of this disclosure, a method for wireless communication by a user equipment (UE) includes converting a block of mixed Automatic Repeat Request Acknowledgment (HARQ-ACK) bits from an original HARQ-ACK codebook into partitions, where multiple partitions for multiple blocks correspond to quantized HARQ-ACK bits. The method further includes transforming the quantized HARQ-ACK bits into a two-part HARQ-ACK payload. The method also includes separately encoding a first part and a second part of the two-part HARQ-ACK payload. The method further includes transmitting the encoded first part and the encoded second part to a network node.

[0008] In various aspects of this disclosure, a method for wireless communication by a network device includes: decoding a first portion of a two-part hybrid automatic repeat request acknowledgment (HARQ-ACK) payload received from a user equipment (UE), the first portion indicating whether quantized HARQ-ACK bits indicate all positive acknowledgments. The method further includes determining the length of a second portion of the two-part HARQ-ACK payload based on the decoding of the first portion. The method further includes decoding the second portion of the two-part HARQ-ACK payload according to the determined length. The method further includes reconstructing the first value in response to detecting a first value of all bits of the original HARQ-ACK codebook in the bits corresponding to the second portion of the original HARQ-ACK codebook. The method further includes reconstructing the second value in response to detecting a second value of each bit of the original HARQ-ACK codebook in the bits corresponding to the second portion of the original HARQ-ACK codebook.

[0009] Other aspects of this disclosure relate to an apparatus. The apparatus has one or more memories and one or more processors coupled to the one or more memories. The processors are configured to convert blocks of mixed Automatic Repeat Request Acknowledgment (HARQ-ACK) bits from an original HARQ-ACK codebook into partitions, where multiple partitions for multiple blocks correspond to quantized HARQ-ACK bits. The processors are also configured to transform the quantized HARQ-ACK bits into a two-part HARQ-ACK payload. The processors are further configured to encode a first part and a second part of the two-part HARQ-ACK payload separately. The processors are further configured to transmit the encoded first part and the encoded second part to a network node.

[0010] Other aspects of this disclosure relate to an apparatus. The apparatus has one or more memories and one or more processors coupled to the one or more memories. The processors are configured to decode a first portion of a two-part Hybrid Automatic Repeat Request Acknowledgment (HARQ-ACK) payload received from a User Equipment (UE), the first portion indicating whether quantized HARQ-ACK bits indicate all positive acknowledgments. The processors are also configured to determine the length of a second portion of the two-part HARQ-ACK payload based on the decoding of the first portion. The processors are further configured to decode the second portion of the two-part HARQ-ACK payload according to the determined length. The processors are further configured to reconstruct a first value in response to detecting a first value of all bits of the original HARQ-ACK codebook in the bits corresponding to the second portion of the original HARQ-ACK codebook. The processors are also configured to reconstruct a second value in response to detecting a second value of each bit of the original HARQ-ACK codebook in the bits corresponding to the second portion of the original HARQ-ACK codebook.

[0011] The aspects as a whole include, as described substantially with reference to the accompanying drawings and description, and as illustrated in the accompanying drawings and description, methods, apparatus, systems, computer program products, non-transitory computer-readable media, user equipment, base stations, wireless communication devices, and processing systems.

[0012] The features and technical advantages of the examples according to this disclosure have been summarized rather extensively above in order to better understand the detailed description that follows. Additional features and advantages will be described. The disclosed concepts and specific examples can be readily utilized as the basis for modifying or designing other structures for achieving the same purpose of this disclosure. Such equivalent constructions do not depart from the scope of the appended claims. The characteristics of the disclosed concepts, in both their organization and manner of operation, and the associated advantages, will be better understood by considering the following description in conjunction with the accompanying drawings. Each drawing in the accompanying drawings is for illustrative and descriptive purposes and not as a limitation of the definitions in the claims. Attached Figure Description

[0013] To gain a detailed understanding of the features of this disclosure, reference can be made to various aspects, some of which are illustrated in the accompanying drawings. However, it should be noted that the drawings illustrate only certain aspects of this disclosure and should therefore not be considered as limiting its scope, as the description may allow for other equivalent aspects. The same reference numerals in different drawings may identify the same or similar elements.

[0014] Figure 1 It is a block diagram that conceptually illustrates examples of wireless communication networks according to various aspects of this disclosure.

[0015] Figure 2 This is a block diagram that conceptually illustrates examples of communication between a base station and a user equipment (UE) in a wireless communication network according to various aspects of this disclosure.

[0016] Figure 3 This is a block diagram illustrating an example decomposed base station architecture according to various aspects of this disclosure.

[0017] Figure 4 This is a call flowchart illustrating an example of two-part hybrid automatic repeat request acknowledgment (HARQ-ACK) transmission according to various aspects of this disclosure.

[0018] Figure 5 This is a block diagram illustrating examples of forming two HARQ-ACK parts based on an initial HARQ-ACK payload according to various aspects of this disclosure.

[0019] Figure 6 This is a block diagram illustrating examples of forming two HARQ-ACK portions based on HARQ-ACK payload segments according to various aspects of this disclosure.

[0020] Figure 7A This is a block diagram illustrating examples of selecting a physical uplink shared channel (PUSCH) for the second HARQ-ACK portion according to various aspects of this disclosure.

[0021] Figure 7B This is a block diagram illustrating an example of a set of pending second HARQ-ACK portions according to various aspects of this disclosure.

[0022] Figure 7C This is a block diagram illustrating examples of reusing HARQ-ACK portions from different HARQ-ACK payloads according to various aspects of this disclosure.

[0023] Figure 8A and Figure 8B This is a block diagram illustrating examples of modifications to the original HARQ-ACK payload according to various aspects of this disclosure.

[0024] Figure 9 This is a block diagram illustrating various aspects of lossy compression encoding and decoding according to this disclosure.

[0025] Figure 10 This is a block diagram illustrating various aspects of bundling and source decoding according to this disclosure.

[0026] Figure 11 This is a table illustrating the bundle size dependency according to various aspects of this disclosure.

[0027] Figure 12 This is a block diagram illustrating various aspects of partitioning and source decoding according to this disclosure.

[0028] Figure 13 It is a table that maps codewords to group indexes according to various aspects of this disclosure, while also showing the distortion level corresponding to the reconstructed bits.

[0029] Figure 14 Based on various aspects of this disclosure Figure 13 The table shown is a portion of the table that maps codewords to group indexes.

[0030] Figure 15 This is a block diagram illustrating the cascading of various aspects of bundling and two-part HARQ-ACK compression according to this disclosure.

[0031] Figure 16 This is a block diagram illustrating the segmentation of bundled HARQ-ACK bits according to various aspects of this disclosure.

[0032] Figure 17 This is a block diagram illustrating the cascading of partitions and two-part HARQ-ACK compression according to various aspects of this disclosure.

[0033] Figure 18 This is a diagram illustrating different types of negative acknowledgment (NACK) events according to various aspects of this disclosure.

[0034] Figure 19 This is a diagram illustrating examples of bundled ACK / NACK bits according to various aspects of this disclosure.

[0035] Figure 20 This is a table of example code points illustrating various aspects of this disclosure for jointly encoding the binding result with information related to the quantity of acknowledgments (ACKs).

[0036] Figure 21 Examples are illustrated of using two-part HARQ-ACK compression to report the number of ACKs according to various aspects of this disclosure.

[0037] Figure 22Examples of the number of ACKs used to utilize bundled lossy compression are illustrated in various aspects of this disclosure.

[0038] Figure 23 This is a flowchart illustrating, for example, an example cascaded HARQ-ACK procedure performed by a user equipment (UE) according to various aspects of this disclosure.

[0039] Figure 24 This is a flowchart illustrating, for example, an example cascaded HARQ-ACK process performed by a network device according to various aspects of this disclosure. Detailed Implementation

[0040] Various aspects of this disclosure are described more fully below with reference to the accompanying drawings. However, this disclosure may be embodied in many different forms and should not be construed as limited to any particular structure or function presented throughout this disclosure. Rather, these aspects are provided to make this disclosure thorough and complete, and to fully convey the scope of this disclosure to those skilled in the art. Based on the teachings, those skilled in the art will recognize that the scope of this disclosure is intended to cover any aspect of this disclosure, whether implemented independently of or in combination with any other aspect of this disclosure. For example, an apparatus or method may be implemented using any number of the aspects set forth. Furthermore, the scope of this disclosure is intended to cover such apparatus or methods practiced using other structures, functions, or structures and functions other than or supplementing the various aspects of this disclosure set forth. It should be understood that any aspect of this disclosure may be embodied by one or more elements of the claims.

[0041] Several aspects of a telecommunications system will now be presented with reference to various devices and techniques. These devices and techniques will be described in detail below and illustrated in the accompanying drawings by various blocks, modules, components, circuits, steps, processes, algorithms, etc. (collectively, “elements”). These elements can be implemented using hardware, software, or a combination thereof. Whether such elements are implemented as hardware or software depends on the specific application and the design constraints imposed on the system as a whole.

[0042] It should be noted that although the aspects may be described using terms commonly associated with 5G and subsequent wireless technologies, the aspects of this disclosure may be applied in other generation-based communication systems, such as and including 3G and / or 4G technologies.

[0043] Wireless communication can sometimes be unreliable. Techniques such as Hybrid Automatic Repeat Request (HARQ) can help recover from transmission errors by allowing the receiver to indicate to the transmitter whether a data transmission (such as a code block (CB), code block group (CBG), or transport block (TB)) has been correctly decoded. The receiver can send an acknowledgment (ACK) in response to correctly decoding the transmission, and a negative acknowledgment (NACK) in response to failing to decode the transmission. The transmitter can retransmit the transmission in response to receiving a NACK, allowing the receiver to correctly decode the retransmission. In some cases, multiple retransmissions may occur. The resources used for HARQ-ACK feedback are important, and it can be carried in the Physical Uplink Control Channel (PUCCH) or the Physical Uplink Shared Channel (PUSCH). It is desirable to reduce the number of bits allocated in the PUCCH for HARQ-ACK feedback.

[0044] Compared to standard HARQ-ACK feedback, lossless compression for HARQ-ACK feedback significantly reduces overhead. Near-optimal compression, or entropy, can be achieved using two-part or two-stage HARQ-ACK compression. One or two bits in the first part are often sufficient. In the simplest form of lossless compression, the first part of the two-part HARQ-ACK payload (e.g., part 1) has one bit. If all received code blocks are successfully decoded (e.g., all ACKs), the transmitter sets the single bit to "1". In this case, nothing is transmitted for the second part of the two-part HARQ-ACK payload (e.g., part 2). Otherwise, the transmitter sets the single bit in the first part to "0" and transmits the complete payload in the second part of the two-part HARQ-ACK payload.

[0045] For ACK to NACK errors (1) 0) error, lossy compression for HARQ-ACK can be defined by a loss function of -(1); and for NACK to ACK error (0) 1) Define the loss function as infinity ( This definition ensures that NACK-ACK decoding will never occur because it is difficult or impossible to recover from NACK-ACK errors. Consider two quantization schemes: 1) bundling; and 2) partitioning. Bundling alone may not be close enough to the optimal rate distortion curve. The same is true for partitioning using short codewords, because long codewords cannot be used for HARQ-ACK feedback (due to the small or medium payload length of the HARQ-ACK codebook).

[0046] According to various aspects of this disclosure, after bundling or partitioning (which reduces size but introduces distortion through quantization), further compression can be applied to reduce overhead by using lossless source decoding techniques (e.g., two-part HARQ-ACK compression). According to another aspect of this disclosure, User Equipment (UE) capability signaling is introduced for concatenation. In these aspects, the UE indicates whether it supports bundling and transition to two-part HARQ-ACK concatenation via UE capability signaling. In other aspects, the network can utilize Radio Resource Control (RRC) signaling to configure bundling and transition to two-part HARQ-ACK concatenation. In still other aspects, Downlink Control Information (DCI) can dynamically enable or disable concatenation. According to various aspects of this disclosure, the length of the original HARQ-ACK codebook ( ) and / or bundle size ( Use the command to enable or disable cascading.

[0047] According to various aspects of this disclosure, the bundled HARQ-ACK bits are divided into multiple segments / blocks. In these aspects, the simplest two-part HARQ-ACK transformation is applied separately to each segment / block.

[0048] According to various aspects of this disclosure, the UE can be configured to transform the group index sequence into two parts, wherein each group index corresponds to a portion of the original HARQ-ACK codebook. Units digit. Group index is the result of partitioning. Each of the original HARQ-ACK codebooks According to The bit value is mapped to the group index.

[0049] Specific aspects of the subject matter described in this disclosure can be implemented to achieve one or more of the following potential advantages. In some examples, the described techniques (such as cascaded HARQ-ACK feedback) can increase network capacity by using fewer resources.

[0050] Figure 1This is an illustration of a wireless network 100 in which various aspects of the present disclosure may be practiced. The wireless network 100 may be a 5G or NR network, or some other wireless network (such as an LTE network). The wireless network 100 may include multiple BS110s (shown as BS 110a, BS 110b, BS 110c, and BS 110d) and other network entities. A BS is an entity that communicates with a user equipment (UE) and may also be referred to as a base station, NR BS, Node B, gNB, 5G Node B, access point, Transmit and Receive Point (TRP), network node, network entity, etc. A base station may be implemented as a converged base station, a decomposed base station, an Integrated Access and Backhaul (IAB) node, a relay node, a sidelink node, etc. A base station may be implemented in a converged or monolithic base station architecture, or alternatively, in a decomposed base station architecture, and may include one or more of a central unit (CU), a distributed unit (DU), a radio unit (RU), a near real-time (near RT) RAN intelligent controller (RIC), or a non-real-time (non-RT) RIC.

[0051] Each BS can provide communication coverage for a specific geographic area. In 3GPP, depending on the context in which the term is used, the term "cell" can refer to the coverage area of ​​a BS and / or the BS subsystem serving that coverage area.

[0052] A BS can provide communication coverage for macrocells, picocells, femtocells, and / or another type of cell. A macrocell can cover a relatively large geographic area (e.g., a radius of several kilometers) and can allow unrestricted access for UEs with a service subscription. A picocell can cover a relatively small geographic area and can allow unrestricted access for UEs with a service subscription. A femtocell can cover a relatively small geographic area (e.g., a home) and can allow restricted access for UEs associated with the femtocell (e.g., UEs in a Closed Subscriber Group (CSG)). A BS used for macrocells can be referred to as a macro BS. A BS used for picocells can be referred to as a pico BS. A BS used for femtocells can be referred to as a femtocell BS or a home BS. Figure 1 In the example shown, BS 110a can be a macro BS for macro cell 102a, BS 110b can be a pico BS for pico cell 102b, and BS 110c can be a femto BS for femto cell 102c. A BS can support one or more (e.g., three) cells. The terms “eNB,” “base station,” “NR BS,” “gNB,” “AP,” “node B,” “5G NB,” “TRP,” and “cell” are used interchangeably.

[0053] In some respects, the cell does not need to be stationary, and the geographical area of ​​the cell can be moved depending on the location of the mobile BS. In some respects, the BS can use any suitable transport network to interconnect with each other and / or with one or more other BSs or network nodes (not shown) in the wireless network 100 via various types of backhaul interfaces (such as direct physical connections, virtual networks, etc.).

[0054] The wireless network 100 may also include a relay station. A relay station is an entity that can receive data transmissions from an upstream station (e.g., a BS or a UE) and forward those data transmissions to a downstream station (e.g., a UE or a BS). A relay station can also be a UE that can relay transmissions for other UEs. Figure 1 In the example shown, relay station 110d can communicate with macro BS 110a and UE 120d to facilitate communication between BS 110a and UE 120d. A relay station can also be referred to as a relay BS, relay base station, repeater, etc.

[0055] Wireless network 100 can be a heterogeneous network comprising different types of Base Stations (BSs) (e.g., macro BSs, pico BSs, femto BSs, relay BSs, etc.). These different types of BSs can have different transmit power levels, different coverage areas, and different effects on interference in wireless network 100. For example, macro BSs can have high transmit power levels (e.g., 5 watts to 40 watts), while pico BSs, femto BSs, and relay BSs can have lower transmit power levels (e.g., 0.1 watts to 2 watts).

[0056] For example, BS 110 (shown as BS 110a, BS 110b, BS 110c, and BS 110d) and core network 130 can exchange communication via backhaul link 132 (e.g., S1, etc.). Base station 110 can communicate with each other directly or indirectly (e.g., via core network 130) via other backhaul links (e.g., X2, etc.).

[0057] The core network 130 may be an evolved packet core (EPC), which may include at least one mobility management entity (MME), at least one serving gateway (S-GW), and at least one packet data network (PDN) gateway (P-GW). The MME may be a control node that processes signaling between UE 120 and the EPC. All user IP packets can be transmitted through the S-GW, which itself may be connected to the P-GW. The P-GW provides IP address allocation and other functions. The P-GW may be connected to the network operator's IP services. The operator's IP services may include the Internet, intranet, IP Multimedia Subsystem (IMS), and packet switching (PS) streaming services.

[0058] Core network 130 can provide user authentication, access authorization, tracking, IP connectivity, and other access, routing, or mobility functions. One or more of base stations 110 or access node controllers (ANCs) can interface with core network 130 via backhaul links 132 (e.g., S1, S2, etc.) and can perform radio configuration and scheduling for communication with UE 120. In some configurations, the various functions of each access network entity or base station 110 can be distributed across various network devices (e.g., radio headends and access network controllers) or consolidated into a single network device (e.g., base station 110).

[0059] UEs 120 (e.g., 120a, 120b, 120c) may be distributed throughout the wireless network 100, and each UE may be stationary or mobile. UEs may also be referred to as access terminals, terminals, mobile stations, subscriber units, stations, etc. UEs may be cellular phones (e.g., smartphones), personal digital assistants (PDAs), wireless modems, wireless communication devices, handheld devices, laptops, cordless phones, wireless local loop (WLL) stations, tablet devices, cameras, gaming devices, netbooks, smartbooks, ultrabooks, medical devices or equipment, biometric sensors / devices, wearable devices (smartwatches, smart clothing, smart glasses, smart wristbands, smart jewelry (e.g., smart rings, smart bracelets)), entertainment devices (e.g., music or video devices, or satellite radios), vehicle components or sensors, smart meters / sensors, industrial manufacturing equipment, GPS devices, or any other suitable device configured to communicate via wireless or wired media.

[0060] One or more UEs 120 can establish Protocol Data Unit (PDU) sessions for network slices. In some cases, UE 120 can select network slices based on application or subscription services. By assigning different network slices to different applications or subscriptions, UE 120 can improve its resource utilization within the wireless network 100 while also meeting the performance specifications of each application of UE 120. In some cases, this can be achieved through an AMF (Application-Specific Function) associated with one or both of base station 110 and core network 130. Figure 1 (Not shown in the image) to serve the network slice used by UE 120. In addition, session management of the network slice can be performed by the Access and Mobility Management Function (AMF).

[0061] UE 120 may include a cascaded Hybrid Automatic Repeat Request (HARQ) module 140. For simplicity, only one UE 120d is shown as including the cascaded HARQ module 140. The cascaded HARQ module 140 can convert blocks of Hybrid Automatic Repeat Request Acknowledgment (HARQ-ACK) bits from the original HARQ-ACK codebook into partitions, with multiple partitions for multiple blocks corresponding to quantized HARQ-ACK bits. The cascaded HARQ module 140 can also transform the quantized HARQ-ACK bits into a two-part HARQ-ACK payload. The cascaded HARQ module 140 can further encode the first and second parts of the two-part HARQ-ACK payload separately. The cascaded HARQ module 140 can also send the encoded first part and the encoded second part to the network node.

[0062] Core network 130 or base station 110 or any other network device (e.g., such as...) Figure 3 (As shown in the image) may include a cascaded HARQ module 138. For simplicity, only one base station 110a is shown as including the cascaded HARQ module 138. The cascaded HARQ module 138 may decode a first portion of a two-part hybrid automatic repeat request acknowledgment (HARQ-ACK) payload received from a user equipment (UE), the first portion indicating whether quantized HARQ-ACK bits indicate all positive acknowledgments. The cascaded HARQ module 138 may also determine the length of a second portion of the two-part HARQ-ACK payload based on the decoding of the first portion. The cascaded HARQ module 138 may further decode the second portion of the two-part HARQ-ACK payload according to the determined length. The cascaded HARQ module 138 may still further reconstruct the first value in response to detecting a first value of all bits of the original HARQ-ACK codebook in the bits corresponding to the second portion of the original HARQ-ACK codebook. The cascaded HARQ module 138 can also reconstruct the second value in response to detecting a second value of each bit of the original HARQ-ACK codebook in the bits corresponding to the second part of the original HARQ-ACK codebook.

[0063] Some UEs can be considered Machine-Type Communication (MTC) or Evolved or Enhanced Machine-Type Communication (eMTC) UEs. For example, MTC and eMTC UEs include robots, drones, remote devices, sensors, meters, monitors, location tags, etc., capable of communicating with a base station, another device (e.g., a remote device), or some other entity. Wireless nodes can provide connectivity to or from a network, such as a wide area network (WAN) like the Internet or a cellular network, via wired or wireless communication links. Some UEs can be considered Internet of Things (IoT) devices and / or can be implemented as NB-IoT (Narrowband Internet of Things) devices. Some UEs can be considered Customer Premises Equipment (CPE). UE 120 can be included in a housing that houses the components of UE 120, such as processor components, memory components, etc.

[0064] Generally, any number of wireless networks can be deployed in a given geographical area. Each wireless network can support a specific Radio Access Technology (RAT) and can operate on one or more frequencies. A RAT can also be referred to as a radio technology, air interface, etc. A frequency can also be referred to as a carrier, frequency channel, etc. Within a given geographical area, each frequency can support a single RAT to avoid interference between wireless networks using different RATs. In some cases, NR or 5G RAT networks can be deployed.

[0065] In some respects, two or more UEs 120 (e.g., shown as UE 120a and UE 120e) may communicate directly using one or more sidelink channels (e.g., without using base station 110 as an intermediary). For example, UEs 120 may communicate using peer-to-peer (P2P) communication, device-to-device (D2D) communication, vehicle-to-everything (V2X) protocols (e.g., which may include vehicle-to-vehicle (V2V) protocols, vehicle-to-infrastructure (V2I) protocols, mesh networks, etc.). In this case, UEs 120 may perform scheduling operations, resource selection operations, and / or other operations described elsewhere herein, performed by base station 110. For example, base station 110 may configure UEs 120 via downlink control information (DCI), radio resource control (RRC) signaling, media access control-control element (MAC-CE), or via system information (e.g., system information block (SIB)).

[0066] As indicated above, Figure 1 This is provided merely as an example. Other examples are available in conjunction with [the relevant documentation / information]. Figure 1 The examples described are different.

[0067] Figure 2A block diagram of a design 200 for a base station 110 and a UE 120 is shown. The base station and the UE can be... Figure 1 One of the base stations in the base station and Figure 1 One of the UEs in the UE. Base station 110 may be equipped with T antennas 234a to 234t, and UE 120 may be equipped with R antennas 252a to 252r, where generally, T≥1 and R≥1.

[0068] At base station 110, transmit processor 220 can receive data for one or more UEs from data source 212, select one or more modulation and decoding schemes (MCS) for each UE based at least in part on the Channel Quality Indicator (CQI) received from each UE, process (e.g., encode and modulate) the data for each UE based at least in part on the MCS selected for each UE, and provide data symbols for all UEs. Reducing the MCS decreases throughput but increases transmission reliability. Transmit processor 220 can also process system information (e.g., for semi-static resource partitioning information (SRPI), etc.) and control information (e.g., CQI requests, grants, upper-layer signaling, etc.), and provide overhead symbols and control symbols. Transmit processor 220 can also generate reference symbols for reference signals (e.g., cell-specific reference signals (CRS)) and synchronization signals (e.g., primary synchronization signal (PSS) and secondary synchronization signal (SSS)). The transmit (TX) multiple-input multiple-output (MIMO) processor 230 can perform spatial processing (e.g., pre-decoding) on ​​data symbols, control symbols, overhead symbols, and / or reference symbols, where applicable, and can provide T output symbol streams to T modulators (MODs) 232a to 232t. Each modulator 232 can process the corresponding output symbol stream (e.g., for orthogonal frequency division multiplexing (OFDM), etc.) to obtain an output sample stream. Each modulator 232 can further process (e.g., convert to analog, amplify, filter, and up-convert) the output sample stream to obtain a downlink signal. The T downlink signals from modulators 232a to 232t can be transmitted via T antennas 234a to 234t, respectively. Position coding can be used to generate synchronization signals to convey additional information, according to various aspects described in more detail below.

[0069] At UE 120, antennas 252a to 252r can receive downlink signals from base station 110 and / or other base stations, and can provide the received signals to demodulators (DEMODs) 254a to 254r respectively. Each demodulator 254 can adjust (e.g., filter, amplify, down-convert, and digitize) the received signal to obtain an input sample. Each demodulator 254 can further process these input samples (e.g., for OFDM, etc.) to obtain the received symbols. MIMO detector 256 can obtain the received symbols from all R demodulators 254a to 254r, perform MIMO detection on the received symbols where applicable, and provide the detected symbols. Receiver processor 258 can process (e.g., demodulate and decode) the detected symbols, provide decoded data for UE 120 to data sink 260, and provide decoded control information and system information to controller / processor 280. The channel processor can determine the Reference Signal Received Power (RSRP), Received Signal Strength Indicator (RSSI), Reference Signal Received Quality (RSRQ), and / or Channel Quality Indicator (CQI), etc. In some aspects, one or more components of the UE 120 may be included in a housing.

[0070] On the uplink, at UE 120, the transmitting processor 264 can receive data from data source 262 and control information (e.g., for reports including RSRP, RSSI, RSRQ, CQI, etc.) from controller / processor 280, and process the data and control information. The transmitting processor 264 can also generate reference symbols for one or more reference signals. Symbols from the transmitting processor 264 can be pre-decoded by the TX MIMO processor 266, where applicable, further processed by modulators 254a to 254r (e.g., for Discrete Fourier Transform Extended OFDM (DFT-s-OFDM), CP-OFDM, etc.), and transmitted to base station 110. At base station 110, uplink signals from UE 120 and other UEs can be received by antenna 234, processed by demodulator 254, detected by MIMO detector 236 (where applicable), and further processed by receiving processor 238 to obtain decoded data and control information transmitted by UE 120. The receiver processor 238 can provide the decoded data to the data sink 239 and the decoded control information to the controller / processor 240. The base station 110 may include a communication unit 244 and communicates with the core network 130 via the communication unit 244. The core network 130 may include a communication unit 294, a controller / processor 290, and a memory 292.

[0071] The controller / processor 240 of base station 110, the controller / processor 280 of UE 120 and / or Figure 2Any other component may perform one or more techniques associated with cascaded HARQ-ACK transmission, as described in more detail elsewhere. For example, the controller / processor 240 of base station 110, the controller / processor 280 of UE 120, and / or Figure 2 Any other component that can execute or instruct, for example Figure 23 and Figure 24 The operation of the process and / or other processes as described. Memory 242 and memory 282 may store data and program code for base station 110 and UE 120, respectively. Scheduler 246 may schedule UEs for data transmission on downlink and / or uplink.

[0072] In some aspects, UE 120 and / or base station 110 may include components for conversion, components for transformation, components for individual encoding, components for transmission, components for reception, components for enabling, components for segmentation, components for decoding, components for determination, and components for reconstruction. Such components may include combinations... Figure 2 The UE120 or one or more components of the base station 110 described.

[0073] As indicated above, Figure 2 This is provided merely as an example. Other examples are available in conjunction with [the relevant documentation / information]. Figure 2 The examples described are different.

[0074] Communication systems, such as 5G New Radio (NR) systems, can be deployed with various components or parts in multiple ways. In a 5G NR system or network, network nodes, network entities, network mobility elements, radio access network (RAN) nodes, core network nodes, network elements or network equipment (such as base stations (BS)) or one or more units (or components) performing base station functions can be implemented in aggregated or decomposed architectures. For example, BSs (such as Node B (NB), evolved NB (eNB), NR BS, 5G NB, access point (AP), transmit and receive point (TRP), or cell, etc.) can be implemented as aggregated base stations (also known as standalone BS or monolithic BS) or decomposed base stations.

[0075] Aggregated base stations can be configured to utilize a radio protocol stack that is physically or logically integrated within a single RAN node. Decentralized base stations can be configured to utilize a protocol stack that is physically or logically distributed across two or more units, such as one or more central or centralized units (CUs), one or more distributed units (DUs), or one or more radio units (RUs) (i.e., central or distributed units). In some respects, the CU may be implemented within a RAN node, and one or more DUs may co-located with the CU, or alternatively, may be geographically or virtually distributed across one or more other RAN nodes. DUs may be implemented to communicate with one or more RUs. Each of the CU, DU, and RU may also be implemented as a virtual unit (e.g., a virtual central unit (VCU), a virtual distributed unit (VDU), or a virtual radio unit (VRU)).

[0076] Base station type operation or network design can take into account the aggregation characteristics of base station functionality. For example, decomposed base stations can be utilized in Integrated Access Backhaul (IAB) networks, Open Radio Access Networks (O-RAN (such as network configurations initiated by the O-RAN Alliance)), or Virtualized Radio Access Networks (vRAN, also known as Cloud Radio Access Networks (C-RAN)). Decomposition can include distributing functionality across two or more units in various physical locations, as well as virtually distributing the functionality of at least one unit, which enables flexibility in network design. The various units in a decomposed base station or decomposed RAN architecture can be configured to communicate wirelessly with at least one other unit.

[0077] In some cases, different types of devices supporting different types of applications and / or services can coexist in a cell. Examples of different types of devices include UE handsets, Customer Premises Equipment (CPE), vehicles, Internet of Things (IoT) devices, etc. Examples of different types of applications include Ultra Reliable Low Latency Communication (URLLC) applications, Massive Machine-Type Communication (mMTC) applications, Enhanced Mobile Broadband (eMBB) applications, Vehicle-to-Everything (V2X) applications, etc. Furthermore, in some cases, a single device can simultaneously support different applications or services.

[0078] Figure 3A diagram illustrating an example of a decomposed base station 300 architecture is shown. The decomposed base station 300 architecture may include one or more central units (CUs) 310, which may communicate directly with the core network 320 via a backhaul link, or indirectly with the core network 320 via one or more decomposed base station units, such as a near real-time (near-RT) RAN Intelligent Controller (RIC) 325 via an E2 link, or a non-real-time (non-RT) RIC 315 associated with a Service Management and Orchestration (SMO) framework 305, or both. CUs 310 may communicate with one or more distributed units (DUs) 330 via appropriate midhaul links (such as F1 interfaces). DUs 330 may communicate with one or more radio units (RUs) 340 via appropriate fronthaul links. RUs 340 may communicate with corresponding UEs 120 via one or more radio frequency (RF) access links. In some implementations, a UE 120 may be served simultaneously by multiple RUs 340.

[0079] Each of these units (e.g., CU 310, DU 330, RU 340, and near-RT RIC 325, non-RT RIC 315, and SMO frame 305) may include one or more interfaces, or may be coupled to one or more interfaces configured to receive or transmit signals, data, or information (collectively, signals) via wired or wireless transmission media. Each of the units, or an associated processor or controller providing instructions to the communication interfaces of these units, may be configured to communicate with one or more other units via transmission media. For example, these units may include wired interfaces configured to receive signals or transmit signals to one or more other units via wired transmission media. Additionally, these units may include wireless interfaces that may include receivers, transmitters, or transceivers (such as radio frequency (RF) transceivers) configured to receive signals or transmit signals to one or more other units via wireless transmission media, or both.

[0080] In some aspects, the CU 310 can host one or more higher-level control functions. Such control functions may include Radio Resource Control (RRC), Packet Data Convergence Protocol (PDCP), Serving Data Adaptation Protocol (SDAP), etc. Each control function can be implemented using an interface configured to signal to other control functions hosted by the CU 310. The CU 310 can be configured to handle user plane functions (e.g., Central Unit-User Plane (CU-UP)), control plane functions (e.g., Central Unit-Control Plane (CU-CP)), or combinations thereof. In some implementations, the CU 310 can be logically divided into one or more CU-UP units and one or more CU-CP units. When implemented in an O-RAN configuration, the CU-UP units can communicate bidirectionally with the CU-CP units via an interface such as an E1 interface. The CU 310 can be implemented to communicate with the DU 330 for network control and signaling, as needed.

[0081] DU 330 may correspond to a logical unit comprising one or more base station functions for controlling the operation of one or more RU 340s. In some aspects, DU 330 may, at least in part, host one or more of the Radio Link Control (RLC) layer, the Media Access Control (MAC) layer, and one or more high physical (PHY) layers (such as modules for forward error correction (FEC) encoding and decoding, scrambling, modulation and demodulation, etc.) depending on functional splits (such as those defined by the 3rd Generation Partnership Project (3GPP). In some aspects, DU 330 may further host one or more low PHY layers. Each layer (or module) may be implemented using an interface configured to communicate signaling with other layers (and modules) hosted by DU 330 or with control functions hosted by CU 310.

[0082] Lower-layer functionality can be implemented by one or more RU 340s. In some deployments, an RU340 controlled by a DU 330 may correspond to a logical node that at least partially hosts RF processing functions or low-PHY layer functions (such as performing Fast Fourier Transform (FFT), Inverse FFT (iFFT), digital beamforming, Physical Random Access Channel (PRACH) extraction and filtering, etc.) based on functional decomposition such as lower-layer functional decomposition, or both. In such architectures, the RU 340 may be implemented to handle over-the-air (OTA) communications with one or more UE 120s. In some specific implementations, the real-time and non-real-time aspects of control plane and user plane communications with the RU 340 may be controlled by the corresponding DU 330. In some scenarios, this configuration allows the DU 330 and CU 310 to be implemented in cloud-based RAN architectures such as vRAN architectures.

[0083] SMO framework 305 can be configured to support RAN deployment and provisioning of both non-virtualized and virtualized network elements. For non-virtualized network elements, SMO framework 305 can be configured to support the deployment of dedicated physical resources for RAN coverage requirements, which can be managed via operation and maintenance interfaces such as the O1 interface. For virtualized network elements, SMO framework 305 can be configured to interact with a cloud computing platform such as Open Cloud (O-cloud) 390 to perform network element lifecycle management (such as instantiating virtualized network elements) via a cloud computing platform interface such as the O2 interface. Such virtualized network elements may include, but are not limited to, CU 310, DU 330, RU 340, and near-RT RIC 325. In some implementations, SMO framework 305 can communicate with the hardware aspects of the 4G RAN (such as Open eNB (O-eNB) 311) via the O1 interface. Additionally, in some implementations, SMO framework 305 can communicate directly with one or more RU 340s via the O1 interface. The SMO framework 305 may also include a non-RT RIC 315 configured to support the functionality of the SMO framework 305.

[0084] The non-RT RIC 315 can be configured to include logical functions enabling non-real-time control and optimization of RAN elements and resources, including AI / ML workflows for model training and updates, or policy-based guidance for applications / features in the near-RT RIC 325. The non-RT RIC 315 can be coupled to or communicate with the near-RT RIC 325, such as via an A1 interface. The near-RT RIC 325 can be configured to include logical functions enabling near real-time control and optimization of RAN elements and resources via data collection and actions through an interface such as an E2 interface that connects one or more CU 310s, one or more DU 330s, or both, and an O-eNB 311 to the near-RT RIC 325.

[0085] In some implementations, to generate AI / ML models to be deployed in the near-RT RIC 325, the non-RT RIC 315 may receive parameters or external enrichment information from an external server. This information can be utilized by the near-RT RIC 325 and can be received from non-network data sources or network functions at the SMO framework 305 or the non-RT RIC 315. In some examples, the non-RT RIC 315 or near-RT RIC 325 may be configured to tune RAN behavior or performance. For example, the non-RT RIC 315 may monitor long-term trends and patterns in performance and employ AI / ML models to perform corrective actions via the SMO framework 305 (such as reconfiguration via O1) or via the creation of RAN management policies (such as A1 policies).

[0086] Wireless communication can sometimes be unreliable. Techniques such as Hybrid Automatic Repeat Request (HARQ) can help recover from transmission errors by allowing the receiver to indicate to the transmitter whether a code block has been correctly decoded. The receiver can send an acknowledgment (ACK) in response to correctly decoding the code block, and a negative acknowledgment (NACK) in response to not being able to decode the code block. The transmitter can retransmit the code block in response to receiving a NACK, hoping to correctly decode the code block during the retransmission. In some cases, multiple retransmissions may occur. The resources used for HARQ-ACK feedback are important, and it can be carried in the Physical Uplink Control Channel (PUCCH). It is desirable to reduce the number of bits used to carry HARQ-ACK feedback in the PUCCH.

[0087] The PUCCH has various formats in the 5G 3rd Generation Partnership Project (3GPP) specification. Some PUCCH formats carry more than two bits, and some allow multiplexing. Format 0 defines a short PUCCH for one or two symbols of up to two bits, where the UE multiplexes it within the same Physical Resource Block (PRB). Format 1 defines a long PUCCH for four to fourteen symbols of up to two bits, where the UE multiplexes it within the same PRB. Format 2 defines a short PUCCH for one or two symbols of more than two bits, where no UE multiplexes it within the same PRB. Format 3 defines a long PUCCH for four to fourteen symbols of more than two bits, where no UE multiplexes it within the same PRB. Format 4 defines a long PUCCH for four to fourteen symbols of more than two bits, where the UE multiplexes it within the same PRB.

[0088] The 5G 3GPP specification defines three types of HARQ-ACK codebooks, where the codebook is represented as a bit sequence. Type 1 HARQ-ACK codebook is a semi-static codebook. Type 2 HARQ-ACK codebook is a dynamic codebook. Type 3 HARQ-ACK codebook is used for single feedback.

[0089] For downlink (DL) transmissions, the target block error rate (BLER) can be set to approximately 10%. Therefore, the majority of HARQ feedback will be positive acknowledgments (e.g., ACK) rather than negative acknowledgments (NACK). Based on this assumption, the number of HARQ-ACK bits in the feedback can be reduced.

[0090] According to various aspects of this disclosure, lossless compression for HARQ-ACK feedback can be provided. Figure 4 This is a call flowchart illustrating an example of two-part hybrid automatic repeat request acknowledgment (HARQ-ACK) transmission according to various aspects of this disclosure. Figure 4 In the example, UE 120 receives one or more transmissions from network device 110 (such as a base station) at time 402. The transmissions may include multiple code blocks, transport blocks (TBs), or code block groups (CBGs). At time 402, UE 120 transmits HARQ feedback via a HARQ-ACK payload, depending on whether UE 120 successfully decodes the transmission. It should be noted that the different ACK / NACK bits corresponding to the HARQ-ACK payload may correspond to different Physical Downlink Shared Channels (PDSCHs) (scheduled in different time slots / sub-time slots or different component carriers / serving cells), or different TBs (each PDSCH may contain one or two TBs), or different CBGs (each TB may contain multiple CBGs), or different CBs (each TB or each CBG may contain multiple CBs).

[0091] exist Figure 4 In one example, UE 120 communicates a first HARQ-ACK portion (e.g., the first part of the HARQ-ACK codebook) to network device 110 at time 404. In some examples, the first portion may include a single bit indicating whether all HARQ responses are ACKs. In some such examples, the first portion indicates that at least one bit of a multi-bit HARQ-ACK response is NACK (e.g., first portion bit = 0), then UE 120 sends a second HARQ-ACK portion to network device 110 at time 406.

[0092] exist Figure 4In the examples, the two HARQ-ACK portions can be encoded separately. In some examples, network device 110 decodes the first HARQ-ACK portion before decoding the second HARQ-ACK portion. The first HARQ-ACK portion can have a fixed size. Additionally, the size and interpretation of the second HARQ-ACK portion can be a function of the code points of the first HARQ-ACK portion.

[0093] Figure 5 This is a block diagram illustrating example 500 of forming two HARQ-ACK portions based on an initial HARQ-ACK payload according to various aspects of this disclosure. Figure 5 In the example, the transmitter (such as the UE) can generate an initial HARQ-ACK payload (e.g., the original HARQ-ACK payload) based on the set of downlink transmissions received from the network node. The UE can be a reference. Figure 1 to Figure 4 The example described is UE 120, and the network node can be a reference. Figure 1 to 4 Examples of base station 110 or network device 110 described. In some examples, the UE may send a message to the network node indicating whether it supports forming two HARQ-ACK parts based on the original HARQ-ACK payload.

[0094] like Figure 5 As shown, the original HARQ-ACK codebook (For example, the HARQ-ACK payload) can be processed by two HARQ-ACK compression modules 502 to form the first HARQ-ACK portion. Second HARQ-ACK section Each HARQ-ACK section and It can be encoded separately by channel encoder 504 and then sent to a receiver (such as a network node). Channel encoder 504 can be the same or a different channel encoder. In some examples, the size of the original HARQ-ACK codebook (CB) (e.g., the initial HARQ-ACK codebook) can be [missing information]. Ones place. The unit digit can also be referred to as the HARQ-ACK payload size. In such examples, the size of the first HARQ-ACK portion can be... The unit digit, and the size of the second HARQ-ACK portion can be Units digit. In some examples, the first size... It is fixed. In some examples, the first size... It could be the size of the original HARQ-ACK payload. The function. That is, the first size. For a given size of the original HARQ-ACK payload It can be fixed. Additionally, a second size. It can be variable and can be the first size. The function. A two-part HARQ-ACK can provide error-free compression. For example, given the first HARQ-ACK part... Second HARQ-ACK section The receiver can determine the original HARQ-ACK codebook. Specifically, network nodes can handle the first HARQ-ACK portion. Decode to determine the second size (Based on the first HARQ-ACK part) (Decode) the second HARQ-ACK part Decode the code and then determine the original HARQ-ACK codebook. (Based on the first HARQ-ACK part) Second HARQ-ACK section ).

[0095] In some examples, the first HARQ-ACK portion Second HARQ-ACK section This can be determined based on a first fixed rule. In such examples, if the original HARQ-ACK codebook... All are ACK (e.g., all) Units digit original HARQ-ACK codebook If all are ACK, then the first HARQ-ACK part Instruction 1 and the second HARQ-ACK section Empty. In this example, the first size... One and second size It is zero. Additionally, in such examples, if the original HARQ-ACK codebook... If it includes one or more NACKs, then the first HARQ-ACK portion Indicates zero and the second HARQ-ACK portion Indicates the original HARQ-ACK codebook This makes the second size Equivalent to the original HARQ-ACK codebook Size In these examples, the first HARQ-ACK portion It is across all Units digit original HARQ-ACK codebook The binary AND operation.

[0096] In other examples, the first HARQ-ACK portion Second HARQ-ACK section This can be determined based on a second fixed rule. In such examples, if the original HARQ-ACK codebook... If all are ACK or all are NACK, then the first HARQ-ACK part Instruction 1, First Size It is one, and the second size It is one. In such examples, if the original HARQ-ACK codebook If all are ACKs, then the second HARQ-ACK part Instruction 1. Alternatively, if the original HARQ-ACK codebook... If all are NACK, then the second HARQ-ACK part Indicates zero. Additionally, in such examples, if the original HARQ-ACK codebook... If it includes one or more NACKs, then the first HARQ-ACK portion Indicates zero and the second HARQ-ACK portion Indicates the original HARQ-ACK codebook This makes the second size Equivalent to the original HARQ-ACK codebook Size .

[0097] In some other examples, for each possible HARQ-ACK payload size The UE receives partition information from the network node. For example, the network node can send a Radio Resource Control (RRC) message indicating partition information. The payload size for each possible HARQ-ACK... Can be with Each code point can be associated with a specific number of code points. For example, a payload size of 2 can be associated with four code points (00, 01, 10, and 11). In such an example, a network node can... Each code point is partitioned as follows There are groups, each of which ( ) includes one or more members .parameter Indicates group index. First HARQ-ACK portion It can have a fixed size and a second HARQ-ACK section. Can be based on group Members The number of [parts] can be of variable length. For example, the second HARQ-ACK section. The second size It can be equal to Ones.

[0098] In some examples, for each payload size Network nodes send instructions targeting Group index of each code point in the set of code points The message. For example, if the payload size If the value is five, then there can be thirty-two code points. For ease of explanation, the first size It can be equal to two, such that there exist four groups ( In this example, the network node indicates the group index for each of the thirty-two code points. For example, a network node might indicate that code point 11111 is associated with Group 1, code points 11110 and 111101 with Group 2, code points 11011 to 11100 with Group 3, and code points 11010 to 00000 with Group 4. In this example, the first HARQ-ACK portion... This indicates that 00 is used for group one, 01 for group two, 10 for group three, and 11 for group four. Second HARQ-ACK section The second size It can be equal to Units digit. For example, for group one, the second size. It can be zero because group one has only one member (e.g., As another example, for group two, the second size... It can be one, because group two has two members (e.g., In this example, the second HARQ-ACK portion. Zero can be indicated to indicate the first member of group two (11110), and one can be indicated to indicate the second member of group two (11101). The aspects of this disclosure are not limited to the foregoing examples; other code point values ​​can be associated with each group index. Related. In some such examples, the first size The number of values ​​or groups It can be predefined. In other examples, the first size... The number of values ​​or groups It can be based on one or more payload sizes Possible values.

[0099] In some other examples, for each payload size Network nodes send instructions The messages are in lists, where each list corresponds to a group index. And includes the corresponding members. (e.g., code points) (and group indexes) (Associated). For example, if the payload size If the value is five, then there can be thirty-two code points. For ease of explanation, It can be equal to two, such that there exist four groups ( In this example, the network node indicates four lists. For example, the first list indicates group one including code point 11111, the second list indicates group two including code points 11110 and 111101, the third list indicates group three including code points 11011 to 11100, and the fourth list indicates group four including code points 11010 to 00000. In this example, the first list includes one member, the second list includes two members, the third list includes four members, and the fourth list includes twenty-five members. As an example, if the code point (e.g., the HARQ-ACK payload) is 11010, then the first HARQ-ACK portion... The instruction corresponds to 11 in group four, and the second HARQ-ACK portion. The code point value 00000 can be used to indicate the first member of group four. This disclosure is not limited to the foregoing examples; other code point values ​​can be associated with the list. Additionally, the number of lists can be equal to or less than the number of groups. For example, a network node can indicate lists associated with three of the four groups, and the UE can infer the members of the fourth group. In some such examples, the first size... The number of values ​​or groups It can be predefined. In other examples, the first size... The number of values ​​or groups It can be based on one or more payload sizes Possible values.

[0100] In some other examples, both the UE and the network node are assumed to be cross-... The sorting is identical for each code point. For example, the sorting can be based on the sorting described in Table 1. For each payload size Network nodes send instructions targeting Members of each group The number of messages. Members The quantity can be determined by parameters Instructions, in which Assuming members in all groups (expecting the last group) The quantity is a power of two (i.e. In such examples, the UE can be based on... Members of each group To infer that it was not included Members of a group within a group. As an example, based on the example in Table 1, if the payload size If the value is five, then there can be thirty-two code points. For ease of explanation, It can be equal to two, such that there exist four groups ( In this example, the network node indicates that group one includes one member, group two includes two members, and group three includes four members. Alternatively, the network node may indicate... These values ​​correspond to the values ​​for the previous... The last member in an ordered list of groups. For example, based on Table 1, a network node could indicate 11111 for the last member of group one, 11101 for the last member of group two, and 11100 for the last member of group three. Alternatively, a network node could indicate the last member of the last member of a group. The first member of each group is listed in an ordered list (Table 1). For example, based on Table 1, a network node could indicate 11110 corresponding to the first member of group two, 11011 corresponding to the first member of group three, and 11010 corresponding to the first member of group four. In some such examples, the first size... The number of values ​​or groups It can be predefined. In other examples, the first size... The number of values ​​or groups It can be based on one or more payload sizes Possible values.

[0101]

[0102] In some examples, the values ​​in an ordered list (e.g., Table 1) can be based on The probability of occurrence of each code point. In other examples, to ensure that both the UE and the network node assume the same ordering, Each code point can be sorted based on the number of ACKs ("1") in each code point. Code points with the same number of ACKs can be sorted based on the decimal representation of the binary sequence corresponding to the respective code point.

[0103] In other examples, for each payload size Network nodes can indicate the first size. Or for the number of groups of a given code point In such examples, partitioning can be based on a first size. The values ​​are associated with rules. Additionally, in such examples, both the UE and the network node assume cross-... The sorting of code points with the same value, such as the sorting in Table 1. In some specific implementations, if the first size... If the value is one, then group one includes the first code point (e.g., 11111), and group two includes the remaining code points. One member. Alternatively, if the first size If the value is two, then group one includes the first code point (e.g., 11111), group two includes the next two code points (e.g., 11110 and 11101), group three includes the next four code points, and group four includes the remaining code points. Generally speaking, the... Group includes One member, and The last group in a set includes the remaining groups (e.g., In some such examples, the first size The number of values ​​or groups It can be based on one or more payload sizes Possible values.

[0104] In some examples, if a set of partition schemes is specified, such as two or more of the partition schemes discussed above, the network node can enable one of the partition schemes via control signaling (such as RRC messages). Additionally or alternatively, the UE can indicate support for one or more partition schemes via UE capability signaling.

[0105] In some examples, the UE may receive from a network node a message that enables the UE to form a first HARQ-ACK portion and a second HARQ-ACK portion. In such examples, the message is one of a Radio Resource Control (RRC) message, a Medium Access Control (MAC)-Control Element (CE) message, or a Downlink Control Information (DCI) message. An RRC message can semi-statically enable the UE to form a first HARQ-ACK portion and a second HARQ-ACK portion for each PUCCH group. A MAC-CE message enables the UE to form a HARQ-ACK portion for a given PUCCH group, and the UE forms each HARQ-ACK portion after the MAC-CE application time (e.g., 3 ms after a HARQ-ACK associated with a PDSCH carrying the MAC-CE message).

[0106] A DCI can be a downlink DCI that schedules a PDSCH or indicates PUCCH resources used for HARQ-ACK transmission. Alternatively, a DCI can be an uplink DCI that schedules a PUSCH. In other examples, a DCI can be a group common DCI format. A DCI may include fields indicating whether it is used for both HARQ-ACK portions, such as a one-bit field. The presence of a field can be configured per DCI format RRC. For example, in DCI formats 1_1 / 1_2 / 0_1 / 0_2, some DCI formats may be configured to include this field, while others may not.

[0107] As discussed, various parameters used for various aspects of this disclosure can be RRC configurations. In some examples, one or more parameters may be indicated by a MAC-CE message or DCI. For example, in the first size The choice between value one (1 bit of the first HARQ-ACK portion) or value two (2 bits of the first HARQ-ACK portion) can be dynamically indicated by a MAC-CE message or DCI. Additionally, the various parameters described for various aspects of this disclosure can be configured with per-physical-layer priority.

[0108] As discussed, in some cases, when using a fixed partitioning scheme, the compression ratio of the HARQ-ACK payload can vary with the size of the HARQ-ACK payload. Increase and decrease. Various aspects of this disclosure relate to the handling of larger HARQ-ACK payload sizes. (such as having a size greater than a size threshold) The HARQ-ACK payload uses a fixed partitioning scheme while increasing the HARQ-ACK payload compression ratio. In some examples, the HARQ-ACK payload can be segmented into a set of segments (e.g., blocks) before forming the first and second HARQ-ACK portions.

[0109] Figure 6 This is a block diagram illustrating example 600 of forming two HARQ-ACK portions based on a set of HARQ-ACK payload segments, according to various aspects of this disclosure. Figure 6 In the example, the transmitter (such as the UE) can generate the original HARQ-ACK payload based on the set of downlink transmissions received from the network node. (For example, the original HARQ-ACK codebook (CB)). UE can be a reference. Figure 1 to Figure 4 The example described is UE 120, and the network node can be a reference. Figure 1 to 4 Examples of base station 110 or network device 110 described.

[0110] Original HARQ-ACK payload It can be received at segmentation module 602, making the original HARQ-ACK payload effective. (has size) It can be segmented into Each segment (with corresponding length) , ... ), making and .length , ... It can be uniform, or two or more lengths. , ... They can be different. For ease of explanation, only paragraphs are provided. As shown in Example 600, the segmentation module 602 can segment the original HARQ-ACK payload based on one or more rules and / or configurations received from network nodes. Divide into segments.

[0111] In some examples, the original HARQ-ACK payload It can be segmented (if the payload size) (Greater than the first payload size threshold), such as 5 or 6 bits. In such examples, the UE can transmit the original HARQ-ACK payload. Treat it as a single block and as referenced Figure 5 The discussion focuses on converting a single block into two HARQ-ACK parts, assuming a certain payload size. The payload size is less than a first payload size threshold and greater than a second payload size threshold. Network nodes can send RRC messages dynamically indicating the first and / or second payload size thresholds. Alternatively, the first and / or second payload size thresholds can be configured statically. In some examples, if the payload size... If the payload size is less than the second payload size threshold (which is less than the first payload size threshold), the UE will not send the original HARQ-ACK payload. The transformation is into two HARQ-ACK parts, and the original HARQ-ACK payload... It can be encoded as a single block. In some examples, the second payload size threshold is 2 or 3 bits.

[0112] In some examples, each segment is derived from the original HARQ-ACK payload. A continuous segment of bits. In such an example, the nominal block size... It can be configured via RRC signaling or pre-configured at the UE. The total number of segments can be based on the nominal block size. and payload size Nominal block size The value can be based on the payload size. Or it can be independent of the payload size. In some such examples, if the payload size Divide by nominal block size The merchants (e.g.) If ) is an integer, then segmentation module 602 generates ( (Number) segments, each segment having a size equal to the nominal block size. The length of the quotient. Otherwise, if the quotient is not an integer, then in some examples, segmentation module 602 generates... A length of The section and The length reaches The segment. The floor function (floor()) returns the largest integer less than or equal to the input of the floor function. In other examples, if the quotient is not an integer, segmentation module 602 generates... A length of a segment and a length of The section.

[0113] In some examples, the number of segments It can be based on a fixed value or the number of configuration segments. The RRC message. In such an example, the length of each segment can be based on the number of segments. and payload size Number of segments Independent of payload size Alternatively, it could be based on the payload size. In some examples, network nodes can be configured for different payload sizes. Number of segments Configure different values. In some such examples, if the payload size... Divide by the number of segments The merchants (e.g.) If ) is an integer, then segmentation module 602 generates There are segments, each of which has a quotient equal to ( The length of the quotient. Otherwise, if the quotient is not an integer, then in some examples, segmentation module 602 generates... A length of The section and A length of The segment. The ceiling function (ceil()) returns the largest integer greater than or equal to the input of the ceiling function. In some other examples, if the quotient is not an integer, the segmentation module 602 generates... A length of A segment and a length of Mod( () section.

[0114] In other examples, for a given payload size The length of each block can be configured via RRC messages. For example, an RRC message may include a vector, where each element of the vector indicates a set of segments. The length of a specific segment within the [section / section]. In such an example, the length of the last segment can be determined as: , ... This vector can be applied to each payload size. Pre-configuration is performed, and the UE is configured according to the given size of the HARQ-ACK payload. Use the corresponding configuration.

[0115] In some other examples, each segment can be based on the ACK / NACK bits of the HARQ-ACK payload, which correspond to one or more of the same component carrier, the same physical downlink shared channel (PDSCH), or the same state in the time domain (e.g., a PDSCH received in a given duplex type, such as full-duplex or half-duplex). In such examples, the bits of each segment may not be consecutive bits of the original HARQ-ACK payload. In some such examples, each segment can be based on different code blocks (CBs), different code block groups (CBGs), or different transport blocks (TBs) of the same PDSCH.

[0116] like Figure 6 As shown in the example, for a set of segments In each segment, two HARQ-ACK compression modules 604 can be used to form a first HARQ-ACK portion and a second HARQ-ACK portion. For each segment, these two portions can be formed separately and independently. The size of the second HARQ-ACK portion can be a function of the first HARQ-ACK portion. Therefore, as shown in Example 600, the UE can compress the HARQ-ACK portion for a set of segments. Each segment in the code forms a corresponding first HARQ-ACK portion and a corresponding second HARQ-ACK portion to generate a set of first HARQ-ACK portions and a set of second HARQ-ACK portions. For example... Figure 6As shown, the first channel encoder 606 can jointly encode the set of first HARQ-ACK portions, and the second channel encoder 608 can jointly encode the set of second HARQ-ACK portions. The first channel encoder 606 and the second channel encoder 608 can be the same or different channel encoders. The UE can send the jointly encoded first HARQ-ACK portion and the jointly encoded second HARQ-ACK portion to the network node.

[0117] In some examples, if the segment size is less than a segment size threshold, the segment may not be transformed into two HARQ-ACK parts. As an example, the segment size threshold can be one or two bits. In such examples, the segment can be considered a first HARQ-ACK part and can be encoded together with other first HARQ-ACK parts via the first channel encoder 606.

[0118] For each segment, the size of the first HARQ-ACK portion can be fixed. In some examples, the size of the first HARQ-ACK portion may not be a function of the segment's payload. However, the size of the first HARQ-ACK portion can be a function of the segment size. Additionally, for each segment, the size of the second HARQ-ACK portion can be varied based on the segment's payload and / or the payload of the first HARQ-ACK portion.

[0119] In some examples, the two HARQ-ACK portions can be formed according to a first partitioning scheme, with one bit allocated to the first HARQ-ACK portion. In one example, for the first partitioning scheme, if the original HARQ-ACK payload is entirely ACK, the first HARQ-ACK portion can indicate a value of 1. In this example, the second HARQ-ACK portion is empty. In another example, if the original HARQ-ACK payload includes one or more NACKs, the first HARQ-ACK portion can indicate a value of zero. In this example, the second HARQ-ACK portion includes the payload of the segment ( Individual digits.

[0120] In other examples, the two HARQ-ACK portions can be formed according to a second partitioning scheme, where two bits are allocated to the first HARQ-ACK portion. In such examples, the code points associated with the original HARQ-ACK payload are grouped into four groups, such as those described in Reference Table 1. For example, the first group includes one code point, the second group includes two code points, the third group includes four code points, and the fourth group includes the remaining code points (e.g., ...). (Number of code points). The code points can be ordered according to a predefined order. In such an example, the first HARQ-ACK portion indicates the group associated with the payload. Additionally, the size of the second HARQ-ACK portion can be one of the following: empty if the first HARQ-ACK portion indicates the first group; one bit if the first HARQ-ACK portion indicates the second group; two bits if the first HARQ-ACK portion indicates the third group; and two bits if the first HARQ-ACK portion indicates the fourth group. Units. In such examples, the UE can receive signaling from the network node that associates code points with corresponding groups. The second partitioning scheme is not limited to a fixed number of groups, such as four groups. In some examples, the number of groups can be determined by the network node via signaling, such as RRC signaling, and for each segment length. Configure it.

[0121] In some examples, the two-part HARQ-ACK compression module 604 can use either a first partitioning scheme or a second partitioning scheme based on RRC signaling received from the network node. Additionally or alternatively, the first partitioning scheme or the second partitioning scheme can be determined based on the segment length. To select. For example, if the segment length If the length is less than the length threshold, the first partitioning scheme can be used, and if the segment length is... If the length is greater than or equal to the length threshold, a second partitioning scheme can be used. The length threshold can be based on a fixed rule (e.g., for...). The first partitioning scheme and its application (Second partitioning scheme). Alternatively, RRC signaling from network nodes can explicitly identify the segment length to be used. The partitioning scheme.

[0122] As discussed, in some examples, the first HARQ-ACK portion and the second HARQ-ACK portion can be multiplexed onto the same channel. The first and second HARQ-ACK portions can be referred to as Uplink Control Information (UCI). For example, when the Physical Uplink Control Channel (PUCCH) associated with the original HARQ-ACK payload overlaps with the Physical Uplink Shared Channel (PUSCH) associated with the multiplexed UCI, the first and second HARQ-ACK portions can be multiplexed on the same PUSCH. In some examples, the UE or network node may only support multiplexing the first and second HARQ-ACK portions on the same PUSCH. In such examples, if the PUCCH does not overlap with any PUSCH, the original HARQ-ACK payload can be transmitted directly on the PUCCH without transforming the original HARQ-ACK payload into two portions. Alternatively, the original HARQ-ACK payload can be transformed, and only the first HARQ-ACK portion can be transmitted. That is, the second HARQ-ACK portion can be omitted. In other examples, if the PUCCH overlaps with the PUSCH, the UE multiplexes both HARQ-ACK portions on the PUSCH instead of sending the original HARQ-ACK payload. In other examples, if the PUSCH is scheduled by the DCI, the DCI can indicate whether both HARQ-ACK portions should be multiplexed on the PUSCH or whether the original HARQ-ACK payload should be multiplexed on the PUSCH.

[0123] In some examples, the first HARQ-ACK portion may truncate the PUSCH data resource element (RE), particularly when the first HARQ-ACK portion is one or two bits. If the first HARQ-ACK portion is co-encoded with other UCIs, it may not truncate the PUSCH data RE. Depending on the size of the second HARQ-ACK portion, the second HARQ-ACK portion may truncate the PUSCH data RE or undergo rate matching. In some examples, rate matching may be performed on the second HARQ-ACK portion if it meets a rate matching condition. For example, if the size of the second HARQ-ACK portion is greater than a threshold, the rate matching condition may be met. As another example, rate matching may be met if the size of the second HARQ-ACK portion is less than a threshold. In other examples, the second HARQ-ACK portion may be rate matched regardless of its size.

[0124] In some examples, other UCIs, such as Configurable Grant (CG)-UCI (CG-UCI) or Channel State Information (CSI), may also be transmitted on the PUSCH. In some such examples, the CG-UCI may be co-encoded with either the first HARQ-ACK portion or the second HARQ-ACK portion. In another example, if the CSI has only one portion, the CSI may be encoded separately and subsequently multiplexed onto the PUSCH, resulting in the multiplexing of three different UCIs (e.g., the CSI, the first HARQ-ACK portion, and the second HARQ-ACK portion).

[0125] In some examples, the CSI may have two parts, with Part One CSI and Part Two CSI being encoded separately. Current wireless standards only allow multiplexing of up to three different UCI types on the PUSCH. Therefore, various strategies can be used to multiplex the two-part CSI with the two HARQ-ACK parts.

[0126] In some examples, the second CSI portion can be omitted, allowing only the first HARQ-ACK portion, the second HARQ-ACK portion, and the first CSI portion to be multiplexed on the PUSCH. In other examples, the two HARQ-ACK portions and the two CSI portions are encoded separately and multiplexed on the same PUSCH. In still other examples, the first HARQ-ACK portion may be encoded together with the first CSI portion, and the second HARQ-ACK portion may be encoded together with the second CSI portion. This results in the two jointly encoded UCI portions being multiplexed on the PUSCH. Alternatively, other examples may use a hybrid approach, where the first HARQ-ACK portion may be jointly encoded with the first CSI portion and subsequently multiplexed with separate encodings of the second HARQ-ACK portion and the second CSI portion.

[0127] In other examples, the second HARQ-ACK portion may be co-encoded with the second CSI portion. This co-encoding can be multiplexed on the PUSCH with the separate encodings of the first HARQ-ACK portion and the first CSI portion. In yet another example, the second HARQ-ACK portion may be co-encoded with the first CSI portion, and then the separate encodings of the first HARQ-ACK portion and the second CSI portion can be multiplexed on the PUSCH with the co-encoding of the second HARQ-ACK portion and the first CSI portion.

[0128] Other examples simplify the process by sending the entire HARQ-ACK payload instead of splitting it into two parts, and then multiplexing it on the PUSCH along with the first and second CSI portions. Finally, in other examples, the transmission of the second HARQ-ACK portion and / or the second CSI portion can be delayed, allowing the delayed transmission to be shifted to subsequent PUCCH / PUSCH transmission scenarios.

[0129] In some examples, the PUCCH (e.g., a PUCCH resource) designated for sending the original HARQ-ACK payload may not overlap with the PUSCH (e.g., a PUSCH resource). In such examples, the first HARQ-ACK portion may be sent on the PUCCH, while the second HARQ-ACK portion may be multiplexed onto the PUSCH (such as a subsequent PUSCH). This multiplexing scheme can present complexities when there is a delay in sending the second HARQ-ACK portion, particularly if there is no overlap between the PUCCH and PUSCH. Various aspects of this disclosure relate to selecting an appropriate PUSCH for the second HARQ-ACK portion.

[0130] Figure 7A This is a block diagram illustrating example 700 of selecting a PUSCH for the second HARQ-ACK portion according to various aspects of this disclosure. Figure 7A In Example 700, PUCCH 702 may be associated with the first HARQ-ACK portion. Additionally, the second HARQ-ACK portion may be associated with one of the groups of subsequent PUSCH 704, 706, and 708.

[0131] In some examples, when the first HARQ-ACK portion is assigned to PUCCH 702, the User Equipment (UE) selects the first PUSCH 704, which has the earliest start symbol after PUCCH 702. This occurs when multiple candidate PUSCHs with the same start symbol are encountered across different component carriers (CCs). Figure 7A (Not shown in the example), the UE prioritizes the PUSCH with the lowest index. However, if the earliest PUSCH is not scheduled within a subsequent number of slots from the PUCCH slot, such as... Each time slot (including the first time slot 710) can discard the second HARQ-ACK portion. Number of time slots The value can be a preset value, such as one or two, or the value can be configured by network nodes via signaling, such as Radio Resource Control (RRC) signaling.

[0132] In some other examples, the UE may identify the next slot starting from the PUCCH slot. PUSCH candidates 704, 706, and 708 are located within a time slot (including the PUCCH time slot, e.g., the first time slot 710). Among these PUSCH candidates 704, 706, and 708, the UE can select a PUSCH based on a priority order. In some examples, the priority order may prioritize PUSCHs with a non-periodic CSI, followed by dynamically granted PUSCHs that are configured to be granted, then the smallest CC index, and finally PUSCHs with an earlier start time within the same CC. In such examples, if a PUSCH is not within the specified time slot... If scheduled within a time slot, the second HARQ-ACK portion can be discarded.

[0133] In some examples, the timeline (T) proc This can be defined relative to the first symbol (S0) of the earliest PUSCH 704. In such examples, the first symbol should not precede any symbol outside the timeline following the last symbol of any physical downlink control channel (PDCCH) associated with the DCI scheduling the expected PUSCH. This rule can be applied to PUSCHs with an earlier start symbol or from... Select a PUSCH from the candidate PUSCHs within each time slot.

[0134] In some other examples, a specific position in the uplink (UL) DCI (such as DCI 0_1 or DCI 0_2) that schedules the PUSCH can indicate whether to reuse the pending second HARQ-ACK portion. When a set of second HARQ-ACK portions has been scheduled, the DCI can indicate one or more PUSCHs from a set of PUSCHs. The second HARQ-ACK portions can be multiplexed on one or more PUSCHs. A set of second HARQ-ACK portions can originate from different PUCCH resources in different time slots corresponding to different original HARQ-ACK payloads.

[0135] As discussed, in some examples, a set of second HARQ-ACK portions may be pending. In some such examples, the corresponding first HARQ-ACK portion corresponding to each second HARQ-ACK portion in the set may have already been transmitted on the PUCCH. In some examples, the UE may jointly encode all pending second HARQ-ACK portions. The jointly encoded second HARQ-ACK portions can then be multiplexed onto the next PUSCH.

[0136] In other examples, the UE may retain only the most recent second HARQ-ACK portion for reuse on subsequent PUSCHes. When determining the most recent second HARQ-ACK portion, the UE may only consider second HARQ-ACK portions of non-zero size. For example, if the first HARQ-ACK portion indicates that all HARQ-ACK payloads are ACKs, then the second HARQ-ACK portion is empty (e.g., of zero size). In some examples, when selecting the most recent second HARQ-ACK portion, second HARQ-ACK portions with a given priority level or a higher priority level may be considered.

[0137] Figure 7B This is a block diagram illustrating example 720 of a set of pending second HARQ-ACK portions according to various aspects of this disclosure. Figure 7B In Example 720, the UE can receive a set of PDSCH transmissions 730, 732, and 734 at each time instance t1, t2, and t3. PUCCHs 722, 724, and 726 can be scheduled in response to the receipt of each set of PDSCH transmissions 730, 732, and 734. Each PUCCH 722, 724, and 726 can be associated with a HARQ-ACK payload, and the corresponding HARQ-ACK payload can be transformed into a two-part HARQ-ACK payload. For example, as... Figure 7B As shown, a first HARQ-ACK portion can be formed at each time t1, t2, and t3. A corresponding second HARQ-ACK portion can also be formed. In some examples, the UE can select only a subset of all pending second HARQ-ACK portions. For example, as shown in Example 720, the UE can select only the second HARQ-ACK portions at times t2 and t3. These second HARQ-ACK portions can be jointly encoded and multiplexed on PUSCH 728.

[0138] In some examples, a subset of all pending second HARQ-ACK portions can be the number of most recent second HARQ-ACK portions. As discussed, the most recent second HARQ-ACK portion can be of non-zero size. Additionally or alternatively, the priority of each second HARQ-ACK portion can be used for selection. The most recent second HARQ-ACK portion. In other examples, the quantity It can be configured by network nodes via control signaling (such as RRC signaling) and / or based on UE capability signaling.

[0139] In other examples, a time window 736 can be specified. Time window 736 can be configured via RRC signaling and / or according to UE capability signaling. During the time window, all pending second HARQ-ACK portions can be multiplexed onto PUSCH 728. Second HARQ-ACK portions falling outside of this time window 736 can be omitted. Time window 736 can be defined by multiple time slots leading to the time slot associated with subsequent PUSCH 728.

[0140] In some cases, because another PUCCH overlaps with a PUSCH, a subsequent PUSCH may include a second original HARQ-ACK payload or a portion associated with the second original HARQ-ACK payload. In such cases, different multiplexing schemes can be used based on whether the second original HARQ-ACK payload has been transformed into one or two parts.

[0141] In some examples, if the second HARQ-ACK payload is transformed only in the first HARQ-ACK portion, the UE may jointly encode the second HARQ-ACK portion associated with the first HARQ-ACK payload and the second HARQ-ACK payload, and multiplex the jointly encoded second HARQ-ACK portion and the second HARQ-ACK payload on subsequent PUSCHes. In other examples, if the second HARQ-ACK payload is transformed only in the first HARQ-ACK portion, the second HARQ-ACK portion and the second HARQ-ACK payload are encoded separately. Subsequently, the UE multiplexes the second HARQ-ACK portion and the second HARQ-ACK payload on subsequent PUSCHes.

[0142] In some cases, the second HARQ-ACK codebook can be transformed into a first HARQ-ACK part and a second HARQ-ACK part. Figure 7CThis is a block diagram illustrating example 750 of multiplexing HARQ-ACK portions from different HARQ-ACK payloads according to various aspects of this disclosure. In some examples, such as example 750, a second HARQ-ACK portion 754 associated with a first HARQ-ACK payload may be co-encoded with a first HARQ-ACK portion 760 associated with a second HARQ-ACK payload. The first HARQ-ACK portion 752 associated with the first HARQ-ACK payload may be multiplexed on a first PUCCH 762. Additionally, the UE may separately encode a second HARQ-ACK portion 758 associated with a second HARQ-ACK payload. The second HARQ-ACK payload may be associated with a second PUCCH 766. The co-encoded first HARQ-ACK portion 760 and second HARQ-ACK portion 754 may be multiplexed with the second HARQ-ACK portion 758 on PUSCH 764. In Example 750, the second HARQ-ACK portion 758 and the first HARQ-ACK portion 760 associated with the second HARQ-ACK payload are encoded separately based on the fact that the size of the second HARQ-ACK portion 758 is a function of the size of the first HARQ-ACK portion 760.

[0143] In other examples ( Figure 7C (Not shown in the image) The UE encodes the second HARQ-ACK portion 754 associated with the first HARQ-ACK payload and the second HARQ-ACK portion 758 associated with the second HARQ-ACK payload together. The first HARQ-ACK portion 760 associated with the second HARQ-ACK payload can be encoded separately. The encoded HARQ-ACK portions 754, 758, and 760 can be multiplexed on subsequent PUSCH 764.

[0144] Reference Figure 7C In all aspects described, two differently encoded UCIs can be multiplexed on the PUSCH. In some other examples, as discussed, the second HARQ-ACK portion associated with the first HARQ-ACK payload and the second HARQ-ACK payload can be encoded separately and subsequently multiplexed on the PUSCH. Such examples also describe scenarios of multiplexing two differently encoded UCIs on the PUSCH. The differently encoded UCIs can be referred to as UCI1 HARQ-ACK and UCI2 HARQ-ACK. As previously discussed, three separately encoded UCI types can be multiplexed on the PUSCH.

[0145] In some cases, the CG-UCI can be co-encoded with either UCI1 HARQ-ACK or UCI2 HARQ-ACK and then multiplexed on the PUSCH. If the CSI consists of a single part, the CSI is encoded separately and multiplexed on the PUSCH, resulting in the multiplexing of three differently encoded UCIs. However, if the CSI comprises two parts (Part 1 CSI and Part 2 CSI), different multiplexing schemes can be used. In some examples, Part 2 CSI can be discarded, and Part 1 CSI can be encoded and multiplexed on the PUSCH. That is, the PUSCH can include three separately encoded UCIs: UCI1 HARQ-ACK, UCI2 HARQ-ACK, and Part 1 CSI. In other examples, all four separately encoded UCIs can be multiplexed on the PUSCH. In some other examples, UCI1 HARQ-ACK can be encoded together with Part 1 CSI, and UCI2 HARQ-ACK can be encoded together with Part 2 CSI. Then, two different UCIs can be multiplexed on the PUSCH. In other examples, UCI1 HARQ-ACK is co-encoded with a portion of CSI, and the three encoded UCIs are then multiplexed on the PUSCH. In other examples, UCI2 HARQ-ACK is co-encoded with a portion of CSI, and the three distinct encoded UCIs are then multiplexed on the PUSCH. Finally, in some examples, UCI2 HARQ-ACK may be co-encoded with a portion of CSI, and the three unique UCIs may be multiplexed on the PUSCH.

[0146] In some examples, a first HARQ-ACK portion is sent on a first PUCCH, and a second HARQ-ACK is sent on a subsequent PUCCH (e.g., a second PUCCH). In some such examples, the first PUCCH corresponds to the original HARQ-ACK payload before it is transformed into the first and second HARQ-ACK portions. The first PUCCH may be scheduled by a first DCI.

[0147] In some examples, a subsequent PUCCH (e.g., a second PUCCH) may be a next PUCCH transmission timing dynamically scheduled by a second DCI for a second HARQ-ACK payload. In such examples, a network node may first decode the first HARQ-ACK portion from the first PUCCH, determine the size of the second HARQ-ACK portion, and dynamically allocate an appropriate PUCCH capable of accommodating both the second HARQ-ACK portion and the second HARQ-ACK payload. In other examples, the second PUCCH may be a semi-statically configurable next PUCCH transmission timing. In such examples, the second PUCCH may initially be scheduled for HARQ-ACK feedback associated with one or more semi-persistently scheduled PDSCHs.

[0148] In other examples, the second DCI may schedule the second PUCCH while referencing the first PUCCH to indicate which pending second HARQ-ACK portion should be sent. In some examples, the second DCI may not include downlink (DL) assignments for PDSCH scheduling. Therefore, the second PUCCH may not be associated with the second HARQ-ACK payload. The second DCI may use slot offsets (such as the gap between the slot associated with the second DCI and the slot associated with the first PUCCH) to identify the first PUCCH resource.

[0149] In an example where the second HARQ-ACK portion is multiplexed on the second PUCCH, the first HARQ-ACK portion associated with the second HARQ-ACK payload can be jointly encoded with the second HARQ-ACK portion associated with the first HARQ-ACK payload. The jointly encoded first and second HARQ-ACK portions can be multiplexed on the same PUCCH.

[0150] In other examples, the first and second HARQ-ACK portions formed from the original HARQ-ACK payload can be multiplexed on the same PUCCH. In such examples, the PUCCH can be a format 3 or format 4 PUCCH. In some such examples, other UCIs, such as CSIs or scheduling requests (SRs), can be multiplexed on the PUCCH resource. In some such examples, if an SR payload is present, the payload can be co-encoded with the first HARQ-ACK, and the two separately encoded UCIs can be transmitted on the PUCCH resource. In other examples, if a portion of a CSI is present, a portion of the CSI can be co-encoded with the first HARQ-ACK, and the two separately encoded UCIs can be transmitted on the PUCCH resource.

[0151] In other examples, the CSI may have two parts. In some examples, part two of the CSI may be discarded, and part one of the CSI may be co-encoded with the first HARQ-ACK, and two separately encoded UCIs ((part one of the CSI and the first HARQ-ACK part) + (the second HARQ-ACK part)) may be transmitted on the PUCCH resource. In other examples, part one of the CSI may be co-encoded with the first HARQ-ACK. Additionally, part two of the CSI may be co-encoded with the second HARQ-ACK, and two separately encoded UCIs may be transmitted on the PUCCH. In other examples, part one of the CSI may be co-encoded with the first HARQ-ACK part, and part two of the CSI and the second HARQ-ACK part may also be encoded separately. Three separately encoded UCIs may be transmitted on the PUCCH.

[0152] In some cases, if the PUCCH and PUSCH overlap, the two HARQ-ACK portions can be multiplexed on the PUSCH instead of the PUCCH. In examples where two HARQ-ACK portions are multiplexed on the same PUCCH, the network node can configure PUCCH resources to accommodate both HARQ-ACK portions. If insufficient PUCCH resources are allocated, the reliability of the HARQ-ACK feedback may be reduced. Additionally, even when two HARQ-ACK portions are multiplexed on the same PUCCH, the network node can still decode the first HARQ-ACK portion before decoding the second HARQ-ACK portion.

[0153] As discussed, in some cases, the HARQ-ACK payload may include one or more dummy NACKs (e.g., d-NACK). d-NACK may also be referred to as default NACK. d-NACK is not low-probability because it is not associated with decoding failures (such as DCI decoding failure, PDSCH decoding failure, or PDCCH decoding failure). Instead, d-NACK may occur more frequently than actual NACKs due to decoding failures, based on one or more scheduling decisions by the network node. Specifically, d-NACK is a type of NACK (denoted as "0") added to the HARQ-ACK payload to ensure that the payload size (e.g., codebook size) matches between the UE and the network node. Therefore, compression schemes such as two-part HARQ-ACK compression schemes may not adequately compress the HARQ-ACK payload in the presence of d-NACK. d-NACK can be used for different types of HARQ-ACK payload types, such as Type 1, Type 2, and Type 3 HARQ-ACK codebooks (e.g., HARQ-ACK payloads).

[0154] Various aspects of this disclosure relate to applying a two-part HARQ-ACK compression scheme when the original HARQ-ACK payload includes one or more d-NACKs. In some cases, it may be desirable to exclude d-NACKs from the HARQ-ACK payload before compression is implemented. However, this can lead to variations in the HARQ-ACK payload size N between the UE and the network, particularly when one or more actual NACKs are associated with DCI decoding failures. This mismatch can also result in a different first size for the first HARQ-ACK portion. And / or the second size of the second HARQ-ACK portion The misalignment.

[0155] In some examples, the UE can modify d-NACK to d-ACK before the compression process, instead of excluding d-NACK. Modifying d-NACK to d-ACK maintains the alignment of the HARQ-ACK payload size N between the UE and the network. In other examples, the HARQ-ACK payload can be split into two segments. In such examples, one of these segments can be transformed into a two-part HARQ-ACK payload. Additionally, in some such examples, the other segment can report a New Data Indicator (NDI).

[0156] As discussed, one or more d-NACKs in the HARQ-ACK payload are not associated with decoding failure. In some cases, one or more d-NACKs may be included based on the number of code block groups (CBGs). In such cases, a CBG-based HARQ-ACK may be configured with a maximum number of CBGs configured as component carriers (CCs) with `maxCodeBlockGroupsPerTransportBlock`. The HARQ-ACK payload may also include one or more d-NACKs based on a scheduled transport block (TB) that includes fewer CBGs than the maximum number of CBGs. For example, d-NACKs may be included in a set of information bits, such as the last TB in the HARQ-ACK payload. This applies to all HARQ-ACK payload types (e.g., Type 1, Type 2, and Type 3 codebooks). For Type 2 HARQ-ACK payloads, the maximum number of CBGs is based on the sum of the maximum number of CBGs for each CC configured with CBG-based HARQ-ACKs.

[0157] In some cases, the maximum number of codewords per PDSCH is set to "2", and spatial bundling is not configured. In such cases, based on a PDSCH comprising one TB, the second transport block for the HARQ-ACK payload may include one or more d-NACKs. Alternatively, the HARQ-ACK payload may include one or more d-NACKs when the DCI associated with the HARQ-ACK does not schedule the PDSCH (e.g., due to a semi-persistent scheduling (SPS) release, a transmit configuration indicator (TCI) state update, or a secondary cell (SCell) hibernation). This rule for including d-NACKs applies to all HARQ-ACK payload types (e.g., type 1, type 2, and type 3 codebooks). For type 2 HARQ-ACK payloads, if at least one configured downlink (DL) bandwidth portion (BWP) of at least one CC is configured with maxNrofCodeWordsScheduledByDCI = 2 Then this rule applies to all CCs. For Type 1 and Type 3 HARQ-ACK payloads, CC-based... maxNrofCodeWordsScheduledByDCI Configure this rule to apply to each CC.

[0158] In some cases, a UE can be scheduled to run in a time slot. n + k HARQ feedback is sent during the process. In such cases, the response is based on the UE's time slot. n Received PDSCH in the middle and failed in the time slot n + k The system sends HARQ feedback, and the HARQ-ACK payload may include one or more d-NACKs. This only applies to type 1 HARQ-ACK payloads.

[0159] In some cases, CBG-based HARQ-ACK can be configured for CC via Radio Resource Control (RRC) parameters (PDSCH - Code Block Group Transmission). In such cases, when the PDSCH is scheduled by a DCI format that does not support CBG-based PDSCH reception, the HARQ-ACK payload may include one or more d-NACKs. For example, DCI formats 1_0 or 1_2 do not support CBG-based PDSCH reception. As another example, the DCI associated with the HARQ-ACK payload may not schedule the PDSCH, such as the DCI associated with SPS release or TCI state update. In this example, the DCI may not support CBG-based PDSCH reception. In such cases, a single-bit HARQ-ACK payload including d-NACKs may be repeated. In some such cases, a HARQ-ACK payload may include d-ACK instead of d-NACK. This can be applied to type 1 or type 3 HARQ-ACK payloads.

[0160] In some cases, for a Type 1 HARQ-ACK payload, the UE may fail to decode the scheduled DCI, and therefore the UE may not receive the TB / CBG. In such cases, the HARQ-ACK payload may include d-NACK in each instance corresponding to the unreceived TB / CBG.

[0161] In some cases, for Type 3 HARQ-ACK payloads, NDI may not be scheduled for reporting as part of the HARQ-ACK payload. In some such cases, when the UE has previously reported HARQ-ACK details received for a PDSCH without scheduling another PDSCH with the same HARQ ID, the HARQ-ACK payload associated with that HARQ identifier (ID) may include one or more d-NACKs. In other cases, when the UE fails to retrieve HARQ-ACK information for a PDSCH with a specific HARQ ID, the HARQ-ACK payload associated with that HARQ ID may include one or more actual NACKs.

[0162] In some cases, for type 3 HARQ-ACK payloads, NDI can be configured to be reported as part of the HARQ-ACK payload. In some such cases, HARQ IDs may not be scheduled. Therefore, a HARQ-ACK payload may include one or more d-NACKs.

[0163] In some examples, the UE can transform the original HARQ-ACK payload (e.g., the original HARQ-ACK codebook) into a first HARQ-ACK portion and a second HARQ-ACK portion based on the fulfillment of formation conditions. If the formation conditions are not met, the UE can transmit the original HARQ-ACK payload. Formation conditions can be semi-static conditions (such as conditions configured via RRC messages) or dynamic conditions (such as conditions associated with scheduling). In some examples, the conditions are met if the HARQ-ACK payload is a type 2 payload. In some such examples, dynamic formation conditions are met if the HARQ-ACK payload is a type 2 payload and if the network node has not yet requested a type 3 payload via DCI. In other examples, formation conditions are met if CBG-based PDSCH reception is not configured. In other examples, formation conditions are met if the maximum number of codewords per PDSCH is greater than or less than a threshold (such as two). In other examples, formation conditions are met if the maximum number of codewords per PDSCH is two and spatial binding is not configured. In some examples, based on scheduling, the UE can dynamically determine whether each NACK in the original HARQ-ACK payload is a d-NACK or an actual NACK.

[0164] As discussed, in some examples, the UE may dynamically determine whether to transform the original HARQ-ACK payload into a two-part HARQ-ACK payload. Such dynamic decisions can occur at each point in time when HARQ-ACK transmission is scheduled. In such examples, dynamically determining to transform the original HARQ-ACK payload may lead to a mismatch between the UE and the network node. Therefore, in some examples, the network node may indicate whether to transform the original HARQ-ACK payload. In such examples, fields or bits in the DCI message may indicate whether the UE should transform the original HARQ-ACK payload. In some such examples, the UE may use an indication included in the last DCI that schedules HARQ-ACK transmission to determine whether to transform the original HARQ-ACK payload into a two-part HARQ-ACK payload.

[0165] In some examples, the UE can modify the original HARQ-ACK payload before transforming the original HARQ-ACK payload into two parts. Figure 8A This is a block diagram illustrating example 800 of a modification of the original HARQ-ACK payload according to various aspects of this disclosure. As shown in example 800, the UE can generate the original HARQ-ACK payload based on receiving one or more downlink transmissions. Modifying module 802 can modify the original HARQ-ACK payload. One or more bits. For example, the original HARQ-ACK payload. Each d-NACK in the configuration can be transformed into a d-ACK. As shown in Example 800, the two-part HARQ-ACK compression module 502 can receive a modified HARQ-ACK payload. The two-part HARQ-ACK compression module 502 can be referenced. Figure 5 The various aspects described generate a two-part HARQ-ACK payload.

[0166] As discussed, in some cases, the number of code block groups (CBGs) included in the scheduled transport block (TB) may be less than the maximum number of configured CBGs. In some examples, when the number of CBGs is less than the maximum number of configured CBGs, the modification module 802 may modify d-NACK to d-ACK in the set of information bits of the original HARQ-ACK payload. In some such examples, the set of information bits may be the last bit in the TB of the original HARQ-ACK payload. One information bit.

[0167] Additionally, as discussed, in some cases, the maximum number of codewords can be set to a value such as two, and space bundling can be left unconfigured. In such cases, the HARQ payload may include one or more d-NACKs if the PDSCH includes a transport block or if the DCI associated with the HARQ-ACK feedback does not schedule the PDSCH. In some examples, if the PDSCH includes a transport block or the DCI associated with the HARQ-ACK feedback does not schedule the PDSCH, the modification module 802 may modify the second transport block of the HARQ-ACK payload to include an ACK (such as d-ACK) instead of a d-NACK.

[0168] Additionally, as discussed, in some cases, the UE can be scheduled based on time slots. n Received PDSCH in time slot n + k The original HARQ-ACK payload is sent in the middle. In some cases, if it is in a time slot... n + k If a HARQ-ACK payload is reported in a different time slot, the value of each bit in the HARQ-ACK payload can be set to d-NACK. In some examples, the modification module 802 can modify each bit in the HARQ-ACK payload from d-NACK to ACK, such as d-ACK.

[0169] Furthermore, as discussed, if the PDSCH is scheduled by a DCI format that does not support CBG-based PDSCH reception, the UE may repeat one bit of HARQ-ACK. Next. A single HARQ-ACK can be either a d-ACK or a d-NACK. For example, the DCI format can be DCI format 1_0 or 1_2 used for the scheduled PDSCH or SPS PDSCH. As another example, the DCI associated with the HARQ-ACK payload can indicate an SPS release for a TCI state update. In some examples, the modification module 802 can generate an ACK, such as the last TB in the original HARQ-ACK payload. d-ACK of 1 information bit.

[0170] In some examples, the original HARQ-ACK payload can be split into a first part and a second part, and then one of these parts can be transformed into a two-part HARQ-ACK payload. Figure 8B This is a block diagram illustrating example 850 of splitting the original HARQ-ACK payload according to various aspects of this disclosure. In example 850, the UE can generate the original HARQ-ACK payload based on receiving one or more downlink transmissions. The split module 852 can disassemble the original HARQ-ACK payload. Split into the first part Part Two As shown in Example 850, the modified HARQ-ACK payload It can be received at the two-part HARQ-ACK compression module 502. The two-part HARQ-ACK compression module 502 can be referenced. Figure 5 The various aspects described generate a two-part HARQ-ACK payload. Furthermore, the channel encoder 504 can process the first part. The UE can then send the encoded first part. The encoded first HARQ-ACK portion and the encoded second HARQ-ACK portion.

[0171] In some examples, the first part It may not be compressible. Therefore, the first part... It may not be transformed into a two-part HARQ-ACK payload. For example, for a Type 3 HARQ-ACK payload, when one or more NDIs are configured to report as part of a Type 3 HARQ-ACK payload, the first part... It may include one or more NDIs and the second part This may include HARQ feedback (e.g., ACK / NACK bits). In this example, the first part... It is incompressible and partially Parts are compressible. In other examples, for a Type 2 HARQ-ACK payload with two sub-payloads (e.g., two sub-codebooks), such as a TB-based sub-payload or a CBG-based sub-payload, the first part... It may include a sub-payload, such as a CBG-based sub-payload, and the second part It may include another sub-payload, such as a TB-based sub-payload. In this example, the first part... The compression gain can be minimized.

[0172] In some examples, such as shown in Example 850, the channel encoder 504 can [address the first part]. Jointly encoded with the first HARQ-ACK portion. In other examples ( Figure 8B In (not shown), the channel encoder 504 can process the first part Jointly encoded with the second HARQ-ACK portion. In other examples ( Figure 8B In (not shown), the channel encoder 504 can process the first part The first HARQ-ACK part and the second HARQ-ACK part are encoded separately.

[0173] As noted above, due to the small block error rate (BLER) observed during 5G and subsequent communications, the lossless compression used for Hybrid Automatic Repeat Request Acknowledgment (HARQ-ACK) feedback significantly reduces overhead compared to standard HARQ-ACK feedback. This overhead is further reduced when there is correlation between different transmissions received from the network.

[0174] Near-optimal compression, or entropy, can be achieved using two-part or two-stage HARQ-ACK compression. One or two bits in the first part are usually sufficient. In the simplest form of lossless compression, the first part of the two-part HARQ-ACK payload (e.g., part 1) has one bit. If all received code blocks are successfully decoded (e.g., all ACKs), the transmitter sets the single bit to "1". In this case, nothing is transmitted for the second part of the two-part HARQ-ACK payload (e.g., part 2). Otherwise, the transmitter sets the single bit in the first part to "0" and transmits the complete payload in the second part of the two-part HARQ-ACK payload.

[0175] If losses are tolerated to further reduce HARQ-ACK overhead, then the loss or distortion and its impact on the system should be defined. Furthermore, the optimal (or information-theoretical) rate distortion function for the chosen loss function should be determined. The practical implementation scheme of the rate distortion function and how to implement it are now described.

[0176] For the information theory rate distortion formula, the parameters... It can be either the compression ratio or the source encoding, making The units digit can be compressed to... Ones place, of which And parameters It is the average distortion between the original sequence and the reconstructed sequence: ,in It is a length of n The original sequence, and This is a reconstructed sequence. It assumes there are no errors from channel coding or channel decoding (e.g., the channel is noise-free or there are channel decoding correction errors). Therefore, distortion is only caused by compression. Rate distortion function. It is the rate The lower limit makes It is achievable.

[0177] Figure 9 These are block diagrams illustrating various aspects of lossy compression encoding and decoding according to this disclosure. For example... Figure 9 As seen, the original HARQ-ACK codebook (CB) Received at source encoding module 902. Original HARQ-ACK codebook. Including multiple bits Source encoding module 902 processes the original HARQ-ACK codebook. The bit HARQ-ACK feedback is encoded to generate A compressed sequence of units. Channel encoder 904 compresses... The individual bits are encoded for transmission to network devices, such as base stations. The channel decoder 906 at the network device compresses the data for use in the source decoder 908. Decode the individual bits. The source decoder 908 generates the reconstructed bits. It is similar to the original HARQ-ACK codebook. The original bit undergoes a certain amount of distortion caused by compression.

[0178] Shannon's lossy source decoding theorem states the rate distortion function of a discrete memoryless source ( , ), and distortion measurement for This means that it is impossible to achieve a rate distortion curve. Any rate distortion pair below. This also means that there exists a rate distortion curve that can be achieved. The code for a given point in the value is... This was achieved through the increase of [something].

[0179] This disclosure describes various aspects used in rate distortion curves Techniques for achieving the desired results. These techniques may include low-complexity source encoding and source decoding schemes for operating with small codeword lengths.

[0180] For distortion metrics in general lossy compression problems, we can consider distortion as... The Hamming function, where This represents the XOR logical operation. In the context of HARQ-ACK compression, Hamming distortion metrics are inappropriate. For ACK-to-NACK errors, Hamming distortion metrics are acceptable because the error only results in unnecessary retransmissions. Unnecessary transmissions impact downlink throughput, and distortion further exacerbates the problem. If the error is small enough, such an impact can be minimized. For NACK-ACK errors, recovery is impossible, or recovery may be difficult or expensive.

[0181] Based on various aspects of this disclosure, distortion is defined to avoid NACK-ACK errors at all costs. Therefore, distortion... Defined as:

[0182] Consider distortion The impact on systems with the above distortion metrics, among which This is the downlink block error rate (BLER) (e.g., the probability of a NACK "0" in the HARQ-ACK codebook). The effective downlink throughput of lossy HARQ-ACK compression, considering the above distortion metric, can be calculated as follows: ,in This is the downlink throughput based on the scheduled downlink modulation and decoding scheme (MCS). In the absence of distortion, the downlink throughput is... Allowing some ACK to NACK errors results in average distortion. Meanwhile, ensuring there are no NACK-ACK errors, the downlink BLER is effectively increased to achieve additional HARQ-ACK compression. This can be illustrated... Bernoulli source and the above distortion measure is The rate distortion, where H(.) is the binary entropy function.

[0183] The smaller the BLER, the greater the difference between Hamming distortion and new distortion. Therefore, the cost of avoiding NACK to ACK becomes more significant. To mitigate the downlink throughput reduction due to lossy compression, distortion should be less than or equal to the downlink BLER. For 10% BLER, compared to lossless compression, the UE can achieve [the following]: At the cost of distortion, HARQ-ACK overhead is reduced to 1 / 1.75 (0.47 / 0.27), while downlink throughput is reduced to 1 / 1.125 (0.9 / 0.8), while NACK-ACK errors are completely avoided.

[0184] Based on all aspects of this disclosure, across Single-digit HARQ-ACK bundling is a technique used for lossy compression. In these respects, source encoding occurs at the UE. For HARQ-ACK payloads... The unit digit, UE sends the corresponding A single bit is used in a logical AND operation. This type of encoding is called a bundle. Source decoding occurs at the network, such that if the received single bit is "1", the network assumes all ACKs in the HARQ-ACK payload are valid. The last bit is ACK (e.g., 1). If the received single bit is "0", the network assumes that all bits of the HARQ-ACK payload are ACKed. The units digit is the NACK bit. This technique ensures that a NACK-to-ACK error will not occur. In other words, only two possible codewords are decoded: 00…0 and 11…1, each with a length of… k .

[0185] Figure 10 This is a block diagram illustrating various aspects of bundling and source decoding according to this disclosure. For example... Figure 10 As seen, the original HARQ-ACK codebook (CB) Received at binding module 1002. Original HARQ-ACK codebook. Including a certain number of bits Bundled module 1002 is bundled for... Units digit original HARQ-ACK codebook HARQ-ACK feedback to generate bundled HARQ-ACK bit sequences The channel encoder 1004 applies compressed bundled HARQ-ACK bit sequences. The compressed bits are encoded and sent to network devices (such as base stations). The channel decoder 1006 at the network device decodes the compressed bits used by the source decoder 1008. The source decoder 1008 generates the reconstructed bits. It is similar to the original HARQ-ACK codebook. The original bits undergo a certain amount of distortion caused by compression. Each 0 bit is decoded into a length of... k The 00…0, and each 1 bit is decoded into a length of k 11…1.

[0186] The rate distortion achieved by this scheme is the rate: .distortion ,in Let this be the expectation function, which represents the sequence. and The average distortion between them.

[0187] In order to achieve bundling, the UE needs to know the bundling size. Bundle size The choice depends on the desired amount of compression. More compression comes at the cost of more distortion. Therefore, the network can be configured with an appropriate bundle size. In addition, the size of the bundle The choice can depend on the size of the HARQ-ACK payload ( ).

[0188] The following describes how the UE can determine the bundle size. The three options.

[0189] In option 0, the bundle size It is a fixed number of hard-coded codes (e.g.) It is used when configuring HARQ-ACK binding for lossy compression in the UE.

[0190] In option 1, the bundle size This is a fixed number configured by the network via Radio Resource Control (RRC). Bundle size Independent of HARQ-ACK payload size The value. If bundle size is not configured. Then, based on the UE assumption (For example, no bundling). If the bundling size If it is configured by RRC, then the range of this parameter can be limited, for example... or Larger values ​​lead to greater distortion, thus affecting downlink throughput.

[0191] In option 2, the bundle size Depends on the size of the HARQ-ACK payload ( In some cases, among which The UE binds the entire HARQ-ACK codebook. This dependency can be configured via RRC signaling, for example, by configuring... Values ​​(for possible) (or by configuring a threshold) Value and corresponding In some aspects, network configuration thresholds and possible corresponding values If they are not fixed.

[0192] Figure 11 This is a table illustrating the bundle size dependency according to various aspects of this disclosure. Figure 11 In the example, if the HARQ-ACK payload size The value is less than or equal to the first threshold. Then the UE uses the corresponding bundle size. The size of this bundle can be fixed in some specific implementations. If the HARQ-ACK payload size... The value is greater than the first threshold. However, it is less than or equal to the second threshold. Then the UE uses the corresponding bundle size. In some specific implementations, the bundle size can be fixed. Therefore, the UE can determine the bundle size. The corresponding value (based on the HARQ-ACK payload size) (the interval of descent), such as Figure 11 See the example table.

[0193] Based on various aspects of this disclosure, methods for determining bundle size can be employed. Each option in the options is used to apply quantization. If the value If it is not an integer, then the same bundle size cannot be assumed for the entire HARQ-ACK codebook. .

[0194] In the first alternative solution, the bundle size value is set to [value] for different bundles. and +1. In this alternative scheme, the quantity Mod(N,k) bundles have a length +1, where Mod() is the modulo function. The number of bundles is floor(N / k) - Mod(N,k) with lengths... Here, floor() is the floor function. Assuming each bundle is compressed into one bit, then the source encoding generates a number of floor(N / k) bits.

[0195] In the second alternative, the bundle size is set to k, except for the last bundle. In this alternative, the number of floor(N / k) bundles has a length of... And a bundle has a length Mod(N,k). Assuming each bundle is compressed to one bit, then the number of bits generated after source encoding is floor(N / k)+1.

[0196] Bundling is equivalent to... Possibilities (length is) The ACK / NACK bits are partitioned into two partitions: (1) all ones and (2) all other combinations. Therefore, after source decoding, the bundle produces two codewords: 11...1 and 00...0.

[0197] This disclosure extends the bundling technology to various aspects. A more general partitioning of possibilities. Based on these aspects, the UE will The possible partitions are Groups (where the index is ) ). UE's response to HARQ-ACK The individual digits are executed to obtain a set of indexes through source encoding. (Also known as a partitioned index). The network source indexes the received group. Decode the code, assuming the first... individual code characters There are a total of Each code word. Each code can be a group An element-wise binary logical AND operation is performed on all members (e.g., to ensure there are no NACK-to-ACK decoding errors). The rate distortion achieved by this technique is the rate: The level of distortion depends on the partition.

[0198] Figure 12 This is a block diagram illustrating various aspects of partitioning and source decoding according to this disclosure. For example... Figure 12 As seen, the original HARQ-ACK codebook (CB) Received at partition module 1202. Original HARQ-ACK codebook. Including a certain number of bits Partition module 1202 is for... Units digit original HARQ-ACK codebook Partition HARQ-ACK feedback to obtain group or partition index sequence The source decoder 1208 at the network device generates the reconstruction bits. It is similar to the original HARQ-ACK codebook. The original bits undergo a certain amount of distortion caused by compression. Each group index Decoded to correspond to the group index The codeword (length is) k ).

[0199] Now about Figure 13 An example describing a partition. Figure 13 This is a table that maps codewords to group indexes according to various aspects of this disclosure, while simultaneously showing the distortion level corresponding to the reconstructed bits. Figure 13 In the example, the bundle size =5, and for G =4 groups, 32 code points. In this example, codewords =11111 was assigned to the group g =1. Derived by the source decoder based on the group index. g =1 generates the reconstructed bit It is also 11111. Therefore, the distortion is... In this example, codeword =11100, 11101, and 1110 were assigned to group g =2. Derived by the source decoder based on the group index. g =2 generated reconstruction bits It is 11100. This depends on the actual source codeword. ,distortion Or 1 / 5 = 20%. In this example, codeword =10010, 10011, 11010, 10110, 10111, and 11011 were assigned to group g =3. Derived by the source decoder based on the group index. g =3 generated reconstruction bits It's 10010. It depends on the actual source codeword. ,distortion 1 / 5 = 20% or 2 / 5 = 40%. Figure 13 The example also shows the values ​​for group 4 and the corresponding distortion levels.

[0200] Similar to bundling, for partitioning, the UE needs to know... The value and how to perform quantization, if Not an integer. Options 0 through 2, as well as the first and second alternatives discussed regarding bundling, also apply to partitioning. However, for partitioning, the UE also needs to know the group index for each code point. Each code point corresponds to one of the original HARQ-ACK bits used for source coding. The following discussion focuses on the units digit. Units digit (to be encoded into the group index) middle).

[0201] In the group index used to determine the source codeword In the first option used for source encoding, it is assumed that the UE knows the codeword.

[0202] In step 1, the UE determines the possible source decoding result. Each code character (length is...) ): ,against These codewords are either explicitly communicated to the UE by the network, for example, via signaling through RRC configuration, or determined by the UE based on a fixed or specified codebook. If the UE determines the codewords, the network may simply signal the number of codewords, the value of which is... If a codeword is notified via signals, and a given codeword must be all zeros, then only signals are used to notify the UE. One code word. Otherwise, It can be equal to all 0s that cannot be mapped to any codeword, and a NACK to ACK error is not allowed.

[0203] In step 2, for a given HARQ-ACK sequence UE selection leads to minimum distortion The typing. In other words, More specifically, if in the sequence The Locations ( If a "0" exists in the same string (e.g., NACK), then in the same string... All codewords containing a "1" in each position (e.g., ACK) are eliminated. This process ensures that no NACK-to-ACK errors occur. The UE then selects the codeword that minimizes the Hamming distance from the remaining codewords (e.g., given that only ACK-to-NACK errors are allowed). (Multiple positions containing "1" in the codeword and "0" in the codeword). If multiple codewords result in the same minimum distance, the UE selects the codeword with the smallest index.

[0204] Now we will describe some examples used to determine group indexes. In these examples, And the length is The four codewords are 11111, 11100, 10010, and 00000. They are either signaled to the UE or configured using a fixed codebook and a set number of codewords. The network provides this.

[0205] In the first example, source encoding The first and second codewords (11111 and 11100) were eliminated. In the third and fourth codewords (10010 and 00000), codeword 10010 has a smaller Hamming distance (2 / 5 vs. 4 / 5) corresponding to the ACK-NACK error. Therefore, .

[0206]

[0207] In the second example, source encoding The first three codewords were eliminated. Therefore, Even if 01111 and 00000 are different in four places, the fourth codeword is the only choice, given that a NACK to ACK error is not allowed.

[0208]

[0209] The following describes how the UE can determine the codewords used for source coding. The second option. In the second option, when the UE does not know the codeword, each possible code point ( The group index is signaled to the UE via RRC signaling. In this second option, the codeword selection depends on the network, and the UE does not need to know about the selection. However, to avoid NACK to ACK errors, the second option... The code should be a group The result of an element-wise binary AND operation on all members. Now, describe three alternative signaling schemes for the second option.

[0210] In the first alternative option, for For each value, the network notifies the group index using a signal. For each binary sequence For each of the codewords, the length of the binary sequence is... . Figure 14 Based on various aspects of this disclosure Figure 13 The table shown is a portion of a table that maps codewords to group indices. In this first alternative scheme, the network signals the mapping to the UE, such as that shown in Figure FF.

[0211] In the second alternative, for For each value, the network indicates There are 3 lists, where each list corresponds to a group and includes code points belonging to that group.

[0212] The third alternative has lower overhead than the first two alternatives but less flexibility, and both the UE and the network are assumed to be cross-platform. Sort of code points with the same value. For For each value, the network indicates the members of each group. The quantity, i.e. This value is used to determine the number of members in the last group.

[0213] When both bundling and partitioning are options for lossy HARQ-ACK compression, the network can, for example, utilize RRC signaling to configure either bundling or partitioning. Even when bundling is a special case of partitioning, one of these two techniques can be explicitly configured, as bundling is easier to configure without requiring instruction codewords or partitioning.

[0214] In some aspects of this disclosure, lossy HARQ-ACK compression can be enabled or disabled. In a first alternative for enabling / disabling, the network (e.g., using RRC signaling) configures the UE to perform bundling / partitioning. In a second alternative, MAC-CE activates or deactivates bundling / partitioning. In a third alternative, the network dynamically signals to the UE (e.g., using downlink control information (DCI)) whether bundling / partitioning should be performed. The downlink DCI scheduling HARQ-ACK can indicate whether bundling / partitioning should be performed. In the case of multiple downlink DCI messages pointing to the same HARQ-ACK codebook, this indication can be based on the last received DCI message. In some aspects, a single field indicates whether bundling / partitioning should be performed. The presence of this field can be configured per DCI format RRC. That is, the network can enable or disable dynamic signaling itself.

[0215] In some respects, the UE indicates whether lossy HARQ-ACK compression is supported via UE capability signaling. Where both bundling and partitioning are options for lossy HARQ-ACK compression, the UE may further indicate support for both bundling and partitioning, or support for bundling only.

[0216] As noted above, due to the small block error rate (BLER) observed during 5G and subsequent communications, the lossless compression used for Hybrid Automatic Repeat Request Acknowledgment (HARQ-ACK) feedback significantly reduces overhead compared to standard HARQ-ACK feedback. This overhead is further reduced when there is correlation between different transmissions received from the network.

[0217] Near-optimal compression, or entropy, can be achieved using two-part or two-stage HARQ-ACK compression. One or two bits in the first part are usually sufficient. In the simplest form of lossless compression, the first part of the two-part HARQ-ACK payload (e.g., part 1) has one bit. If all received code blocks are successfully decoded (e.g., all ACKs), the transmitter sets the single bit to "1". In this case, nothing is transmitted for the second part of the two-part HARQ-ACK payload (e.g., part 2). Otherwise, the transmitter sets the single bit in the first part to "0" and transmits the complete payload in the second part of the two-part HARQ-ACK payload.

[0218] As noted above, for ACK to NACK errors (1 0) error, the loss function can be defined as one (1); and for NACK to ACK error (0) 1) Define the loss function as infinity ( This definition ensures that NACK-ACK decoding will never occur because it is difficult or impossible to recover from a NACK-ACK error.

[0219] Two quantization schemes can be considered: 1) bundling; and 2) partitioning. Bundling alone may not yield the optimal rate distortion profile. The same applies to partitioning using short codewords, as long codewords cannot be used for HARQ-ACK feedback. Furthermore, even if partitioning can achieve good rate distortion pairs, it is complex and requires more signaling overhead.

[0220] According to various aspects of this disclosure, after bundling or partitioning (which reduces size but introduces distortion through quantization), further compression can be applied to reduce overhead by using lossless source decoding techniques (e.g., two-part HARQ-ACK compression). Further compression is possible because code points are not equally possible even after bundling or partitioning.

[0221] For example, suppose the original HARQ-ACK codebook is an independent and identically distributed (iid) binary source, where the probability of 0 (e.g., NACK) is defined as (For example, Bernoulli) For HARQ-ACK feedback, the probability... The corresponding downlink BLER is, for example, 0.1. If the receiver is bundled... Units digit (e.g., Logical AND of the units digit), prob(binding Ack=0) = In other words, after bundling, the probability of the new alphabet being zero (e.g., NACK) is Berounulli ( ).if and ,but Therefore, the entropy of the new alphabet is approximately 0.7. Thus, the new alphabet is losslessly compressible, and two-part HARQ-ACK compression can be applied to further reduce overhead. As discussed below, the cascading of bundling / partitioning and two-part HARQ-ACK compression achieves a near-optimal rate distortion profile.

[0222] According to various aspects of this disclosure, the UE can be configured to transform the bundled HARQ-ACK bit sequence into a two-part HARQ-ACK payload. In some aspects, for bundling: each of the original HARQ-ACK codebooks The units digit is bound into a corresponding... One bit of the logical AND operation. This bundling reduces the payload but introduces distortion. To generate a two-part HARQ-ACK payload, the length is... The bundled HARQ-ACK bit sequence is transformed into a first part (e.g., part 1) and a second part (e.g., part 2) of the HARQ-ACK payload. The transformation further reduces the payload or averages the payload without introducing any additional distortion.

[0223] In some respects, the length of the first part It is fixed. That is, the length of the first part is fixed. no The function, which means that part 1 for a given It has a fixed size. The length of the second part... It is variable and is The function of . That is, part 2 has a variable length that depends on the payload of part 1.

[0224] In its simplest form, part 1 has one bit. .if If all bits are 1, then the UE will set a single bit to "1" (for example, The logical AND of the units digit is equivalent to... (Logical AND of individual bits). In this case, the transmitter does not transmit bits in section 2. Otherwise, the transmitter sets a single bit to "0" and transmits the complete sequence of bundled HARQ-ACK bits in section 2. .

[0225] The base station first decodes part 1 of the payload, then determines the length of part 2. The base station then decodes part 2 and determines the bundled HARQ-ACK sequence. The bits. This compression technique is lossless. For bundled HARQ-ACK sequences. For each bit, if the bit is 1, the base station assumes that for the original HARQ-ACK codebook, there are... One 1; if the bit is 0, the base station assumes that for the original HARQ-ACK codebook, there are A series of zeros. Therefore, the base station obtains the original HARQ-ACK codebook with some distortion. .

[0226] Figure 15This is a block diagram illustrating the cascading of bundling and two-part HARQ-ACK compression according to various aspects of this disclosure. Cascading means initially bundling (or transforming) the HARQ-ACK codebook into component regions, and then transforming the bundled / transformed HARQ-ACK partitions into two-part HARQ payloads. As... Figure 15 As seen, the original HARQ-ACK codebook (CB) Received at binding module 1502. Original HARQ-ACK codebook. Including multiple bits Bundled module 1502 is bundled for... Units digit original HARQ-ACK codebook HARQ-ACK feedback to generate bundled HARQ-ACK bit sequences The two-part HARQ-ACK compression module 1504 will bind the HARQ-ACK bit sequence. Transformed into a two-part HARQ-ACK payload, including the first part Part Two The first channel encoder 1506 is for the first part. Encoding is performed, and the second channel encoder 1508 encodes the second part. They are encoded separately for use in network devices (such as base stations).

[0227] According to another aspect of this disclosure, UE capability signaling is introduced for cascading. In these aspects, the UE uses UE capability signaling to indicate whether it supports cascading with bundling and transition to two-part HARQ-ACK.

[0228] In other aspects, the network can utilize Radio Resource Control (RRC) signaling to configure bundling and transition to concatenation of two-part HARQ-ACK. In other aspects, Downlink Control Information (DCI) can dynamically enable or disable concatenation. In these aspects, the downlink DCI scheduled for HARQ-ACK transmission can indicate enable / disable. In the case of multiple downlink DCI messages pointing to the same HARQ-ACK codebook, the indication can be based on the most recent DCI.

[0229] DCI can enable or disable concatenation. Disabling concatenation can include performing only bundling, performing only the two-part HARQ-ACK transition, or disabling both bundling and the two-part HARQ-ACK transition. A field in the DCI with one or two bits provides such indication. The presence of this field can be configured via RRC signaling according to the downlink DCI format. Therefore, if not needed, the network can disable dynamic indication of concatenation itself according to the DCI format. That is, based on configuration, one DCI format (e.g., DCI format 1_1) may include this field and thus dynamically provide such indication, while another DCI format (e.g., DCI format 1_2) may not include this field and thus cannot dynamically provide such indication.

[0230] According to various aspects of this disclosure, the length of the original HARQ-ACK codebook can be used as a basis ( ) and / or bundle size ( Cascading can be enabled or disabled based on the length of the original HARQ-ACK CB. To enable or disable cascading, for example because of the small value of the original HARQ-ACK codebook. It may not be necessary to reduce the HARQ-ACK payload by bundling and compressing both parts of the HARQ-ACK. Therefore, bundling or compressing both parts of the HARQ-ACK may be sufficient. In some cases, for example, for It may not require any technology.

[0231] According to the size of the bundle ( To enable or disable cascading, because The value of affects the compressibility of bundled HARQ-ACKs. In other words, the entropy of bundled HARQ-ACKs depends on . The value. For example, if Make the probability Therefore, the bundled HARQ-ACK is not lossless compressible.

[0232] It can be based on the length of the original HARQ-ACK CB ( ) and bundle size ( Both can be used to enable or disable cascading. For example, if the number of bits after bundling ( It becomes too small, for example, if big enough and If small enough, it may not be necessary to transform the bundled HARQ-ACK into two HARQ-ACK payloads.

[0233] Cascades can provide iid Bernoulli sequences (probability of 0) The optimal rate distortion pair achieved is the rate (combined lossy and lossless): ,in And H(.) is the entropy of the bundled sequence. Without two-part HARQ-ACK compression (e.g., just bundling), the rate becomes... Entropy decoding can achieve this rate. Two-part HARQ-ACK compression can approach this rate very closely. How closely depends on the complexity of processing the two-part HARQ-ACK and the size of the bundled HARQ-ACK. Distortion can be calculated as... To achieve or approach the above rates, the design of two-part HARQ-ACK compression can be complex, requiring exhaustive search. Alternatively, the simplest form of two-part HARQ-ACK compression (with one bit used for part one) can be used for lossless compression after bundling.

[0234] As described above, segmenting into multiple blocks can improve the performance of simple two-part HARQ-ACK compression. That is, for each segment, if all bits are 1, the UE transmits "1" in the first part and nothing in the second part. Otherwise, the UE transmits "0" in the first part and transmits the entire segment in the second part.

[0235] According to various aspects of this disclosure, the bundled HARQ-ACK bit ( The data is divided into multiple segments / blocks. In these respects, the simplest two-part HARQ-ACK transform is applied individually to each segment / block.

[0236] Figure 16 This is a block diagram illustrating the segmentation of HARQ-ACK bits bundled according to various aspects of this disclosure. For example... Figure 16 As seen, the original HARQ-ACK codebook Received at binding module 1602. Original HARQ-ACK codebook. Including multiple bits Bundling module 1602 is bundled for... Units digit original HARQ-ACK codebook HARQ-ACK feedback to generate bundled HARQ-ACK bit sequences .

[0237] Segmentation module 1604 will bind the HARQ-ACK bit sequence Divide into M blocks, such that and M blocks Each block in the process is then transformed into two HARQ-ACK payloads by two HARQ-ACK compression modules 1606 (only one module is labeled for illustration purposes), comprising a first part and a second part. Figure 16 In the example, the first part of the HARQ-ACK payload of each segment / block has one bit. If all bits of the bundled HARQ-ACK sequence of a segment / block are one, the UE sets that bit to "1". Otherwise, the UE sets the single bit to "0". The first channel encoder 1608 encodes the first part of each segment / block from the M segments / blocks together for transmission to a network device, such as a base station.

[0238] The second part of the HARQ-ACK payload of each segment / block has a size of 0 (if the first part is set to "1") or a size equal to the length of the segment / block (if the first part is set to "0"), in which case the second part becomes the entire segment / block of the bundled HARQ-ACK sequence, as shown below. Figure 16 As shown in the example, the second channel encoder 1610 encodes the second portion of each of the M segments / blocks together for transmission to the network device.

[0239] As discussed previously, a simple binding assumption has been made for lossy compression. Binding will... Unit-order quantization to 1 bit is very efficient, especially when concatenated with lossless compression. However, a more general form of quantization, partitioning, can also be considered. However, it should be noted that small values... Partitioning may not be as meaningful as bundling.

[0240] According to various aspects of this disclosure, the UE can be configured to transform the group index sequence into two parts, wherein each group index corresponds to a portion of the original HARQ-ACK codebook. Units digit. As discussed in more detail above, group indexes are the result of partitioning. Each of the original HARQ-ACK codebooks According to The bit value is mapped to the group index: ,in This partitioning will be achieved by... Quantifying the possibilities There are several possibilities to reduce payload. However, partitioning introduces distortion. It should be noted that bundling is a special case of partitioning, in which… And is The binary AND operation on the units digit. Grouped index sequence. (where the length is) The payload is then transformed into a partial HARQ-ACK payload and a partial HARQ-ACK payload. The transformation further reduces the payload or average payload without introducing additional distortion.

[0241] Figure 17 This is a block diagram illustrating the cascading of partitions and two-part HARQ-ACK compression according to various aspects of this disclosure. For example... Figure 17 As seen, the original HARQ-ACK codebook Received at partition module 1702. Original HARQ-ACK codebook. Including multiple bits The partition module 1702 will... Units digit original HARQ-ACK codebook Each block is encoded as a component region (or group index). To generate HARQ-ACK bits for multiple partitions The two-part HARQ-ACK compression module 1704 divides the HARQ-ACK bits of multiple partitions. Transformed into a two-part HARQ-ACK payload, including the first part Part Two The first channel encoder 1706 is for the first part. Encoding is performed and the second channel encoder 1708 encodes the second part. It is encoded separately for transmission to network devices. Although in Figure 17 Not shown in the diagram, but block-by-block two-part HARQ-ACK compression can also be applied (see [link]). Figure 16 ).

[0242] The Type 1 HARQ-ACK codebook is determined via semi-static information based on candidate Physical Downlink Shared Channel (PDSCH) timings. The User Equipment (UE) does not consider the Physical Downlink Control Channel (PDCCH) monitoring timings used for the Type 1 HARQ-ACK codebook. The UE determines a set of PDSCH timings on a per-downlink (DL) serving cell basis. The set of configured K1 values ​​is a set of possible slot timing offset values ​​that can be indicated by Downlink Control Information (DCI). The K1 offset is the time delay between the PDSCH slot and the HARQ-ACK slot. If only DCI format 1_0 is configured in the serving cell and DCI format 1_1 is not configured, the set of configured K1 values ​​includes {1, 2, 3, 4, 5, 6, 7, 8}. On the other hand, if DCI format 1_1 / 1_2 is configured for the serving cell, the K1 offset is determined by parameters... dl-DataToUL-ACKProvides a set of configured K1 values ​​to indicate a set of possible values ​​for HARQ feedback timing, where DCI indicates one of the possible values ​​in the set for HARQ feedback timing.

[0243] For each K1 value, the set of PDSCH Time Domain Resource Allocation (TDRA) candidates corresponds to the start and length indicator values ​​(SLIVs) within the time slot. For Time Division Duplex (TDD) configurations, TDRA candidates that overlap with semi-static uplink symbols are removed. The remaining TDRA candidates are grouped such that the number of groups is the maximum number of non-overlapping SLIVs in the time slot. Based on UE Capability Report or Radio Resource Control (RRC) configurations, if the maximum number of PDSCHs per time slot is one, no grouping is required.

[0244] Type 1 HARQ-ACK codebooks hold as many bits as the potential PDSCH receiver, even if only a subset of the PDSCH can actually be scheduled. For example, if the TDRA includes SLIVs for symbols {0-6} and {7-13}, then there are two bits for each K1 value per component carrier. Therefore, if K1={1,2,3}, then for a frequency division duplex (FDD) configuration, there are 2 bits per component carrier. Three bits. For TDD configurations, there are slightly fewer bits depending on how many SLIVs overlap with uplink symbols. The specification in Section 9.1.2 of 3GPP 38.213 describes two steps for HARQ-ACK codebook determination: Step 1: PDSCH timing determination based on the K1 set and SLIVs; and Step 2: HARQ-ACK codebook determination based on PDSCH timing.

[0245] For a Type 1 HARQ-ACK codebook, a NACK (e.g., 0) placed in the codebook associated with a given candidate PDSCH timing may be due to three types of events. Event 1: A DCI for scheduling a PDSCH in the candidate PDSCH timing is detected, but the PDSCH or transport block (TB) is not successfully decoded. This type of event is a true NACK, which should occur with a low probability, e.g., 10% if the PDSCH block error rate (BLER) is 10%. Event 2: The DCI for scheduling a PDSCH in the candidate PDSCH timing is lost. The base station transmits the DCI (and the scheduled PDSCH), but the UE does not detect the DCI (and therefore does not attempt to receive the scheduled PDSCH). This event is also a true NACK for the DCI, which should occur with a low probability (e.g., 1%). Event 3: A PDSCH is not scheduled in the corresponding candidate PDSCH timing. This type of event is not a true NACK, but codebook size mismatch needs to be avoided. The third type of event may occur frequently, depending on the service pattern and / or scheduling decisions at the base station.

[0246] Figure 18 These are diagrams illustrating different types of negative confirmation (NACK) events according to various aspects of this disclosure. Figure 18 In the example, a single candidate PDSCH timing occurs in each slot, and the set of K1 values ​​is {1, 2, 3, 4, 5, 6}. Figure 18In the example, the first DCI message 1802 indicates that the first PDSCH 1804 is scheduled at time slot n-6. Because the UE detects the first DCI message 1802 but cannot decode the first PDSCH 1804 scheduled by the first DCI message 1802, the UE generates a first NACK for time slot n-6, which is event 1 NACK. At time slot n-5, no PDSCH is scheduled. Therefore, the NACK for time slot n-5 is event 3 NACK. The second DCI message 1806 schedules the second PDSCH 1808 for time slot n-4. Because the UE successfully decodes the second PDSCH 1808, the UE generates an ACK for time slot n-4. At time slot n-3, the UE misses the third DCI message 1810 for the third PDSCH 1812. Therefore, the UE generates event 2 NACK for time slot n-3. For time slot n-2, the UE receives the fourth DCI message 1814, which schedules the fourth PDSCH 1816. After successfully decoding the fourth PDSCH 1816, the UE generates an ACK for slot n-2. No PDSCH is scheduled for slot n-1. Therefore, the NACK for slot n-1 is an event 3 NACK. At slot n, the UE sends Physical Uplink Control Channel (PUCCH) 1818, which includes four NACKs and two ACKs corresponding to the previous six slots.

[0247] The problem with Type 1 HARQ-ACK codebooks is that the UE cannot distinguish between Event 2, DCI false detection, and Event 3, which does not schedule any content. HARQ-ACK compression techniques are affected by the UE's inability to distinguish event types. Various aspects of this disclosure address this problem with compression schemes, including: lossless compression with two-part HARQ-ACK; and lossy compression utilizing bundling, both of which have been previously described in detail. A brief overview of these two types of compression is now provided.

[0248] Scheme 1 involves lossless compression with a simple two-part HARQ-ACK, one of which is a bit-bundled part one. For a Type 1 HARQ-ACK codebook, if at least one candidate PDSCH opportunity is not scheduled, a single bit part one (e.g., the first HARQ-ACK part) is set to NACK (e.g., 0), and the UE transmits the entire codebook in the second HARQ-ACK part. If the UE transmits the entire codebook frequently, the HARQ-ACK overhead may increase. That is, the UE will frequently transmit 1+N bits instead of N bits.

[0249] Scheme 2 involves using bundled lossy compression. In this scheme, the UE transmits a logical AND of all ACK / NACK bits. If all bits are ACK, the UE transmits ACK. Otherwise, the UE transmits NACK. For a Type 1 HARQ-ACK codebook, if at least one candidate PDSCH timing is not scheduled, the UE transmits NACK even if all DCI messages have been detected and all PDSCHs have been decoded.

[0250] To address the indistinguishability between NACK event types, the UE only considers the scheduled PDSCH when performing logic and bundling, whether in Part 1 of Scheme 1 or Scheme 2. However, because the UE cannot distinguish between event 2 and event 3, various aspects of this disclosure introduce additional mechanisms.

[0251] In the first approach, signaling is added to the DCI, the counter downlink assignment index (DAI), or the total DAI to enable the UE to determine if a DCI has been lost. If at least one PDSCH is not decoded or at least one DCI is lost, the bundled bit is set to "0". The first approach adds constant DCI overhead and may be inconsistent with the Type 1 HARQ-ACK codebook structure.

[0252] In the second method, the UE indicates how many ACKs are bundled. Then, even if the bundled ACK is "1", the network can determine whether the DCI has been lost. That is, the network effectively interprets the bundled ACK as "0" and can reschedule the PDSCH or request the full HARQ-ACK codebook. More details about the second method will now be discussed.

[0253] According to various aspects of this disclosure, when a UE binds HARQ-ACK bits (e.g., performs a logical AND operation on multiple bits of the HARQ-ACK codebook), in addition to the bound bits, the UE also indicates information related to the number of ACKs (e.g., 1s) as part of the HARQ-ACK payload. These aspects are particularly applicable to Type 1 HARQ-ACK codebooks. For Type 1 HARQ-ACK codebooks, the HARQ-ACK bits to be bound are based solely on the received PDSCH, not all candidate PDSCH reception times. These aspects exclude HARQ-ACK bits associated with candidate PDSCH receptions that were not received by the UE due to the UE not detecting the corresponding DCI format (due to DCI false detection or due to base station non-scheduling), as the UE cannot distinguish between these cases. If semi-persistent scheduling (SPS) is also configured, SPS PDSCHs can be considered even if they are not scheduled by DCI.

[0254] Figure 19This is a diagram illustrating examples of bundled ACK / NACK bits according to various aspects of this disclosure. Figure 19 In the first example 1900, the original Type 1 HARQ-ACK codebook includes six ACK / NACK bits. The first bit 1902 is a NACK for Type 1 events. The second bit 1904 is a NACK for Type 3 events. The third bit 1906 is an ACK. The fourth bit 1908 is a NACK for Type 2 events. The fifth bit 1910 is an ACK. The sixth bit 1912 is a NACK for Type 3 events. According to various aspects of this disclosure, only Type 1 events are considered for bundling. Therefore, the UE bundles the first bit 1902, the third bit 1906, and the fifth bit 1910. The resulting bundled bit 1914 is a NACK.

[0255] exist Figure 19 In the second example 1920, the original Type 1 HARQ-ACK codebook also includes six ACK / NACK bits. The first bit 1922 is ACK. The second bit 1924 is NACK for Type 3 events. The third bit 1926 is ACK. The fourth bit 1928 is NACK for Type 2 events. The fifth bit 1930 is ACK, and the sixth bit 1932 is NACK for Type 3 events. According to various aspects of this disclosure, only Type 1 events are considered for bundling. Therefore, the UE bundles the first bit 1922, the third bit 1926, and the fifth bit 1930. The resulting bundled bit 1934 is ACK.

[0256] On the network side, if the bound bits are ACKs and the number of ACKs does not match the network's expected number, the network knows that one or more DCIs have been lost. However, network nodes may not be aware of the specific DCI message that was lost. Therefore, the network treats the bound bits as NACKs. Consequently, the network reschedules the PDSCH or requests a retransmission of the unbound HARQ-ACK.

[0257] We will now discuss the details of the information related to the number of ACKs signaled. In some aspects, the information related to the number of ACKs is the magnitude M of the number of ACKs, where M is a fixed value or a value signaled by the RRC. Defining the information related to the number of ACKs as the magnitude M of the number of ACKs reduces signaling overhead, and the size of the information related to the number of ACKs remains fixed. This technique works well as long as the number of lost DCIs is less than the value M. In some specific implementations, the value M = 4.

[0258] The following describes two options for indicating information related to the number of ACKs. In the first option (Option 1), the UE sends information related to the number of ACKs separately from the bundling result. For the first option, it is necessary to... The unit digit is added along with a bit related to the bundling result. In this case, the value of M can be a power of 2, such as 2, 4, 8, etc. In the first alternative, information related to the number of ACKs is indicated only if the bundling bit indicates all ACKs (e.g., the bundling bit is "1"). In the second alternative, the UE indicates information related to the number of ACKs, regardless of whether the bundling bit is ACK or NACK.

[0259] In the second option (Option 2), the UE jointly encodes information related to the number of ACKs with the binding bits. That is, a given code point jointly indicates information related to the number of ACKs and the binding result. In the second option, it is necessary to... The unit digit, one of the code points indicates the result of the binding is NACK, and if the result of the binding is ACK, the remaining code points indicate the number of ACKs. Therefore, the binding result is effectively indicated based on whether the first code point or one of the remaining code points is indicated, and the indication of the number of ACKs is conditional on the binding result being ACK. This second option is prompted by the fact that if the result of the binding is NACK, the number of ACKs is not critical. A lost DCI does not change the result of the binding. In this second option, the value of M can be a power of 2 minus 1, such as 3, 7, ...

[0260] Figure 20 This is a table illustrating example code points used to jointly encode the binding result and information related to the number of ACKs according to various aspects of this disclosure. Figure 20 In the example, assume the value M=3, and therefore four code points require two bits. The first code point 00 indicates that the result of the bundle is NACK, and does not indicate the number of ACKs. The second code point 01 indicates that the result of the bundle is ACK, and the number of ACKs modulo 3 is 0. The third code point 10 indicates that the result of the bundle is ACK, and the number of ACKs modulo 3 is 1. The fourth code point 11 indicates that the result of the bundle is ACK, and the number of ACKs modulo 3 is 2.

[0261] The technique for configuring a two-part HARQ-ACK (Scheme 1) will now be described. If part one of the two HARQ-ACK codebooks indicates that the result of the binding is NACK, then the UE transmits the entire original Type 1 HARQ-ACK codebook in part two, even if only a subset of bits is considered for the binding in part one, as referenced. Figure 19 As discussed above. Therefore, if the result of the binding is NACK, then the indication of the number of ACKs is of little value.

[0262] The first solution to the first scheme (Solution 1) is based on Option 1, with an alternative solution. That is, the UE transmits information related to the number of ACKs separately from the bundling result. The information related to the number of ACKs is only indicated if the bits of the bundling indicate all ACKs. More specifically, if Part 1 indicates that the result of the bundling is ACKs, then the indication of the number of ACKs is transmitted in Part 2. As discussed previously, for the two-part HARQ-ACK codebook, Part 1 and Part 2 are encoded separately (e.g., channel coding). Therefore, in this solution, the encoding of the bundling result and the encoding of the indication of the number of ACKs are also separate.

[0263] The second solution (Solution 2) is based on Option 2, namely, the UE jointly instructs (through joint code points as discussed in Option 2) on information and binding bits related to the number of ACKs. In this second solution, if the result of binding is an ACK, an indication of the number of ACKs is transmitted in Part 1.

[0264] Figure 21 Examples are illustrated below of reporting the number of ACKs using two-part HARQ-ACK compression, according to various aspects of this disclosure. Figure 21 In the first example 1900, it is similar to Figure 19 The first example 1900 is identical; the original Type 1 HARQ-ACK codebook includes six ACK / NACK bits. The first bit 1902 is a NACK for a Type 1 event. The second bit 1904 is a NACK for a Type 3 event. The third bit 1906 is an ACK. The fourth bit 1908 is a NACK for a Type 2 event. The fifth bit 1910 is an ACK. The sixth bit 1912 is a NACK for a Type 3 event. According to various aspects of this disclosure, only Type 1 NACK events are considered for bundling. Therefore, the first bit 1902, the third bit 1906, and the fifth bit 1910 are considered. The resulting bundling bit 1914 is a NACK.

[0265] According to various aspects of this disclosure, the UE does not indicate the number of ACKs in the first example 1900 because the resulting bundled bit 1914 is NACK. As seen in Table 2116, for Solution 1, the bits in Part 1 are 0. The bits in Part 2 correspond to the original HARQ-ACK codebook, i.e., 001010. The value of M affects the size of Part 1 in Solution 2. Therefore, as seen in Table 2116 for Solution 2, two bits in Part 1 are 00, indicating that the bundled result is NACK. The bits in Part 2 are the same as those in Solution 1, i.e., 001010.

[0266] exist Figure 22 In the second example 1920, it is similar to Figure 19The second example 1920 is identical; the original Type 1 HARQ-ACK codebook includes six ACK / NACK bits. The first bit 1922 is ACK. The second bit 1924 is NACK for Type 3 events. The third bit 1926 is ACK. The fourth bit 1928 is NACK for Type 2 events. The fifth bit 1930 is ACK. The sixth bit 1932 is NACK for Type 3 events. According to various aspects of this disclosure, only Type 1 NACK events are considered for bundling. Therefore, the first bit 1922, the third bit 1926, and the fifth bit 1930 are considered. The resulting bundling bit 1934 is ACK.

[0267] As shown in Table 2126, the UE indicates the number of ACKs in Part Two (for Solution 1) or Part One (for Solution 2). More specifically, for Solution 1, a bit in Part One is 1, indicating ACK. When the value M=4, the bit in Part Two is 11 (from...). Figure 20 (derived from the table in), which corresponds to 3 MOD 4=3. For solution 2, where the value M=3, part of it is 01 (from...). Figure 20 (From the table in the table), because 3 MOD 3=0. For solution 2, no bits are carried in part two because the binding result is ACK.

[0268] The following aspects will now be described for the case where lossy compression using bundling is configured (Scheme 2). In the case of lossy compression using bundling, even if the bundling result is NACK, the indication of the number of ACKs still has a value, even if the number of ACKs may not be critical.

[0269] The first solution (Solution 1) of the second scheme is based on Option 2, where the UE jointly indicates information related to the number of ACKs and the binding bits. The second solution (Solution 2) of the second scheme is based on Option 1, Alternative Solution 2, where the UE sends information related to the number of ACKs separately from the binding result. The information related to the number of ACKs is indicated independently of the value of the binding bits.

[0270] The third solution (Solution 3) is based on Option 1, alternative to Solution 1. That is, the UE sends information related to the number of ACKs separately from the bundling result. Information related to the number of ACKs is only indicated if the bundling bits indicate all ACKs. In the third solution, the UE sends HARQ-ACK feedback in two parts, similar to Solution 1 (two-part HARQ-ACK). However, unlike Solution 1, the compression in the third solution is lossy. The purpose of Part 2 is to transmit an indication of the number of ACKs only when needed. Compared to Solution 1 (two-part HARQ-ACK), the purpose of Part 2 here (in Solution 3 of Solution 2) is not to indicate the complete HARQ-ACK information when the bundling result is NACK. An indication of the number of ACKs is transmitted in Part 2 only if Part 1 indicates that the bundling result is ACK. In the third solution, if the bundling result is NACK, Part 2 does not exist (unlike Solution 1). The encoding used for Part 1 and Part 2 (e.g., channel coding) is separate (similar to Solution 1). Therefore, in this solution, the encoding of the bundling result and the encoding of the indication of the number of ACKs are separate.

[0271] Figure 22 Examples of the number of ACKs used to utilize bundled lossy compression, as reported according to various aspects of this disclosure, are illustrated. Figure 22 In the first example 1900, it is similar to Figure 19 The first example 1900 is identical; the original Type 1 HARQ-ACK codebook includes six ACK / NACK bits. The first bit 1902 is a NACK for a Type 1 event. The second bit 1904 is a NACK for a Type 3 event. The third bit 1906 is an ACK. The fourth bit 1908 is a NACK for a Type 2 event. The fifth bit 1910 is an ACK. The sixth bit 1912 is a NACK for a Type 3 event. According to various aspects of this disclosure, only Type 1 NACK events are considered for bundling. Therefore, the first bit 1902, the third bit 1906, and the fifth bit 1910 are considered. The resulting bundling bit 1914 is a NACK.

[0272] According to various aspects of this disclosure, the number of ACKs is indicated only in Solution 2 of the first example 1900. That is, the UE sends information related to the number of ACKs separately from the bundling result. The information related to the number of ACKs is indicated independently of the values ​​of the bundled bits. As seen in Table 2216, for the first solution, the payload is 00, which indicates that the bundling result is NACK based on the joint code point, where the value M=3. For Solution 2, the payload is 0 and 10 because 2 MOD 4=2, where the value M=4. The UE sends the values ​​in one part; in other words, these values ​​are encoded together (e.g., channel coding). For Solution 3, given that the bundling result is NACK, the UE sends 0 in Part 1 and does not send any bits in Part 2.

[0273] exist Figure 22 In the second example 1920, it is similar to Figure 19 The second example 1920 is identical; the original Type 1 HARQ-ACK codebook includes six ACK / NACK bits. The first bit 1922 is ACK. The second bit 1924 is NACK for Type 3 events. The third bit 1926 is ACK. The fourth bit 1928 is NACK for Type 2 events. The fifth bit 1930 is ACK. The sixth bit 1932 is NACK for Type 3 events. According to various aspects of this disclosure, only Type 1 NACK events are considered for bundling. Therefore, the first bit 1922, the third bit 1926, and the fifth bit 1930 are considered. The resulting bundling bit 1934 is ACK.

[0274] In this second example 1920, the number of ACKs is indicated in all solutions because bit 1934 of the resulting bundle is an ACK. (See reference) Figure 22 In Table 2226, the UE sends 01 for the first solution, where the value M=3 because 3 MOD 3=0. For the second solution, the UE performs joint encoding (e.g., channel coding) on ​​the value 1 (e.g., the binding result) and 11 (e.g., the number of ACKs), because 3 MOD 4=3, where the value M=4. For solution 3, the UE sends 1 in part one and sends 11 separately in part two, because 3 MOD 4=3, where the value M=4. The channel coding for part one and part two is also separate.

[0275] According to another aspect of this disclosure, the UE reports the number of bits that are bundled together (ACK or NACK), rather than the number of ACKs resulting from the bundling. It should be noted that if the result of the bundling is ACK (e.g., 1), there is no difference between the number of ACKs and the number of bundled bits. However, if the result of the bundling is NACK (e.g., 0), these two values ​​can differ. Figure 19 The first example is shown in 1900.

[0276] In the second option, if the UE jointly indicates information related to the number of ACKs and the binding bits, and the result of the binding is NACK, the UE does not report the number. Therefore, this proposal is not applicable.

[0277] Similarly, in Option 1, the first alternative scheme, the UE only sends information related to the number of ACKs, separate from the binding result, if the binding result is ACK; if the binding result is NACK, the UE does not report information related to the number of ACKs. Therefore, this proposal is not applicable.

[0278] In Option 1 and the second alternative scheme, regardless of whether the bound bit is ACK or NACK, the UE sends information related to the number of ACKs, separate from the binding result; these two values ​​can be different. Figure 19 In the first example 1900, the UE reports three as the number of bits in the bundle, instead of the number of ACKs (which is two).

[0279] Although the preceding description pertains to HARQ-ACK, other types of ACK are also envisioned.

[0280] Figure 23 This is a flowchart illustrating, for example, an example procedure 2300 performed by a user equipment (UE) according to various aspects of this disclosure. Example procedure 2300 is an example of cascaded hybrid automatic repeat request acknowledgment (HARQ-ACK) feedback. Operation of procedure 2300 can be implemented by UE 120.

[0281] At box 2302, the UE converts blocks of mixed Automatic Repeat Request Acknowledgment (HARQ-ACK) bits from the original HARQ-ACK codebook into partitions, where multiple partitions for multiple blocks correspond to quantized HARQ-ACK bits. For example, the UE (e.g., using controller / processor 280, memory 282, etc.) can convert blocks of HARQ-ACK bits. In some aspects, the conversion includes generating bundled sequences of HARQ-ACK bits, each bundled HARQ-ACK bit in which a logical AND operation of bits from different blocks of the HARQ-ACK codebook is performed.

[0282] At block 2304, the UE transforms the quantized HARQ-ACK bits into a two-part HARQ-ACK payload. For example, the UE (e.g., using controller / processor 280, memory 282, etc.) can transform the quantized HARQ-ACK bits. This transformation may include transforming a bundled HARQ-ACK bit sequence into a two-part HARQ-ACK payload. The UE may transmit a UE capability signal indicating that the UE supports generating a bundled HARQ-ACK bit sequence and cascading the transformation of the bundled HARQ-ACK bit sequence into a two-part HARQ-ACK payload.

[0283] At block 2306, the UE encodes the first and second portions of the two-part HARQ-ACK payload separately. For example, the UE (e.g., using controller / processor 280, memory 282, etc.) may encode the first and second portions of the two-part HARQ-ACK payload separately. In some aspects, the UE segments the bundled HARQ-ACK bit sequence into multiple segments, and transforming the quantized HARQ-ACK bits includes transforming each segment of the bundled HARQ-ACK bits into a separate two-part HARQ-ACK payload. In these aspects, separate encoding includes encoding the first portion of all segments together, and encoding the second portion of all segments together separately. In other aspects, the UE segments the quantized HARQ-ACK bits into multiple segments, and this transformation includes transforming each segment of the quantized HARQ-ACK bits into a separate two-part HARQ-ACK payload. In these aspects, separate encoding includes encoding the first portion of all segments together, and encoding the second portion of all segments together separately.

[0284] At block 2308, the UE transmits the encoded first portion and the encoded second portion to the network node. For example, the UE (e.g., using antenna 252, DEMOD / MOD 254, TX MIMO processor 266, transmit processor 264, controller / processor 280, memory 282, etc.) may transmit the first and second portions of the two-part HARQ-ACK payload. In some aspects, the first portion of the two-part HARQ-ACK payload indicates whether the quantized HARQ-ACK bits indicate all positive acknowledgments, and the size of the second portion of the two-part HARQ-ACK payload is a function of the first portion.

[0285] Figure 24 This is a flowchart illustrating, for example, an example process 2400 performed by a network device according to various aspects of this disclosure. Example process 2400 is an example of cascaded Hybrid Automatic Repeat Request Acknowledgment (HARQ-ACK) feedback. Operation of process 2400 can be implemented by base station 110.

[0286] At block 2402, the base station decodes a first portion of a two-part Hybrid Automatic Repeat Request Acknowledgment (HARQ-ACK) payload received from the User Equipment (UE), the first portion indicating whether quantized HARQ-ACK bits indicate all positive acknowledgments. For example, the base station (e.g., using controller / processor 240, memory 242, etc.) can decode the first portion of the two-part HARQ-ACK. At block 2404, the base station determines the length of a second portion of the two-part HARQ-ACK payload based on the decoding of the first portion. For example, the base station (e.g., using controller / processor 240, memory 242, etc.) can determine the length of the second portion of the two-part HARQ-ACK payload.

[0287] At box 2406, the base station decodes the second part of the two-part HARQ-ACK payload according to the determined length. For example, the base station (e.g., using controller / processor 240, memory 242, etc.) can decode the second part of the two-part HARQ-ACK payload. In some aspects, the network device sends a configuration for concatenating the generation of the bundled HARQ-ACK bit sequence with the transformation of the bundled HARQ-ACK bit sequence into the two-part HARQ-ACK payload, which includes downlink control information (DCI) or radio resource control (RRC) signaling.

[0288] At block 2408, the base station reconstructs the first value in response to detecting a first value of all bits of the original HARQ-ACK codebook in the bits corresponding to the second part of the original HARQ-ACK codebook. For example, the base station (e.g., using controller / processor 240, memory 242, etc.) can reconstruct the first value of all bits of the original HARQ-ACK codebook. At block 2410, the base station reconstructs the second value in response to detecting a second value of each bit of the original HARQ-ACK codebook in the bits corresponding to the second part of the original HARQ-ACK codebook. For example, the base station (e.g., using controller / processor 240, memory 242, etc.) can reconstruct the second value of each bit of the original HARQ-ACK codebook. In some aspects, the network device receives a UE capability signal indicating that the UE supports generating a bundled HARQ-ACK bit sequence and converting the bundled HARQ-ACK bit sequence into a two-part HARQ-ACK payload concatenated.

[0289] Example Aspects

[0290] Aspect 1: A method for wireless communication by a user equipment (UE), the method comprising: converting a block of hybrid automatic repeat request acknowledgment (HARQ-ACK) bits from an original HARQ-ACK codebook into partitions, wherein multiple partitions for multiple blocks correspond to quantized HARQ-ACK bits; transforming the quantized HARQ-ACK bits into a two-part HARQ-ACK payload; separately encoding a first part and a second part of the two-part HARQ-ACK payload; and transmitting the encoded first part and the encoded second part to a network node.

[0291] Aspect 2: According to the method of aspect 1, the transformation includes generating a bundled HARQ-ACK bit sequence, each bundled HARQ-ACK bit in the bundled HARQ-ACK bit sequence including a logical AND operation of bits of different blocks of the HARQ-ACK codebook; and transforming the quantized HARQ-ACK bits includes transforming the bundled HARQ-ACK bit sequence into the two-part HARQ-ACK payload.

[0292] Aspect 3: According to the method of aspect 1 or 2, the method further includes sending a UE capability signal, the UE capability signal indicating that the UE supports generating the bundled HARQ-ACK bit sequence and converting the bundled HARQ-ACK bit sequence into the concatenation of the two HARQ-ACK payloads.

[0293] Aspect 4: The method according to any one of the preceding aspects, the method further includes receiving a configuration for concatenating the generation of the bundled HARQ-ACK bit sequence with the transformation of the bundled HARQ-ACK bit sequence to the two-part HARQ-ACK payload, the configuration including downlink control information (DCI) or radio resource control (RRC) signaling.

[0294] Aspect 5: The method according to any one of the preceding aspects, wherein the DCI dynamically enables or disables the concatenation by at least one of the following: enabling the concatenation, disabling the concatenation and performing the transformation, disabling the concatenation and performing a transformation of the quantized HARQ-ACK bit, or disabling both the bundling and the transformation.

[0295] Aspect 6: The method according to any one of the preceding aspects further includes enabling the concatenation of the transformation of the bundled HARQ-ACK bit sequence to the two portions of the HARQ-ACK payload, the enabling being based on at least one or more of the length of the original HARQ-ACK codebook, the length of the block of HARQ-ACK bits, or the length of the bundled HARQ-ACK bit sequence.

[0296] Aspect 7: The method according to any one of the preceding aspects further includes segmenting the bundled HARQ-ACK bit sequence into multiple segments, wherein: transforming the quantized HARQ-ACK bits includes transforming each segment of the bundled HARQ-ACK bits into two separate HARQ-ACK payloads, and the separate encoding includes: encoding the first portion of all segments together, and encoding the second portion of all segments together separately.

[0297] Aspect 8: The method according to any one of the preceding aspects, wherein each block of the original HARQ-ACK codebook is mapped to a group index corresponding to a partition in the partition.

[0298] Aspect 9: The method according to any one of the preceding aspects further includes segmenting the quantized HARQ-ACK bits into multiple segments, wherein: the transformation includes transforming each segment of the quantized HARQ-ACK bits into two separate HARQ-ACK payloads, and the separate encoding includes: encoding the first portion of all segments together, and encoding the second portion of all segments together separately.

[0299] Aspect 10: The method according to any one of the preceding aspects, wherein: the first part of the two-part HARQ-ACK payload indicates whether the quantized HARQ-ACK bit indicates all positive acknowledgments, and the size of the second part of the two-part HARQ-ACK payload is a function of the first part.

[0300] Aspect 11: A method for wireless communication by a network device, the method comprising: decoding a first portion of a two-part hybrid automatic repeat request acknowledgment (HARQ-ACK) payload received from a user equipment (UE), the first portion indicating whether quantized HARQ-ACK bits indicate all positive acknowledgments; determining a length of a second portion of the two-part HARQ-ACK payload based on the decoding of the first portion; decoding the second portion of the two-part HARQ-ACK payload according to the determined length; reconstructing a first value in response to detecting a first value of all bits of the original HARQ-ACK codebook in bits corresponding to the second portion of the original HARQ-ACK codebook; and reconstructing a second value in response to detecting a second value of each bit of the original HARQ-ACK codebook in bits corresponding to the second portion of the original HARQ-ACK codebook.

[0301] Aspect 12: According to the method of aspect 11, the method further includes receiving a UE capability signal, the UE capability signal indicating that the UE supports generating a bundled HARQ-ACK bit sequence and converting the bundled HARQ-ACK bit sequence into the two-part HARQ-ACK payload concatenation.

[0302] Aspect 13: The method according to aspect 11 or 12, the method further comprising sending a configuration for concatenating the generation of the bundled HARQ-ACK bit sequence with the transformation of the bundled HARQ-ACK bit sequence to the two-part HARQ-ACK payload, the configuration including downlink control information (DCI) or radio resource control (RRC) signaling.

[0303] Aspect 14: The method according to any one of Aspects 11 to 13, wherein the DCI dynamically enables or disables the concatenation by at least one of the following: enabling the concatenation, disabling the concatenation and performing the generation, disabling the concatenation and performing a transformation of the quantized HARQ-ACK bits, or disabling both the generation and the transformation.

[0304] Aspect 15: The method according to any one of Aspects 11 to 14, wherein enabling the concatenation of the transformation of the bundled HARQ-ACK bit sequence and the bundled HARQ-ACK bit sequence to the two-part HARQ-ACK payload is based on at least one or more of the length of the original HARQ-ACK codebook, the length of the block of HARQ-ACK bits, or the length of the bundled HARQ-ACK bit sequence.

[0305] Aspect 16: An apparatus for wireless communication by a user equipment (UE), the apparatus comprising: at least one memory; and at least one processor coupled to the at least one memory, the at least one processor being configured to: convert blocks of mixed automatic repeat request acknowledgment (HARQ-ACK) bits from an original HARQ-ACK codebook into partitions, wherein multiple partitions for multiple blocks correspond to quantized HARQ-ACK bits; transform the quantized HARQ-ACK bits into a two-part HARQ-ACK payload; separately encode a first part and a second part of the two-part HARQ-ACK payload; and transmit the encoded first part and the encoded second part to a network node.

[0306] Aspect 17: The apparatus according to aspect 16, wherein the at least one processor is further configured to generate a bundled HARQ-ACK bit sequence, each bundled HARQ-ACK bit in the bundled HARQ-ACK bit sequence comprising a logical AND operation of bits of different blocks of the HARQ-ACK codebook; and to transform the bundled HARQ-ACK bit sequence into the two-part HARQ-ACK payload.

[0307] Aspect 18: The apparatus according to aspect 16 or 17, wherein the at least one processor is further configured to transmit a UE capability signal indicating that the UE supports generating the bundled HARQ-ACK bit sequence and cascading the bundled HARQ-ACK bit sequence into the two-part HARQ-ACK payload.

[0308] Aspect 19: The apparatus according to any one of Aspects 16 to 18, wherein the at least one processor is further configured to receive a configuration for concatenating the generation of the bundled HARQ-ACK bit sequence with the transformation of the bundled HARQ-ACK bit sequence to the two-part HARQ-ACK payload, the configuration including downlink control information (DCI) or radio resource control (RRC) signaling.

[0309] Aspect 20: The apparatus according to any one of Aspects 16 to 19, wherein the DCI dynamically enables or disables the cascading by at least one of the following: enabling the cascading, disabling the cascading and performing the conversion, disabling the cascading and performing a transformation of the quantized HARQ-ACK bit, or disabling both the bundling and the conversion.

[0310] Aspect 21: The apparatus according to any one of Aspects 16 to 20, wherein the at least one processor is further configured to enable the cascading of the generation of the bundled HARQ-ACK bit sequence and the transformation of the bundled HARQ-ACK bit sequence to the two-part HARQ-ACK payload, wherein the at least one processor is enabled based on at least one or more of the length of the original HARQ-ACK codebook, the length of the block of HARQ-ACK bits, or the length of the bundled HARQ-ACK bit sequence.

[0311] Aspect 22: The apparatus according to any one of Aspects 16 to 21, wherein the at least one processor is further configured to segment the bundled HARQ-ACK bit sequence into a plurality of segments, transform each segment of the bundled HARQ-ACK bits into a separate two-part HARQ-ACK payload, encode the first part of all segments together, and encode the second part of all segments together separately.

[0312] Aspect 23: The apparatus according to any one of aspects 16 to 22, wherein each block of the original HARQ-ACK codebook is mapped to a group index corresponding to a partition of the partition.

[0313] Aspect 24: The apparatus according to any one of Aspects 16 to 23, wherein the at least one processor is further configured to segment the quantized HARQ-ACK bits into a plurality of segments, transform each segment of the quantized HARQ-ACK bits into a separate two-part HARQ-ACK payload, encode the first part of all segments together, and encode the second part of all segments together separately.

[0314] Aspect 25: The apparatus according to any one of Aspects 16 to 24, wherein: a first portion of the two-part HARQ-ACK payload indicates whether the quantized HARQ-ACK bit indicates all positive acknowledgments, and the size of a second portion of the two-part HARQ-ACK payload is a function of the first portion.

[0315] Aspect 26: An apparatus for wireless communication by a network device, the apparatus comprising: at least one memory; and at least one processor coupled to the at least one memory, the at least one processor being configured to: decode a first portion of a two-part hybrid automatic repeat request acknowledgment (HARQ-ACK) payload received from a user equipment (UE), the first portion indicating whether quantized HARQ-ACK bits indicate all positive acknowledgments; determine a length of a second portion of the two-part HARQ-ACK payload based on the decoding of the first portion; decode the second portion of the two-part HARQ-ACK payload according to the determined length; reconstruct a first value in response to detecting a first value in bits corresponding to the second portion of the original HARQ-ACK codebook; and reconstruct a second value in response to detecting a second value in bits corresponding to the second portion of the original HARQ-ACK codebook.

[0316] Aspect 27: The apparatus according to aspect 26, wherein the at least one processor is further configured to receive a UE capability signal indicating that the UE supports generating a bundled HARQ-ACK bit sequence and cascading the bundled HARQ-ACK bit sequence into the two-part HARQ-ACK payload.

[0317] Aspect 28: The apparatus according to aspect 26 or 27, wherein the at least one processor is further configured to send a configuration for concatenating the generation of the bundled HARQ-ACK bit sequence with the transformation of the bundled HARQ-ACK bit sequence into the two-part HARQ-ACK payload, the configuration including downlink control information (DCI) or radio resource control (RRC) signaling.

[0318] Aspect 29: The apparatus according to any one of Aspects 26 to 28, wherein the DCI dynamically enables or disables the cascading by at least one of the following: enabling the cascading, disabling the cascading and performing the generation, disabling the cascading and performing a transformation of the quantized HARQ-ACK bit, or disabling both the generation and the transformation.

[0319] Aspect 30: An apparatus according to any one of Aspects 26 to 29, wherein the at least one processor enables the cascading of the generation of the bundled HARQ-ACK bit sequence and the transformation of the bundled HARQ-ACK bit sequence to the two-part HARQ-ACK payload based on at least one or more of the length of the original HARQ-ACK codebook, the length of the block of HARQ-ACK bits, or the length of the bundled HARQ-ACK bit sequence.

[0320] The foregoing disclosure provides examples and descriptions, but is not intended to be exhaustive or to limit the aspects to the precise forms disclosed. Modifications and variations may be made based on the foregoing disclosure, or from various practices.

[0321] As used, the term "component" is intended to be interpreted broadly as hardware, firmware, and / or a combination of hardware and software. As used, a processor is implemented using hardware, firmware, and / or a combination of hardware and software.

[0322] The threshold is used to describe certain aspects. As used, depending on the context, meeting the threshold can mean that the value is greater than the threshold, greater than or equal to the threshold, less than the threshold, less than or equal to the threshold, equal to the threshold, not equal to the threshold, etc.

[0323] It will be apparent that the described systems and / or methods can be implemented in various forms, including hardware, firmware, and / or combinations of hardware and software. The actual dedicated control hardware or software code used to implement these systems and / or methods is not limiting in any way. Therefore, since the operation and performance of these systems and / or methods are described without reference to specific software code, it should be understood that the software and hardware used to implement these systems and / or methods can be designed, at least in part, based on this description.

[0324] Although specific combinations of features are set forth in the claims and / or disclosed in the specification, these combinations are not intended to limit the disclosure of various aspects. In fact, many of these features can be combined in ways not specifically set forth in the claims and / or not disclosed in the specification. Although each dependent claim listed below may depend directly on only one claim, the disclosure of various aspects includes each dependent claim combined with every other claim in the claim set. The phrase referring to “at least one of” in the list of items means any combination of those items, including single members. As an example, “at least one of a, b, or c” is intended to cover: a, b, c, ab, ac, bc, and abc, as well as any combination having multiple of the same element (e.g., aa, aaa, aab, aac, abb, acc, bb, bbb, bbc, cc, and ccc, or any other ordering of a, b, and c).

[0325] The elements, actions, or instructions used should not be interpreted as critical or necessary unless explicitly stated otherwise. Furthermore, as used, the articles “a” and “one” are intended to include one or more items and may be used interchangeably with “one or more.” Additionally, as used, the terms “set” and “group” are intended to include one or more items (e.g., related items, unrelated items, combinations of related and unrelated items, etc.) and may be used interchangeably with “one or more.” If only one item is desired, the phrase “only one” or similar terminology will be used. Furthermore, as used, the terms “have,” “possess,” “have,” etc., are intended to be open-ended terms. Additionally, the phrase “based on” is intended to mean “at least partially based on” unless otherwise explicitly stated.

Claims

1. A method for wireless communication by a user equipment (UE), the method comprising: The block with mixed automatic repeat request acknowledgment (HARQ-ACK) bits is converted from the original HARQ-ACK codebook into a partition, and multiple partitions for multiple blocks correspond to quantized HARQ-ACK bits; The quantized HARQ-ACK bits are transformed into two HARQ-ACK payloads; The first and second parts of the two HARQ-ACK payloads are encoded separately; as well as Send the encoded first part and the encoded second part to the network node.

2. The method of claim 1, wherein the transformation comprises generating a bundled HARQ-ACK bit sequence, each bundled HARQ-ACK bit in the bundled HARQ-ACK bit sequence comprising a logical AND operation of bits of different blocks of the HARQ-ACK codebook; and transforming the quantized HARQ-ACK bits comprises transforming the bundled HARQ-ACK bit sequence into the two-part HARQ-ACK payload.

3. The method according to claim 2, further comprising sending a UE capability signal, the UE capability signal indicating that the UE supports generating the bundled HARQ-ACK bit sequence and converting the bundled HARQ-ACK bit sequence into the concatenation of the two HARQ-ACK payloads.

4. The method of claim 2, further comprising receiving a configuration for concatenating the generation of the bundled HARQ-ACK bit sequence with the transformation of the bundled HARQ-ACK bit sequence to the two-part HARQ-ACK payload, the configuration including downlink control information (DCI) or radio resource control (RRC) signaling.

5. The method of claim 4, wherein the DCI dynamically enables or disables the concatenation by at least one of the following: enabling the concatenation, disabling the concatenation and performing the transformation, disabling the concatenation and performing a transformation of the quantized HARQ-ACK bit, or disabling both the bundling and the transformation.

6. The method of claim 2, further comprising enabling the concatenation of the transformation of the bundled HARQ-ACK bit sequence to the two portions of the HARQ-ACK payload, the enabling being based on at least one or more of the length of the original HARQ-ACK codebook, the length of the block of HARQ-ACK bits, or the length of the bundled HARQ-ACK bit sequence.

7. The method according to claim 2, further comprising segmenting the bundled HARQ-ACK bit sequence into multiple segments, in: Transforming the quantized HARQ-ACK bits includes transforming each segment of the bundled HARQ-ACK bits into two separate HARQ-ACK payloads, and The separate encoding includes: The first part of all segments is encoded together, and The second part of all segments is encoded separately.

8. The method of claim 1, wherein each block of the original HARQ-ACK codebook is mapped to a group index corresponding to a partition in the partition.

9. The method according to claim 1, further comprising segmenting the quantized HARQ-ACK bits into multiple segments. in: The transformation includes transforming each segment of the quantized HARQ-ACK bits into two separate HARQ-ACK payloads, and The separate encoding includes: The first part of all segments is encoded together, and The second part of all segments is encoded separately.

10. The method according to claim 1, wherein: The first part of the two-part HARQ-ACK payload indicates whether the quantized HARQ-ACK bits indicate all positive acknowledgments, and The size of the second part of the two-part HARQ-ACK payload is a function of the size of the first part.

11. A method for wireless communication by a network device, the method comprising: The first part of the two-part Hybrid Automatic Repeat Request Acknowledgment (HARQ-ACK) payload received from the User Equipment (UE) is decoded, the first part indicating whether the quantized HARQ-ACK bits indicate all positive acknowledgments; The length of the second part of the two-part HARQ-ACK payload is determined based on the decoding of the first part; The second part of the two-part HARQ-ACK payload is decoded according to the determined length; The first value is reconstructed in response to detecting a first value in the bits corresponding to the second portion of the original HARQ-ACK codebook of all bits of the original HARQ-ACK codebook; and The second value is reconstructed in response to detecting a second value for each bit of the original HARQ-ACK codebook in the bits corresponding to the second portion of the original HARQ-ACK codebook.

12. The method of claim 11, further comprising receiving a UE capability signal, the UE capability signal indicating that the UE supports generating a bundled HARQ-ACK bit sequence and cascading the bundled HARQ-ACK bit sequence into the two-part HARQ-ACK payload.

13. The method of claim 12, further comprising sending a configuration for concatenating the generation of the bundled HARQ-ACK bit sequence with the transformation of the bundled HARQ-ACK bit sequence into the two-part HARQ-ACK payload, the configuration including downlink control information (DCI) or radio resource control (RRC) signaling.

14. The method of claim 13, wherein the DCI dynamically enables or disables the concatenation by at least one of the following: enabling the concatenation, disabling the concatenation and performing the generation, disabling the concatenation and performing a transformation of the quantized HARQ-ACK bits, or disabling both the generation and the transformation.

15. The method of claim 14, wherein enabling the concatenation of the transformations of the bundled HARQ-ACK bit sequence and the bundled HARQ-ACK bit sequence to the two-part HARQ-ACK payload is based on at least one or more of the length of the original HARQ-ACK codebook, the length of the block of HARQ-ACK bits, or the length of the bundled HARQ-ACK bit sequence.

16. An apparatus for wireless communication by a user equipment (UE), the apparatus comprising: At least one memory; and At least one processor, coupled to the at least one memory, the at least one processor being configured to: The block with mixed automatic repeat request acknowledgment (HARQ-ACK) bits is converted from the original HARQ-ACK codebook into a partition, and multiple partitions for multiple blocks correspond to quantized HARQ-ACK bits; The quantized HARQ-ACK bits are transformed into two HARQ-ACK payloads; The first and second parts of the two HARQ-ACK payloads are encoded separately; as well as Send the encoded first part and the encoded second part to the network node.

17. The apparatus of claim 16, wherein the at least one processor is further configured to generate a bundled HARQ-ACK bit sequence, each bundled HARQ-ACK bit in the bundled HARQ-ACK bit sequence comprising a logical AND operation of bits of different blocks of the HARQ-ACK codebook; and to transform the bundled HARQ-ACK bit sequence into the two-part HARQ-ACK payload.

18. The apparatus of claim 17, wherein the at least one processor is further configured to transmit a UE capability signal indicating that the UE supports generating the bundled HARQ-ACK bit sequence and cascading the bundled HARQ-ACK bit sequence into the two-part HARQ-ACK payload.

19. The apparatus of claim 17, wherein the at least one processor is further configured to receive a configuration for concatenating the generation of the bundled HARQ-ACK bit sequence with the transformation of the bundled HARQ-ACK bit sequence into the two-part HARQ-ACK payload, the configuration including downlink control information (DCI) or radio resource control (RRC) signaling.

20. The apparatus of claim 19, wherein the DCI dynamically enables or disables the cascading by at least one of the following: enabling the cascading, disabling the cascading and performing the conversion, disabling the cascading and performing a transformation of the quantized HARQ-ACK bit, or disabling both the bundling and the conversion.

21. The apparatus of claim 17, wherein the at least one processor is further configured to enable the cascading of the generation of the bundled HARQ-ACK bit sequence and the transformation of the bundled HARQ-ACK bit sequence to the two-part HARQ-ACK payload, the at least one processor being enabled based on at least one or more of the length of the original HARQ-ACK codebook, the length of the block of HARQ-ACK bits, or the length of the bundled HARQ-ACK bit sequence.

22. The apparatus of claim 17, wherein the at least one processor is further configured to: The bundled HARQ-ACK bit sequence is segmented into multiple segments. Each segment of the bundled HARQ-ACK bits is transformed into two separate HARQ-ACK payloads. The first part of all segments is encoded together, and The second part of all segments is encoded separately.

23. The apparatus of claim 16, wherein each block of the original HARQ-ACK codebook is mapped to a group index corresponding to a partition in the partition.

24. The apparatus of claim 15, wherein the at least one processor is further configured to: The quantized HARQ-ACK bits are segmented into multiple segments. Each segment of the quantized HARQ-ACK bits is transformed into two separate HARQ-ACK payloads. The first part of all segments is encoded together, and The second part of all segments is encoded separately.

25. The apparatus according to claim 16, wherein: The first part of the two-part HARQ-ACK payload indicates whether the quantized HARQ-ACK bits indicate all positive acknowledgments, and The size of the second part of the two-part HARQ-ACK payload is a function of the size of the first part.

26. An apparatus for wireless communication by a network device, the apparatus comprising: At least one memory; and At least one processor, coupled to the at least one memory, the at least one processor being configured to: The first part of the two-part Hybrid Automatic Repeat Request Acknowledgment (HARQ-ACK) payload received from the User Equipment (UE) is decoded, the first part indicating whether the quantized HARQ-ACK bits indicate all positive acknowledgments; The length of the second part of the two-part HARQ-ACK payload is determined based on the decoding of the first part; The second part of the two-part HARQ-ACK payload is decoded according to the determined length; The first value is reconstructed in response to detecting a first value in the bits corresponding to the second portion of the original HARQ-ACK codebook of all bits of the original HARQ-ACK codebook; and The second value is reconstructed in response to detecting a second value for each bit of the original HARQ-ACK codebook in the bits corresponding to the second portion of the original HARQ-ACK codebook.

27. The apparatus of claim 26, wherein the at least one processor is further configured to receive a UE capability signal indicating that the UE supports generating a bundled HARQ-ACK bit sequence and cascading the bundled HARQ-ACK bit sequence into the two-part HARQ-ACK payload.

28. The apparatus of claim 27, wherein the at least one processor is further configured to send a configuration for concatenating the generation of the bundled HARQ-ACK bit sequence with the transformation of the bundled HARQ-ACK bit sequence into the two-part HARQ-ACK payload, the configuration including downlink control information (DCI) or radio resource control (RRC) signaling.

29. The apparatus of claim 28, wherein the DCI dynamically enables or disables the cascading by at least one of the following: enabling the cascading, disabling the cascading and performing the generation, disabling the cascading and performing a transformation of the quantized HARQ-ACK bits, or disabling both the generation and the transformation.

30. The apparatus of claim 29, wherein the at least one processor enables the cascading of the generation of the bundled HARQ-ACK bit sequence and the transformation of the bundled HARQ-ACK bit sequence to the two-part HARQ-ACK payload based on at least one or more of the length of the original HARQ-ACK codebook, the length of the block of HARQ-ACK bits, or the length of the bundled HARQ-ACK bit sequence.

Images