Prosecution Insights
Last updated: April 18, 2026
Application No. 18/308,683

MEMORY SYSTEM WITH IMPROVED MAP TABLE UPDATE EFFICIENCY, MEMORY CONTROLLER THEREFOR, AND OPERATING METHOD THEREOF

Final Rejection §102
Filed
Apr 28, 2023
Examiner
ALSIP, MICHAEL
Art Unit
2139
Tech Center
2100 — Computer Architecture & Software
Assignee
SK Hynix Inc.
OA Round
2 (Final)
75%
Grant Probability
Favorable
3-4
OA Rounds
2y 11m
To Grant
80%
With Interview

Examiner Intelligence

Grants 75% — above average
75%
Career Allow Rate
481 granted / 645 resolved
+19.6% vs TC avg
Moderate +5% lift
Without
With
+5.2%
Interview Lift
resolved cases with interview
Typical timeline
2y 11m
Avg Prosecution
30 currently pending
Career history
675
Total Applications
across all art units

Statute-Specific Performance

§101
2.8%
-37.2% vs TC avg
§103
39.6%
-0.4% vs TC avg
§102
37.3%
-2.7% vs TC avg
§112
15.3%
-24.7% vs TC avg
Black line = Tech Center average estimate • Based on career data from 645 resolved cases

Office Action

§102
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 . Claim Rejections - 35 USC § 102 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-3, 5-9 11-17 and 19-21 is/are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Kanno (US 2021/0064520). Consider claim 1, Kanno discloses a memory system comprising: a storage device; an external interface circuit configured to receive a write logical address associated with a write command and a storage location for mapping information and store the write logical address in the storage location, and to set a first flag indicating whether storage of the write logical address has been completed; and a processor configured to determine the storage location at which the write logical address is to be stored within a map table and control the storage device to program write data associated with the write command, the map table storing map data between external logical addresses and physical addresses of the storage device (abstract, [0028], [0055]-[0057], [0081], [0096]-[0097], [0170], [0178], [0187], Kanno discloses receiving write and read commands, determining where to write data and updating an L2P table to reflect where data is stored. The storage disclosed in Kanno can store a multitude of data (is shared). Kanno discloses a completion response that is stored in a completion queue.). Consider claim 2, Kanno discloses the memory system according to claim 1, wherein the external interface circuit is configured to start receiving the write data after the write logical address is stored in the storage location (abstract, [0028], [0055]-[0057], [0081], [0096]-[0097], [0170], [0178], [0187], Kanno discloses L2P updates can happen before transfer of data or in parallel.). Consider claim 3, Kanno discloses the memory system according to claim 1, wherein an interval in which the write logical address is stored in the storage location and an interval in which the write data is input are configured to partially overlap (abstract, [0028], [0055]-[0057], [0081], [0096]-[0097], [0170], [0178], [0187], Kanno discloses L2P updates can happen before transfer of data or in parallel.). Consider claim 5, Kanno discloses the memory system according to claim 1, wherein the processor is configured to set a second flag indicating whether the programming has been completed (abstract, [0028], [0055]-[0057], [0081], [0096]-[0097], [0170], [0178], [0187], Kanno discloses a completion response that is stored in a completion queue.). Consider claim 6, Kanno discloses the memory system according to claim 1, wherein: the processor is configured to set a second flag indicating whether the programming has been completed, and the processor is configured to process a read command based on the first flag and the second flag set for a read logical address associated with the read command (abstract, [0028], [0055]-[0057], [0081], [0096]-[0097], [0170], [0178], [0187], Kanno discloses a completion response that is stored in a completion queue. The completion response is considered to meet the claim requirements of the first and second flags. A read for data can only be processed if that data is been previously successfully written.). Claims 7-9, 11 and 12 are the memory controller claims to memory system claims 1-3, 5 and 6 above and are rejected in the same manner. Claims 13-15 and 19-20 are the memory claims to memory system claims 1-3, 5 and 6 above and are rejected in the same manner. Consider claim 16, Kanno discloses the operating method according to claim 13, wherein the receiving of the write logical address comprises: receiving, by the external interface circuit, the write command including the write logical address and an address length, from an external device; and storing, by the external interface circuit, the write logical address and the address length in the shared memory region (abstract, [0028], [0055]-[0057], [0081], [0096]-[0097], [0170], [0178], [0187], Kanno discloses logical addresses and lengths are received/stored related to write commands.). Consider claim 17, Kanno discloses the operating method according to claim 13, wherein the receiving of the storage location comprises: determining, by the processor, the storage location at which the write logical address is to be stored within a map table storing map data between external logical addresses and physical addresses of the storage device; storing, by the processor, the write logical address in the shared memory region; and reading, by the processor, the storage location from the shared memory region (abstract, [0028], [0055]-[0057], [0081], [0096]-[0097], [0170], [0178], [0187], Kanno discloses a completion response that is stored in a completion queue. The completion response is considered to meet the claim requirements of the first and second flags. A read for data can only be processed if that data is been previously successfully written.). Consider claim 21, Kanno discloses an operating method of a memory system, the operating method comprising: receiving, by an external interface circuit, a write command including a write logical address and an address length; receiving, by the external interface circuit, write data associated with the write command; and programming, by a processor, the write data associated with the write command in a storage device, wherein a map table storing map data between external logical addresses and physical addresses of the storage device is updated, by the external interface circuit, before the programming of the write data has been completed by the processor; and a first flag is set, by the external interface circuit, after completing update of the map table (abstract, [0028], [0055]-[0057], [0081], [0096]-[0097], [0170], [0178], [0187], Kanno discloses receiving write and read commands, determining where to write data and updating an L2P table to reflect where data is stored. The storage disclosed in Kanno can store a multitude of data (is shared). Kanno discloses L2P updates can happen before transfer of data or in parallel. Kanno discloses a completion response that is stored in a completion queue.). Response to Arguments Applicant's arguments filed 11/21/2025 have been fully considered but they are not persuasive. The applicant argues that in Kanno, the completion response is transmitted to the host after completing both the L2P update and the transfer of the write data, and in the claim, the first flag is set after storage of the write logical address and the first flag is not transmitted to the host. As the applicant has stated, Kanno’s completion response is after the write data is written and the L2P update is made. There does not appear to be a limitation stating that the “first flag” cannot be transmitted to the host. Therefore Kanno appears to disclose the new claim limitations. Conclusion THIS ACTION IS MADE FINAL. Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to MICHAEL ALSIP whose telephone number is (571)270-1182. The examiner can normally be reached M-F 9-5. 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, Kenneth M. Lo can be reached at (571) 272-9774. 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. /MICHAEL ALSIP/Primary Examiner, Art Unit 2136
Read full office action

