Prosecution Insights
Last updated: April 19, 2026
Application No. 18/870,773

ENHANCED DESIGN AND USE OF LONGER LOW-DENSITY PARITY-CHECK WI-FI CODEWORDS

Non-Final OA §112
Filed
Dec 02, 2024
Examiner
KNAPP, JUSTIN R
Art Unit
2112
Tech Center
2100 — Computer Architecture & Software
Assignee
Intel Corporation
OA Round
1 (Non-Final)
84%
Grant Probability
Favorable
1-2
OA Rounds
2y 6m
To Grant
93%
With Interview

Examiner Intelligence

Grants 84% — above average
84%
Career Allow Rate
574 granted / 679 resolved
+29.5% vs TC avg
Moderate +8% lift
Without
With
+8.3%
Interview Lift
resolved cases with interview
Typical timeline
2y 6m
Avg Prosecution
11 currently pending
Career history
690
Total Applications
across all art units

Statute-Specific Performance

§101
12.7%
-27.3% vs TC avg
§103
21.0%
-19.0% vs TC avg
§102
22.9%
-17.1% vs TC avg
§112
27.6%
-12.4% vs TC avg
Black line = Tech Center average estimate • Based on career data from 679 resolved cases

Office Action

§112
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 . Examiner Notes The Preliminary Amendment filed on December 2, 2024 is acknowledged. Amended claims 1-9, 12-21, and 24 were examined for this Office Action. Specification The disclosure is objected to because of the following informalities: On page 10, line 25, the specification recites, “…but may be expanded to 3844 bits using…”. It appears that “3844” is a typographical error and should be amended to recite “3888 bits”. Appropriate correction is required. Claim Rejections - 35 USC § 112 The following is a quotation of 35 U.S.C. 112(b): (b) CONCLUSION.—The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the inventor or a joint inventor regards as the invention. The following is a quotation of 35 U.S.C. 112 (pre-AIA ), second paragraph: The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the applicant regards as his invention. Claims 1-9, 12-21, and 24 rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph, as being indefinite for failing to particularly point out and distinctly claim the subject matter which the inventor or a joint inventor (or for applications subject to pre-AIA 35 U.S.C. 112, the applicant), regards as the invention. Claims 1, 13, and 24 (and, therefore, their respective dependent claims) recite the limitations "the entries of the mark matrix", “each entry of the first base matrix”, and “the entries of the second base matrix” in, for example, lines 7, 10-12, and 14 of claim 1 (similar issue in claims 13 and 24). There is insufficient antecedent basis for this limitation in the claim. Claims 1, 13, and 24 (and, therefore, their respective dependent claims) contain the trademark/trade name “Wi-Fi”. Where a trademark or trade name is used in a claim as a limitation to identify or describe a particular material or product, the claim does not comply with the requirements of 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph. See Ex parte Simpson, 218 USPQ 1020 (Bd. App. 1982). The claim scope is uncertain since the trademark or trade name cannot be used properly to identify any particular material or product. A trademark or trade name is used to identify a source of goods, and not the goods themselves. Thus, a trademark or trade name does not identify or describe the goods associated with the trademark or trade name. In the present case, the trademark/trade name is used to identify/describe a type of coding and decoding and, accordingly, the identification/description is indefinite. Allowable Subject Matter Claims 1-9, 12-21, and 24 would be allowable if rewritten or amended to overcome the rejection(s) under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), 2nd paragraph, set forth in this Office action. The closest prior art found includes: US 11,456,756 B2 to Yamamoto which discloses a transmission device, a transmission method, a reception device, and a reception method for securing good communication quality in data transmission using an LDPC code. The LDPC coding is performed on the basis of the parity check matrix of the LDPC code with the code length N of 17280 bits and the coding rate r of 5/16, 6/16, or 7/16. US 11303303 B2 to Richardson et al which discloses encoding data for wireless transmissions. In one aspect, a wireless device may encode a number (M) of systematic bits for transmission to a receiving device. The systematic bits may be encoded using a low-density parity-check (LDPC) code to produce an LDPC codeword. The LDPC codeword may include a number (N) of codeword bits, including the M systematic bits and one or more parity bits. The wireless device may further puncture a number (K) of the codeword bits to produce a punctured codeword having a code rate M/(N−K)>5/6. The following is a statement of reasons for the indication of allowable subject matter: Regarding claims 1-9, 12-21, and 24, the closest prior art listed above and the prior art of record has not taught, either individually or in combination, and together with all other claimed features an apparatus for LDPC [wireless] coding and decoding and/or corresponding method/non-transitory CRM comprising: a mask matrix associated with generating a second base matrix based on a first base matrix, the mask matrix consisting of four rows and 24 columns, the entries of the mask matrix consisting of values of 0, 1, and −1, and the second base matrix associated with generating LDPC codewords of 3888 bits; generating, by the processing circuitry, the second base matrix by multiplying each entry of the first base matrix by each entry of the mask matrix, the second base matrix consisting of eight rows and 48 columns, the entries of the second base matrix indicative of respective cyclic shifts to apply to an identity matrix consisting of 81 rows and 81 columns; generating, by the processing circuitry, a parity check matrix by multiplying each entry of the second base matrix by each entry of the identity matrix, the parity check matrix consisting of 648 rows and 3888 columns; generating, by the processing circuitry, a LDPC codeword consisting of 3888 bits based on the parity check matrix; and causing, by the processing circuitry, the device to transmit a frame comprising the LDPC codeword. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to Justin Knapp whose telephone number is (571)270-3008. The examiner can normally be reached 8:00 am - 4:30 pm (ET). 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, Albert Decady can be reached at (571) 272-3819. 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. Justin R. Knapp Primary Examiner Art Unit 2112 /JUSTIN R KNAPP/Primary Examiner, Art Unit 2112
Read full office action

Prosecution Timeline

Dec 02, 2024
Application Filed
Feb 21, 2026
Non-Final Rejection — §112 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12579026
APPARATUSES, SYSTEMS, AND METHODS FOR STORING MEMORY METADATA IN A GLOBAL COLUMN REDUNDANCY PLANE
2y 5m to grant Granted Mar 17, 2026
Patent 12580593
MEMORY SYSTEM AND NONVOLATILE MEMORY DEVICE CAPABLE OF COMPRESSING DATA FROM A MEMORY PLANE AND OUTPUTTING DATA IN PARALLEL
2y 5m to grant Granted Mar 17, 2026
Patent 12571781
VERIFICATION METHOD AND SYSTEM FOR A SAMPLE INTRODUCTION DEVICE DEDICATED TO GAS CHROMATOGRAPHY FOR PRECISELY MEASURING A CONCENTRATION OF ATMOSPHERIC GREENHOUSE GAS CONTAINED IN A TEDLAR BAG
2y 5m to grant Granted Mar 10, 2026
Patent 12572416
ERROR CORRECTING CODES FOR MULTI-MASTER MEMORY CONTROLLER
2y 5m to grant Granted Mar 10, 2026
Patent 12574146
METHOD AND APPARATUS FOR FAST DECODING OF POLAR CODES
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

1-2
Expected OA Rounds
84%
Grant Probability
93%
With Interview (+8.3%)
2y 6m
Median Time to Grant
Low
PTA Risk
Based on 679 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