Method and apparatus for automatic expansion of storage array, device and medium

US12579349B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-12579349-B2
Application numberUS-202217954468-A
CountryUS
Kind codeB2
Filing dateSep 28, 2022
Priority dateDec 21, 2021
Publication dateMar 17, 2026
Grant dateMar 17, 2026

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A method for automatic expansion of a storage array includes: acquiring a word-line total number and bit-line total number of a target expanded storage array; calculating a translation amount of a translation array in a translation direction according to the word-line total number and the bit-line total number, a word-line total number and bit-line total number of the translation array and a preset translation rule, and calculating a number of repetitions of a repetition array in a repetition direction according to the translation amount, a word-line total number and bit-line total number of the repetition array and a preset repetition rule; and controlling at least part of the translation array and at least part of the repetition array to translate the translation amount along the translation direction and controlling the repetition array to repeat for the number of repetitions along the repetition direction to obtain the target expanded storage array.

First claim

Opening claim text (preview).

The invention claimed is: 1 . A method for automatic expansion of a storage array, comprising: acquiring a total number of word lines of a target expanded storage array and a total number of bit lines of the target expanded storage array; calculating a translation amount of a translation array in a translation direction according to the total number of word lines, the total number of bit lines, a total number of word lines of the translation array, a total number of bit lines of the translation array, and a preset translation rule, and calculating a number of repetitions of a repetition array in a repetition direction according to the translation amount, a total number of word lines of the repetition array, a total number of bit lines of the repetition array, and a preset repetition rule; and controlling at least part of the translation array and at least part of the repetition array to translate by the translation amount along the translation direction, and controlling the repetition array to repeat for the number of repetitions along the repetition direction, to obtain the target expanded storage array. 2 . The method of claim 1 , wherein the translation array comprises a first translation array defined to translate in a first direction, a second translation array defined to translate in a second direction, and a third translation array defined to translate in the first direction and the second direction; and the calculating a translation amount of a translation array in a translation direction comprises: calculating a first-direction translation amount of the first translation array in the first direction according to a difference between the total number of bit lines of the target expanded storage array and the total number of bit lines of the translation array; calculating a second-direction translation amount of the second translation array in the second direction according to a difference between the total number of word lines of the target expanded storage array and the total number of word lines of the translation array; and using a vector sum of the first-direction translation amount and the second-direction translation amount as a third-direction translation amount of the third translation array. 3 . The method of claim 2 , wherein the calculating a translation amount of a translation array in a translation direction further comprises: determining a word line pitch and a bit line pitch of the storage array, wherein the word line pitch is an average distance between two adjacent word lines, and the bit line pitch is an average distance between two adjacent bit lines; and calculating the first-direction translation amount stretch_x and the second-direction translation amount stretch_y according to the following formulae: stretch_ x =( N bitline− N corner b )*bitline_pitch; and stretch_ y =( N wordline− N corner w )*wordline_pitch; in the formulae, Nwordline is the total number of word lines of the target expanded storage array, Ncornerw is the total number of word lines of the translation array, Nbitline is the total number of bit lines of the target expanded storage array, Ncornerb is the total number of bit lines of the translation array, wordline_pitch is the word line pitch, and bitline_pitch is the bit line pitch. 4 . The method of claim 2 , wherein after controlling at least part of the translation array and at least part of the repetition array to translate by the translation amount along the translation direction, the repetition array is controlled to repeat for the number of repetitions along the repetition direction. 5 . The method of claim 2 , wherein the repetition array comprises a first repetition array to be repeated in the first direction, a second repetition array to be repeated in the second direction, and a third repetition array to be repeated in a vector sum direction of the first direction and the second direction; and the calculating a number of repetitions of a repetition array in a repetition direction comprises: calculating a first number of repetitions of the first repetition array and the third repetition array in the first direction according to the difference between the total number of bit lines of the target expanded storage array and the total number of bit lines of the translation array; and calculating a second number of repetitions of the second repetition array and the third repetition array in the second direction according to the difference between the total number of word lines of the target expanded storage array and the total number of word lines of the translation array. 6 . The method of claim 5 , wherein the calculating the first number of repetitions and the second number of repetitions further comprises: determining a number of bit lines Nb in the first repetition array and a number of word lines Nw in the second repetition array; and calculating the first number of repetitions repetition_x and the second number of repetitions repetition_y according to the following formulae: repetition_ x =(( Nr bitline− N corner b )/ Nb )−1; and repetition_ y =(( Nr wordline− N corner w )/ Nw )−1; in the formulae, Nrwordline is the total number of word lines of the target expanded storage array, Nrbitline is the total number of bit lines of the target expanded storage array, Ncornerw is the total number of word lines of the translation array, and Ncornerb is the total number of bit lines of the translation array. 7 . The method of claim 1 , wherein the translation array comprises a corner array of the target expanded storage array. 8 . The method of claim 7 , wherein the translation array is a corner array of an initial array, and the translation array and the repetition array together form the initial array; and the repetition array is located between adjacent translation arrays. 9 . The method of claim 7 , wherein the translation array is a corner array of an initial array, and the initial array is composed of the translation array and an intermediate array; and a length of the repetition array in the repetition direction is less than a length of the intermediate array in the repetition direction, and a width of the repetition array in the repetition direction is equal to a width of the intermediate array in the repetition direction. 10 . The method of claim 2 , wherein: the first direction is consistent with an extension direction of word lines; and the second direction is consistent with an extension direction of bit lines. 11 . A computer device, comprising a memory and a processor, the memory storing a computer program that, when executed by the processor, causes the processor to implement following: acquiring a total number of word lines of a target expanded storage array and a total number of bit lines of the target expanded storage array; calculating a translation amount of a translation array in a translation direction according to the total number of word lines, the total number of bit lines, a total number of word lines of the translation array, a total number of bit lines of the translation array, and a preset translation rule, and calculating a number of repetitions of a repetition array in a repetition direction according to the translation amount, a total number of word lines of the repetition array, a total number of bit lines of the repetition array, and a preset repetition rule; and controlling at least part of the translation array and at least part of the repetition array to translate by the translation amount along the translation direction, and controlling the repetition array to repeat for the number of repetitions along the repetition direction, to obtain the target expande

Assignees

Inventors

Classifications

  • Memory cell initialisation circuits, e.g. when powering up or down, memory clear, latent image memory · CPC title

  • Word line organisation; Word line lay-out · CPC title

  • G06F30/323Primary

    Translation or migration, e.g. logic to logic, hardware description language [HDL] translation or netlist translation · CPC title

  • G11C5/025Primary

    Geometric lay-out considerations of storage- and peripheral-blocks in a semiconductor storage device (geometrical lay-out of the components in integrated circuits, geometrical lay-out of the components in integrated circuits H10D89/10) · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US12579349B2 cover?
A method for automatic expansion of a storage array includes: acquiring a word-line total number and bit-line total number of a target expanded storage array; calculating a translation amount of a translation array in a translation direction according to the word-line total number and the bit-line total number, a word-line total number and bit-line total number of the translation array and a pr…
Who is the assignee on this patent?
Changxin Memory Tech Inc
What technology area does this patent fall under?
Primary CPC classification G06F30/323. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Mar 17 2026 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).