Prosecution Insights
Last updated: August 17, 2026
Application No. 18/978,504

SYSTEMS, APPARATUSES, METHODS, AND NON-TRANSITORY COMPUTER-READABLE STORAGE DEVICES FOR WIRELESS COMMUNICATION EMPLOYING REDUCED DATA SYMBOL LENGTH ASSOCIATED WITH DISTRIBUTED RESOURCE UNIT TRANSMISSION

Non-Final OA §102§103
Filed
Dec 12, 2024
Priority
Sep 05, 2024 — provisional 63/691,024
Examiner
BURD, KEVIN MICHAEL
Art Unit
2632
Tech Center
2600 — Communications
Assignee
Huawei Technologies Co., Ltd.
OA Round
1 (Non-Final)
75%
Grant Probability
Favorable
1-2
OA Rounds
1y 2m
Est. Remaining
86%
With Interview

Examiner Intelligence

Grants 75% — above average
75%
Career Allowance Rate
583 granted / 781 resolved
+12.6% vs TC avg
Moderate +11% lift
Without
With
+11.1%
Interview Lift
resolved cases with interview
Typical timeline
2y 11m
Avg Prosecution
20 currently pending
Career history
808
Total Applications
across all art units

Statute-Specific Performance

§101
5.3%
-34.7% vs TC avg
§103
48.5%
+8.5% vs TC avg
§102
22.1%
-17.9% vs TC avg
§112
10.7%
-29.3% vs TC avg
Black line = Tech Center average estimate • Based on career data from 781 resolved cases

Office Action

