Prosecution Insights
Last updated: July 31, 2026
Application No. 18/829,440

PROGRAM CONTINUATION STRATEGIES AFTER MEMORY DEVICE POWER LOSS

Non-Final OA §103
Filed
Sep 10, 2024
Priority
Feb 18, 2022 — continuation of 12/119,068
Examiner
CHO, SUNG IL
Art Unit
2825
Tech Center
2800 — Semiconductors & Electrical Systems
Assignee
Micron Technology Inc.
OA Round
1 (Non-Final)
91%
Grant Probability
Favorable
1-2
OA Rounds
1m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 91% — above average
91%
Career Allowance Rate
542 granted / 593 resolved
+23.4% vs TC avg
Moderate +8% lift
Without
With
+8.3%
Interview Lift
resolved cases with interview
Fast prosecutor
2y 0m
Avg Prosecution
39 currently pending
Career history
621
Total Applications
across all art units

Statute-Specific Performance

§101
0.2%
-39.8% vs TC avg
§103
65.0%
+25.0% vs TC avg
§102
26.8%
-13.2% vs TC avg
§112
2.8%
-37.2% vs TC avg
Black line = Tech Center average estimate • Based on career data from 593 resolved cases

Office Action

§103
DETAILED ACTION This action is responsive to the following communications: the Application filed September 10, 2024. This application is a CON of 17/675,241 filed 02/18/2022. Claims 1-20 are pending. Claims 1, 8 and 15 are independent. Notice of Pre-AIA or AIA Status The present application is being examined under the first inventor to file provisions of the AIA . Double Patenting The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the conflicting claims are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969). A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP §§ 706.02(l)(1) - 706.02(l)(3) for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b). The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to www.uspto.gov/patents/process/file/efs/guidance/eTD-info-I.jsp. Claims 1-20 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1-20 of US Patent No. 12,119,068. Although the claims at issue are not identical, they are not patentably distinct from each other. Instant Application US Patent 12,119,068 Comment Claim 1. A system comprising: a memory device; and a processing device, operatively coupled with the memory device, to perform operations comprising: identifying an open block of the memory device; determining, based on at least one charge loss metric associated with a set of programmed pages of the open block or at least one charge gain metric associated with a set of erased pages of the open block, whether the open block is valid for programming; and responsive to determining that the open block is not valid for programming, abandoning the open block. Claim 1. A system comprising: a memory device; and a processing device, operatively coupled with the memory device, to perform operations comprising: detecting a power up event of the memory device; responsive to detecting the power up event, selecting an open block of the memory device, wherein the open block comprises a set of pages; analyzing the set of pages to obtain at least one of: at least one charge loss metric indicative of charge loss associated with a set of programmed pages of the set of pages, the set of programmed pages comprising at least one of: an oldest written page of the open block, or at least one first sample page associated with at least one respective individual charge loss metric; or at least one charge gain metric indicative of charge gain associated with a set of erased pages of the set of pages, the set of erased pages comprising at least one of: an initial erased page of the open block, or at least one second sample page associated with at least one respective individual charge gain metric; determining, based on at least one of the at least one charge loss metric or the at least one charge gain metric, whether the open block is valid for programming; and responsive to determining that the open block is valid for programming, keeping the open block open for programming. Note footnote1 Claim Rejections - 35 USC § 103 The following is a quotation of AIA 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 of this title, 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 1-20 are rejected under AIA 35 U.S.C. 103 as being unpatentable over Lee et al. (US 2021/0202008) in view of Arora et al. (US 2021/0373764). Regarding independent claims 1, 8 and 15, Lee et al. teach a system comprising: a memory device (FIG. 3 along with FIG. 1); and a processing device, operatively coupled with the memory device, to perform operations comprising: identifying an open block (FIG. 1: O_BLK, para. 0030-0036, the free block FR_BLK … the open block O_BLK …) of the memory device; determining, based on at least one charge loss metric associated with a set of programmed pages of the open block or at least one charge gain metric associated with a set of erased pages of the open block whether the open block is valid for programming (e.g., para. 0042: … a charge loss, charge gain2 … in the free block … Thus, an error may occur during a process of programming new data. For this reason, the conventional controller generates the free block (along with para. 0031: the free block FR_BLK, …, may be used as the open block O_BLK)… just before performing a program operation …; and para. 0177: The controller may determine … the open block O_BLK is changed to a closed block … the open block O_BLK may be changed to the closed block C_BLK; i.e., the closed block does not valid for programming (by para. 0032: … Among closed blocks C_BLK, a memory block … because the memory block has no valid data stored …)). Lee et al’ open block does not explicitly disclose responsive to determining that the open block is not valid for programming, abandoning the open block. Arora et al. teach the deficiencies in e.g., FIG. 7, 736: Open Block as GBB, and accompanying disclosure, e.g., para. 0054: … the controller may mark … as a GBB (para. 0005: grown bad blocks) and remove it from the population of available open blocks. Lee and Arora are analogous art because they both are directed to flash memory device and one of ordinary skill in the art would have had a reasonable expectation of success to modify Lee with the specified features of Arora because they are from the same field of endeavor. It would have been obvious to one of ordinary skill in the art before the effective filing date to apply the teaching of Arora et al. to the teaching of Lee et al. such that a memory, as taught by Lee et al., utilizes a abandoning non valid blocks, as taught by Arora et al., for the purpose of utilizing healthy storage space, thereby improving storage device performance during memory operations. Regarding claims 2, 9 and 16, Lee et al. and Arora et al, as combined, teach the limitations of claims 1, 8 and 15, respectively. Lee et al. further teach the set of programmed pages comprises an oldest written page of the open block (see e.g., FIG. 1: O_BLK, i.e., one of DAT is oldest written). Regarding claims 3, 10 and 17, Lee et al. and Arora et al, as combined, teach the limitations of claims 1, 8 and 15, respectively. Lee et al. further teach the set of programmed pages comprises a set of sample pages, wherein each sample page of the set of sample pages is associated with a respective individual charge loss metric, and wherein the at least one charge loss metric is a function of each respective individual charge loss metric (see FIGS. 5A-5B, and accompanying disclosure, e.g., para. 0123-0129: … the program unit …). Regarding claims 4, 11 and 18, Lee et al. and Arora et al, as combined, teach the limitations of claims 1, 8 and 15, respectively. Lee et al. further teach determining whether the open block is valid for programming further comprises at least one of: determining whether an amount of charge loss is less than or equal to a threshold amount of charge loss; determining whether a number of cells that have a threshold voltage above a charge loss detection read level is greater than or equal to a threshold number of cells; or determining whether a position difference related to movement of a center of a valley of an erased state threshold voltage distribution is greater than or equal to a threshold position difference (see e.g., para. 0042: … the time point of a program operation … charge loss … the threshold voltage distribution of memory cell …). Regarding claims 5 and 12, Lee et al. and Arora et al, as combined, teach the limitations of claims 1 and 15, respectively. Lee et al. further teach the set of erased pages comprises a first erased page of the open block. (see e.g., FIG. 1, ET_BLK from O_BLK). Regarding claims 6, 13 and 19, Lee et al. and Arora et al, as combined, teach the limitations of claims 1, 8 and 15, respectively. Lee et al. further teach the set of erased pages comprises a set of sample pages, wherein each sample page of the set of sample pages is associated with a respective individual charge gain metric, and wherein the at least one charge gain metric is a function of each respective individual charge gain metric (see FIGS. 5A-5B, and accompanying disclosure, e.g., para. 0123-0129: … the erase target blocks …). Regarding claims 7, 14 and 20, Lee et al. and Arora et al, as combined, teach the limitations of claims 1, 8 and 15, respectively. Lee et al. further teach determining whether the open block is valid for programming further comprises at least one of: determining whether an amount of charge gain is less than or equal to a threshold amount of charge gain; determining whether a number of cells that have a threshold voltage below a charge gain detection read level is less than or equal to a threshold number of cells; or determining whether a position difference related to movement of a center of a valley of an erased state threshold voltage distribution is greater than or equal to a threshold position difference (see e.g., para. 0042: … the time point of a program operation … charge gain … the threshold voltage distribution of memory cell …). Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to SUNG IL CHO whose telephone number is (571)270-0137. The examiner can normally be reached M-Th, 7:30AM-5PM; Every other F, 7:30AM-4PM 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, Alexander G Sofocleous can be reached on 571-272-0635. 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. /SUNG IL CHO/Primary Examiner, Art Unit 2825 1 Re independent claims 1, 8 and 15, claims of US Patent recites all the claimed limitations. The various dependent claims are anticipated by/obvious in view of the conflicting patent. 2 A charge loss with respect to a programmed memory cell, and a charge gain with respect to a erase state is an inherent characteristic of a flash memory device (see, for example, Kang et al. (US 2015/0364199), paragraph [0068]).
Read full office action

Prosecution Timeline

Sep 10, 2024
Application Filed
May 12, 2026
Non-Final Rejection mailed — §103
Jul 21, 2026
Examiner Interview Summary
Jul 21, 2026
Response Filed
Jul 21, 2026
Applicant Interview (Telephonic)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12694927
MULTI-PORT SRAM STRUCTURES WITH CELL SIZE OPTIMIZATION
3y 0m to grant Granted Jul 28, 2026
Patent 12682947
MEMORY ARRAY AND MEMORY CELL
2y 3m to grant Granted Jul 14, 2026
Patent 12670950
BIT CELL BASED WRITE SELF-TIME DELAY PATH
2y 3m to grant Granted Jun 30, 2026
Patent 12660145
STACKED INTEGRATED CIRCUIT STRUCTURE AND MANUFACTURING METHOD THEREOF
2y 5m to grant Granted Jun 16, 2026
Patent 12658248
EMBEDDED MEMORY DEVICE AND OPERATING METHOD THEREOF
2y 6m 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
91%
Grant Probability
99%
With Interview (+8.3%)
2y 0m (~1m remaining)
Median Time to Grant
Low
PTA Risk
Based on 593 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