Prosecution Insights
Last updated: May 29, 2026
Application No. 18/476,499

SYSTEM AND METHOD FOR ADDITION AND SUBTRACTION IN MEMRISTOR-BASED IN-MEMORY COMPUTING

Non-Final OA §103§112
Filed
Sep 28, 2023
Priority
Oct 11, 2022 — provisional 63/415,147
Examiner
NGUYEN, HIEN N
Art Unit
2824
Tech Center
2800 — Semiconductors & Electrical Systems
Assignee
The University of Hong Kong
OA Round
1 (Non-Final)
96%
Grant Probability
Favorable
1-2
OA Rounds
0m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 96% — above average
96%
Career Allowance Rate
595 granted / 618 resolved
+28.3% vs TC avg
Minimal +4% lift
Without
With
+3.9%
Interview Lift
resolved cases with interview
Fast prosecutor
1y 9m
Avg Prosecution
6 currently pending
Career history
635
Total Applications
across all art units

Statute-Specific Performance

§101
3.0%
-37.0% vs TC avg
§103
23.9%
-16.1% vs TC avg
§102
30.1%
-9.9% vs TC avg
§112
2.9%
-37.1% vs TC avg
Black line = Tech Center average estimate • Based on career data from 618 resolved cases

Office Action

§103 §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 . DETAILED ACTION Election/Restrictions Applicant’s election without traverse of claims 2-10 in the reply filed on 26 September, 2025 is acknowledged. Claim 1 has been withdrawn from further consideration pursuant to 37 CFR 1.142(b) as being drawn to a nonelected invention(s)/ species, there being no allowable generic or linking claim. Information Disclosure Statement The Information Disclosure Statements (IDS) submitted on 9/28/23 by the applicant have been received and fully considered. 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. Claims 2-17 are rejected under 35 U.S.C. 112(b) as being indefinite for failing to particularly point out and distinctly claim the subject matter which the inventor or a joint inventor regards as the invention. Claims 2–17 repeatedly recite “scheme #1”, “scheme #2”, … “scheme #9”, but: The claims do not define: structural boundaries of each “scheme”, what required circuit elements for each scheme and how schemes differ functionally rather than by label. The specification uses “scheme” as an informal design label, not as a claim-defining term. The term “scheme” (emphasis)is not a recognized term of art defining a specific circuit structure, and the claims do not recite structural elements that distinguish one “scheme” from another. Instead, the claims rely on ordinal labels without specifying how each scheme is implemented, how it differs structurally from other schemes, or what minimum elements are required for each scheme. As a result, a person of ordinary skill in the art would not be reasonably apprised of the scope of the claimed subject matter, rendering the claims indefinite.. Claim Rejections - 35 USC § 103 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 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 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. Claims 2-17, as best understood (See the 112 Rejection above), are rejected under 35 U.S.C. §103 as being unpatentable over Wang et al.( US 11,526,285) in view of Choi et al. (US 10,643,705). Examiner’s Note: A reference must be considered in its entirety, not in isolation.”— In re Wesslau, 353 F.2d 238. “The test for obviousness is what the combined teachings of the references would have suggested to those of ordinary skill in the art.” — In re Keller, 642 F.2d 413 (CCPA 1981). Key Note for the Applicant to consider: There is no legal requirement that: all limitations appear in one figure, or all limitations be disclosed in one paragraph. Thus, This Office Action properly relies on the teachings of the references as a whole, not on a rigid, element-by-element figure overlay. Also, The examiner used “the cited references are relied upon for their combined teachings as understood by a person of ordinary skill in the art. The Office Action does not require a one-to-one correspondence between individual claim limitations and a single figure or paragraph of any reference. Rather, the rejection properly relies on the collective disclosures of the references, which, when combined, render the claimed subject matter obvious under 35 U.S.C. §103.” Regarding independent claim 2: Claim 2 recites that the RCM performs inference in a parallel mode by activating each row. Claim 2 is rejected under 35 U.S.C. §103 as being unpatentable over Wang et al.( US 11,526,285) in view of Choi et al. (US 10,643,705). Wang et al. discloses a fully integrated RRAM-based AI accelerator comprising ratio-based crossbar macros in which process elements are arranged in rows and columns, input voltages are applied to rows via digital-to-analog converters, and output currents are summed along columns and digitized by shared analog-to-digital converters (e.g., see Wang, Figs. 2–4; col. 6, ll. 5–40; col. 8, ll. 10–45). Wang further teaches performing inference operations in parallel by activating multiple rows simultaneously. Choi et al. further discloses specific processing element configurations for RRAM crossbars, including variants optimized for addition and subtraction operations, and teaches the use of shared ADC resources across multiple columns to reduce area and power consumption (e.g., see Choi, Figs. 3–5; col. 7, ll. 1–30). A person of ordinary skill in the art would have been motivated to combine the system-level architecture of Wang with the processing-element configurations of Choi to implement a ratio-based crossbar macro capable of parallel inference using shared ADCs, as both references address the same technical problem of efficient neural network computation using RRAM crossbars. The combination represents a predictable use of prior art elements according to their established functions Claim 3 depends from claim 2 and further recites that the RCM performs inference in a parallel mode by activating each row. Wang et al. teaches performing inference operations in parallel within an RRAM crossbar by simultaneously activating multiple word lines corresponding to rows of processing elements (e.g., see Wang, Figs. 3–4; col. 8, ll. 15–35). Wang explicitly discloses row-wise activation to compute outputs concurrently across columns. Accordingly, claim 3 is unpatentable under 35 U.S.C. §103 as obvious over Wang. Claim 4 depends from claim 3 and recites an architecture for addition having size (M×2N) with left and right arrays and an iT1R processing element. Wang et al. discloses paired crossbar sub-arrays arranged laterally to implement differential and addition-based computation using current summation across columns (e.g., see Wang, Fig. 6; col. 9, ll. 10–30). The use of multiple arrays to support addition operations is therefore taught by Wang. Claim 4 is unpatentable under §103 as obvious over Wang. Claim 5 depends from claim 3 and recites that the processing elements comprise a one-transistor-one-resistor (1T1R) structure with bit lines, word lines, and source lines collecting summed currents. Choi et al. explicitly discloses 1T1R processing elements in RRAM crossbar arrays, where word lines control transistor gates, bit lines apply input voltages, and source lines collect summed currents for column outputs (e.g., see Choi, Fig. 4; col. 7, ll. 20–45). Accordingly, claim 5 is unpatentable under §103 as obvious over Choi. Claim 6 depends from claim 5 and further recites a dual-array architecture where one array is biased with a constant conductance and another array stores synaptic weights. Wang et al. discloses using reference or bias arrays with fixed conductance values in combination with weight-mapped arrays to perform normalized or ratio-based computation in RRAM crossbars (e.g., see Wang, Fig. 7; col. 10, ll. 5–30). Therefore, claim 6 is unpatentable under §103 as obvious over Wang. Claim 7 depends from claim 3 and recites an addition architecture using a single (M×N) array with a 2T2R processing element. Choi et al. discloses processing elements having two transistors and two resistive memory devices arranged to support differential addition and subtraction operations within a single crossbar array (e.g., see Choi, Fig. 5; col. 8, ll. 1–25). Claim 7 is unpatentable under §103 as obvious over Choi. Claim 8 depends from claim 3 and recites an addition architecture using a single (M×N) array with a 1T2R processing element. Choi et al. further teaches 1T2R processing elements in which paired resistive devices are coupled to a single transistor to enable addition and subtraction operations (e.g., see Choi, Fig. 6; col. 8, ll. 30–55). Accordingly, claim 8 is unpatentable under §103 as obvious over Choi. Claim 9 depends from claim 8 and recites that one RRAM cell connects to a bit line and another connects to a constant bias voltage. Wang et al. discloses applying constant bias voltages to selected bit lines in RRAM arrays to support reference-based current summation and normalization (e.g., see Wang, col. 9, ll. 40–55). Claim 9 is unpatentable under §103 as obvious over Wang. Claim 10 depends from claim 3 and recites an architecture having a size (2M×N) with upper and lower arrays and a 1T1R processing element. Wang et al. teaches stacking or duplicating crossbar arrays vertically or logically to expand computational dimensions and support multi-row addition operations (e.g., see Wang, Fig. 8; col. 11, ll. 5–25). Claim 10 is unpatentable under §103 as obvious over Wang. Claim 11 depends from claim 3 and recites an addition architecture with a (M×N) array and a 2T2R processing element. As discussed above with respect to claim 7, Choi et al. expressly discloses 2T2R processing elements used within a single crossbar array to implement addition operations (e.g., see Choi, Fig. 5; col. 8, ll. 1–25). Claim 11 is unpatentable under §103 as obvious over Choi. Claim 12 depends from claim 3 and recites a subtraction operation using a single array with a 2T2R processing element. Choi et al. teaches implementing subtraction operations by differential current comparison using paired resistive elements within a 2T2R processing element (e.g., see Choi, col. 8, ll. 20–40). Accordingly, claim 12 is unpatentable under §103 as obvious over Choi. Claim 13 depends from claim 3 and recites a subtraction operation using a single array with a 1T1R processing element. Wang et al. discloses performing subtraction and differential operations using single-transistor resistive elements combined with reference biases (e.g., see Wang, col. 10, ll. 35–55). Claim 13 is unpatentable under §103 as obvious over Wang. Claim 14 depends from claim 3 and recites element-wise absolute value calculation using sequential read-out and multi-bit quantization. Wang et al. teaches sequential read-out of multi-bit RRAM weights combined with DAC/ADC conversion to implement nonlinear activation and post-processing operations (e.g., see Wang, col. 12, ll. 10–40). Claim 14 is unpatentable under §103 as obvious over Wang. Claim 15 depends from claim 14 and recites accumulating sums using an adder and register across multiple clock cycles. Wang et al. discloses accumulating partial sums from crossbar outputs using digital adders and registers across multiple cycles (e.g., see Wang, col. 13, ll. 5–25). Claim 15 is unpatentable under §103 as obvious over Wang. Claim 16 depends from claim 14 and recites pointwise convolution using multiple RCMs and backend summation. Wang et al. teaches mapping convolutional operations into pointwise crossbar computations using multiple crossbar macros and aggregating results digitally (e.g., see Wang, col. 14, ll. 1–35). Claim 16 is unpatentable under §103 as obvious over Wang. Claim 17 depends from claim 3 and recites a subtraction architecture using dual arrays and differential sensing. Choi et al. discloses subtraction using dual-array configurations and differential sensing of column currents (e.g., see Choi, Fig. 7; col. 9, ll. 10–35). Accordingly, claim 17 is unpatentable under §103 as obvious over Choi. Citation of Relevant Art The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. Applicants are directed to consider additional pertinent prior art included on the Notice of References Cited (PTOL 892) attached herewith. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to HIEN N NGUYEN whose telephone number is (571)272-1879. The examiner can normally be reached Monday- Friday 9am-6pm EST. 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, Richard Elms can be reached at 5712721869. 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. HIEN N. NGUYEN Primary Examiner Art Unit 2824 /HN/ January 9, 2026 /HIEN N NGUYEN/Primary Examiner, Art Unit 2824
Read full office action