§102 §103
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 1. Claims 17-21 are objected to because of the following informalities: claims 17-21 recite “one or more circuits according to claim 15…” However, claim 15 recites one or more non-transitory computer readable storage devices in line 1. Appropriate correction is required. Claim Rejections - 35 USC § 102 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 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. 2. Claims 1, 6-8, 13-15, 20 and 21 are rejected under 35 U.S.C. 102(a) (1) as being anticipated by Dunn (US 2022/0094523). Regarding claim 1, Dunn discloses a communication method (Figure 4) comprising: receiving a packet including a truncated data symbol sample and an indication of a truncation ratio; based at least in part on the truncation ratio (Paragraph 0041: in step 408, the set of samples and the encrypted data frame are transmitted to the receiver. In step 1414, the receiver appends generic padding bits to the samples replacing those that had been truncated in order to return the samples to the expected size. Because of this function taking place at the receiver, the receiver receives at least the expected size or the amount of truncation that occurs in the received data frame so the padding bits can be appended to return the samples to the expected size.), determining a number of additional truncated data symbol samples for appending to the truncated data symbol sample (Paragraph 0041: In step 1414, the receiver appends generic padding bits to the samples replacing those that had been truncated in order to return the samples to the expected size. The number of padding bits is determined prior to appending those padding bits.); and appending the number of additional truncated data symbol samples to the truncated data symbol sample in order to obtain a whole data symbol sample (Paragraph 0041: In step 1414, the receiver appends generic padding bits to the samples replacing those that had been truncated in order to return the samples to the expected size.). Regarding claim 6, Dunn discloses wherein the method is performed in association with one or more of a downlink communication and an uplink communication (Paragraph 0041: in step 408, the set of samples and the encrypted data frame are transmitted to the receiver. This transmission will be in an uplink or a downlink communication.). Regarding claim 7, Dunn discloses wherein the truncation ratio is indicated in one or more of a common field or a special info field for a multi-user Phy protocol data unit (PPDU) or a trigger frame for a trigger based PPDU (This recitation does not require a step to be performed. The receiver does not control the format of a signal to be received. Therefore, the recitation does not limit the claim in terms of scope.). Regarding claim 8, Dunn discloses one or more circuits for performing a method (Figure 4 shows the method. The means for executing this method will comprise one or more circuits.) comprising: receiving a packet including a truncated data symbol sample and an indication of a truncation ratio; based at least in part on the truncation ratio (Paragraph 0041: in step 408, the set of samples and the encrypted data frame are transmitted to the receiver. In step 1414, the receiver appends generic padding bits to the samples replacing those that had been truncated in order to return the samples to the expected size. Because of this function taking place at the receiver, the receiver receives at least the expected size or the amount of truncation that occurs in the received data frame so the padding bits can be appended to return the samples to the expected size.), determining a number of additional truncated data symbol samples for appending to the truncated data symbol sample (Paragraph 0041: In step 1414, the receiver appends generic padding bits to the samples replacing those that had been truncated in order to return the samples to the expected size. The number of padding bits is determined prior to appending those padding bits.); and appending the number of additional truncated data symbol samples to the truncated data symbol sample in order to obtain a whole data symbol sample (Paragraph 0041: In step 1414, the receiver appends generic padding bits to the samples replacing those that had been truncated in order to return the samples to the expected size.). Regarding claim 13, Dunn discloses wherein the method is performed in association with one or more of a downlink communication and an uplink communication (Paragraph 0041: in step 408, the set of samples and the encrypted data frame are transmitted to the receiver. This transmission will be in an uplink or a downlink communication.). Regarding claim 14, Dunn discloses wherein the truncation ratio is indicated in one or more of a common field or a special info field for a multi-user Phy protocol data unit (PPDU) or a trigger frame for a trigger based PPDU (This recitation does not require a step to be performed. The receiver does not control the format of a signal to be received. Therefore, the recitation does not limit the claim in terms of scope.). Regarding claim 15, Dunn discloses one or more non-transitory computer-readable storage devices comprising computer-executable instructions, wherein the instructions, when executed (Paragraph 0022: the processor 110 can have access to a memory 150 in a device.), cause one or more circuits to perform a method (Figure 4) comprising: receiving a packet including a truncated data symbol sample and an indication of a truncation ratio; based at least in part on the truncation ratio (Paragraph 0041: in step 408, the set of samples and the encrypted data frame are transmitted to the receiver. In step 1414, the receiver appends generic padding bits to the samples replacing those that had been truncated in order to return the samples to the expected size. Because of this function taking place at the receiver, the receiver receives at least the expected size or the amount of truncation that occurs in the received data frame so the padding bits can be appended to return the samples to the expected size.), determining a number of additional truncated data symbol samples for appending to the truncated data symbol sample (Paragraph 0041: In step 1414, the receiver appends generic padding bits to the samples replacing those that had been truncated in order to return the samples to the expected size. The number of padding bits is determined prior to appending those padding bits.); and appending the number of additional truncated data symbol samples to the truncated data symbol sample in order to obtain a whole data symbol sample (Paragraph 0041: In step 1414, the receiver appends generic padding bits to the samples replacing those that had been truncated in order to return the samples to the expected size.). Regarding claim 20, Dunn discloses wherein the method is performed in association with one or more of a downlink communication and an uplink communication (Paragraph 0041: in step 408, the set of samples and the encrypted data frame are transmitted to the receiver. This transmission will be in an uplink or a downlink communication.). Regarding claim 21, Dunn discloses wherein the truncation ratio is indicated in one or more of a common field or a special info field for a multi-user Phy protocol data unit (PPDU) or a trigger frame for a trigger based PPDU (This recitation does not require a step to be performed. The receiver does not control the format of a signal to be received. Therefore, the recitation does not limit the claim in terms of scope.). 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. 3. Claims 2, 3, 9, 10, 16 and 17 are rejected under 35 U.S.C. 103 as being unpatentable over Dunn (US 2022/0094523) in view of Perets et al (US 9,87,607). Regarding claims 2, 9 and 16, Dunn discloses the method, circuit and non-transitory computer readable medium stated above. Dunn does not disclose wherein prior to appending, the method further includes performing at least one arithmetic operation on the truncated data symbol sample to obtain at least one of the additional truncated data symbol samples, wherein the at least one arithmetic operation includes one or more of: same repetition, mirror repetition, negation and conjugation. Perets discloses multiplying the OFDM symbol (prior to windowing) by the complex conjugate of the expression in equation 5, and then applying the windowing and FFT to compensated signal for demodulation at the receiver as stated in column 5, lines 14-29. These steps will comprise at least one arithmetic function of one or more of: same repetition, mirror repetition, negation and conjugation. Figure 2 shows the receiver 28. It would have been obvious for one of ordinary skill in the art before the effective filing date of the claimed invention to incorporate the process of recovering the transmitted data of Perets into the receiver of Dunn. Perets discloses the invention overcomes the issues in communication as stated in column 1, line 55 to column 2, line 3. By overcoming these issues, the communication system will operate efficiently and effectively. Regarding claims 3, 10 and 17, Dunn discloses the method, circuit and non-transitory computer readable medium stated above. Dunn does not disclose applying a discrete Fourier transform (DFT) to the whole data symbol sample thereby obtaining the data symbol. Perets discloses multiplying the OFDM symbol (prior to windowing) by the complex conjugate of the expression in equation 5, and then applying the windowing and FFT to compensated signal for demodulation at the receiver as stated in column 5, lines 14-29. The FFT is an implementation of the DFT. It would have been obvious for one of ordinary skill in the art before the effective filing date of the claimed invention to incorporate the process of recovering the transmitted data of Perets into the receiver of Dunn. Perets discloses the invention overcomes the issues in communication as stated in column 1, line 55 to column 2, line 3. By overcoming these issues, the communication system will operate efficiently and effectively. 4. Claims 4, 5, 11, 12, 18 and 19 are rejected under 35 U.S.C. 103 as being unpatentable over Dunn (US 2022/0094523) in view of Wang et al (US 2005/0185724). Regarding claims 4, 11 and 18, Dunn discloses the method, circuit and non-transitory computer readable medium stated above. Dunn does not disclose wherein prior to appending, the method further comprises removing a guard interval from the truncated data symbol sample. Wang discloses the communication system shown in figure 1. Wang discloses the received signal is input to the GI removal block 32. The output signal from GI removal block is input to the FFT 36. The signal is then demodulated in demodulation rate match block 44 and decoded in decoder 46 to recover the transmitted information. Paragraph 0024 provides additional information. The guard interval is used to minimize inter-symbol interference. The GI is removed at the receiver so the originally transmitted information can be recovered. It would have been obvious for one of ordinary skill in the art before the effective filing date of the claimed invention to utilize a guard interval in the transmission to minimize inter-symbol interference and remove the GI once the signal is received at the receiver. Preventing interference improves the function of the communication system. Regarding claims 5, 12 and 17, the combination discloses wherein prior to appending, the method further comprises removing the guard interval from the truncated data symbol sample to obtain at least one of the additional truncated data symbol samples (Wang: figure 1: The first function after the received signal is received is the guard interval removal in block 32. All other processing of the received signal takes place after the GI removal.). Conclusion 5. The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. Matsumoto et al (US 2008/0008256) discloses the communication system shown in figure 5. The receiver comprises a GI deletion section 153. FFT section 154 processes the signal and outputs the signal to determining section 156 and demodulation section 159. Any inquiry concerning this communication or earlier communications from the examiner should be directed to KEVIN M. BURD whose telephone number is (571)272-3008. The examiner can normally be reached 9:30 - 5:00. 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, Chieh Fan can be reached at 571-272-3042. 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. /KEVIN M BURD/Primary Examiner, Art Unit 2632 7/28/2026
Read full office action

