Prosecution Insights
Last updated: April 19, 2026
Application No. 17/776,464

TERMINAL AND RADIO COMMUNICATION METHOD

Final Rejection §103
Filed
May 12, 2022
Examiner
NGUYEN, BAO G
Art Unit
2461
Tech Center
2400 — Computer Networks
Assignee
NTT Docomo Inc.
OA Round
5 (Final)
73%
Grant Probability
Favorable
6-7
OA Rounds
3y 5m
To Grant
76%
With Interview

Examiner Intelligence

Grants 73% — above average
73%
Career Allow Rate
256 granted / 350 resolved
+15.1% vs TC avg
Minimal +3% lift
Without
With
+3.3%
Interview Lift
resolved cases with interview
Typical timeline
3y 5m
Avg Prosecution
56 currently pending
Career history
406
Total Applications
across all art units

Statute-Specific Performance

§101
2.2%
-37.8% vs TC avg
§103
71.9%
+31.9% vs TC avg
§102
18.1%
-21.9% vs TC avg
§112
4.8%
-35.2% vs TC avg
Black line = Tech Center average estimate • Based on career data from 350 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 . Response to Arguments Applicant’s arguments, filed 01/28/26, with respect to the rejection(s) of claim(s) 7, 9-11 have been fully considered and are persuasive. Therefore, the rejection has been withdrawn. However, upon further consideration, a new ground(s) of rejection is made in view of Khoshnevisan (Pub No 20200351934) in view of Li (Pub No 20220224453), Ying (Pub No 20220377767), and newly cited Gerami (Pub No 20220386336). Regarding claim 7, Applicant argues that the prior art does not teach the amended limitation. The examiner relies on newly cited Gerami (Pub No 20220386336) which teaches the amended limitation. 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. Claim(s) 7-11 is/are rejected under 35 U.S.C. 103 as being unpatentable over Khoshnevisan (Pub No 20200351934) in view of Li (Pub No 20220224453), Ying (Pub No 20220377767), and and Gerami (Pub No 20220386336) Regarding claim 7 and 9, Khoshnevisan teaches A terminal comprising: a receiver that receives first information regarding one or more time domain resource allocation candidates notified by higher layer signaling (interpreted as For example, NR (e.g., NR Release 15) specifies that TDRA field indicates one of the entries of the higher layer parameter pusch-TimeDomainAllocationList, if this higher layer parameter is configured, see para [0065]) and second information regarding a certain time domain resource allocation candidate indicated by a time domain resource allocation field included in downlink control information; and (interpreted as In certain aspects, as the TDRA field of the DCI indicates one of the entries/rows from the TDRA table, see para [0064]. Wherein the TDRA candidates are interpreted as TDRA entries). a processor that determines, based on a number of the one or more time domain resource allocation candidates, a size of the time domain resource allocation field, (interpreted as the bit length of the TDRA field is a function of the number of rows in the TDRA table. For example, bit-width of the TDRA field is 4 bits for indicating each of the sixteen TDRA options from the default TDRA table as shown in FIG. 4A., see para [0064]. Examiner notes 16 TDRA rows/entries is 4 bits (e.g. 2 to the 4th power), 9 TDRA rows/entries is 3 bits (2 to the 3rd power), etc.) wherein each of the time domain resource allocation candidates has information regarding a start symbol and length (SLIV) of a downlink shared channel (interpreted as shown in FIG. 4A, for each TDRA option (e.g., each row), the table 400A defines a Row index, a mapping type, a slot offset (K.sub.2), a starting symbol (S) and an allocation length L…. Alternatively, the starting symbol S and the allocation length L may be indicated jointly as Start and Length Indicator Value (SLIV), see para [0059]). Also see Time-Domain Resource Allocation (TDRA) for transmissions (e.g., PUSCH/PDSCH transmissions) in a slot of an NR subframe, see para [0056]). However, Khoshnevisan does not teach and a number of repetitions, and a SLIV value corresponding to each number of repetitions can be configured separately. Li teaches and a number of repetitions, and a SLIV value corresponding to each number of repetitions can be configured separately. (interpreted as Optionally, the higher layer parameter used to indicate the quantity K of repetitions and the higher layer parameter used to indicate the TDRA table are two different parameters, and the quantity K of repetitions is applicable to all SLIVs in the TDRA table. Optionally, the higher layer parameter used to indicate the quantity K of repetitions and the higher layer parameter used to indicate the TDRA table are a same parameter. For example, each SLIV in the TDRA table is associated with one quantity K of repetitions, and quantities K of repetitions associated with different SLIVs may be the same or different. K is an integer, and K≥2, see para [0111]) It would have been obvious to one of ordinary skill in the art before the effective filing date of the invention to combine the SLIV taught by Khoshnevisan with the repetitions for SLIV taught by Li with the motivation being to configure the parameters for performing the communications. However Koshnevisan in view of Li does not teach wherein a number of the time domain resource allocation candidates corresponding to different numbers of repetitions can be configured separately. Ying teaches wherein a number of the time domain resource allocation candidates corresponding to different numbers of repetitions can be configured separately. (interpreted as TDRA table with number of repetitions is configured for a DCI format(s) (e.g., DCI format 0_1, DCI format 0_2, or DCI format 0_0), see para [0163]). Also see TIME DOMAIN RESOURC EALLOCATION LIST for DCI format 0_1 … number of repetitions INTEGER (0..8), see TABLE-US-00007) It would have been obvious to one of ordinary skill in the art before the effective filing date of the invention to combine the configuring of the TDRA taught by Khoshnevisan in view of Li with the configuring separately the repetitions of the TDRA taught by Ying the motivation being to configure the parameters for performing the communications. However Khoshnevisan in view of Li and Ying do not teach wherein the information regarding the number of repetitions indicates a value selected from a set of discrete values including a value indicating a number of repetitions greater than 8. Gerami teaches wherein the information regarding the number of repetitions indicates a value selected from a set of discrete values including a value indicating a number of repetitions greater than 8. (interpreted as repK can be chosen to be a set of values, i.e., repK={repKvalue1,repKvalue2,repKvalue3,repKvalue4}., e.g., repK.Math.{1,2,4,8}, or repK={1, 2, 4, 16}. Also see The process also includes selecting a number of repetitions from the set (Block S142), see para [0113]) It would have been obvious to one of ordinary skill in the art before the effective filing date of the invention to combine the number of repetitions taught by Khoshnevisan in view of Li and Ying with the increased number of repetitions as taught by Gerami the motivation being to improve reliability by using the more optimal number of repetitions. Regarding claim 8, Khoshnevisan teaches The terminal according to claim 7, however does not teach wherein a number of the time domain resource allocation candidates corresponding to different numbers of repetitions can be configured separately. Li teaches wherein a number of the time domain resource allocation candidates corresponding to different numbers of repetitions can be configured separately. (interpreted as Optionally, the higher layer parameter used to indicate the quantity K of repetitions and the higher layer parameter used to indicate the TDRA table are two different parameters, and the quantity K of repetitions is applicable to all SLIVs in the TDRA table. Optionally, the higher layer parameter used to indicate the quantity K of repetitions and the higher layer parameter used to indicate the TDRA table are a same parameter. For example, each SLIV in the TDRA table is associated with one quantity K of repetitions, and quantities K of repetitions associated with different SLIVs may be the same or different. K is an integer, and K≥2, see para [0111]) It would have been obvious to one of ordinary skill in the art before the effective filing date of the invention to combine the SLIV taught by Khoshnevisan with the repetitions for SLIV taught by Li since it would have been a simple modification providing expected results of indicating multiple transmissions. Regarding claim 10, Khoshnevisan teaches A base station comprising: a transmitter that transmits first information regarding one or more time domain resource allocation candidates notified by higher layer signaling (interpreted as For example, NR (e.g., NR Release 15) specifies that TDRA field indicates one of the entries of the higher layer parameter pusch-TimeDomainAllocationList, if this higher layer parameter is configured, see para [0065]) and second information regarding a certain time domain resource allocation candidate indicated by a time domain resource allocation field included in downlink control information; and (interpreted as In certain aspects, as the TDRA field of the DCI indicates one of the entries/rows from the TDRA table, see para [0064]. Wherein the TDRA candidates are interpreted as TDRA entries). a processor that determines, based on a number of the one or more time domain resource allocation candidates, a size of the time domain resource allocation field, (interpreted as the bit length of the TDRA field is a function of the number of rows in the TDRA table. For example, bit-width of the TDRA field is 4 bits for indicating each of the sixteen TDRA options from the default TDRA table as shown in FIG. 4A., see para [0064]. Examiner notes 16 TDRA rows/entries is 4 bits (e.g. 2 to the 4th power), 9 TDRA rows/entries is 3 bits (2 to the 3rd power), etc.) wherein each of the time domain resource allocation candidates has information regarding a start symbol and length (SLIV) of a downlink shared channel (interpreted as shown in FIG. 4A, for each TDRA option (e.g., each row), the table 400A defines a Row index, a mapping type, a slot offset (K.sub.2), a starting symbol (S) and an allocation length L…. Alternatively, the starting symbol S and the allocation length L may be indicated jointly as Start and Length Indicator Value (SLIV), see para [0059]). Also see Time-Domain Resource Allocation (TDRA) for transmissions (e.g., PUSCH/PDSCH transmissions) in a slot of an NR subframe, see para [0056]). However, Khoshnevisan does not teach and a number of repetitions, and a SLIV value corresponding to each number of repetitions can be configured separately. Li teaches and a number of repetitions, and a SLIV value corresponding to each number of repetitions can be configured separately. (interpreted as Optionally, the higher layer parameter used to indicate the quantity K of repetitions and the higher layer parameter used to indicate the TDRA table are two different parameters, and the quantity K of repetitions is applicable to all SLIVs in the TDRA table. Optionally, the higher layer parameter used to indicate the quantity K of repetitions and the higher layer parameter used to indicate the TDRA table are a same parameter. For example, each SLIV in the TDRA table is associated with one quantity K of repetitions, and quantities K of repetitions associated with different SLIVs may be the same or different. K is an integer, and K≥2, see para [0111]) It would have been obvious to one of ordinary skill in the art before the effective filing date of the invention to combine the SLIV taught by Khoshnevisan with the repetitions for SLIV taught by Li with the motivation being to configure the parameters for performing the communications. However Koshnevisan in view of Li does not teach wherein a number of the time domain resource allocation candidates corresponding to different numbers of repetitions can be configured separately. Ying teaches wherein a number of the time domain resource allocation candidates corresponding to different numbers of repetitions can be configured separately. (interpreted as TDRA table with numberofrepetitions is configured for a DCI format(s) (e.g., DCI format 0_1, DCI format 0_2, or DCI format 0_0), see para [0163]). Also see TIME DOMAIN RESOURC EALLOCATION LIST for DCI format 0_1 … number of repetitions INTEGER (0..8), see TABLE-US-00007) It would have been obvious to one of ordinary skill in the art before the effective filing date of the invention to combine the configuring of the TDRA taught by Khoshnevisan in view of Li with the configuring separately the repetitions of the TDRA taught by Ying the motivation being to configure the parameters for performing the communications. Regarding claim 11, Khoshnevisan teaches A system comprising a terminal and a base station, wherein the terminal comprises: a receiver that receives first information regarding one or more time domain resource allocation candidates notified by higher layer signaling (interpreted as For example, NR (e.g., NR Release 15) specifies that TDRA field indicates one of the entries of the higher layer parameter pusch-TimeDomainAllocationList, if this higher layer parameter is configured, see para [0065]) and second information regarding a certain time domain resource allocation candidate indicated by a time domain resource allocation field included in downlink control information; and (interpreted as In certain aspects, as the TDRA field of the DCI indicates one of the entries/rows from the TDRA table, see para [0064]. Wherein the TDRA candidates are interpreted as TDRA entries). a processor that determines, based on a number of the one or more time domain resource allocation candidates, a size of the time domain resource allocation field, (interpreted as the bit length of the TDRA field is a function of the number of rows in the TDRA table. For example, bit-width of the TDRA field is 4 bits for indicating each of the sixteen TDRA options from the default TDRA table as shown in FIG. 4A., see para [0064]. Examiner notes 16 TDRA rows/entries is 4 bits (e.g. 2 to the 4th power), 9 TDRA rows/entries is 3 bits (2 to the 3rd power), etc.) wherein each of the time domain resource allocation candidates has information regarding a start symbol and length (SLIV) of a downlink shared channel (interpreted as shown in FIG. 4A, for each TDRA option (e.g., each row), the table 400A defines a Row index, a mapping type, a slot offset (K.sub.2), a starting symbol (S) and an allocation length L…. Alternatively, the starting symbol S and the allocation length L may be indicated jointly as Start and Length Indicator Value (SLIV), see para [0059]). Also see Time-Domain Resource Allocation (TDRA) for transmissions (e.g., PUSCH/PDSCH transmissions) in a slot of an NR subframe, see para [0056]). However, Khoshnevisan does not teach and a number of repetitions, and a SLIV value corresponding to each number of repetitions can be configured separately. Li teaches and a number of repetitions, and a SLIV value corresponding to each number of repetitions can be configured separately. (interpreted as Optionally, the higher layer parameter used to indicate the quantity K of repetitions and the higher layer parameter used to indicate the TDRA table are two different parameters, and the quantity K of repetitions is applicable to all SLIVs in the TDRA table. Optionally, the higher layer parameter used to indicate the quantity K of repetitions and the higher layer parameter used to indicate the TDRA table are a same parameter. For example, each SLIV in the TDRA table is associated with one quantity K of repetitions, and quantities K of repetitions associated with different SLIVs may be the same or different. K is an integer, and K≥2, see para [0111]) It would have been obvious to one of ordinary skill in the art before the effective filing date of the invention to combine the SLIV taught by Khoshnevisan with the repetitions for SLIV taught by Li with the motivation being to configure the parameters for performing the communications. However Koshnevisan in view of Li does not teach wherein a number of the time domain resource allocation candidates corresponding to different numbers of repetitions can be configured separately. Ying teaches wherein a number of the time domain resource allocation candidates corresponding to different numbers of repetitions can be configured separately. (interpreted as TDRA table with numberofrepetitions is configured for a DCI format(s) (e.g., DCI format 0_1, DCI format 0_2, or DCI format 0_0), see para [0163]). Also see TIME DOMAIN RESOURC EALLOCATION LIST for DCI format 0_1 … number of repetitions INTEGER (0..8), see TABLE-US-00007) It would have been obvious to one of ordinary skill in the art before the effective filing date of the invention to combine the configuring of the TDRA taught by Khoshnevisan in view of Li with the configuring separately the repetitions of the TDRA taught by Ying the motivation being to configure the parameters for performing the communications. 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 BAO G NGUYEN whose telephone number is (571)272-7732. The examiner can normally be reached M-F 10pm - 6: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, Huy Vu can be reached on 571-272-3155. 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. /BAO G NGUYEN/Examiner, Art Unit 2461 /HUY D VU/Supervisory Patent Examiner, Art Unit 2461
Read full office action

