Prosecution Insights
Last updated: April 19, 2026
Application No. 18/607,653

COUNTER-BASED MULTIPLICATION USING PROCESSING IN MEMORY

Final Rejection §DP
Filed
Mar 18, 2024
Examiner
YAARY, MICHAEL D
Art Unit
2151
Tech Center
2100 — Computer Architecture & Software
Assignee
Micron Technology, Inc.
OA Round
2 (Final)
87%
Grant Probability
Favorable
3-4
OA Rounds
3y 2m
To Grant
95%
With Interview

Examiner Intelligence

Grants 87% — above average
87%
Career Allow Rate
872 granted / 1001 resolved
+32.1% vs TC avg
Moderate +8% lift
Without
With
+8.0%
Interview Lift
resolved cases with interview
Typical timeline
3y 2m
Avg Prosecution
18 currently pending
Career history
1019
Total Applications
across all art units

Statute-Specific Performance

§101
24.5%
-15.5% vs TC avg
§103
33.9%
-6.1% vs TC avg
§102
21.6%
-18.4% vs TC avg
§112
9.0%
-31.0% vs TC avg
Black line = Tech Center average estimate • Based on career data from 1001 resolved cases

Office Action

§DP
DETAILED ACTION 1. Claims 1-20 are pending in the application. Notice of Pre-AIA or AIA Status 2. The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Double Patenting 3. 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 claims at issue 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); and 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 a nonstatutory double patenting ground provided the reference application or patent either is shown to be commonly owned with this application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b). The USPTO internet Web site contains terminal disclaimer forms which may be used. Please visit http://www.uspto.gov/forms/. The filing date of the application will determine what form 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 http://www.uspto.gov/patents/process/file/efs/guidance/eTD-info-I.jsp. Claims 1-20 are rejected on the ground of non-statutory double patenting as being unpatentable over claims 1-23 of US Pat. 11,934,798. Although the claims at issue are not identical, they are not patentably distinct from each other because the claims are directed to the broader version of the limitations with the limitations of the instant application found in the ‘798 patent. Example mapping below: Application 18/607,653 US Pat. 11,934,798 1. A device, comprising: at least one memory array; and a plurality of memory cells of the at least one memory array, the plurality of memory cells accessible via a plurality of bit lines and a plurality of word lines, wherein the device is configured to store at least one multiplicand or multiplier in the memory array, and wherein the device is configured to generate a sum of the at least one multiplicand or multiplier based on an operation performed on the at least one multiplicand or multiplier. 2. The device of claim 1, wherein the sum is generated based on a plurality of popcount operations. 3. The device of claim 2, wherein each of the plurality of popcount operations is configured to determine a total number of high bits present in a single word line of the plurality of word lines. 5. The device of claim 1, wherein the device is further configured to generate a multiplication result based on the sum. 6. The device of claim 5, wherein the multiplication result is generated based on sequencing through bits of the multiplier. 1. A system comprising: at least one memory device; at least one memory array of a memory device; a plurality of memory cells of the at least one memory array, the plurality of memory cells accessible via a plurality of bit lines and a plurality of word lines, wherein at least one multiplicand is stored in the memory array and at least one multiplier is stored in the memory device; the at least one memory device being configured to: generate a sum of the at least one multiplicand based on a plurality of popcount operations performed on the at least one multiplicand, wherein each of the plurality of popcount operations is configured to determine a total number of high bits present in a single word line of the plurality of word lines; and generate a multiplication result based on the sum and by sequencing through bits of the multiplier. 7. The device of claim 1, wherein the sum is generated based on accumulation of a current sum value with a popcount result, in response to a first bit of the multiplier having a first predefined value. The system of claim 1, wherein the sum is generated based on accumulation of a current sum value with the popcount result, in response to the first bit of multiplier having a first predefined value at a corresponding position. 8. The device of claim 1, wherein at least one multiplicand is stored along a bit line of the plurality of bit lines. 4. The system of claim 1, wherein at least one multiplicand is stored along a corresponding bit line. 9. The device of claim 8, wherein the sum is generated based on a plurality of popcount operations and further wherein the plurality of popcount operations comprises counting the number of bits having the first predefined value for each bit position of the at least one multiplicand. 5. The system of claim 4, wherein the plurality of popcount operations comprises counting the number of bits having the first predefined value for each bit position of the at least one multiplicand. 10. The device of claim 9, wherein bit positions of the at least one multiplicand are stored along a same word line. 6. The system of claim 5, wherein the bit positions of the at least one multiplicand are stored along the same word line. 11. The device of claim 8, further comprising a plurality of sense amplifiers, wherein each sense amplifier is coupled to a respective bit line of the plurality of bit lines, wherein the plurality of sense amplifiers are configured to perform the plurality of popcount operations. 7. The system of claim 4, further comprising a plurality of sense amplifiers, wherein each sense amplifier is coupled to a corresponding bit line, wherein the plurality of sense amplifiers are used to perform the plurality of popcount operations. Response to Arguments 4. Applicant's arguments regarding the Double Patenting rejection have been fully considered but they are not persuasive. Applicant argues that the claims are not obvious in view of the ‘798 patent as claim 1 recites the “device is configured to store at least…” and that the ‘798 patent recites that “at least one multiplicand is stored in the memory array.” Examiner respectfully disagrees. Being configured to store would be a broader recitation and clearly obvious in view the language of the ’798 patent. Applicant’s arguments with respect to the 35 U.S.C. 102 rejection have been fully considered and are persuasive. The 35 U.S.C. 102 rejection has been withdrawn. Allowable Subject Matter 5. Claims 1-20 would be allowable if rewritten or amended to overcome the rejection(s) under Double Patenting, set forth in this Office action. 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 D YAARY whose telephone number is (571)270-1249. The examiner can normally be reached Mon-Fri 9-5:30. 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, James Trujillo can be reached at (571)272-3677. 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 D. YAARY/Primary Examiner, Art Unit 2151
Read full office action

Prosecution Timeline

Mar 18, 2024
Application Filed
Oct 27, 2025
Non-Final Rejection — §DP
Jan 29, 2026
Response Filed
Feb 23, 2026
Final Rejection — §DP (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12591537
INFORMATION PROCESSING DEVICE, INFORMATION PROCESSING METHOD AND STORAGE MEDIUM
2y 5m to grant Granted Mar 31, 2026
Patent 12591411
SYSTEM AND METHOD TO ACCELERATE GRAPH FEATURE EXTRACTION
2y 5m to grant Granted Mar 31, 2026
Patent 12585434
COMPUTING DEVICE AND METHOD
2y 5m to grant Granted Mar 24, 2026
Patent 12585430
FLOATING-POINT CONVERSION WITH DENORMALIZATION
2y 5m to grant Granted Mar 24, 2026
Patent 12585725
NON-RECTANGULAR MATRIX COMPUTATIONS AND DATA PATTERN PROCESSING USING TENSOR CORES
2y 5m to grant Granted Mar 24, 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
87%
Grant Probability
95%
With Interview (+8.0%)
3y 2m
Median Time to Grant
Moderate
PTA Risk
Based on 1001 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