Prosecution Insights
Last updated: April 19, 2026
Application No. 18/352,832

PDCCH REPETITION TRANSMISSION CONFIGURATION METHOD AND RELATED APPARATUS

Final Rejection §103
Filed
Jul 14, 2023
Examiner
NGUYEN, STEVEN H D
Art Unit
2414
Tech Center
2400 — Computer Networks
Assignee
Huawei Technologies Co., Ltd.
OA Round
2 (Final)
80%
Grant Probability
Favorable
3-4
OA Rounds
3y 4m
To Grant
92%
With Interview

Examiner Intelligence

Grants 80% — above average
80%
Career Allow Rate
757 granted / 945 resolved
+22.1% vs TC avg
Moderate +12% lift
Without
With
+11.8%
Interview Lift
resolved cases with interview
Typical timeline
3y 4m
Avg Prosecution
40 currently pending
Career history
985
Total Applications
across all art units

Statute-Specific Performance

§101
7.4%
-32.6% vs TC avg
§103
44.0%
+4.0% vs TC avg
§102
23.6%
-16.4% vs TC avg
§112
14.0%
-26.0% vs TC avg
Black line = Tech Center average estimate • Based on career data from 945 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 . 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) 21, 24-28, 31-35 and 38-40 is/are rejected under 35 U.S.C. 103 as being unpatentable over Grossmann [US 2023/0125672] in view of Khoshnevisan [US 2022/0225319]. As claims 21, 28 and 35, Grossmann [US 2023/0125672] discloses an apparatus, comprising: at least one processor, configured to: receive/generating a first message, wherein the first message comprises information of a configuration that is related to physical downlink control channel (PDCCH) repetition transmission [Par. 0110 discloses Base station send configuration information to UE to how to pair the PDCCH candidates sequences into the sets of PDCCH candidates for transmission repetitions], the configuration that is related to the PDCCH repetition transmission is configured for determining M groups of PDCCH candidate sequences, each group of PDCCH candidate sequences of the M groups of PDCCH candidate sequences comprises 2 PDCCH candidates, the 2 PDCCH candidates of each group of PDCCH candidate sequences associated with for sending same downlink control information [Par. 0126-0127, 0130, 0302 discloses a group of two PDCCH candidate sequences which carries a same DCI content, from multiple groups of two of PDCCH candidate sequences], the 2 PDCCH candidates of each group of PDCCH candidate sequences are separately located on different symbols [Par. 0126 discloses pair of PDCCH multiplexed into slot or different slot “symbols”], M is a positive integer [Par. 0127, M is integer], and wherein each PDCCH candidate in the M groups of PDCCH candidate sequences meets a first condition [Par. 0146-0151, 0230, 0307 discloses PDCCH candidates in the group meet condition such as no overlap, capability decoding the PDCCH repetitions, group limitation based on capability of UE]; and parse/sending the first message [Fig 8]. However, Grossmann fails to discloses the first message comprises information of a configuration that is related to parameters for reception of physical downlink control channel (PDCCH) repetition transmission, the configuration that is related to the parameters for the reception of the PDCCH repetition transmission is configured for associated with determining M groups of PDCCH candidate sequences. In the same field of endeavor, Khoshnevisan [US 2022/0225319] discloses the first message comprises information of a configuration that is related to parameters for reception of physical downlink control channel (PDCCH) repetition transmission, the configuration that is related to the parameters for the reception of the PDCCH repetition transmission is configured for associated with determining M groups of PDCCH candidate sequences [Fig 3, Ref 105 send a configuration message [Fig 3, Ref 310-320] includes information that related to the parameters [Fig 3, Ref 305] for receiving of PDCCH candidates wherein the PDCCH candidates form into the groups wherein each group includes two PDCCH candidates which includes same DCI, Fig 2 discloses intra-slot each PDCCH is at different symbol]. Since, Grossmann [US 2023/0125672] suggests the use of intra-slot and UE’s capability. Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of claimed invention to apply a method and system comprising the first message comprises information of a configuration that is related to parameters for reception of physical downlink control channel (PDCCH) repetition transmission, the configuration that is related to the parameters for the reception of the PDCCH repetition transmission is configured for associated with determining M groups of PDCCH candidate sequences as disclosed by Khoshnevisan into the teaching of Grossmann [US 2023/0125672]. The motivation would have been to provide a reliability communication. As claims 24, 31 and 38, Grossmann [US 2023/0125672] implicitly discloses a total quantity of control channel elements (CCEs) corresponding to the M groups of PDCCH candidate sequences is less than or equal to a preset first value [Par. 0132, 0134 discloses each PDCCH in a group is mapped to one CCE; So AL-1 – AL-16 has 34 CCEs which is mapped 17 groups of PDCCHs. Total CCEs 34 corresponds to 17 groups of PDCCHs is equal preset value such as 34], and each PDCCH candidate comprises one or more CCEs [Par. 0282]. As claims 25, 32 and 39, Grossmann [US 2023/0125672] discloses the total quantity of CCEs corresponding to the M groups of PDCCH candidate sequences is a sum of a quantity of CCEs corresponding to the first PDCCH candidate in each group of PDCCH candidate sequences in the M groups of PDCCH candidate sequences is first preset value [Par. 0132, 0134 discloses each PDCCH in a group is mapped to one CCE; So AL-1 – AL-16 has 34 CCEs which is mapped 17 groups of PDCCHs. Total CCEs of the first PDCCH candidate of groups of PDCCHs is equal preset value such as 17]. As claims 26, 33 and 40, Khoshnevisan discloses before receiving the first message, send a second message, wherein the second message comprises a capability that is supported by a terminal device and that is related to the parameters for the reception of the PDCCH repetition transmission [Fig 3, Ref 305], and the capability that is supported by the terminal device and that is related to the parameters for the reception of the PDCCH repetition transmission is associated determining the first condition [Fig 3, Ref 305 UE supports decoding and combining the PDCCH repetition according the reported capability, Par. 0061]. As claims 27 and 34, Grossmann [US 2023/0125672] discloses the capability that is supported by the terminal device and that is related to the PDCCH repetition transmission [Par. 0209 with G groups of PDCCH candidates] comprises a total quantity of CCEs corresponding to each group of PDCCH candidate sequences of the M groups of PDCCH candidate sequences is a preset first value [Par. 0132, 0134 discloses each PDCCH in a group is mapped to one CCE; So AL-1 – AL-16 has 34 CCEs which is mapped 17 groups of PDCCHs. Total CCEs of each of groups of PDCCHs is preset value such as two]. Claim(s) 22-23, 29-30 and 36-37 is/are rejected under 35 U.S.C. 103 as being unpatentable over Grossmann [US 2023/0125672] and Khoshnevisan [US 2022/0225319] as applied to claims 21, 28, 35 above, and further in view of Takahashi [US 2023/0362956]. As claims 22, 29 and 36, Grossmann [US 2023/0125672] and Khoshnevisan [US 2022/0225319] fail to disclose what Takahashi [US 2023/0362956] discloses the first condition comprises a time interval between the 2 PDCCH candidates in each group of PDCCH candidate sequences of the M groups of PDCCH candidate sequences comprises is less than 7 orthogonal frequency division multiplexing (OFDM) symbols [Fig 6-8, the spacing between the first and second is less than 7 symbols, Par. 0081]. Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of claimed invention to apply a method and system comprising spacing between the repetitions PDCCH candidates as disclosed by Takahashi into the teaching of Grossmann [US 2023/0125672] and Khoshnevisan [US 2022/0225319]. The motivation would have been to prevent data loss. As claims 23, 30 and 37, Grossmann [US 2023/0125672] and Khoshnevisan [US 2022/0225319] fail to disclose what Takahashi [US 2023/0362956] discloses the time interval between the 2 PDCCH candidates in each group of PDCCH candidate sequences of the M groups of PDCCH candidate sequences is between a start symbol of a first PDCCH candidate in the 2 PDCCH candidates and an end symbol of a 2nd PDCCH candidate in the 2 PDCCH candidates, and each PDCCH candidate occupies one or more symbols [Fig 6-8, each of the first and second PDCCH occupies one symbol, spacing between the start symbol of first and end symbol of the second PDCCH, Par. 0081]. Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of claimed invention to apply a method and system comprising spacing between the repetitions PDCCH candidates as disclosed by Takahashi into the teaching of Grossmann [US 2023/0125672] and Khoshnevisan [US 2022/0225319]. The motivation would have been to prevent data loss. 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 nonprovisional extension fee (37 CFR 1.17(a)) 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 mailing date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to STEVEN HIEU D NGUYEN whose telephone number is (571)272-3159. The examiner can normally be reached 9-5. 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, Edan Orgad can be reached at 571-272-7884. 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. /STEVEN HIEU D NGUYEN/Primary Examiner, Art Unit 2414
Read full office action

