# US 12,003,328 B2 · Method and apparatus for HARQ-ACK codebook reduction > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,003,328 B2 - Document ID: US12003328B2 - Status: Granted - Kind: B2 - Application number: 17/441,566 - Filed: 2019-03-29 - Published: 2022-02-17 - Granted: 2024-06-04 - Earliest claimed: 2019-03-29 - Assignees: Lenovo (Beijing) Limited - Applicants: Lenovo (Beijing) Limited - Inventors: Haipeng Lei; Alexander Golitschek Edler Von Elbwart; Zhang Yu - Web page: https://patentgrep.com/patent/US12003328B2 ## CPC - H04L 1/1671: {the supervisory signal being transmitted together with control information} - H04L 1/1812: Hybrid protocols; Hybrid automatic repeat request [HARQ] - H04L 1/1607: Details of the supervisory signal - H04L 1/1822: involving configuration of automatic repeat request [ARQ] with parallel processes - H04L 5/0053: {Allocation of signalling, i.e. of overhead other than pilot signals} - H04W 72/1268: of uplink data flows - H04W 72/23: in the downlink direction of a wireless link, i.e. towards a terminal - H04W 76/28: Discontinuous transmission [DTX]; Discontinuous reception [DRX] - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) - H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72) ## Abstract Embodiments of the present disclosure relate to methods and apparatuses for HARQ-ACK codebook reduction. According to an embodiment of the present disclosure, a method can include: transmitting a plurality of uplink data channels to a BS; and receiving a HARQ-ACK codebook in first DCI indicating downlink feedback. At least one of the plurality of uplink data channels is configured by the BS, and each uplink data channel is associated with each HARQ process. The HARQ-ACK codebook includes at least two sub-codebooks: a first sub-codebook including TB-level HARQ-ACK information bits for a first set of HARQ processes and a second sub-codebook including CBG-level HARQ-ACK information bits for a second set of HARQ processes. The first DCI has the same size with the second DCI for scheduling uplink data transmission. Embodiments of the present disclosure can ensure both UE side and BS side have the same understanding on the reduced HARQ-ACK codebook. ## Claims ### Claim 1 A method comprising: transmitting a plurality of uplink data channels to a base station, wherein at least one uplink data channel of the plurality of uplink data channels is configured by the base station, and wherein each of the plurality of uplink data channels is associated with a hybrid automatic repeat request process; and receiving a hybrid automatic repeat request acknowledgement codebook in first downlink control information indicating downlink feedback, wherein the hybrid automatic repeat request acknowledgement codebook comprises at least two sub-codebooks: a first sub-codebook comprising transport block level hybrid automatic repeat request acknowledgement information bits for a first set of hybrid automatic repeat request processes, and a second sub-codebook comprising code block group level hybrid automatic repeat request acknowledgement information bits for a second set of hybrid automatic repeat request processes; and wherein the first downlink control information has a same size with second downlink control information for scheduling uplink data transmission. ### Claim 2 (depends on 1) The method of claim 1, wherein the first set of hybrid automatic repeat request processes includes all the hybrid automatic repeat request processes and the second set of hybrid automatic repeat request processes includes first x hybrid automatic repeat request processes indicated by “non-acknowledgement (NACK)” in the first sub-codebook and x is the largest value satisfying the following equation: N+x*M+Z<=Y, wherein M is the maximum number of code block groups per transport block, N is a number of all the hybrid automatic repeat request processes, Z is a size of other information bits except for the hybrid automatic repeat request acknowledgement codebook in the first downlink control information, and Y is the size of the second downlink control information. ### Claim 3 (depends on 1) The method of claim 1, wherein the first set of hybrid automatic repeat request processes include (N−x) hybrid automatic repeat request processes and the second set of hybrid automatic repeat request processes includes x hybrid automatic repeat request processes, and x is the largest value satisfying the following equation: x*M+(N−x)+Z<=Y, wherein M is the maximum number of code block groups per transport block, N is a number of all the hybrid automatic repeat request processes, Z is a size of other information bits except for hybrid automatic repeat request acknowledgement codebook in the first downlink control information, and Y is the size of the second downlink control information. ### Claim 4 (depends on 1) The method of claim 1, wherein the first set of hybrid automatic repeat request processes includes all the hybrid automatic repeat request processes and the second set of hybrid automatic repeat request processes includes first x hybrid automatic repeat request processes indicated by “NACK” in the first sub-codebook, and x is configured by a radio resource control signaling. ### Claim 5 (depends on 1) The method of claim 1, wherein the first set of hybrid automatic repeat request processes includes (N−x) hybrid automatic repeat request processes and the second set of hybrid automatic repeat request processes includes x hybrid automatic repeat request processes, wherein N is a number of all the hybrid automatic repeat request processes and x is a value configured by a radio resource control signaling. ### Claim 6 (depends on 1) The method of claim 1, wherein each of the first set of hybrid automatic repeat request processes is indicated with two transport block level hybrid automatic repeat request acknowledgement information bits in the first sub-codebook. ### Claim 7 (depends on 6) The method of claim 6, wherein the two transport block level hybrid automatic repeat request acknowledgement information bits represent four states indicating “acknowledgement (ACK),” “NACK,” “discontinuous transmission (DTX),” and “other state” respectively; wherein the first set of hybrid automatic repeat request processes includes all the hybrid automatic repeat request processes and the second set of hybrid automatic repeat request processes includes first x hybrid automatic repeat request processes indicated by “NACK” in the first sub-codebook, and x is the largest value satisfying the following equation: 2*N+x*M+Z<=Y, wherein M is the maximum number of code block groups per transport block, N is a number of all the hybrid automatic repeat request processes, Z is a size of other information bits except for the hybrid automatic repeat request acknowledgement codebook in the first downlink control information, and Y is the size of the second downlink control information. ### Claim 8 (depends on 6) The method of claim 6, wherein the two transport block level hybrid automatic repeat request acknowledgement information bits represent four states indicating “All ACK,” “All NACK,” “Partial ACK” or “Partial NACK,” “DTX” for all code block groups of each transport block on each of the first set of hybrid automatic repeat request processes; wherein the first set of hybrid automatic repeat request processes includes all the hybrid automatic repeat request processes, and the second set of hybrid automatic repeat request processes includes first x hybrid automatic repeat request processes indicated by “Partial ACK” or “Partial NACK” in the first sub-codebook, and x is the largest value satisfying the following equation: 2*N+x*M+Z<=Y, wherein M is the maximum number of code block groups per transport block, N is a number of all the hybrid automatic repeat request processes, Z is a size of other information bits except for the hybrid automatic repeat request acknowledgement codebook in the first downlink control information, and Y is the size of the second downlink control information. ### Claim 9 (depends on 1) The method of claim 1, wherein the first sub-codebook comprises T bits for the first set of hybrid automatic repeat request processes and the first set of hybrid automatic repeat request processes comprises all the hybrid automatic repeat request processes, and the second set of hybrid automatic repeat request processes comprises first x hybrid automatic repeat request processes indicated by “NACK” in the first sub-codebook, and x is the largest value satisfying the following equation: T+x*M+Z<=Y, wherein M is the maximum number of code block groups per transport block, Z is a size of other information bits except for the hybrid automatic repeat request acknowledgement codebook in the first downlink control information, and Y is the size of the second downlink control information. ### Claim 10 (depends on 1) The method of claim 1, wherein the at least one configured uplink data channel of the plurality of uplink data channels carries uplink control information and the uplink control information includes uplink transmission indicator. ### Claim 11 (depends on 10) The method of claim 10, wherein the uplink transmission indicator denotes an accumulative number of transmitted configured uplink data channels up to the current configured grant transmission occasion. ### Claim 12 (depends on 10) The method of claim 10, wherein the uplink transmission indicator denotes an accumulative number of transmitted uplink data channels including configured grant uplink data channel and scheduled uplink data channel, up to the current configured grant transmission occasion. ### Claim 13 (depends on 10) The method of claim 10, wherein the uplink transmission indicator denotes a total number of transmitted configured uplink data channels. ### Claim 14 (depends on 10) The method of claim 10, wherein the uplink transmission indicator denotes a total number of transmitted uplink data channels including configured grant uplink data channel and scheduled uplink data channel. ### Claim 15 (depends on 1) The method of claim 1, wherein the second set of hybrid automatic repeat request processes includes a third set of hybrid automatic repeat request processes which are transmitted in reference slots and indicated by “NACK” in the first sub-codebook, wherein the reference slots are used for determining a contention window size for uplink channel access procedure. ### Claim 16 (depends on 1) The method of claim 1, wherein the first downlink control information further includes padding bits so as to have a same size with the second downlink control information. ### Claim 17 A method comprising: receiving, from a device, a plurality of uplink data channels, wherein at least one uplink data channel of the plurality of uplink data channels is configured to the device, and wherein each of the plurality of uplink data channels is associated with a hybrid automatic repeat request process; and transmitting, to the device, a hybrid automatic repeat request acknowledgement codebook in first downlink control information indicating downlink feedback, wherein the hybrid automatic repeat request acknowledgement codebook comprises at least two sub-codebooks: a first sub-codebook comprising transport block level hybrid automatic repeat request acknowledgement information bits for a first set of hybrid automatic repeat request processes, and a second sub-codebook comprising code block group level hybrid automatic repeat request acknowledgement information bits for a second set of hybrid automatic repeat request processes; and wherein the first downlink control information has a same size with second downlink control information scheduling uplink data transmission. ### Claim 18 (depends on 17) The method of claim 17, wherein the at least one configured uplink data channel of the plurality of uplink data channels carries uplink control information and the uplink control information includes uplink transmission indicator. ### Claim 19 (depends on 17) The method of claim 17, wherein the second set of hybrid automatic repeat request processes includes a third set of hybrid automatic repeat request processes which are transmitted in reference slots and indicated by “NACK” in the first sub-codebook, wherein the reference slots are used for determining a contention window size for uplink channel access procedure. ### Claim 20 (depends on 17) The method of claim 17, wherein the first downlink control information further includes padding bits so as to have a same size with the second downlink control information.