Prosecution Insights
Last updated: May 29, 2026
Application No. 18/442,437

TWO-PART PROGRAMMING OF MEMORY CELLS

Non-Final OA §102§103
Filed
Feb 15, 2024
Priority
Nov 20, 2008 — continuation of 8089805 +7 more
Examiner
NGUYEN, VAN THU T
Art Unit
2824
Tech Center
2800 — Semiconductors & Electrical Systems
Assignee
Lodestar Licensing Group LLC
OA Round
5 (Non-Final)
83%
Grant Probability
Favorable
5-6
OA Rounds
0m
Est. Remaining
89%
With Interview

Examiner Intelligence

Grants 83% — above average
83%
Career Allowance Rate
788 granted / 953 resolved
+14.7% vs TC avg
Moderate +7% lift
Without
With
+6.6%
Interview Lift
resolved cases with interview
Typical timeline
2y 2m
Avg Prosecution
19 currently pending
Career history
987
Total Applications
across all art units

Statute-Specific Performance

§101
0.2%
-39.8% vs TC avg
§103
69.5%
+29.5% vs TC avg
§102
21.0%
-19.0% vs TC avg
§112
7.0%
-33.0% vs TC avg
Black line = Tech Center average estimate • Based on career data from 953 resolved cases

Office Action

§102 §103
DETAILED ACTION The present application is being examined under the pre-AIA first to invent provisions. This Office Action is in response to 02/19/2026 Amendment and 03/06/2026 RCE. Claims 1-3, 6, 8-17, 19-20 are pending and examined. Claims 4-5, 7, 18 have been cancelled. Claim Rejections - 35 USC § 102 The following is a quotation of the appropriate paragraphs of pre-AIA 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 – (b) the invention was patented or described in a printed publication in this or a foreign country or in public use or on sale in this country, more than one year prior to the date of application for patent in the United States. Claims 1-3, 9-10, 14, 17, 20 are rejected under pre-AIA 35 U.S.C. 102(b) as being anticipated by US 7,920,420 to Lee (hereafter Lee) with support from US 6,335,881 to Kim et al. (hereafter Kim). Regarding independent claim 1, Lee teaches a memory device, comprising: control circuitry configured to: program (FIGS 6-7: programming states 202 and 204 corresponding to of 1st Group 200), via a number of pulses in a first programming voltage range (FIG. 8: voltage range corresponding to 1st Group), a first number of memory cells to a level greater than or equal to a first particular level (FIG. 6: states 202 and 204 are greater than state 201); load a second number of memory cells with level 0 data to inhibit programming of the second number of memory cells while the first number of memory cells is programmed (FIG. 6: i.e. inhibiting programming of states 231-201, see 7:35-8:41. Kim provides support that each of the bit lines of unselected group of memory cells is applied with Vcc by loading data “0” in a latch of the corresponding page buffer, see 2:9-12 and 5:39-43); program (FIGS 6-7: programming states 212 and 214 of 2nd Group 210), via a number of pulses in a second, different programming voltage range (FIG. 8: voltage range corresponding to 2nd Group), the second number of memory cells to a level less than a second particular level (FIG. 6: states 212 and 214 are less than state 202), wherein the second particular level is greater than the first particular level (FIG. 6: state 202 is greater than state 201) and a start programming voltage of the first programming voltage range is substantially equal to a stop programming voltage of the second, different programming voltage range (see annotated FIG. 8 below); and inhibit programming of the first number of memory cells while the second number of memory cells is programmed (FIG. 6: i.e. inhibiting programming of states 231-211 and 201-204, see 7:35-8:41). Annotated FIG. 8 of Lee PNG media_image1.png 342 630 media_image1.png Greyscale Regarding dependent claim 2, Lee teaches the control circuit further configured to: load data to be programmed to the first number of cells prior to programming the first number of cells; and load data to be programmed to the second number of memory cells prior to programming the second number of cells (because a select operation of the group units is repeated, see 8:20-41). Regarding dependent claim 3, Lee teaches load inhibit level data to the first number of cells prior to programming the second number of cells (because a select operation of the group units is repeated, see 8:20-41). Regarding dependent claim 9, Lee teaches wherein the control circuitry is configured to load the first number of memory cells with level 0 data to inhibit programming of the first number of memory cells while the second number of memory cells is programmed (i.e. applying Vcc to unselect bit lines of unselected erased memory cells, also see support from Kim, 2:9-12 and 5:39-43). Regarding independent claim 10, Jung teaches a memory device, comprising: control logic configured to: load data to be programmed to levels within a first number of levels (FIGS 6-7: loading data for programming states 202 and 204 of 1st Group 200) that are greater than or equal to a first particular level (FIG. 6: states 202 and 204 are greater than state 201); program first memory cells to the levels within the first number of levels using a first set of program pulses having programming voltages within a first programming voltage range (FIG. 8: programming states 202 and 204 with voltage range corresponding to 1st Group); load second memory cells with level 0 data to inhibit programming of the second memory cells to be programmed to levels within a second number of levels that are less than a second particular level while the first memory cells are programmed (i.e. inhibiting programming other states 231-214, which are less than state 202, see 7:35-8:41. Kim provides support that each of the bit lines of unselected group of memory cells is applied with Vcc by loading data “0” in a latch of the corresponding page buffer, see 2:9-12 and 5:39-43), wherein the second particular level is greater than the first particular level (FIG. 6: state 202 is greater than state 201); load data to be programmed to the levels within the second number of levels (FIGS 6-7: loading data for programming states 212 and 214 of 2nd Group 210); and program the second memory cells to the levels within the second number of levels using a second set of program pulses having programming voltages within a second programming voltage range (FIG. 8: programing states 212 and 214 with voltage range corresponding to 2nd Group), wherein a start programming voltage of the first programming voltage range is substantially equal to a stop programming voltage of the second programming voltage range (see annotated FIG. 8 above). Regarding dependent claim 14, see rejection applied to claim 10 above. Regarding independent claim 17, Lee teaches a method of programming a memory, comprising: loading data for cells to be programmed (FIGS 6-7: loading data for programming states 202 and 204 of 1st Group 200) to a level greater than or equal to a first particular level (FIG. 6: states 202 and 204 are greater than state 201); loading data for cells to be programmed to a level less than a second particular level with level 0 data (i.e. inhibiting programming other states 231-214, which are less than state 202, see 7:35-8:41. Kim provides support that each of the bit lines of unselected group of memory cells is applied with Vcc by loading data “0” in a latch of the corresponding page buffer, see 2:9-12 and 5:39-43), wherein the second particular level is greater than the first particular level (FIG. 6: state 202 is greater than state 201); programming the cells to be programmed with program pulses in a first voltage range (FIG. 8: programming states 202 and 204 with voltage range corresponding to 1st Group); re-loading data for cells to be programmed to a level less than the first particular level with actual data to be programmed (FIGS 6-7: loading data for programming states 212 and 214 of 2nd Group 210); and programming the re-loaded cells to be programmed with program pulses in a second voltage range (FIG. 8: programing states 212 and 214 with voltage range corresponding to 2nd Group), wherein a start programming voltage of the first programming voltage range is substantially equal to a stop programming voltage of the second, different programming voltage range (see annotated FIG. 8 above). Regarding dependent claim 20, Lee teaches re-loading data for cells to be programmed to a level greater than or equal to the second particular level with the inhibit level prior to programming the re-loaded cells the program pulses in the second voltage range (because when programing of states 202 and 204 is completed, states 202 and 204 become unselected group and are applied with program inhibit voltage Vcc). Claims 6, 8, 11-13, 15-16, 19 are rejected under pre-AIA 35 U.S.C. 103(a) as being unpatentable over Lee in view of US 7,602,650 to Jung et al. (hereafter Jung) with support from Kim. Lee teaches, as applied in prior rejection of claim 1, all claimed subject matter except further limitations set forth in the following claim(s). Regarding dependent claims 6, Jung suggests 16-level memory cells are grouped into first and second programming voltage ranges, each includes different numbers of target threshold voltage states (see 12:47-52). Jung is silent regarding particular voltage values. Since Lee and Jung are both from the same field of endeavor, the purpose disclosed by Jung would have been recognized in the pertinent art of Lee. It would have been obvious to one with ordinary skill in the art to realize that the recited particular values are merely design choice depending at least on type of flash memory cells and grouping of states. Regarding dependent claim 8, Jung teaches the memory comprises a 16 level memory (see FIG. 6). Jung does not explicitly teach the first number of cells are programmed to levels 8-15 and the second number of cells are programmed to levels 0-7. However, Jung suggests the groups may be selected to include different numbers of target threshold voltage states (see 12:47-52). Regarding dependent claims 11-13, see rejection applied to claim 8 above. Regarding dependent claims 15-16, see rejection applied to claim 6 above. Regarding dependent claim 19, see rejection applied to claim 8 above, wherein first particular level and second particular level are the same level. Response to Arguments Applicant’s arguments with respect to claims 1-3, 6, 8-17, 19-20 have been considered but are moot because of the new ground of rejection. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to VANTHU NGUYEN whose telephone number is (571)272-1881. The examiner can normally be reached M-F: 7:00AM - 3:00PM. 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 on (571) 272-1869. 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. April 9, 2026 /VANTHU T NGUYEN/Primary Examiner, Art Unit 2824
Read full office action