Prosecution Timeline

May 12, 2022
Application Filed
Jun 14, 2024
Non-Final Rejection — §103
Sep 20, 2024
Response Filed
Dec 26, 2024
Non-Final Rejection — §103
Apr 02, 2025
Response Filed
Jul 18, 2025
Final Rejection — §103
Sep 22, 2025
Response after Non-Final Action
Oct 27, 2025
Non-Final Rejection — §103
Jan 28, 2026
Response Filed
Mar 10, 2026
Final Rejection — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12593346
UPLINK INDICATION FOR FULL-DUPLEX OPERATION
2y 5m to grant Granted Mar 31, 2026
Patent 12587485
Adaptive Buffering in a Distributed System with Latency/Adaptive Tail Drop
2y 5m to grant Granted Mar 24, 2026
Patent 12532213
Communication Coordination and Reduced Processing Techniques for Enhanced Quality of Service Procedures
2y 5m to grant Granted Jan 20, 2026
Patent 12520165
METHOD BY WHICH UE PERFORMS INITIAL ACCESS TO BASE STATION IN WIRELESS COMMUNICATION SYSTEM, AND DEVICE THEREFOR
2y 5m to grant Granted Jan 06, 2026
Patent 12513742
CHANNEL DETECTION METHOD, COMMUNICATION DEVICE, AND STORAGE MEDIUM
2y 5m to grant Granted Dec 30, 2025
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

6-7
Expected OA Rounds
73%
Grant Probability
76%
With Interview (+3.3%)
3y 5m
Median Time to Grant
High
PTA Risk
Based on 350 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