Prosecution Insights
Last updated: April 19, 2026
Application No. 18/386,276

REPETITION INDICATION FOR PUCCH HACK-ACK FOR MSG4

Non-Final OA §103
Filed
Nov 02, 2023
Examiner
COBY, FRANTZ
Art Unit
2459
Tech Center
2400 — Computer Networks
Assignee
MediaTek Inc.
OA Round
1 (Non-Final)
91%
Grant Probability
Favorable
1-2
OA Rounds
2y 7m
To Grant
95%
With Interview

Examiner Intelligence

Grants 91% — above average
91%
Career Allow Rate
664 granted / 732 resolved
+32.7% vs TC avg
Minimal +5% lift
Without
With
+4.7%
Interview Lift
resolved cases with interview
Typical timeline
2y 7m
Avg Prosecution
16 currently pending
Career history
748
Total Applications
across all art units

Statute-Specific Performance

§101
7.7%
-32.3% vs TC avg
§103
38.6%
-1.4% vs TC avg
§102
24.9%
-15.1% vs TC avg
§112
12.0%
-28.0% vs TC avg
Black line = Tech Center average estimate • Based on career data from 732 resolved cases

Office Action

§103
DETAILED ACTION 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 . This Office Action is in response to Application filed on November 02, 2023 in which claims 1-20 are presented for examination. Claim Rejections - 35 USC § 103 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. 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. Claim(s) 1 and 18-20 is/are rejected under 35 U.S.C. 103 as being unpatentable over TAKEDA KAZUKI et al. EP 3962159A1 in view of YANG et al. US 2019/0363832A1. Regarding claim 1, TAKEDA KAZUKI et al. disclose “a method of wireless communication of a user equipment (UE)” by providing a user terminal and a radio communication method in a next-generation mobile communication system (See Title; Paragraph 0001), comprising: “receiving, from a base station, a common configuration indicating a set of candidate repetition factors for physical uplink control channel (PUCCH) transmissions” (Paragraph 0038 describing in Fig. 2, the UE receives information indicating the repetition factor K (for example, aggregationFactorUL or aggregationFactorDL) by higher layer layer signaling. In this case, the UE controls the repetition reception of each PDSCH or the repetition transmission of each PUSCH based on the semi-statically configured repetition factor K); “determining a particular repetition factor based on the common configuration” (Paragraph 0010 describing a reception section that receives information regarding one or more repetition factor candidates that are configured corresponding to a time domain resource allocated to a physical shared channel; and a control section that selects a specific repetition factor candidate based on a codepoint of a given field included in downlink control information used for scheduling the physical shared channel). It is noted however, TAKEDA KAZUKI et al. did not specifically detail the aspects of “receiving, from the base station, a contention resolution message in a random access procedure; and transmitting an acknowledgement (ACK) or negative acknowledgement (NACK) of the contention resolution message in a PUCCH in accordance with the particular repetition factor” as recited in the instant claim 1. On the other hand, YANG et al. achieved the aforementioned claimed features (See YANG et al. (Figures 8, 9, 12; Paragraphs 0025, 0027, 0089-0093, 0098-0099). It would have been obvious to one of ordinary skill in the art before the effective filing date of the invention to have incorporated the ACK/NACK (Uplink Acknowledgement/Negative Acknowledgement) transmission mechanism of YANG et al. into the communication system of TAKEDA KAZUKI et al. because that would have enhanced the versatility of YANG et al. by allowing it to effectively performing operations of transmission and reception of a wireless signal. Regarding claim 18, TAKEDA KAZUKI et al. disclose “an apparatus for wireless communication, the apparatus being a user equipment (UE), comprising: a memory; and at least one processor coupled to the memory” by providing a user terminal and a radio communication method in a next-generation mobile communication system (See Title; Paragraph 0001), and configured to: “receive, from a base station, a common configuration indicating a set of candidate repetition factors for physical uplink control channel (PUCCH) transmissions” (Paragraph 0038 describing in Fig. 2, the UE receives information indicating the repetition factor K (for example, aggregationFactorUL or aggregationFactorDL) by higher layer layer signaling. In this case, the UE controls the repetition reception of each PDSCH or the repetition transmission of each PUSCH based on the semi-statically configured repetition factor K); “receive, from the base station, a specific configuration for selecting a particular repetition factor from the set of candidate repetition factors or a set of default candidate repetition factors” (Paragraph 0038 describing in Fig. 2, the UE receives information indicating the repetition factor K (for example, aggregationFactorUL or aggregationFactorDL) by higher layer layer signaling. In this case, the UE controls the repetition reception of each PDSCH or the repetition transmission of each PUSCH based on the semi-statically configured repetition factor K); “determine the particular repetition factor based on the common configuration and/or the specific configuration” (Paragraph 0010 describing a reception section that receives information regarding one or more repetition factor candidates that are configured corresponding to a time domain resource allocated to a physical shared channel; and a control section that selects a specific repetition factor candidate based on a codepoint of a given field included in downlink control information used for scheduling the physical shared channel). It is noted however, TAKEDA KAZUKI et al. did not specifically detail the aspects of “receive, from the base station, a contention resolution message in a random access procedure; and transmit an acknowledgement (ACK) or negative acknowledgement (NACK) of the contention resolution message in a PUCCH in accordance with the particular repetition factor” as recited in the instant claim 18. On the other hand, YANG et al. achieved the aforementioned claimed features (See YANG et al. (Figures 8, 9, 12; Paragraphs 0025, 0027, 0089-0093, 0098-0099). It would have been obvious to one of ordinary skill in the art before the effective filing date of the invention to have incorporated the ACK/NACK (Uplink Acknowledgement/Negative Acknowledgement) transmission mechanism of YANG et al. into the communication system of TAKEDA KAZUKI et al. because that would have enhanced the versatility of YANG et al. by allowing it to effectively performing operations of transmission and reception of a wireless signal. As per claims 19, TAKEDA KAZUKI et al. disclose “wherein the common configuration is received in a system information block (SIB)” (See TAKEDA KAZUKI et al. describing synchronization signal may be, for example, at least one of a primary synchronization signal (PSS) and a secondary synchronization signal (SSS). A signal block including SS (PSS or SSS) and PBCH (and DMRS for PBCH) may be referred to as an SS/PBCH block, an SS Block (SSB), and the like. Note that the SS, the SSB, or the like may also be referred to as a reference signal). Regarding claim 20, TAKEDA KAZUKI et al. disclose “a computer-readable medium storing computer executable code for wireless communication of a user equipment (UE)” by providing a user terminal and a radio communication method in a next-generation mobile communication system (See Title; Paragraph 0001), comprising code to: “receive, from a base station, a common configuration indicating a set of candidate repetition factors for physical uplink control channel (PUCCH) transmissions” (Paragraph 0038 describing in Fig. 2, the UE receives information indicating the repetition factor K (for example, aggregationFactorUL or aggregationFactorDL) by higher layer layer signaling. In this case, the UE controls the repetition reception of each PDSCH or the repetition transmission of each PUSCH based on the semi-statically configured repetition factor K); “receive, from the base station, a specific configuration for selecting a particular repetition factor from the set of candidate repetition factors or a set of default candidate repetition factors” (Paragraph 0038 describing in Fig. 2, the UE receives information indicating the repetition factor K (for example, aggregationFactorUL or aggregationFactorDL) by higher layer layer signaling. In this case, the UE controls the repetition reception of each PDSCH or the repetition transmission of each PUSCH based on the semi-statically configured repetition factor K); “determine the particular repetition factor based on the common configuration and/or the specific configuration” (Paragraph 0010 describing a reception section that receives information regarding one or more repetition factor candidates that are configured corresponding to a time domain resource allocated to a physical shared channel; and a control section that selects a specific repetition factor candidate based on a codepoint of a given field included in downlink control information used for scheduling the physical shared channel). It is noted however, TAKEDA KAZUKI et al. did not specifically detail the aspects of “receive, from the base station, a contention resolution message in a random access procedure; and transmit an acknowledgement (ACK) or negative acknowledgement (NACK) of the contention resolution message in a PUCCH in accordance with the particular repetition faction” as recited in the instant claim 20. On the other hand, YANG et al. achieved the aforementioned claimed features (See YANG et al. (Figures 8, 9, 12; Paragraphs 0025, 0027, 0089-0093, 0098-0099). It would have been obvious to one of ordinary skill in the art before the effective filing date of the invention to have incorporated the ACK/NACK (Uplink Acknowledgement/Negative Acknowledgement) transmission mechanism of YANG et al. into the communication system of TAKEDA KAZUKI et al. because that would have enhanced the versatility of YANG et al. by allowing it to effectively performing operations of transmission and reception of a wireless signal. Allowable Subject Matter Claims 2-17 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. The following is a statement of reasons for the indication of allowable subject matter: the prior art of record failed to show “receiving, from the base station, a specific configuration for selecting the particular repetition factor from the set of candidate repetition factors or a set of default candidate repetition factors, wherein the particular repetition factor is determined based on the common configuration and/or the specific configuration, wherein the set of candidate repetition factors is the common configuration received from the base station, and the set of default candidate repetition factors is predefined configuration”. These claimed features would render the claim 2 allowable if rewritten in independent form including all of the limitations of the base claims 1, 18 and 20 and any intervening claims. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to FRANTZ COBY whose telephone number is (571)272-4017. The examiner can normally be reached Monday-Thursday 7AM-5:30PM. 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, Tonia Dollinger can be reached at (571) 272-4170. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. 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. /FRANTZ COBY/Primary Examiner, Art Unit 2459 February 10, 2026
Read full office action

Prosecution Timeline

Nov 02, 2023
Application Filed
Feb 12, 2026
Non-Final Rejection — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12603825
MULTI-INSTRUMENT, MULTI-TECHNICIAN, AND MULTI-JOB INTEGRATION IN A TEST PROCESS AUTOMATION SYSTEM FOR NETWORKS
2y 5m to grant Granted Apr 14, 2026
Patent 12598132
DATA OBTAINING METHOD AND APPARATUS, DEVICE, AND STORAGE MEDIUM
2y 5m to grant Granted Apr 07, 2026
Patent 12598123
OPERATIONAL STATISTICS ENCODING AND MAPPING IN NETWORK NODES
2y 5m to grant Granted Apr 07, 2026
Patent 12598107
Network Slice Quota Management Enhancements
2y 5m to grant Granted Apr 07, 2026
Patent 12580817
CONFLICT MITIGATION OF A RADIO ACCESS NETWORK
2y 5m to grant Granted Mar 17, 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
91%
Grant Probability
95%
With Interview (+4.7%)
2y 7m
Median Time to Grant
Low
PTA Risk
Based on 732 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