Prosecution Insights
Last updated: July 17, 2026
Application No. 18/672,020

Method and Apparatus for Decoding Channel Codes Employing Compute-In-Memory

Non-Final OA §102
Filed
May 23, 2024
Priority
Jun 07, 2023 — provisional 63/506,828
Examiner
KERVEROS, DEMETRIOS C
Art Unit
2192
Tech Center
2100 — Computer Architecture & Software
Assignee
The Hong Kong University of Science and Technology
OA Round
1 (Non-Final)
87%
Grant Probability
Favorable
1-2
OA Rounds
2m
Est. Remaining
90%
With Interview

Examiner Intelligence

Grants 87% — above average
87%
Career Allowance Rate
949 granted / 1086 resolved
+32.4% vs TC avg
Minimal +3% lift
Without
With
+2.6%
Interview Lift
resolved cases with interview
Typical timeline
2y 4m
Avg Prosecution
24 currently pending
Career history
1111
Total Applications
across all art units

Statute-Specific Performance

§101
3.8%
-36.2% vs TC avg
§103
11.0%
-29.0% vs TC avg
§102
69.8%
+29.8% vs TC avg
§112
3.4%
-36.6% vs TC avg
Black line = Tech Center average estimate • Based on career data from 1086 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 . This is a NON-FINAL OFFICE ACTION in response to the present Application filed 05/23/2024. Claims 1-20 are pending in the Application, of which Claims 1 and 12 are independent. Continuity/ Priority Information The present Application 18672020 filed 05/23/2024 Claims Priority from Provisional Application 63506828, filed 06/07/2023. Information Disclosure Statement The information disclosure statement (IDS) submitted on 08/02/2024 is in compliance with the provisions of 37 CFR 1.97. Accordingly, the IDS has been considered by the examiner. 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. Claims 1-20 are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Noda (Pub. No. US 20030165112) Pub. Date: 2003-09-04. Regarding independent Claims 1 and 12, Noda discloses a communication system and a communication method employing multi-level modulation system, comprising: a demodulator configured to demodulate the received channel codes to obtain a demodulated data vector; Referring to FIG. 1, [0099] In the receiving apparatus 121, the six-phase demodulator 122 performs six-phase demodulation of the received signal 138 which has been sent from the transmitting apparatus 101 over the transmission line and received by the receiving apparatus 121, and outputs a ternary received sequence 139 and a binary received sequence 140. a syndrome computer configured to compute a data vector syndrome for the demodulated data vector; The ternary received sequence 139 is supplied to the syndrome calculation circuit 123. The syndrome calculation circuit 123 constitutes part of a ternary error correction decoding circuit associated with the ternary error correction encoding circuit 103, and generates a syndrome 141 from the ternary received sequence 139. a controller configured to receive the data vector syndrome …..store a plurality of pre-computed test error pattern syndromes; receive the search key from the controller; concurrently evaluate the plurality of test error pattern syndromes under a codebook membership criterion with the search key; The low-order digit correction circuit 128 uses the syndrome 141 and the parity difference 145 to correct an error in the ternary received sequence 139, and then supplies a ternary decoded sequence 147 to the 6-ary to binary conversion circuit 130. The high-order digit correction circuit 129 corrects an error in the delayed binary received sequence 144 based on a ternary received sequence 146-1 and a ternary decoded sequence 146-2 supplied from the low-order digit correction circuit 128, thereby generating a binary decoded sequence 148 for supply to the 6-ary to binary conversion circuit 130. The 6-ary to binary conversion circuit 130 converts the received ternary decoded sequence 147 and the binary decoded sequence 148 into a received binary signal 149 to output the received binary signal 149. determine an address of a candidate test error pattern corresponding to a candidate test error pattern syndrome that satisfy the codebook membership criterion; and a word-generation module configured to: use the determined address to retrieve indices of non-zero elements of the candidate test error pattern; and generate a candidate output codeword based on the retrieved indices of non-zero elements of the test error pattern and the input data vector. [0165] Referring to FIG. 18, the ternary error correction decoding circuit 153 includes among others, an error location calculating unit 153-2 to “determine an address” [0166] The syndrome calculating unit 153-1 computes the syndrome of a ternary received sequence 139. The error location-calculating unit 153-2 generates an error locator polynomial, from the syndrome, and solves the error locator polynomial to compute an error location. The error value-calculating unit 153-3 is supplied with the syndrome and with the error location and computes an error value from the error locator polynomial and a derivative of the error locator polynomial. The error pattern-generating unit 153-4 generates an error pattern from the error location and from the error value. The delay circuit 153-6 delays the ternary received signal sequence a preset time. The error pattern subtraction unit 153-6 subtracts the error pattern from the delayed ternary received signal sequence to output a ternary decoded sequence 141. Regarding Claims 2, 3, 13,14, Noda discloses wherein the demodulator configured to demodulate the received channel codes on basis of a hard-decision algorithm to obtain a hard-decided vector, wherein the demodulator is configured to demodulate the received channel codes on basis of a soft-decision algorithm to obtain a soft-decided vector; Referring to FIG. 1 [0099] In the receiving apparatus 121, the six-phase demodulator 122 performs six-phase demodulation of the received signal 138 which has been sent from the transmitting apparatus 101 over the transmission line and received by the receiving apparatus 121. Referring to FIG.18, [0166] The syndrome calculating unit 153-1 computes the syndrome of a ternary received sequence 139. The error location-calculating unit 153-2 generates an error locator polynomial, from the syndrome, and solves the error locator polynomial to compute an error location. The error value-calculating unit 153-3 is supplied with the syndrome and with the error location and computes an error value from the error locator polynomial and a derivative of the error locator polynomial. Regarding Claims 4, 5, 15, 16, Noda discloses wherein the reliability order is an ascending order of absolute values of the individual elements of the soft-decided vector, and wherein the controller is further configured to calculate a likelihood value for each of the one or more candidate output codewords based on the corresponding demodulated data vector. [0100] First, the code parameters of the ternary BCH (Bose-Chaudhuri-Hocquenghem) code as typical of the ternary error correction code will be explained. The ternary BCH code is formed on the basis of the following p-degree generating polynomial p(x) having coefficients of a.sub.0,a.sub.1, . . . a.sub.p with the elements of 0, 1, 2: p(x)=x.sup.p+a.sub.p 1x.sup.p-1+ . . . +a.sub.1x+a.sub.0 (1) [0101] where [0102] a.sub.i=0,1,2. Regarding Claims 6-11, 17-20, Noda discloses wherein the plurality of test error pattern syndromes is ranked into the one or more subsets according to the Hamming weights of the corresponding TEPs thereof; and the compute-in-memory comprises one or more sub-memories, each configured to: store a corresponding subset of test error pattern syndromes; and evaluate the corresponding subset of test error pattern syndromes with the codebook membership criterion based on the channel codeword syndrome. Referring to FIG. 18, [0166] The syndrome calculating unit 153-1 computes the syndrome of a ternary received sequence 139. The error location-calculating unit 153-2 generates an error locator polynomial, from the syndrome, and solves the error locator polynomial to compute an error location. The error value-calculating unit 153-3 is supplied with the syndrome and with the error location and computes an error value from the error locator polynomial and a derivative of the error locator polynomial. The error pattern-generating unit 153-4 generates an error pattern from the error location and from the error value. The delay circuit 153-6 delays the ternary received signal sequence a preset time. The error pattern subtraction unit 153-6 subtracts the error pattern from the delayed ternary received signal sequence to output a ternary decoded sequence 141. Meanwhile, a ternary received sequence 139-1 and a ternary decoded sequence 139-2 are sent to the high order digit correction circuit 129. Prior Art References Cited The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. See References Cited on PTO-892 form. US 20080148129 Moon; Jaekyun et al. Error detection and correction using error pattern correcting codes US 5930272 Thesling; William H. Block decoding with soft output information Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to JAMES C KERVEROS whose telephone number is (571)272-3824. The examiner can normally be reached 9-5. 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, MARK FEATHERSTONE can be reached at (571) 270-3750. 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. /JAMES C KERVEROS/Primary Examiner, Art Unit 2111 Date: June 11, 2026 Non-Final Rejection 20260611 JAMES C. KERVEROS Primary Examiner, Art Unit 2111 James.Kerveros@USPTO.GOV
Read full office action

Prosecution Timeline

May 23, 2024
Application Filed
Jun 16, 2026
Non-Final Rejection mailed — §102 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12682980
Self-Repair Memory Techniques
3y 11m to grant Granted Jul 14, 2026
Patent 12682949
UTILIZING FLASH MEMORY OF STORAGE DEVICES EXPERIENCING POWER LOSS PROTECTION FAILURES
2y 4m to grant Granted Jul 14, 2026
Patent 12663468
SYSTEM AND METHOD FOR DETECTING FAULTS IN INTEGRATED CIRCUITS
2y 11m to grant Granted Jun 23, 2026
Patent 12659072
Cellular Networks FEC Offload
3y 2m to grant Granted Jun 16, 2026
Patent 12657505
EFFICIENT QUANTUM ERROR CORRECTION IN NEUTRAL ATOMS BY CONVERSION TO ERASURE ERRORS
1y 11m to grant Granted Jun 16, 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
87%
Grant Probability
90%
With Interview (+2.6%)
2y 4m (~2m remaining)
Median Time to Grant
Low
PTA Risk
Based on 1086 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