Prosecution Timeline

Apr 28, 2023
Application Filed
Aug 20, 2025
Non-Final Rejection — §102
Nov 21, 2025
Response Filed
Dec 30, 2025
Final Rejection — §102
Mar 24, 2026
Applicant Interview (Telephonic)
Mar 24, 2026
Examiner Interview Summary
Apr 03, 2026
Request for Continued Examination
Apr 08, 2026
Response after Non-Final Action

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12596685
SYSTEM AND METHODS FOR BANDWIDTH-EFFICIENT DATA ENCODING
2y 5m to grant Granted Apr 07, 2026
Patent 12591518
VALIDITY MAPPING TECHNIQUES
2y 5m to grant Granted Mar 31, 2026
Patent 12591545
SYSTEM AND METHOD FOR SECURING HIGH-SPEED INTRACHIP COMMUNICATIONS
2y 5m to grant Granted Mar 31, 2026
Patent 12585950
METHOD AND ELECTRONIC DEVICE FOR PERFORMING DEEP NEURAL NETWORK OPERATION
2y 5m to grant Granted Mar 24, 2026
Patent 12578856
SYSTEM AND METHOD FOR DATA COMPACTION AND SECURITY USING MULTIPLE ENCODING ALGORITHMS WITH PRE-CODING AND COMPLEXITY ESTIMATION
2y 5m to grant Granted Mar 17, 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

3-4
Expected OA Rounds
75%
Grant Probability
80%
With Interview (+5.2%)
2y 11m
Median Time to Grant
Moderate
PTA Risk
Based on 645 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