Prosecution Insights
Last updated: April 19, 2026
Application No. 18/934,743

Error Alert Encoding for Improved Error Mitigation

Non-Final OA §102§103
Filed
Nov 01, 2024
Examiner
MERANT, GUERRIER
Art Unit
2111
Tech Center
2100 — Computer Architecture & Software
Assignee
Advanced Micro Devices, Inc.
OA Round
1 (Non-Final)
88%
Grant Probability
Favorable
1-2
OA Rounds
2y 3m
To Grant
86%
With Interview

Examiner Intelligence

Grants 88% — above average
88%
Career Allow Rate
1070 granted / 1209 resolved
+33.5% vs TC avg
Minimal -3% lift
Without
With
+-2.8%
Interview Lift
resolved cases with interview
Typical timeline
2y 3m
Avg Prosecution
42 currently pending
Career history
1251
Total Applications
across all art units

Statute-Specific Performance

§101
8.3%
-31.7% vs TC avg
§103
43.7%
+3.7% vs TC avg
§102
16.2%
-23.8% vs TC avg
§112
17.2%
-22.8% vs TC avg
Black line = Tech Center average estimate • Based on career data from 1209 resolved cases

Office Action

§102 §103
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 the initial Office Action based on the application filed 11/01/2024. Claims 1-20 are presented for examination and have been considered below. 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. Claim(s) 1, 2, 4-10, 12-15, and 20 are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Nguyen (OBET: On-the-Fly Byte-Level Error Tracking for Correcting and Detecting Faults in Unreliable DRAM Systems). Claim 1: Nguyen discloses a system comprising: a processor (e.g. memory controller and OS-level Memory Fault Management module) configured to: receive an encoded signal (e.g. Byte-Error Flag BF as defined in Equation 1, in page 7, section 4.2.1) indicating a type of an error detected (e.g. single-bit, multi-bit, parity) in a memory (e.g. DRAM with on-die ECC); and output one or more mitigation commands to mitigate the type of the error detected in the memory based on the encoded signal. For instance, the processor outputs mitigation commands (e.g., trigger scrubbing, update parity, retire page) based on this signal (see, e.g., Sections 4.2.1, 5.2.2, Algorithms 2 & 3, and FIG. 2-4). As per claim 20, the claimed features are rejected similarly to claim 1 above. Claim 2: Nguyen discloses the system of claim 1, wherein the processor is further configured to decode the encoded signal to determine the type of the error detected in the memory. For instance, Nguyen discloses that the processor (EDF module/OS) decodes the encoded Byte-Error Flag (BF) to determine the error type. The BF value directly corresponds to the error type (e.g., 0xFFFF for parity error, a single shifted bit for a data error) as described in Equation 1 and the associated diagnostic procedures (Section 5.2.2, Algorithm 2). Claim 4: Nguyen discloses the system of claim 1, wherein the processor is further configured to select the one or more mitigation commands from multiple different mitigation commands based on the type of the error detected in the memory. For example, a single-bit transient error triggers a data rewrite (scrub) via Algorithm 3, while a permanent error triggers page retirement (Section 5.2.3). Different commands are selected for parity errors versus data errors (Algorithm 2). Claim 5: Nguyen discloses the system of claim 1, wherein the processor is further configured to output a first set of mitigation commands if the type of the error detected in the memory corresponds to a first error type and output a second set of mitigation commands if the type of the error detected in the memory corresponds to a second error type. For instance, Nguyen explicitly discloses outputting a first set of commands (scrubbing/write-back) for transient errors (first type) and a second set of commands (page remapping) for permanent errors (second type), as outlined in the Memory Fault Management (MFM) operations (Sections 5.2.2, 5.2.3, and Table 4). Claim 6: Nguyen discloses the system of claim 1, wherein the encoded signal comprises an alert signal. For instance, Nguyen explicitly uses the ALERT_n pin, defined in the JEDEC standard as an alert signal, to communicate the Byte-Error Flag from the DRAM to the memory controller (Sections 2.3, 4.2.1, 4.2.2, and FIG. 3). The encoded signal is this alert signal. Claim 7: Nguyen discloses the system of claim 1, further comprising a memory system that includes at least the memory. For instance, Nguyen describes a full memory system including the memory (DRAM chips with on-die ECC) and the processor (memory controller/OS) that constitutes the claimed system (FIG. 2, System Overview). Claim 8: Nguyen discloses the system of claim 7, wherein the memory system further includes a buffer, and wherein the processor receives the encoded signal indicating the type of error detected in the memory from the buffer. For instance, the Error Diagnostic and Fixing (EDF) module located in the memory controller contains a "catch-up error buffer" (64-byte SRAM) that stores error information before the OS processes it. The processor (OS) receives the error information (encoded signal) from this buffer (Section 5.1, FIG. 4). Claim 9: Nguyen discloses the system of claim 1, wherein the processor receives the encoded signal indicating the type of the error detected in the memory directly from the memory. For instance, Nguyen discloses the processor (memory controller) receiving the encoded signal (Byte-Error Flag) directly from the memory via the ALERT_n pin, without an intermediary buffer for the initial signal transmission (FIG. 3, Section 4.2.2: "the 16-bit BF is transmitted to the corresponding DRAM controller through the ALERT_n pin"). Claim 10: Nguyen discloses a memory system comprising: a memory (e.g. DRAM array; Abstract); and a buffer (e.g. the EDF module's catch-up error buffer- page 9, section 5.1), the buffer configured to output an encoded signal (error information/BF) indicating a type of an error detected in the memory (Sections 5.1, 5.2.1, Algorithm 1). Claim 12: Nguyen discloses the memory system of claim 10, wherein the buffer is further configured to detect the error in the memory. For instance, Nguyen discloses that the on-die ECC detects the error (e.g. section 3.3, page 5), and this information is passed to and managed by the EDF module/buffer. The buffer is part of the system configured to handle the detected error (Section 5.1, Algorithm 1 procedure EDF_INFORM_ERROR_TO_OS_MFM). Claim 13: Nguyen discloses the memory system of claim 10, wherein the buffer is further configured to output the encoded signal indicating the type of the error detected in the memory to a processor. For instance, Nguyen's EDF module/buffer outputs the error information (encoded signal) to the OS (the processor) via an interrupt and function call, as detailed in Algorithm 1 (Sections 5.1, 5.2.1). Claim 14: Nguyen discloses the memory system of claim 10, wherein the encoded signal comprises an alert signal (e.g. As with claim 6, the encoded signal output by Nguyen's system is carried via the ALERT_n pin, which is an alert signal (Sections 2.3, 4.2.1). Claim 15: Nguyen discloses the memory system of claim 14, wherein the buffer is further configured to encode the alert signal with the type of the error detected in the memory. For instance, Nguyen's system encodes the error type into the Byte-Error Flag (BF) register. This encoded BF is then transmitted via the ALERT_n pin. Therefore, the buffer/EDF system outputs an alert signal encoded with the error type (Equation 1, Section 4.2.1). Claim 20: Nguyen discloses a method comprising: detecting an error in a memory (e.g. Nguyen discloses that the on-die ECC detects the error- see section 3.3, page 5); outputting an encoded signal indicating a type of the error detected in the memory (e.g. Nguyen's EDF module/buffer outputs the error information (encoded signal) to the OS (the processor) via an interrupt and function call, as detailed in Algorithm 1 (Sections 5.1, 5.2.1)); receiving, by a processor, the encoded signal (e.g. Byte-Error Flag BF as defined in Equation 1, in page 7, section 4.2.1) indicating the type of the error (e.g. single-bit, multi-bit, parity) detected in the memory; and outputting, by the processor, one or more mitigation commands to mitigate the type of the error detected in the memory based on the encoded signal. For instance, the processor outputs mitigation commands (e.g., trigger scrubbing, update parity, retire page) based on this signal (see, e.g., Sections 4.2.1, 5.2.2, Algorithms 2 & 3, and FIG. 2-4). 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 (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 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. The factual inquiries for establishing a background for determining obviousness under 35 U.S.C. 103 are summarized as follows: 1. Determining the scope and contents of the prior art. 2. Ascertaining the differences between the prior art and the claims at issue. 3. Resolving the level of ordinary skill in the pertinent art. 4. Considering objective evidence present in the application indicating obviousness or nonobviousness. Claim(s) 3, 18 and 19 are rejected under 35 U.S.C. 103 as being unpatentable over Nguyen as applied to claim1 above, and further in view of Konireddygari et al (US 8,250,273 B2). Claim 3: Nguyen teaches the system of claim 1, but fails to teach that the encoded signal is encrypted, and wherein the processor is further configured to decrypt the encoded signal to determine the type of the error detected in the memory. However, Konireddygari is directly concerned with securing interrupt signaling in a computer system. It teaches encrypting an interrupt vector (a type of encoded signal indicating an interrupt request) using a key (e.g. Abstract). It also teaches providing the key to a processor’s local interrupt controller to enable it to decrypt the encrypted interrupt vector (e.g. Abstract). Therefore, it would have been obvious to a POSITA, before the effective filing date of the claimed invention, to apply the security teaching of Konireddygari to the error reporting system of Nguyen in order to prevent unauthorize access to the system. As per claims 18 and 19, the combination of Nguyen and Konireddygari et al teach encrypting/decrypting the encoded signal, as shown in the rejection of claim 3 above. Claim(s) 11 is rejected under 35 U.S.C. 103 as being unpatentable over Nguyen as applied to claim 10 above. Claim 11: Nguyen teaches the memory system of claim 10, but fails to teach that the buffer comprises a registered clock driver. However, Nguyen teaches, in section 5.1, a buffer in the memory controller (EDF). Therefore, it would have been obvious to one of ordinary skill in the art, before the effective filing date of the claimed invention, to implement such a buffer using standard memory system components, including a Registered Clock Driver (RCD), which is a common element in DIMM design for buffering addresses, commands, and clocks, to perform the stated function. Claim(s) 16 is rejected under 35 U.S.C. 103 as being unpatentable over Nguyen as applied to claim 10 above, and further in view of Bains et al (US 2013/0117641 A1). Claim 16: Nguyen teaches the memory system of claim 10, but fails to teach that the encoded signal is encoded using time domain based encoding. However, Bains teaches using an ALERT_n signal’s pulse width to differentiate between a CRC error and a Command/Address Parity error (e.g. see Figs. 4-6 & [0065]). It also describes a system where the memory controller determines the error type by decoding the duration (pulse width) of the ALERT_n signal (e.g. [0068]). Therefore, it would have been obvious to a POSITA, before the effective filing date of the claimed invention, to a time-domain encoding, as taught by Bains, to implement error-type signaling system described in Nguyen in order to optimize the system. Claim(s) 17 is rejected under 35 U.S.C. 103 as being unpatentable over Nguyen as applied to claim 10 above, and further in view of Crayford (US 6,078,627). Claim 17: Nguyen teaches the memory system of claim 10, but fails to teach that the encoded signal is encoded using voltage level based encoding. However, such a technique was known in the art, before the effective filing date of the claimed invention, as disclosed by Crayford (e.g. col. 1, lines 15-24; it details the MLT-3 encoding scheme, where a +V, 0V, or -V level represents different states of the transmitted data, col. 6, lines 10-25). Therefore, it would have been obvious to a POSITA, before the effective filing date of the claimed invention, to improve the teaching of Nguyen with the one taught by Crayford in order to optimize the system. Any inquiry concerning this communication or earlier communications from the examiner should be directed to GUERRIER MERANT whose telephone number is (571)270-1066. The examiner can normally be reached Monday-Friday 8:00 Am - 5:00 PM. 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. /GUERRIER MERANT/Primary Examiner, Art Unit 2111 1/22/2026
Read full office action

Prosecution Timeline

Nov 01, 2024
Application Filed
Jan 22, 2026
Non-Final Rejection — §102, §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12602286
STORAGE CLASS MEMORY, DATA PROCESSING METHOD, AND PROCESSOR SYSTEM
2y 5m to grant Granted Apr 14, 2026
Patent 12598903
MANUFACTURING METHOD OF DISPLAY DEVICE
2y 5m to grant Granted Apr 07, 2026
Patent 12568497
NLOS WIRELESS BACKHAUL UPLINK COMMUNICATION
2y 5m to grant Granted Mar 03, 2026
Patent 12553935
PINBOARD REPAIR JIG AND PINBOARD ASSEMBLY
2y 5m to grant Granted Feb 17, 2026
Patent 12547493
MULTI-STAGE DECODER WITH ADAPTIVE LEARNING
2y 5m to grant Granted Feb 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
88%
Grant Probability
86%
With Interview (-2.8%)
2y 3m
Median Time to Grant
Low
PTA Risk
Based on 1209 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