Prosecution Insights
Last updated: October 27, 2026
Application No. 18/531,100

MANAGING ALLOCATION OF BLOCKS IN A MEMORY SUB-SYSTEM

Non-Final OA §103
Filed
Dec 06, 2023
Priority
Dec 16, 2022 — provisional 63/433,322
Examiner
STORMES, JOSEPH FIDELIS
Art Unit
2825
Tech Center
2800 — Semiconductors & Electrical Systems
Assignee
Micron Technology Inc.
OA Round
3 (Non-Final)
88%
Grant Probability
Favorable
3-4
OA Rounds
0m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 88% — above average
88%
Career Allowance Rate
22 granted / 25 resolved
+20.0% vs TC avg
Strong +17% interview lift
Without
With
+16.7%
Interview Lift
resolved cases with interview
Typical timeline
2y 6m
Avg Prosecution
23 currently pending
Career history
60
Total Applications
across all art units

Statute-Specific Performance

§103
52.4%
+12.4% vs TC avg
§102
34.1%
-5.9% vs TC avg
§112
13.0%
-27.0% vs TC avg
Black line = Tech Center average estimate • Based on career data from 25 resolved cases

Office Action

§103
DETAILED ACTION This action is responsive to the following: request for continued examination filed on June 22, 2026, the amendments to claims filed on May 1, 2026, and the information disclosure stamen filed on June 22, 2026. Claims 1-4, 6-11, 13-18, and 20 are pending. Claims 1, 8, and 15 are independent. Claims 5, 12, and 19 are cancelled by applicant. 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 . Information Disclosure Statement The information disclosure statement (IDS) submitted on June 22, 2026 is in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner. Continued Examination Under 37 CFR 1.114 A request for continued examination under 37 CFR 1.114, including the fee set forth in 37 CFR 1.17(e), was filed in this application after final rejection. Since this application is eligible for continued examination under 37 CFR 1.114, and the fee set forth in 37 CFR 1.17(e) has been timely paid, the finality of the previous Office action has been withdrawn pursuant to 37 CFR 1.114. Applicant's submission filed on May 13, has been entered. Response to Amendment The amendment filed on May 1, 2026 have been entered. Claim Rejections - 35 USC § 103 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 1-3, 7-10, 14-17, and 20 are rejected under 35 U.S.C. 103 as being unpatentable over Inbar et al (US 20210389879) in view of Seol et al (US 20120268988 A1) Regarding Independent Claim 1, Inbar teaches a system comprising: a memory device (Fig. 1: 104); and a processing device (Fig. 1: 102), operatively coupled with the memory device (Fig. 1: 104), to perform operations comprising: performing a first programming operation (Fig. 14: 2 programming both zones at different WL, WL1, Zone A) on a first set of cells (Fig 14: Plane 0, Plane 1) associated with a first wordline (Fig. 14: WL1) of a first die (Fig. 14: Zone A) of the memory device (Fig. 1: 104); identifying, based on a first predefined value, a second wordline (Fig. 14: WL0) of a second die (Fig. 14: Zone B) of the memory device (Fig. 1: 104), wherein the first predefined value is a shift in an index value of the first wordline (Fig. 14: WL1) of the first die (Fig. 14: Zone A) of the memory device (Fig. 1: 104); and performing a second programming operation (Fig. 14: 2 programming both zones at different WL, WL0, Zone B) on a second set of cells (Fig 14: Plane 2, Plane 3) associated with the second wordline (Fig. 14: WL0) of the second die (Fig. 14: Zone B), wherein the second wordline (Fig. 14: WL1) of the second die (Fig. 14: Zone B) is associated with a different index (Fig. 14: 0) value than the first wordline (Fig. 14: WL1) of the first die (Fig. 14: Zone A). Inbar fails to teach wherein the first predefined value is determined based on grouping wordlines of each die by raw bit error rate (RBER). Seol teaches grouping word lines based on the bit error rate. (para “word lines WL0-WLm are divided into an upper word line group UWLG and a lower word line group LWLG. The upper word line group UWLG and the lower word line group LWLG may be determined depending on which select line, i.e., the string select line SSL or the ground select line GSL, the word lines are adjacent or closest to. The upper word line group UWLG and the lower word line group LWLG may be determined depending on bit error rates of the memory cells connected to each word line group. In this case, the number of word lines in the upper word line group UWLG and the lower word line group LWLG may vary depending on the bit error rates.”) Seol states in paragraph 37 that organizing the cells based on bit error rates can improve the overall storage capacity of a non-volatile memory devices. Therefore, this would represent an obvious improvement to the operation of non-volatile memories. It would therefore have been obvious to one of ordinary skill in the art prior to the filing date of the claimed invention to apply the teachings of Seol to the teachings of Inbar to produce a memory where the wordlines are grouped based on the bit error rates of cells on a given word line. Regarding Claim 2, Inbar and Seol teach the limitations of Claim 1. Inbar further teaches the limitations of claim 1 further comprising: receiving a request to perform a third programming operation (para 116 “The embodiment of FIG. 14 illustrates an embodiment in which multiple zones can be assigned to a single die, and where each of the zones is assigned to multiple planes (two planes each).”; Fig. 14: 2 programming both zones at different WL); identifying, based on a second predefined value, a third wordline of a third die of the memory device, wherein the second predefined value is a shift in an index value of the second wordline of the second die of the memory device; and (para 116 “The embodiment of FIG. 14 illustrates an embodiment in which multiple zones can be assigned to a single die, and where each of the zones is assigned to multiple planes (two planes each).”; Fig. 14: 2 programming both zones at different WL) performing the third programming operation on a third set of cells associated with the third wordline of the third die, wherein the third wordline of the third die is associated with a different index value than the first wordline of the first die and the second wordline of the second die. (para 116 “The embodiment of FIG. 14 illustrates an embodiment in which multiple zones can be assigned to a single die, and where each of the zones is assigned to multiple planes (two planes each).”; Fig. 14: 2 programming both zones at different WL) Inbar teaches a plurality of die (para 35) and that multiple parallel programming operations can occur in parallel (Fig. 14: programming both zones at different WL) and that this programming method can be used in multi-zone arrangements where each zone consists of two planes each (para 115-116). Thus, a third programming operation in a third die based on a second predefined value is anticipated. Regarding Claim 3, Inbar and Seol teach the limitations of Claim 1. Inbar further teaches wherein performing the first programming operation comprises performing a write operation (para 114-116; Fig. 14: programming both zones at different WL; the write operation and programming are used interchangeably to refer to the same thing. It is well understood in the art that a write operation and programming operation are the same for non-volatile memories). Regarding Claim 7, Inbar and Seol teach the limitations of Claim 1. Inbar further teaches wherein the first predefined value is computed using a hardware accelerator (para 34; “The XOR engines 224/254 and ECC engines 226/256 are dedicated hardware circuits, known as hardware accelerators.”) associated with the memory device (Fig. 1: 104). Regarding Independent Claim 8, Inbar teaches a method comprising: computing a predefined value associated with each die of a memory device (Fig. 1: 104), wherein the predefined value is a shift in an index value of each wordline associated with each die of the memory device (Fig. 1: 104); receiving a request to perform a first programming operation (Fig. 14: 2 programming both zones at different WL, WL1, Zone A); identifying, based on the predefined value, a first wordline (Fig. 14: WL1) of a first die (Fig. 14: Zone A) of the memory device (Fig. 1: 104); performing the first programming operation (Fig. 14: 2 programming both zones at different WL, WL1, Zone A) on a first set of cells (Fig 14: Plane 0, Plane 1) associated with the first wordline (Fig. 14: WL1) of the first die of the memory device (Fig. 1: 104); identifying, based on the predefined value, a second wordline (Fig. 14: WL0) of a second die (Fig. 14: Zone B) of the memory device (Fig. 1: 104); and performing a second programming operation (Fig. 14: 2 programming both zones at different WL, WL0, Zone B) on a second set of cells (Fig 14: Plane 2, Plane 3) associated with the second wordline (Fig. 14: WL0) of the second die (Fig. 14: Zone B) , wherein the second wordline (Fig. 14: WL0) of the second die (Fig. 14: Zone B) is associated with a different index value (Fig. 14: 0) than the first wordline (Fig. 14: WL1) of the first die (Fig. 14: Zone B). Inbar fails to teach wherein the first predefined value is determined based on grouping wordlines of each die by raw bit error rate (RBER). Seol teaches grouping word lines based on the bit error rate. (para “word lines WL0-WLm are divided into an upper word line group UWLG and a lower word line group LWLG. The upper word line group UWLG and the lower word line group LWLG may be determined depending on which select line, i.e., the string select line SSL or the ground select line GSL, the word lines are adjacent or closest to. The upper word line group UWLG and the lower word line group LWLG may be determined depending on bit error rates of the memory cells connected to each word line group. In this case, the number of word lines in the upper word line group UWLG and the lower word line group LWLG may vary depending on the bit error rates.”) Seol states in paragraph 37 that organizing the cells based on bit error rates can improve the overall storage capacity of a non-volatile memory devices. Therefore, this would represent an obvious improvement to the operation of non-volatile memories. It would therefore have been obvious to one of ordinary skill in the art prior to the filing date of the claimed invention to apply the teachings of Seol to the teachings of Inbar to produce a memory where the wordlines are grouped based on the bit error rates of cells on a given word line. Regarding Claim 9, Inbar and Seol teach the limitations of Claim 8. Inbar further teaches the method of claim 8, further comprising: receiving a request to perform a third programming operation (para 116 “The embodiment of FIG. 14 illustrates an embodiment in which multiple zones can be assigned to a single die, and where each of the zones is assigned to multiple planes (two planes each).”; Fig. 14: 2 programming both zones at different WL); identifying, based on the predefined value, a third wordline of a third die of the memory device (para 116 “The embodiment of FIG. 14 illustrates an embodiment in which multiple zones can be assigned to a single die, and where each of the zones is assigned to multiple planes (two planes each).”; Fig. 14: 2 programming both zones at different WL); and performing the third programming operation on a third set of cells associated with the third wordline of the third die, wherein the third wordline of the third die is associated with a different index value than the first wordline of the first die and the second wordline of the second die. (para 116 “The embodiment of FIG. 14 illustrates an embodiment in which multiple zones can be assigned to a single die, and where each of the zones is assigned to multiple planes (two planes each).”; Fig. 14: 2 programming both zones at different WL) Inbar teaches a plurality of die (para 35) and that multiple parallel programming operations can occur in parallel (Fig. 14: programming both zones at different WL) and that this is programming method can be used in multi-zone arrangements where each zone consists of two planes each (para 115-116). Thus, a third programming operation in a third die based on a second predefined value is anticipated. Regarding Claim 10, Inbar and Seol teach the limitations of Claim 8. Inbar further teaches wherein performing the first programming operation comprises performing a write operation (para 114-116; Fig. 14: programming both zones at different WL; the write operation and programming are used interchangeably to refer to the same thing. It is well understood in the art that a write operation and programming operation are the same for non-volatile memories). Regarding Claim 14, Inbar and Seol teach the limitations of Claim 8. Inbar further teaches wherein the predefined value is computed using a hardware accelerator (para 34; “The XOR engines 224/254 and ECC engines 226/256 are dedicated hardware circuits, known as hardware accelerators.”) associated with the memory device (Fig. 1: 104). Regarding Independent Claim 15, Inbar teaches a non-transitory computer-readable storage medium (Fig. 1: 104) comprising instructions that, when executed by a processing device (Fig. 1: 102), cause the processing device (Fig. 1: 102) to perform operations comprising: performing a first programming operation (Fig. 14: 2 programming both zones at different WL, WL1, Zone A) on a first set of cells (Fig 14: Plane 0, Plane 1) associated with a first wordline (Fig. 14: WL1) of a first die (Fig. 14: Zone A) of the memory device (Fig. 1: 104); identifying, based on a first predefined value, a second wordline (Fig. 14: WL0) of a second die (Fig. 14: Zone B) of the memory device (Fig. 1: 104), wherein the first predefined value is a shift in an index value of the first wordline (Fig. 14: WL1) of the first die (Fig. 14: Zone A) of the memory device (Fig. 1: 104); and performing a second programming operation (Fig. 14: 2 programming both zones at different WL, WL0, Zone B) on a second set of cells (Fig 14: Plane 2, Plane 3) associated with the second wordline (Fig. 14: WL0) of the second die (Fig. 14: Zone B), wherein the second wordline (Fig. 14: WL1) of the second die (Fig. 14: Zone B) is associated with a different index (Fig. 14: 0) value than the first wordline (Fig. 14: WL1) of the first die (Fig. 14: Zone A). Inbar fails to teach wherein the first predefined value is determined based on grouping wordlines of each die by raw bit error rate (RBER). Seol teaches grouping word lines based on the bit error rate. (para “word lines WL0-WLm are divided into an upper word line group UWLG and a lower word line group LWLG. The upper word line group UWLG and the lower word line group LWLG may be determined depending on which select line, i.e., the string select line SSL or the ground select line GSL, the word lines are adjacent or closest to. The upper word line group UWLG and the lower word line group LWLG may be determined depending on bit error rates of the memory cells connected to each word line group. In this case, the number of word lines in the upper word line group UWLG and the lower word line group LWLG may vary depending on the bit error rates.”) Seol states in paragraph 37 that organizing the cells based on bit error rates can improve the overall storage capacity of a non-volatile memory devices. Therefore, this would represent an obvious improvement to the operation of non-volatile memories. It would therefore have been obvious to one of ordinary skill in the art prior to the filing date of the claimed invention to apply the teachings of Seol to the teachings of Inbar to produce a memory where the wordlines are grouped based on the bit error rates of cells on a given word line. Regarding Claim 16, Inbar and Seol teach the limitations of Claim 15. Inbar further teaches wherein the processing device (Fig. 1: 102) is to perform operations further comprising: identifying, based on a second predefined value, a third wordline of a third die of the memory device, wherein the second predefined value is a shift in an index value of the second wordline of the second die of the memory device; and (para 116 “The embodiment of FIG. 14 illustrates an embodiment in which multiple zones can be assigned to a single die, and where each of the zones is assigned to multiple planes (two planes each).”; Fig. 14: 2 programming both zones at different WL) performing the third programming operation on a third set of cells associated with the third wordline of the third die, wherein the third wordline of the third die is associated with a different index value than the first wordline of the first die and the second wordline of the second die. (para 116 “The embodiment of FIG. 14 illustrates an embodiment in which multiple zones can be assigned to a single die, and where each of the zones is assigned to multiple planes (two planes each).”; Fig. 14: 2 programming both zones at different WL) Inbar teaches a plurality of die (para 35) and that multiple parallel programming operations can occur in parallel (Fig. 14: programming both zones at different WL) and that this programming method can be used in multi-zone arrangements where each zone consists of two planes each (para 115-116). Thus, a third programming operation in a third die based on a second predefined value is anticipated. Regarding Claim 17, Inbar and Seol teach the limitations of Claim 15. Inbar further teaches wherein performing the first programming operation comprises performing a write operation (para 114-116; Fig. 14: programming both zones at different WL; the write operation and programming are used interchangeably to refer to the same thing. It is well understood in the art that a write operation and programming operation are the same for non-volatile memories). Regarding Claim 20, Inbar and Seol teach the limitations of Claim 15. Inbar further teaches wherein the predefined value is computed using a hardware accelerator (para 34; “The XOR engines 224/254 and ECC engines 226/256 are dedicated hardware circuits, known as hardware accelerators.”) associated with the memory device (Fig. 1: 104). Claims 4, 6, 11, 13, and 18 are rejected under 35 U.S.C. 103 as being unpatentable over Inbar et al (US 20210389879) and Seol et al (US 20120268988 A1) in view of Krakulak et al (US 20160147582). Regarding Claim 4, Inbar and Seol teach the limitations of Claim 1. Inbar teaches applying an index value to one wordline (Fig. 14: WL1) in one die (Fig. 14: Zone A) and a different index value (Fig. 14: WL2) in another die (Fig. 14: Zone B). Inbar fails to teach a look-up table that can be used to identify word line index values and apply value to shift from one index value in one die to an index value in another. However, Krakulak teaches a table of word line values for the purpose of performing operations on memory cells (para 39; “Each wordline of a block may be represented in the table.”). Inbar states that “When programming memory cells to different word lines that are in different fingers of different blocks in different planes of a die, each of the word lines needs to receive a programming voltage Vpgm. Because the word lines are in different sub-blocks of different blocks (and are likely to be at different word line positions), it is likely that one of the word lines will program faster than the other word line due to the different word line positions.” Thus, it would be advantageous to have a table that stores word lines index values that can be used to identify the word line being programmed so a different word line in a different die can be programmed in order to speed up the programming operation. It would have been obvious to one of ordinary skill in the art prior to the filing date of the claimed invention to apply the teachings of Krakulak to the teachings of Inbar to produce a memory device that retrieves a predefined value from a table based on a current first word line selected in a first die and then applies the predefined value to the index value of the value of the first word line to select a second word line with a different index value in a second die. Regarding Claim 6, Inbar, Seol, and Krakulak teach the limitations of Claim 1. Inbar Fails to teach wherein the first predefined value is computed based on an error count associated with each die of the memory device. Krakulak teaches keeping an error count with in the memory (para 3). It is well understood that correcting for errors in memory arrays often need to be accounted for by counting the number of errors in the cells of the array in order to prevent read errors. Thus, it would be obvious to apply the methodology of counting errors and correcting for it when shifting between word lines that are selected between the die of the memory device. It would have been obvious to one of ordinary skill in the art prior to the filing date of the claimed invention to apply the teachings of Krakulak to the teachings of Inbar in order to produce a predefined value used to shift the index value of a first word line in one die to a second value in another word line based on the error count associated with each die. Regarding Claim 11, Inbar and Seol teach the limitations of Claim 8. Claim 11 is rejected for the same reasons as claim 4. Regarding Claim 13, Inbar and Seol teach the limitations of Claim 8. Claim 13 is rejected for the same reasons as claim 6. Regarding Claim 18, Inbar and Seol teach the limitations of Claim 15. Claim 18 is rejected for the same reasons as claim 4. Response to Arguments Applicant’s arguments with respect to claims 1-3, 7-10, 14-17, and 20 have been considered but are moot because the new ground of rejection. Applicant’s first argument seems to rely largely on the basis that memory Zones described in Inbar are not analogous to memory die. However, both are just arbitrarily defined regions of memory cells. Within the context of this application which is largely focused on a method of operating memory devices the is no difference since both focus one how word lines are being selected in relation to one another. Applicant’s argument then focuses on the amendment to independent claims 1, 8, and 15, which bases the grouping of word lines based on raw bit error rates. This limitation is addressed by the addition of Seol, which teaches grouping word lines in a memory based on bit error rates. Therefore, the rejection of these claims are maintained. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to JOSEPH FIDELIS STORMES whose telephone number is (571)272-3443. The examiner can normally be reached M-F: 6:30am-4pm CST. 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 Sofocleous can be reached at 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. /JOSEPH FIDELIS STORMES/ Examiner, Art Unit 2825 /Donald HB Braswell/ Primary Examiner, Art Unit 2825
Read full office action

