Prosecution Insights
Last updated: April 19, 2026
Application No. 18/695,925

METHOD AND COMMUNICATION DEVICE FOR DETERMINING RANDOM ACCESS RESPONSE WINDOW

Non-Final OA §103
Filed
Mar 27, 2024
Examiner
GEORGE, AYANAH S
Art Unit
2467
Tech Center
2400 — Computer Networks
Assignee
BEIJING XIAOMI MOBILE SOFTWARE CO., LTD.
OA Round
1 (Non-Final)
86%
Grant Probability
Favorable
1-2
OA Rounds
2y 5m
To Grant
93%
With Interview

Examiner Intelligence

Grants 86% — above average
86%
Career Allow Rate
431 granted / 498 resolved
+28.5% vs TC avg
Moderate +6% lift
Without
With
+6.1%
Interview Lift
resolved cases with interview
Typical timeline
2y 5m
Avg Prosecution
31 currently pending
Career history
529
Total Applications
across all art units

Statute-Specific Performance

§101
4.1%
-35.9% vs TC avg
§103
55.3%
+15.3% vs TC avg
§102
23.8%
-16.2% vs TC avg
§112
11.1%
-28.9% vs TC avg
Black line = Tech Center average estimate • Based on career data from 498 resolved cases

Office Action

§103
DETAILED ACTION This action is a response to an application filed on 3/27/2024 in which claims 1-8 and 17-28 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 . Claim Objections Claims 26 and 28 are objected to under 37 CFR 1.75 as being a substantial duplicate of claim 19. When two claims in an application are duplicates or else are so close in content that they both cover the same thing, despite a slight difference in wording, it is proper after allowing one claim to object to the other as being a substantial duplicate of the allowed claim. See MPEP § 608.01(m). 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) 1-4, 7, 8, 17-19, 21-23 and 25-28 is/are rejected under 35 U.S.C. 103 as being unpatentable over Lu et al. (WO 2021/016773 A1), herein Lu and Shin et al. (Pub. No.: 2019/0373646), herein Shin. As to claim 1, Lu teaches a method for determining a random access response window, comprising: obtaining a round-trip time (RTT) between a first device and a second device (Lu [0113] The terminal device with the positioning capability may estimate a distance between the location of the terminal device and the network device based on its own positioning capability, to determine the RTT); and determining a start position of the random access response window (Lu [0133] Step S602: The terminal device determines the start time of the RAR time window based on the offset) Lu does not teach obtaining a number of repeated transmissions of a narrowband physical random access channel (NPRACH) However Shin does teach obtaining a number of repeated transmissions of a narrowband physical random access channel (NPRACH) (Shin [0802] The processor of the UE controls the receiver to receive NPRACH configuration information including control information for the number of repeated NPRACH preambles including symbol groups from the eNB through upper layer signaling. The upper layer signaling may be RRC signaling); It would have been obvious before the effective filing date of the claimed invention to combine the teachings of Lu and Shin, because Shin teaches us [0497] When the corresponding method is used, it is advantageous in that since the preamble is continuously repeatedly transmitted by the pre-configured repetition number regardless of the number of invalid UL subframes which exist in the NPRACH resource, initially anticipated performance is maintained in terms of the NPRACH reliability. As to claim 17, Lu teaches a communication device, and one or more processors that are communicatively coupled to the memory, wherein the one or more processors are collectively configured to: obtain a round-trip time (RTT) between a first device and a second device (Lu [0113] The terminal device with the positioning capability may estimate a distance between the location of the terminal device and the network device based on its own positioning capability, to determine the RTT); and determine a start position of a random access response window (Lu [0133] Step S602: The terminal device determines the start time of the RAR time window based on the offset) Lu does not teach obtain a number of repeated transmissions of a narrowband physical random access channel (NPRACH) However Shin does teach obtain a number of repeated transmissions of a narrowband physical random access channel (NPRACH) (Shin [0802] The processor of the UE controls the receiver to receive NPRACH configuration information including control information for the number of repeated NPRACH preambles including symbol groups from the eNB through upper layer signaling. The upper layer signaling may be RRC signaling); It would have been obvious before the effective filing date of the claimed invention to combine the teachings of Lu and Shin for the same reasons stated in claim 1. As to claim 18, Lu teaches a communication device comprising: one or more processors (Lu Fig. 16); and an interface circuit (Lu Fig. 16); wherein the interface circuit is configured to receive code instructions and transmitting the code instructions to at least one of the one or more processors (Lu Fig. 16); and wherein the one or more processors are collectively configured to: obtain around-trip time (RTT) between a first device and a second device (Lu [0113] The terminal device with the positioning capability may estimate a distance between the location of the terminal device and the network device based on its own positioning capability, to determine the RTT); and determine a start position of a random access response window (Lu [0133] Step S602: The terminal device determines the start time of the RAR time window based on the offset) Lu does not teach obtain a number of repeated transmissions of a narrowband physical random access channel (NPRACH) However Shin does teach obtain a number of repeated transmissions of a narrowband physical random access channel (NPRACH) (Shin [0802] The processor of the UE controls the receiver to receive NPRACH configuration information including control information for the number of repeated NPRACH preambles including symbol groups from the eNB through upper layer signaling. The upper layer signaling may be RRC signaling); It would have been obvious before the effective filing date of the claimed invention to combine the teachings of Lu and Shin for the same reasons stated in claim 1. As to claim 2, the combination of Lu and Shin teach the method according to claim 1, wherein determining the start position of the random access response window comprises: determining the start position of the random access response window according to the RTT, wherein the number of repeated transmissions of the NPRACH is less than a preset threshold (Lu [0133] Step S602: The terminal device determines the start time of the RAR time window based on the offset) Claim 21 is rejected for the same reasons stated in claim 2. As to claim 3, the combination of Lu and Shin teach the method according to claim 1, wherein determining the start position of the random access response window comprises: obtaining a preset value (Lu [0133] Step S602: The terminal device determines the start time of the RAR time window based on the offset); and determining the start position of the random access response window based on the RTT and the preset value, wherein the number of repeated transmissions of the NPRACH is greater than or equal to a preset threshold (Lu [0133] Step S602: The terminal device determines the start time of the RAR time window based on the offset) Claim 22 is rejected for the same reasons stated in claim 3. As to claim 4, the combination of Lu and Shin teach the method according to claim 2, wherein the start position of the random access response window is: a subframe n+ the RTT, the n being an integer (Lu [0134] The start time is a first physical downlink control channel PDCCH occasion after a reference time, and the reference time is an offset after a time delay of sending a random access request by the terminal device. Claim 23 is rejected for the same reasons stated in claim 4. As to claim 7, the combination of Lu and Shin teach the method according to claim 1, wherein the first device is a terminal device and the second device is a network device (Lu [0113] The terminal device with the positioning capability may estimate a distance between the location of the terminal device and the network device based on its own positioning capability, to determine the RTT); As to claim 8, the combination of Lu and Shin teach the method according to claim 1, wherein the first device is a network device and the second device is a terminal device (Lu [0113] The terminal device with the positioning capability may estimate a distance between the location of the terminal device and the network device based on its own positioning capability, to determine the RTT); As to claim 19, the combination of Lu and Shin teach the non-transitory computer-readable storage medium for storing instructions which, the instructions when the instructions are executed by a processors, cause the processor to execute the method according to claim 1 (Lu Fig. 16) As to claim 25, the combination of Lu and Shin teach the wireless system for determining a random access response window, the system comprising the communication device according to claim 17 (Lu Fig. 16) As to claim 26, the combination of Lu and Shin teach a non-transitory computer program product comprising a computer program which, when executed by a computer, causes the computer to perform the method according to claim 1 (Lu Fig. 16) As to claim 27, the combination of Lu and Shin teach a chip system, comprising: at least one processor and interfaces, the chip system being configured to perform the method according to claim 1 (Lu Fig. 16) As to claim 28, the combination of Lu and Shin teach a non-transitory computer program which, when executed by a computer, causes the computer to perform the method according to claim 1 (Lu Fig. 16) Claim(s) 5 and 24 is/are rejected under 35 U.S.C. 103 as being unpatentable over Lu, Shin and Miao et al. (Pub. No.: 2022/0386263), herein Miao. As to claim 5, Shin and Lu teach the method according to claim 3, Lu nor Shin teach wherein the start position of the random access response window is: a subframe n+ max {the RTT, the preset value}, the n being an integer However Miao does teach wherein the start position of the random access response window is: a subframe n+ max {the RTT, the preset value}, the n being an integer (Miao Fig. 9 and The starting time of the RAR window is a moment after delaying a sending moment of a random access preamble (Msg1 message) sent by the terminal by at least a reference RTT time length, and the duration of the RAR window is equal to a sum of a difference value between a maximum RTT and a reference RTT and a processing delay of a base station) It would have been obvious before the effective filing date of the claimed invention to combine the teachings of Lu, Shin and Miao, because Miao teaches us [0126] In order to facilitate comparison, in an example, a terminal (terminal 1) closest to the base station and a terminal (terminal 2) furthest from the base station send the Msg1 message at the same moment. An RAR message (shown as Msg2_1 in the figure) sent to the terminal 1 by the base station and an RAR message (shown as Msg2_2 in the figure) sent to the terminal 2 by the base station are inconsistent in arrival time. A time length between a moment of sending the Msg2_1 message to the terminal 1 by the base station and a moment of sending the Msg1 message by the terminal 1 is roughly a sum of a time length of a minimum RTT and a processing delay of a the base station, and a time length between a moment of sending the Msg2_2 message to the terminal 2 by the base station and a moment of sending the Msg1 message by the terminal 2 is roughly a sum of a time length of a maximum RTT and a processing delay of a base station. Claim 24 is rejected for the same reasons stated in claim 5. Claim(s) 6 and 20 is/are rejected under 35 U.S.C. 103 as being unpatentable over Lu, Shin and Shin2 et al. (Pub. No.: 2021/0314925), herein Shin2 As to claim 6, Lu and Shin teach the method according to claim 4, Lu nor Shin teach Wherein a last subframe comprising a repeated transmission of the NPRACH is the subframe n However Shin2 does teach Wherein a last subframe comprising a repeated transmission of the NPRACH is the subframe n (Shin2 [0409] The time window (or RAR window) starts at subframe (SF)+3 subframe (SF) of a last preamble) It would have been obvious before the effective filing date of the claimed invention to combine the teachings of Lu, Shin and Shin2, because Shin2 teaches us [0410] When the preamble transmission is unsuccessful, for example, when the associated RAR message is not received, the UE transmits another preamble. Such an operation is performed up to a maximum number, and the maximum number depends on a CE level. When the RAR is not received even though the preamble is transmitted at the maximum number, the UE performs the corresponding operation at a next (i.e., higher) CE level. When the total number of access attempt is reached, the associated failure is reported to the RRC. Through the RAR, the UE acquires a temporary C-RNTI, a timing advance command, etc. The MSG3 is temporally aligned and required for transmission through the NPUSCH. The RAR provides a UL grant including all related data for transmission of the MSG3. Claim 20 is rejected for the same reasons stated in claim 6. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to AYANAH S GEORGE whose telephone number is (571)272-8880. The examiner can normally be reached 7:00 AM - 5:00 PM. 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, Hassan Phillips can be reached at 572-272-3940. 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. AYANAH S. GEORGE Primary Examiner Art Unit 2467 /AYANAH S GEORGE/Primary Examiner, Art Unit 2467
Read full office action

Prosecution Timeline

Mar 27, 2024
Application Filed
Mar 01, 2026
Non-Final Rejection — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12604234
WIRELESS COMMUNICATION METHOD, NETWORK ELEMENT, AND DEVICE
2y 5m to grant Granted Apr 14, 2026
Patent 12604364
WIRELESS COMMUNICATION METHOD AND COMMUNICATION APPARATUS
2y 5m to grant Granted Apr 14, 2026
Patent 12587982
Apparatus, Method and Computer Program
2y 5m to grant Granted Mar 24, 2026
Patent 12581354
DYNAMIC QOS MAPPING IN A HOME NETWORK
2y 5m to grant Granted Mar 17, 2026
Patent 12568554
TECHNIQUES FOR VOICE CALL PACKET GROUPING
2y 5m to grant Granted Mar 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
86%
Grant Probability
93%
With Interview (+6.1%)
2y 5m
Median Time to Grant
Low
PTA Risk
Based on 498 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