Prosecution Insights
Last updated: April 19, 2026
Application No. 18/610,933

ACHIEVING UNEQUAL ERROR PROTECTION FOR DECODING HYBRID AUTOMATIC REPEAT REQUEST BITS

Non-Final OA §103
Filed
Mar 20, 2024
Examiner
HARPER, KEVIN C
Art Unit
2462
Tech Center
2400 — Computer Networks
Assignee
Qualcomm Incorporated
OA Round
1 (Non-Final)
88%
Grant Probability
Favorable
1-2
OA Rounds
2y 11m
To Grant
94%
With Interview

Examiner Intelligence

Grants 88% — above average
88%
Career Allow Rate
839 granted / 955 resolved
+29.9% vs TC avg
Moderate +6% lift
Without
With
+5.6%
Interview Lift
resolved cases with interview
Typical timeline
2y 11m
Avg Prosecution
28 currently pending
Career history
983
Total Applications
across all art units

Statute-Specific Performance

§101
5.8%
-34.2% vs TC avg
§103
53.7%
+13.7% vs TC avg
§102
20.8%
-19.2% vs TC avg
§112
4.6%
-35.4% vs TC avg
Black line = Tech Center average estimate • Based on career data from 955 resolved cases

Office Action

§103
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 (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. Claim Objections Claims 11 and 19 are objected to because of the following informalities: “true prior associated” should be --true prior set associated--. Appropriate correction is required. Claim Rejections - 35 USC § 103 The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. This application currently names joint inventors. In considering patentability of the claims the examiner presumes that the subject matter of the various claims was commonly owned as of the effective filing date of the claimed invention(s) absent any evidence to the contrary. Applicant is advised of the obligation under 37 CFR 1.56 to point out the inventor and effective filing dates of each claim that was not commonly owned as of the effective filing date of the later invention in order for the examiner to consider the applicability of 35 U.S.C. 102(b)(2)(C) for any potential 35 U.S.C. 102(a)(2) prior art against the later invention. Claims 1, 9-10, 12, 18 and 20 are rejected under 35 U.S.C. 103 as being unpatentable over Wong (US 2010/0042881) in view of Ghimire et al. (WO 2022/090766). For dependent claims herein, the motivation to combine is the same as the parent claim unless otherwise noted. Regarding claim 1, Wong discloses a network node (fig. 2, item 202; para. 27, last two lines) for wireless communication, comprising (para. 61): one or more memories; and one or more processors, coupled to the one or more memories, which are configured, individually or in any combination, to (para. 61): receive, from a user equipment (UE) (item 206.1), a codeword (item 215; para. 27, third sentence; note: ARQ feedback; para. 23, second sentence; note: HARQ) including a However, Wong fails to disclose a codeword including a plurality of hybrid automatic repeat request (HARQ) bits, decoding each of the plurality of HARQ bits, and a decoding rule that is based at least in part on posterior probabilities. Ghimire discloses these features (page 27, lines 20-21; page 31, line 18 to page 32, lines 10; fig. 8, item S158; page 7, lines 18-27; note: posterior probabilities are updated probabilities in the broadest reasonable interpretation). Therefore, it would have been obvious to one skilled in the art before the effective filing date of the claimed invention to have a codeword including a plurality of hybrid automatic repeat request (HARQ) bits, decoding each of the plurality of HARQ bits, and a decoding rule that is based at least in part on posterior probabilities in the invention of Wong. The motivation to have the modification and/or well-known benefits of the modification include, but are not limited to, realizing physical data transmissions (using bits) and providing current metrics for communication decisions as is known in the art (Ghimire, fig. 8 and pages 7, 27 and 31-32; MPEP 2143(I)(A)(B)(C)(D) - note: e.g., applying known techniques having predictable results). Regarding claim 9, Wong in view of Ghimire teaches and makes obvious the network node of claim 1, wherein the threshold is tuned to achieve a first bit error rate (BER) associated with decoding ACK bits and a second BER associated with decoding NACK bits (Wong, figs. 7 and 9-11; paras. 17, 51, 53-55 and 57). Regarding claim 10, Wong in view of Ghimire teaches and makes obvious the network node of claim 1, wherein the threshold is tuned such that an ACK signal-to-noise ratio (SNR) at which a first bit error rate (BER) associated with decoding ACK bits is achieved is equal to a NACK SNR at which a second BER associated with decoding NACK bits is achieved (Wong, figs. 7 and 9-11; paras. 17, 51, 53-55 and 57; note: the SNR is equal for given error rates for ACK and NAK, i.e., a given SNR (vertical line) has an error rate for an ACK and NAK). Regarding claims 12 and 18, these limitations are rejected on the same ground as claims 1 and 9, respectively. Regarding claim 20, these limitations are rejected on the same ground as claim 1. In addition, Wong discloses a non-transitory computer-readable medium (para. 61) storing a set of instructions, the set of instructions comprising: one or more instructions that, when executed by one or more processors of the network node, cause the network node to perform the method of claim 1. Allowable Subject Matter Claims 2-8, 11, 13-17 and 19 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. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to Kevin Harper whose telephone number is 571-272-3166. The examiner can normally be reached weekdays from 11:00 AM to 7:00 PM ET. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner's supervisor, Yemane Mesfin, can be reached at 571-272-3927. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. For non-official communications, the examiner’s e-mail address is kevin.harper@uspto.gov (MPEP 502.03 – A copy of all received emails relating to an application including proposed amendments and excluding scheduling information for interviews will be placed informally into the application file). Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /Kevin C. Harper/ Primary Examiner, Art Unit 2462
Read full office action

Prosecution Timeline

Mar 20, 2024
Application Filed
Feb 21, 2026
Non-Final Rejection — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12603735
COMMUNICATION METHOD AND DEVICE FOR INDICATING RESOURCE UNITS, ELECTRONIC DEVICE, AND COMPUTER-READABLE STORAGE MEDIUM
2y 5m to grant Granted Apr 14, 2026
Patent 12593219
CARRIER AGGREGATION COMBINATION GENERATOR
2y 5m to grant Granted Mar 31, 2026
Patent 12563532
METHODS AND APPARATUS FOR SEARCH SPACE SWITCHING
2y 5m to grant Granted Feb 24, 2026
Patent 12557011
ASSOCIATION AND RE-ASSOCIATION REQUEST STATION STEERING UTILIZING CONTROLLER DIRECTION
2y 5m to grant Granted Feb 17, 2026
Patent 12543052
METHOD AND DEVICE FOR MEASUREMENT RELAXATION
2y 5m to grant Granted Feb 03, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

1-2
Expected OA Rounds
88%
Grant Probability
94%
With Interview (+5.6%)
2y 11m
Median Time to Grant
Low
PTA Risk
Based on 955 resolved cases by this examiner. Grant probability derived from career allow 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