Prosecution Timeline

Dec 06, 2023
Application Filed
Sep 05, 2025
Non-Final Rejection mailed — §103
Dec 05, 2025
Response Filed
Mar 19, 2026
Final Rejection mailed — §103
May 01, 2026
Response after Non-Final Action
Jun 22, 2026
Request for Continued Examination
Jun 24, 2026
Response after Non-Final Action
Aug 26, 2026
Non-Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12770691
METHOD OF ERASING MEMORY CELLS OF FLASH MEMORY DEVICE AND AN FLASH MEMORY DEVICE USING THE SAME
2y 9m to grant Granted Oct 20, 2026
Patent 12763114
CIRCUIT WITH A LOW-POWER CHARGE-SHARING LIGHT-SLEEP MODE
3y 3m to grant Granted Oct 13, 2026
Patent 12744065
SIGNAL RETIMING WITHIN MEMORY SYSTEMS
2y 5m to grant Granted Sep 22, 2026
Patent 12744088
MEMORY DEVICE AND OPERATION METHOD THEREOF
2y 3m to grant Granted Sep 22, 2026
Patent 12725632
MAGNETIC STORAGE DEVICE PROVIDED WITH MAGNETORESISTIVE ELEMENT
2y 5m to grant Granted Sep 01, 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

3-4
Expected OA Rounds
88%
Grant Probability
99%
With Interview (+16.7%)
2y 6m (~0m remaining)
Median Time to Grant
High
PTA Risk
Based on 25 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