Prosecution Timeline

Jul 14, 2023
Application Filed
Sep 12, 2023
Response after Non-Final Action
Dec 03, 2025
Non-Final Rejection — §103
Mar 09, 2026
Response Filed
Mar 23, 2026
Final Rejection — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12603799
SYSTEM AND METHOD FOR URSP-BASED TUNNELING THROUGH FIXED WIRELESS ACCESS
2y 5m to grant Granted Apr 14, 2026
Patent 12587933
METHOD AND DEVICE FOR TRANSMITTING AND RECEIVING DATA IN WIRELESS COMMUNICATION SYSTEM
2y 5m to grant Granted Mar 24, 2026
Patent 12587882
RECEPTION USING TRANSMISSION SPUR FREQUENCY LOCATIONS
2y 5m to grant Granted Mar 24, 2026
Patent 12587931
CONNECTION DESTINATION SWITCHING CONTROL METHOD, COMMUNICATION APPARATUS AND PROGRAM
2y 5m to grant Granted Mar 24, 2026
Patent 12588079
METHOD AND APPARATUS FOR SPATIAL SETTING DETERMINATION DURING A RANDOM ACCESS PROCEDURE
2y 5m to grant Granted Mar 24, 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

3-4
Expected OA Rounds
80%
Grant Probability
92%
With Interview (+11.8%)
3y 4m
Median Time to Grant
Moderate
PTA Risk
Based on 945 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