Prosecution Insights
Last updated: May 29, 2026
Application No. 18/471,249

USER EQUIPMENT (UE) REPORTING OF QUANTITY OF ACKNOWLEDGEMENTS (ACKs) IN BUNDLED ACKNOWLEDGEMENT (ACK) CODEBOOK

Non-Final OA §102
Filed
Sep 20, 2023
Examiner
YEUNG, MANG HANG
Art Unit
2417
Tech Center
2400 — Computer Networks
Assignee
Qualcomm Incorporated
OA Round
2 (Non-Final)
87%
Grant Probability
Favorable
2-3
OA Rounds
0m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 87% — above average
87%
Career Allowance Rate
652 granted / 748 resolved
+29.2% vs TC avg
Moderate +12% lift
Without
With
+12.1%
Interview Lift
resolved cases with interview
Typical timeline
2y 7m
Avg Prosecution
20 currently pending
Career history
763
Total Applications
across all art units

Statute-Specific Performance

§101
1.8%
-38.2% vs TC avg
§103
70.2%
+30.2% vs TC avg
§102
17.5%
-22.5% vs TC avg
§112
5.4%
-34.6% vs TC avg
Black line = Tech Center average estimate • Based on career data from 748 resolved cases

Office Action

§102
DETAILED ACTION The instant application having Application No. 18/471249 filed on 09/20/2023 is presented for examination by the examiner. Claims 1, 4, 13, 16, 17, 18, 21, 22, 23 were amended. Claims 1-23 are pending. Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection. Response to Argument Applicant’s arguments (see the Applicant's Remarks) with respect to the rejection(s) of claims 1-23 have been fully considered and not persuasive. Examiner provide a new ground of rejections to address Applicant’s amendment/argument (See the updated claim rejections below.). Allowable Subject Matters Claims 2, 9-10, 18 are objected to as being dependent upon a rejected base claim, but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims. Claim 3-4 are objected since they depend on claim 2. Claim Rejections - 35 USC § 102 The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action: A person shall be entitled to a patent unless – (a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale or otherwise available to the public before the effective filing date of the claimed invention. Claims 1, 5-8, 11-17, 19-23 are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Ying et al. (US 2019/0150122 A1) As per claim 1, Ying discloses “An apparatus for wireless communication, comprising: at least one transceiver, at least one memory comprising instructions; and at least one processor configured to execute the instructions to cause the apparatus to:” as [(fig. 1).] “receive, via the at least one transceiver, downlink transmissions;” [(par. 0022), a bundled HARQ-ACK information bit for a CBG index indicating whether the CBG(s) with the same index in any TBs or both TBs in the PDSCH are decoded successfully or no.] “generate an original acknowledgement (ACK) codebook based on whether each of the downlink transmissions is successfully decoded;” [(fig. 4), 4 ACK bits (1111) for 4 CBGs of TB 0. 4 ACK bits (1101) for 4 CBGs of TB 1.] “modify the original ACK codebook by transforming a plurality of bits of the original ACK codebook;” [(fig. 4B), CBG HARQ-ACK bundling of 4 Positive ACK bits for 4 CBGs of TB 0 by a logical “AND“ operation.] “generate an ACK payload comprising the modified original ACK codebook and information related to a quantity of one or more positive acknowledgements for the received downlink transmissions;” [(fig. 4B), Generate a HARQ ACK feedback which contains 1 bit (through a logical “AND“ operation) indicating successfully received all 4 CBGs of the TB 0, and 4 bits (1101) for successfully received only 3 of 4 CBGs of the TB 1.] “and transmit, via the at least one transceiver, for transmission, the ACK payload” [(fig. 4B), Generate a HARQ ACK feedback which contains 1 bit for successfully received all 4 CBGs of the TB 0, and 4 bits (1101) for successfully received only 3 of 4 CBGs of the TB 1.] As per claim 5, Ying discloses “The apparatus of claim 1,” as [see rejection of claim 1.] “in which the payload comprises a first bit associated with the modified original ACK codebook and at least one second bit associated with the information related to the quantity of positive acknowledgements” [(fig. 4B), Generate a HARQ ACK feedback which contains 1 bit for successfully received all 4 CBGs of the TB 0, and 4 bits (1101) for successfully received only 3 of 4 CBGs of the TB 1.] As per claim 6, Ying discloses “The apparatus of claim 5,” as [see rejection of claim 5.] “in which the information related to the quantity of positive acknowledgements is based on the modified original ACK codebook indicating all positive acknowledgements” [(fig. 4B), CBG HARQ-ACK bundling of Positive ACK bits of TB 0 by a logical “AND“ operation.] As per claim 7, Ying discloses “The apparatus of claim 5,” as [see rejection of claim 5.] “in which the information related to the quantity of positive acknowledgements is generated in response the modified original ACK codebook indicating all positive acknowledgements, or in response to the modified original ACK codebook indicating at least one negative acknowledgement (NACK)” [(fig. 4B), Generate a HARQ ACK feedback which contains 1 bit (through a logical “AND“ operation) indicating successfully received all 4 CBGs (1111) of the TB 0, and 4 bits (1101) for successfully received only 3 of 4 CBGs of the TB 1. (fig. 4B), Generate a HARQ ACK feedback which contains the 1 bit for successfully received all 4 CBGs of the TB 0, and 4 bits (1101) for successfully received only 3 of 4 CBGs of the TB 1.] As per claim 8, Ying discloses “The apparatus of claim 1,” as [see rejection of claim 1.] “in which the at least one processor is further configured to execute the instructions to cause the apparatus to generate a codepoint comprising one or more bits that jointly indicate the modified original ACK codebook and the information related to the quantity of positive acknowledgements” [(fig. 4B), Generate a HARQ ACK feedback which contains 1 bit for successfully received all 4 CBGs of the TB 0, and 4 bits (1101) for successfully received only 3 of 4 CBGs of the TB 1.] As per claim 11, Ying discloses “The apparatus of claim 1,” as [see rejection of claim 1.] “in which the at least one processor is further configured to execute the instructions to cause the apparatus to generate a bundled ACK bit comprising a logical AND operation on the plurality of bits of the original ACK codebook; and the ACK payload comprises joint encoding of the bundled ACK bit and the information related to the quantity of positive acknowledgements” [(fig. 4B), Generate a HARQ ACK feedback which contains 1 bit (through a logical “AND“ operation) indicating successfully received all 4 CBGs (1111) of the TB 0, and 4 bits (1101) for successfully received only 3 of 4 CBGs of the TB 1. (fig. 4B), Generate a HARQ ACK feedback which contains the 1 bit for successfully received all 4 CBGs of the TB 0, and 4 bits (1101) for successfully received only 3 of 4 CBGs of the TB 1.] As per claim 12, Ying discloses “The apparatus of claim 1,” as [see rejection of claim 1.] “in which the at least one processor is further configured to execute the instructions to cause the apparatus to generate a bundled ACK bit comprising a logical AND operation on the plurality of bits of the original ACK codebook; and the information related to the quantity of positive acknowledgements is in response to the bundled ACK bit indicating all positive acknowledgements, or in response to the bundled ACK bit indicating at least one negative acknowledgement (NACK)” [(fig. 4B), Generate a HARQ ACK feedback which contains 1 bit (through a logical “AND“ operation) indicating successfully received all 4 CBGs of the TB 0, and 4 bits (1101) for successfully received only 3 of 4 CBGs of the TB 1. (fig. 4B), Generate a HARQ ACK feedback which contains the 1 bit for successfully received all 4 CBGs of the TB 0, and 4 bits (1101) for successfully received only 3 of 4 CBGs of the TB 1.] As per claim 13, Ying discloses “The apparatus of claim 1,” as [see rejection of claim 1.] “in which the at least one processor is further configured to execute the instructions to cause the apparatus to generate a bundled ACK bit comprising a logical AND operation on the plurality of bits of the original ACK codebook; and the information related to the quantity of positive acknowledgements is in response to the bundled ACK bit indicating all positive acknowledgements, the information related to the quantity of positive acknowledgements being transmitted in a second part, in response to a first part indicating the bundled ACK bit corresponds to the all positive acknowledgements” [(fig. 4B), Generate a HARQ ACK feedback which contains 1 bit (through a logical “AND“ operation) indicating successfully received all 4 CBGs of the TB 0, and 4 bits (1101) for successfully received only 3 of 4 CBGs of the TB 1. (fig. 4B), Generate a HARQ ACK feedback which contains the 1 bit for successfully received all 4 CBGs of the TB 0, and 4 bits (1101) for successfully received only 3 of 4 CBGs of the TB 1.] As per claim 14 Ying discloses “The apparatus of claim 1,” as [see rejection of claim 1.] “in which the information related to the quantity of positive acknowledgements comprises a quantity of bits bundled together, the quantity of bits including positive acknowledgements (ACKs) and negative acknowledgements (NACKs)” [(fig. 4B), Generate a HARQ ACK feedback which contains 1 bit for successfully received all 4 CBGs of the TB 0, and 4 bits (1101) for successfully received only 3 of 4 CBGs of the TB 1.] As per claim 15, Ying discloses “The apparatus of claim 1,” as [see rejection of claim 1.] “in which the at least one processor is further configured to execute the instructions to cause the apparatus to perform a logical AND operation on the plurality of bits of the original ACK codebook” [(fig. 4B), Generate a HARQ ACK feedback which contains 1 bit (through a logical “AND“ operation) indicating successfully received all 4 CBGs of the TB 0, and 4 bits (1101) for successfully received only 3 of 4 CBGs of the TB 1.] As per claim 16, Ying discloses “The apparatus of claim 1,” as [see rejection of claim 1.] “wherein the apparatus is configured as a user equipment (UE)” as [see rejection of claim 1.] As per claim 17, Ying discloses “An apparatus for wireless communication, comprising: at least one transceiver at least one memory comprising instructions; and at least one processor configured to execute the instructions to cause the apparatus to: as [(fig. 1.)] “transmit, for transmission, downlink transmissions;” [(par. 0022), a bundled HARQ-ACK information bit for a CBG index indicating whether the CBG(s) with the same index in any TBs or both TBs in the PDSCH are decoded successfully or no.] “and receiving, via the at least one transceiver, an acknowledgement (ACK) payload comprising a modified original ACK codebook and information related to a quantity of one or more positive acknowledgements associated with the transmitted downlink transmissions” [fig. 4B), CBG HARQ-ACK bundling for Positive ACK bits for 4 CBGs of TB 0 through a logical “AND“ operation. (fig. 4B), receiving a HARQ ACK feedback which contains the 1 bit (through a logical “AND“ operation) indicating the UE successfully received all 4 CBGs of the TB 0, and 4 bits (1101) for successfully received only 3 of 4 CBGs of the TB 1.] As per claim 19, Ying discloses “The apparatus of claim 17,” as [see rejection of claim 17.] “in which the at least one processor is further configured to execute the instructions to cause the apparatus to reschedule the downlink transmissions in response to the quantity of one or more positive acknowledgements not matching an expected value” [fig. 4B), CBG HARQ-ACK bundling for Positive ACK bits for 4 CBGs of TB 0 through a logical “AND“ operation. (fig. 4B), receiving a HARQ ACK feedback which contains the 1 bit (through a logical “AND“ operation) indicating the UE successfully received all 4 CBGs of the TB 0, and 4 bits (1101) for successfully received only 3 of 4 CBGs of the TB 1.] As per claim 20, Ying discloses “The apparatus of claim 17,” as [see rejection of claim 17.] “in which the payload comprises a first bit associated with the modified original ACK codebook and at least one second bit associated with the information related to the quantity of positive acknowledgements” [(fig. 4B), CBG HARQ-ACK bundling for Positive ACK bits for 4 CBGs of TB 0 through a logical “AND“ operation. (fig. 4B), receiving a HARQ ACK feedback which contains the 1 bit (through a logical “AND“ operation) indicating the UE successfully received all 4 CBGs of the TB 0, and 4 bits (1101) for successfully received only 3 of 4 CBGs of the TB 1.] As per claim 21, Ying discloses “The apparatus of claim 17,” as [see rejection of claim 17.] “in which the at least one processor is further configured to execute the instructions to cause the apparatus to received, via the at least one transceiver, a codepoint comprising one or more bits that jointly indicate the modified original ACK codebook and the information related to the quantity of positive acknowledgements” [(fig. 4B), CBG HARQ-ACK bundling for Positive ACK bits for 4 CBGs of TB 0 through a logical “AND“ operation. (fig. 4B), receiving a HARQ ACK feedback which contains the 1 bit (through a logical “AND“ operation) indicating the UE successfully received all 4 CBGs of the TB 0, and 4 bits (1101) for successfully received only 3 of 4 CBGs of the TB 1.] As per claim 22, Ying discloses “The apparatus of claim 17,” as [see rejection of claim 17.] “further comprising: wherein the apparatus is configured as a network device” as [(fig. 1)] As per claim 23, as [see rejection of claim 1.] Conclusion Applicant's amendment necessitated the new ground(s) of rejection presented in this Office action. Accordingly, THIS ACTION IS MADE FINAL. See MPEP § 706.07(a). Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any extension fee pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to Mang Hang Yeung whose telephone number is (571)-270-7319 The examiner can normally be reached on Mon through Th (9:00 am to 4:00pm EST). If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Rebecca Song can be reached on (571) 270-3667. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of an application may be obtained from the Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from either Private PAIR or Public PAIR. Status information for unpublished applications is available through Private PAIR only. For more information about the PAIR system, see http://pair-direct.uspto.gov. Should you have questions on access to the Private PAIR system, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative or access to the automated information system, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /MANG HANG YEUNG/Primary Examiner, Art Unit 2417
Read full office action

Prosecution Timeline

Show 1 earlier event
Oct 14, 2025
Non-Final Rejection mailed — §102
Jan 13, 2026
Response Filed
Feb 02, 2026
Final Rejection mailed — §102
Mar 12, 2026
Applicant Interview (Telephonic)
Mar 13, 2026
Response after Non-Final Action
Mar 13, 2026
Examiner Interview Summary
May 04, 2026
Request for Continued Examination
May 12, 2026
Response after Non-Final Action

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12641579
Method and Apparatus for Adjusting Inner Loop Value, Storage Medium and Electronic Device
3y 0m to grant Granted May 26, 2026
Patent 12640855
HYBRID AUTOMATIC REPEAT REQUEST (HARQ) FEEDBACK EN-/DISABLING FOR MULTICAST
2y 10m to grant Granted May 26, 2026
Patent 12641617
TRANSMITTING CONTROL INFORMATION ASSOCIATED WITH DYNAMIC SUBBAND FULL DUPLEX
2y 11m to grant Granted May 26, 2026
Patent 12628243
Flight Area Management Method for Uncrewed Aerial Vehicle and Related Apparatus
4y 1m to grant Granted May 12, 2026
Patent 12627409
A DATA PACKET TRANSACTION TIMING SOLUTION FOR A WIRELESS COMMUNICATION SYSTEM
2y 10m to grant Granted May 12, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

2-3
Expected OA Rounds
87%
Grant Probability
99%
With Interview (+12.1%)
2y 7m (~0m remaining)
Median Time to Grant
Moderate
PTA Risk
Based on 748 resolved cases by this examiner. Grant probability derived from career allowance rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month