Prosecution Timeline

Dec 12, 2024
Application Filed
Jul 30, 2026
Non-Final Rejection mailed — §102, §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12689407
TIMING DETECTION METHOD, COMMUNICATION SYSTEM AND RECEIVING APPARATUS
1y 9m to grant Granted Jul 21, 2026
Patent 12683657
METHODS FOR A COMMUNICATION DEVICE FOR CONTROLLING A RADIATION BOUNDARY AREA, METHOD FOR A NETWORK ENTITY, APPARATUS, VEHICLE AND COMPUTER PROGRAM
2y 2m to grant Granted Jul 14, 2026
Patent 12683696
Detecting attacks in SS-TWR communication
1y 10m to grant Granted Jul 14, 2026
Patent 12665554
RADIO FREQUENCY POWER AMPLIFIER MODULE
3y 2m to grant Granted Jun 23, 2026
Patent 12665796
HIGH-SPEED COMMUNICATION METHOD AND DEVICE BASED ON DUOBINARY SIGNAL
1y 8m to grant Granted Jun 23, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

1-2
Expected OA Rounds
75%
Grant Probability
86%
With Interview (+11.1%)
2y 11m (~1y 2m remaining)
Median Time to Grant
Low
PTA Risk
Based on 781 resolved cases by this examiner. Grant probability derived from career allowance 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