Prosecution Timeline

Sep 28, 2023
Application Filed
Nov 28, 2023
Response after Non-Final Action
Jan 14, 2026
Non-Final Rejection mailed — §103, §112
Apr 08, 2026
Response Filed

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12640200
DEVICES AND METHODS FOR READING A MEMRISTIVE ELEMENT
2y 8m to grant Granted May 26, 2026
Patent 12603128
METHODS OF CONTROLLING PCRAM DEVICES IN SINGLE-LEVEL-CELL (SLC) AND MULTI-LEVEL-CELL (MLC) MODES AND A CONTROLLER FOR PERFORMING THE SAME METHODS
2y 1m to grant Granted Apr 14, 2026
Patent 12597467
ADAPTIVE MEMORY MANAGEMENT AND CONTROL CIRCUITRY
2y 5m to grant Granted Apr 07, 2026
Patent 12555639
MEMORY DEVICE INCLUDING PAGE BUFFER CIRCUIT
2y 9m to grant Granted Feb 17, 2026
Patent 12525290
READ-OUT CIRCUITS FOR RRAM-BASED CROSSBAR CIRCUITS
1y 10m to grant Granted Jan 13, 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
96%
Grant Probability
99%
With Interview (+3.9%)
1y 9m (~0m remaining)
Median Time to Grant
Low
PTA Risk
Based on 618 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