Prosecution Timeline

Show 6 earlier events
Jul 07, 2025
Response after Non-Final Action
Aug 11, 2025
Non-Final Rejection mailed — §102, §103
Dec 05, 2025
Response Filed
Jan 02, 2026
Final Rejection mailed — §102, §103
Feb 12, 2026
Response after Non-Final Action
Mar 06, 2026
Request for Continued Examination
Mar 14, 2026
Response after Non-Final Action
Apr 13, 2026
Non-Final Rejection mailed — §102, §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12640941
Systems and Methods for Providing Reliable Physically Unclonable Functions
3y 10m to grant Granted May 26, 2026
Patent 12626731
METHODS FOR OPTIMIZING SEMICONDUCTOR DEVICE PLACEMENT ON A SUBSTRATE FOR IMPROVED PERFORMANCE, AND ASSOCIATED SYSTEMS AND METHODS
2y 3m to grant Granted May 12, 2026
Patent 12620425
MEMORY DEVICE AND METHOD OF OPERATING THE SAME
2y 6m to grant Granted May 05, 2026
Patent 12618893
APPARATUS AND METHOD OF MEASURING RELIABILITY FOR FLASH MEMORY MATERIAL THROUGH A CURRENT MEASUREMENT
2y 6m to grant Granted May 05, 2026
Patent 12620448
SOLID STATE DRIVE (SSD) WITH IN-FLIGHT ERASURE ITERATION SUSPENSION
1y 10m to grant Granted May 05, 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

5-6
Expected OA Rounds
83%
Grant Probability
89%
With Interview (+6.6%)
2y 2m (~0m remaining)
Median Time to Grant
High
PTA Risk
Based on 953 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