Prosecution Insights
Last updated: April 19, 2026
Application No. 18/733,898

METHOD AND DEVICE IN NODE USED FOR WIRELESS COMMUNICATION

Non-Final OA §102
Filed
Jun 05, 2024
Examiner
PATEL, JAY P
Art Unit
2466
Tech Center
2400 — Computer Networks
Assignee
Apogee Networks, LLC
OA Round
2 (Non-Final)
84%
Grant Probability
Favorable
2-3
OA Rounds
2y 9m
To Grant
90%
With Interview

Examiner Intelligence

Grants 84% — above average
84%
Career Allow Rate
777 granted / 920 resolved
+26.5% vs TC avg
Moderate +5% lift
Without
With
+5.4%
Interview Lift
resolved cases with interview
Typical timeline
2y 9m
Avg Prosecution
35 currently pending
Career history
955
Total Applications
across all art units

Statute-Specific Performance

§101
5.5%
-34.5% vs TC avg
§103
42.6%
+2.6% vs TC avg
§102
34.7%
-5.3% vs TC avg
§112
7.5%
-32.5% vs TC avg
Black line = Tech Center average estimate • Based on career data from 920 resolved cases

Office Action

§102
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 § 102 The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action: A person shall be entitled to a patent unless – (a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention. Claim(s) 21-40 are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Hosseini et al.(US Publication 2019/0200352 A1) In regards to claims 21 and 27 Hosseini teaches, teaches a user equipment (UE) configured for wireless communication (see figures 6, 7 and 8 which illustrate a UE), the UE comprising: a receiver (see receivers 710 and 810 in figures 7 and 8 respectively); a processor (see paragraph 153; the UE can include a processor); and a transmitter (see transmitters 720 and 820 in figures 7 and 8 respectively), wherein: the receiver and the processor are configured to receive a downlink control information (DCI), wherein the DCI indicates a set of symbols for nominal repetitions of a transport block (TB) (see paragraph 91; Based on the DCI and RRC-configured parameters, the HARQ process ID and RV index for each repetition of the transport block in the repetition window may be known), wherein the set of symbols comprises a plurality of symbol groups (see paragraph 128; A TTI in eCC may consist of one or multiple symbol periods. In some cases, the TTI duration (that is, the number of symbol periods in a TTI) may be variable), wherein one TB is transported in one symbol group (see paragraph 132; a TBS for transmissions within the repetition window, a number of TTIs in the repetition window (i.e., a repetition window size)); and the transmitter and the processor are configured to transmit a TB a first actual number of times respectively in a first number of symbol groups (see paragraph 140; Within repetition window 405, the same transport block may be sent multiple times (e.g., with different RVs). In accordance with the present disclosure, a subset of the TTIs 410 in repetition window 405 may contain a new transport block (e.g., having RV 0). By way of example, the new transport block may be contained in TTI 410-a or TTI 410-b (e.g., but not TTI 410-c). Thus, a UE 115 may attempt to blindly decode a PDSCH transmission in TTI 410-a using a first RV index in a RV sequence received via RRC configuration and a HARQ process ID given by an index of TTI 410-a. If the decoding attempt is successful, the UE 115 may subsequently attempt to decode a second repetition of the transport block (e.g., having a second RV index in the RV sequence received via RRC signaling) in a second TTI 410 of timing alignment 415-a), wherein the TB is repeatedly transmitted the first actual number of times respectively in the first number of symbol groups, wherein each transmission of the TB is transmitted using a redundancy version (RV) value (see paragraph 149; UE 115-c may identify a series of RV indices for the repetition window based at least in part on the resource configuration, determine one or more potential RV indices for each TTI of the repetition window, where each potential RV index for each TTI is based at least in part on the series of RV indices beginning at a respective TTI of the subset of TTIs, and attempt to decode the grant-free downlink transmission during a given TTI of the repetition window based at least in part on the one or more potential RV indices for the given TTI), wherein the RV value is based on a symbol subset to which the symbol group that the TB is transmitted in belongs (see paragraph 164; Decoding manager 835 may determine one or more potential RV indices for each TTI of the repetition window, where each potential RV index for each TTI is based on the series of RV indices beginning at a respective TTI of the subset of TTIs), and wherein a symbol group belongs to a first symbol subset or a second symbol subset (see paragraph 192; the repetition window includes the subset of TTIs and at least one other TTI). In regards to claims 33 and 38, Hosseini teaches a base station (see figures 6, 11 and 12) configured for wireless communication, the base station comprising: a receiver (see figures 11 and 12, receivers 1110 and 1210 respectively); a processor (see paragraphs 184, 188, the base station has a processor) and a transmitter (see figures 11 and 12 and transmitters 1120 and 1220 respectively) wherein: the transmitter and the processor are configured to transmit a downlink control information (DCI), wherein the DCI indicates a set of symbols for nominal repetitions of a transport block (TB) (see paragraph 91; Based on the DCI and RRC-configured parameters, the HARQ process ID and RV index for each repetition of the transport block in the repetition window may be known), wherein the set of symbols comprises a plurality of symbol groups (see paragraph 128; A TTI in eCC may consist of one or multiple symbol periods. In some cases, the TTI duration (that is, the number of symbol periods in a TTI) may be variable), wherein one TB is transported in one symbol group (see paragraph 132; a TBS for transmissions within the repetition window, a number of TTIs in the repetition window (i.e., a repetition window size)),; and the receiver and the processor are configured to receive a TB a first actual number of times respectively in a first number of symbol groups (see paragraph 140; Within repetition window 405, the same transport block may be sent multiple times (e.g., with different RVs). In accordance with the present disclosure, a subset of the TTIs 410 in repetition window 405 may contain a new transport block (e.g., having RV 0). By way of example, the new transport block may be contained in TTI 410-a or TTI 410-b (e.g., but not TTI 410-c). Thus, a UE 115 may attempt to blindly decode a PDSCH transmission in TTI 410-a using a first RV index in a RV sequence received via RRC configuration and a HARQ process ID given by an index of TTI 410-a. If the decoding attempt is successful, the UE 115 may subsequently attempt to decode a second repetition of the transport block (e.g., having a second RV index in the RV sequence received via RRC signaling) in a second TTI 410 of timing alignment 415-a), wherein the TB is repeatedly transmitted the first actual number of times respectively in the first number of symbol groups, wherein each transmission of the TB is transmitted using a redundancy version (RV) value (see paragraph 149; UE 115-c may identify a series of RV indices for the repetition window based at least in part on the resource configuration, determine one or more potential RV indices for each TTI of the repetition window, where each potential RV index for each TTI is based at least in part on the series of RV indices beginning at a respective TTI of the subset of TTIs, and attempt to decode the grant-free downlink transmission during a given TTI of the repetition window based at least in part on the one or more potential RV indices for the given TTI), wherein the RV value is based on a symbol subset to which the symbol group that the TB is transmitted in belongs (see paragraph 164; Decoding manager 835 may determine one or more potential RV indices for each TTI of the repetition window, where each potential RV index for each TTI is based on the series of RV indices beginning at a respective TTI of the subset of TTIs), and wherein a symbol group belongs to a first symbol subset or a second symbol subset (see paragraph 192; the repetition window includes the subset of TTIs and at least one other TTI). In regards to claims 22, 28, 34 and 39, Hosseini teaches, wherein each of the plurality of symbol groups comprises a plurality of consecutive symbols (see figures 4 and 5, the repetitions are in consecutive TTIs). In regards to claims 23, 29 and 35, Hosseini teaches wherein the DCI indicates an earliest one of the symbol groups (see figure 4; see timing alignments 415-a, 415-b; the 1st Tx is shown). In regards to claims 24 and 30, Hosseini teaches wherein: the receiver and the processor are configured to receive time division duplex configuration information; and the processor is configured to determine the first symbol subset and the second symbol subset based on the time division duplex configuration information (see paragraph 126; A UE 115 may be configured with multiple downlink CCs and one or more uplink CCs according to a carrier aggregation configuration. Carrier aggregation may be used with both FDD and TDD component carriers). In regards to claims 25, 31, 36 and 40 Hosseini teaches wherein the time division duplex configuration information indicates a type of symbol, wherein the type of symbol comprises one of: uplink symbol, downlink symbol, or flexible symbol (see paragraph 120; Carriers may be downlink or uplink (e.g., in an FDD mode), or be configured to carry downlink and uplink communications (e.g., in a TDD mode)). In regards to claims 26, 32 and 37 Hosseini teaches, wherein the plurality of symbol groups indicate times of nominal transmissions of the TB, and wherein symbols of an actual transmission are a subset of symbols of a nominal transmission (see figures 4 and 5; see the TTIs and the timing alignments the includes the repetitions). Response to Arguments Applicant’s arguments filed on 11/26/2025 with respect to the Lee reference have been considered but are moot because the new ground of rejection does not rely on any reference applied in the prior rejection of record for any teaching or matter specifically challenged in the argument. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to JAY P PATEL whose telephone number is (571)272-3086. The examiner can normally be reached M-F 9:30-6. 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, Faruk Hamza can be reached at 571-272-7969. 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. /JAY P PATEL/Primary Examiner, Art Unit 2466
Read full office action

Prosecution Timeline

Jun 05, 2024
Application Filed
Apr 03, 2025
Request for Continued Examination
Apr 22, 2025
Response after Non-Final Action
Aug 07, 2025
Request for Continued Examination
Aug 12, 2025
Response after Non-Final Action
Aug 26, 2025
Non-Final Rejection — §102
Nov 26, 2025
Response Filed
Mar 18, 2026
Non-Final Rejection — §102 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12598591
COMMUNICATION RESOURCE SCHEDULING METHOD AND APPARATUS
2y 5m to grant Granted Apr 07, 2026
Patent 12593244
METHOD AND DEVICE FOR RADIO RESOURCE DETERMINATION
2y 5m to grant Granted Mar 31, 2026
Patent 12587951
PROVISIONING HEADLESS WIFI DEVICES AND RELATED SYSTEMS, METHODS AND DEVICES
2y 5m to grant Granted Mar 24, 2026
Patent 12581418
TERMINAL DEVICE AND WIRELESS COMMUNICATIONS METHOD
2y 5m to grant Granted Mar 17, 2026
Patent 12574273
CONFIGURATION OF TYPE INFORMATION FOR APPDU IN WIRELESS LAN SYSTEM
2y 5m to grant Granted Mar 10, 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

2-3
Expected OA Rounds
84%
Grant Probability
90%
With Interview (+5.4%)
2y 9m
Median Time to Grant
Moderate
PTA Risk
Based on 920 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