CN111966302A - SPI Nand data writing method based on logical and physical mapping table - Google Patents

SPI Nand data writing method based on logical and physical mapping table Download PDF

Info

Publication number
CN111966302A
CN111966302A CN202010870830.5A CN202010870830A CN111966302A CN 111966302 A CN111966302 A CN 111966302A CN 202010870830 A CN202010870830 A CN 202010870830A CN 111966302 A CN111966302 A CN 111966302A
Authority
CN
China
Prior art keywords
block
data
dynamic
logical
page
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202010870830.5A
Other languages
Chinese (zh)
Other versions
CN111966302B (en
Inventor
黄欢
施冠良
郑伟
朱纯莹
郑文豪
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Heyangtek Cooperation Ltd
Original Assignee
Heyangtek Cooperation Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Heyangtek Cooperation Ltd filed Critical Heyangtek Cooperation Ltd
Priority to CN202010870830.5A priority Critical patent/CN111966302B/en
Priority claimed from CN202010870830.5A external-priority patent/CN111966302B/en
Publication of CN111966302A publication Critical patent/CN111966302A/en
Application granted granted Critical
Publication of CN111966302B publication Critical patent/CN111966302B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0604Improving or facilitating administration, e.g. storage management
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638Organizing or formatting or addressing of data
    • G06F3/064Management of blocks
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0646Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
    • G06F3/0652Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0655Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671In-line storage system
    • G06F3/0673Single storage device
    • G06F3/0679Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Human Computer Interaction (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Read Only Memory (AREA)
  • Memory System (AREA)
  • Techniques For Improving Reliability Of Storages (AREA)

Abstract

The invention discloses an SPI Nand data writing method based on a logical physical mapping table, which comprises the following steps: resolving the logic address in the write command into a corresponding logic block and page; judging whether a dynamic block corresponding to the logic block exists or not; when the corresponding dynamic block exists, storing the written data into one of the dynamic blocks, and recording the storage position in the logical physical mapping table; if the corresponding dynamic block does not exist, judging whether an empty dynamic block exists, if so, storing the written data into the dynamic block, and recording the storage position in a logical-physical mapping table; if no empty dynamic block exists, extracting a dynamic block from all occupied dynamic blocks, sorting all data in the dynamic block into a new data block, completing the release of the dynamic block, updating the storage position in the logical-physical mapping table, storing the written data into the released dynamic block, and recording the storage position in the logical-physical mapping table.

Description

SPI Nand data writing method based on logical and physical mapping table
Technical Field
The invention belongs to the technical field of memory chips, and particularly relates to a SPI Nand data writing method based on a logical physical mapping table.
Background
The Nand-flash memory is one of flash memories, and a nonlinear macro-unit mode is adopted in the Nand-flash memory, so that a cheap and effective solution is provided for realizing a solid-state large-capacity memory. The Nand-flash memory has the advantages of large capacity, high rewriting speed, suitability for storing a large amount of data and the like, so that the Nand-flash memory is more and more widely applied in the industry, for example, embedded products comprise a digital camera, an MP3 walkman memory card, a small-sized U-disk and the like.
The Nand-flash memory is special in write operation, and data can be written only after erasing the Nand-flash memory, that is, no data is in a memory unit required to be written, so that a user firstly judges whether a written page address is written or not when performing write operation, if so, the user needs to erase the page address first, but in some cases, the user needs to continuously update data in a certain address area when using the Nand-flash memory, and the mode of erasing the page address first and then writing the data is easy to cause inconvenience.
Disclosure of Invention
The purpose of the invention is as follows: in order to solve the problem of inconvenient use caused by the fact that a user needs to erase and write data firstly when in use, the invention provides a data writing method of SPI Nand with a novel L2P (logic to physical) architecture.
The technical scheme is as follows: a SPI Nand data writing method based on a logical physical mapping table is used for writing data into an SPI Nand memory chip and comprises the following steps:
resolving the logic address in the write command into a corresponding logic block and page;
judging whether a dynamic block corresponding to the logic block exists or not; and
when the corresponding dynamic block exists, storing the written data into one of the dynamic blocks, and recording the storage position in the logical physical mapping table;
if the corresponding dynamic block does not exist, judging whether an empty dynamic block exists, if so, storing the written data into the dynamic block, and recording the storage position in a logical-physical mapping table; if no empty dynamic block exists, extracting a dynamic block from all occupied dynamic blocks, sorting all data in the dynamic block into a new data block, completing the release of the dynamic block, updating the storage position in the logical-physical mapping table, storing the written data into the released dynamic block, and recording the storage position in the logical-physical mapping table.
Further, writing data into the corresponding dynamic block according to a storage mode of the write data, wherein the storage mode comprises a Regular mode and an Irregular mode; the corresponding dynamic blocks comprise Regular blocks and Irregular blocks;
when the storage mode is a Regular mode, writing down data in the Regular block in sequence;
when the storage mode is an Irregular mode, writing data in page disorder in an Irregular block, and recording a physical address corresponding to each page.
Further, the sorting all the data in the dynamic block into a new data block to complete the release of the dynamic block includes:
when a Regular block is written in sequence, the Regular block is directly replaced by a data block, and the data of the original Regular block is erased and released to be an unoccupied Regular block;
when the Irregular block is fully written, the corresponding data storage position of each page is found in sequence according to the page table, a new data block is read and written, the data of the original Irregular block is erased, and the Irregular block which is not occupied is released.
Further, a logical block value, a physical page value corresponding to the logical block value, and a storage mode are recorded in the back point of each page of the logical-physical mapping table.
Furthermore, in the process of sorting all data in the dynamic block into a new data block, the corresponding address relation of the written data is determined by reading the logical block value, the physical page value corresponding to the logical block value and the storage mode, and then the data is transported to the data block according to the page sequence.
The invention also discloses an SPI Nand memory device, comprising:
a memory;
a controller that executes instructions to perform operations comprising:
resolving the logic address in the write command into a corresponding logic block and page;
judging whether a dynamic block corresponding to the logic block exists or not; and
when the corresponding dynamic block exists, storing the written data into one of the dynamic blocks, and recording the storage position in the logical physical mapping table;
if the corresponding dynamic block does not exist, judging whether an empty dynamic block exists, if so, storing the written data into the dynamic block, and recording the storage position in a logical-physical mapping table; if no empty dynamic block exists, extracting a dynamic block from all occupied dynamic blocks, sorting all data in the dynamic block into a new data block, completing the release of the dynamic block, updating the storage position in the logical-physical mapping table, storing the written data into the released dynamic block, and recording the storage position in the logical-physical mapping table.
Further, writing data into the corresponding dynamic block according to a storage mode of the write data, wherein the storage mode comprises a Regular mode and an Irregular mode; the corresponding dynamic blocks comprise Regular blocks and Irregular blocks;
when the storage mode is a Regular mode, writing down data in the Regular block in sequence;
when the storage mode is an Irregular mode, writing data in page disorder in an Irregular block, and recording a physical address corresponding to each page.
Further, the sorting all the data in the dynamic block into a new data block to complete the release of the dynamic block includes:
when a Regular block is written in sequence, the Regular block is directly replaced by a data block, and the data of the original Regular block is erased and released to be an unoccupied Regular block;
when the Irregular block is fully written, the corresponding data storage position of each page is found in sequence according to the page table, a new data block is read and written, the data of the original Irregular block is erased, and the Irregular block which is not occupied is released.
Further, a logical block value, a physical page value corresponding to the logical block value and a storage mode are recorded in back point of each page of the logical-physical mapping table;
in the process of sorting all data in the dynamic block into a new data block, the corresponding address relation of the written data is determined by reading the logical block value, the physical page value corresponding to the logical block value and the storage mode, and then the data is carried into the data block according to the page sequence.
Further, when the controller is in a relatively idle state or data writing is completed in a staged manner, a dynamic block is preferentially extracted from all occupied dynamic blocks, and all data in the dynamic block is sorted into a new data block to complete the release of the dynamic block.
Has the advantages that: compared with the prior art, the invention has the following advantages:
(1) the data writing method of the invention saves the user from erasing operation, does not need extra judgment, and simplifies the use of the user;
(2) the SPI Nand memory device finishes sorting by using idle time, reduces the influence of sorting on the writing speed, and improves the performance of a chip.
Drawings
FIG. 1 is an architectural diagram of an SPI Nand memory device of the present invention;
FIG. 2 is a schematic diagram of a data writing process according to the present invention.
Detailed Description
The method needs to rely on the existing Nand Flash storage structure, the operation of the Nand Flash is realized by an external controller, a CPU or a microprocessor such as 8051, ARM series and the like is usually embedded in the controller, and the method needs to be controlled and realized by the instruction of the controller. The Nand Flash has the operating characteristic of writing (or programming) or reading in units of page pages, one page cannot be repeatedly written, and the page must be erased before repeated writing. While erasing is performed in block units (because a write operation can change a memory cell from 1 to 0 but not from 0 to 1; and to change 0 to 1, only an erase operation).
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in detail with reference to the accompanying drawings and specific embodiments. For convenience of description, a unit of an erasing operation is called a block (block), and the block is a physical storage structural unit of Nand Flash, and partial data in the block (block) is called a data block, but the data block is smaller than or equal to the block (block), that is, the data block is a continuous area in which actual data is stored in one block (block), and possibly a complete block (block).
The SPI Nand data writing method based on the logical physical mapping table sets a dynamic block (block) group in the currently general Nand Flash through a controller for temporarily storing data, and the physical address of the dynamic block (block) group can be known. The logical physical mapping table entry records the corresponding relation between the logical address and the physical address in the dynamic block (block). The dynamic block group of the present embodiment includes a plurality of dynamic blocks.
The SPI Nand data writing method based on the logical-physical mapping table shown in fig. 2 includes:
step 1: resolving the logical address in the write command into a logical block and a page;
step 2: judging whether the logic block has a corresponding dynamic block, if so, writing data in the corresponding dynamic block; if no corresponding dynamic block exists, judging whether an empty dynamic block exists, if so, storing the written data into the dynamic block, and recording the storage position in a logical-physical mapping table; if no empty dynamic block exists, extracting a dynamic block from all occupied dynamic blocks, sorting all data in the dynamic block into a new data block, completing the release of the dynamic block, updating the storage position in the logical physical mapping table, storing the written data into the released dynamic block, and recording the storage position in the logical physical mapping table.
As shown in fig. 1, the dynamic chunk set of this embodiment includes 1 regular chunk and 2 Irregular chunks; writing the data into the corresponding dynamic blocks according to the storage mode of the data, when the storage mode is a Regular mode, sequentially writing the data into the Regular blocks, and when one dynamic block is written in sequence, namely writing from page 0 to the maximum page, which is equivalent to the fact that one dynamic block is written in sequence; directly replacing the dynamic block with a data block without trimming;
when the storage mode is an Irstandardized mode, the random writing is processed, and the random writing cannot be sequentially stored in a standardized block, because the flash is characterized in that a larger page is not written in the block, and then a smaller page is written, data can be written only in a page (called an Irstandardized page) in the Irstandardized block at this time, and then a physical address (an actual physical page) corresponding to each page is recorded; namely: when the storage mode is an Irregular mode, the writing in is out of order, when data (data) comes, Irregular pages are written in order, when the dynamic block is full, the data inside needs to be arranged into a new data block (data block) according to the page order, namely, the storage position of the data (data) corresponding to each page (page) is found out according to the page table in order, a new data block (data block) is read out and written in, the data of the original dynamic block is erased, and the data of the original dynamic block is released to be an unoccupied dynamic block.
The SPI Nand memory device stores data through dynamic blocks, maps physical addresses through logical addresses, and records the logical block values, the corresponding physical page values and whether the storage mode is Regular mode or Irregular mode in the back point (8bytes) of each page, so that the corresponding address relation of the data can be quickly determined only by reading out important information in the sorting process, and the sorting is more accurate and quicker.
When the write operation is executed, the data is not directly written to the actual physical address, but is temporarily stored through the dynamic block group, meanwhile, the position is recorded in the logical physical mapping table, and the mapping relation is updated every time the write operation is performed, so that the data correspondence is ensured not to be lost. When the dynamic block group is full or needs to be replaced, the data of the whole dynamic block group is sorted into a new data block to finish sorting.
Therefore, the method avoids the characteristic that the original data needs to be erased before the NAND-FLASH is written, provides data storage management, and ensures that a user can use the method more conveniently without considering erasing operation.

Claims (10)

1. A SPI Nand data write-in method based on logical physical mapping table is used for writing data into SPI Nand memory chip, and is characterized in that: the method comprises the following steps:
resolving the logic address in the write command into a corresponding logic block and page;
judging whether a dynamic block corresponding to the logic block exists or not; and
when the corresponding dynamic block exists, storing the written data into one of the dynamic blocks, and recording the storage position in the logical physical mapping table;
if the corresponding dynamic block does not exist, judging whether an empty dynamic block exists, if so, storing the written data into the dynamic block, and recording the storage position in a logical-physical mapping table; if no empty dynamic block exists, extracting a dynamic block from all occupied dynamic blocks, sorting all data in the dynamic block into a new data block, completing the release of the dynamic block, updating the storage position in the logical-physical mapping table, storing the written data into the released dynamic block, and recording the storage position in the logical-physical mapping table.
2. The SPI Nand data writing method based on logical-physical mapping table according to claim 1, characterized in that: writing data into a corresponding dynamic block according to a storage mode of the write data, wherein the storage mode comprises a Regular mode and an Irregular mode; the corresponding dynamic blocks comprise Regular blocks and Irregular blocks;
when the storage mode is a Regular mode, writing down data in the Regular block in sequence;
when the storage mode is an Irregular mode, writing data in page disorder in an Irregular block, and recording a physical address corresponding to each page.
3. The SPI Nand data writing method based on logical-physical mapping table according to claim 2, characterized in that: the sorting of all data in the dynamic block into a new data block to complete the release of the dynamic block includes:
when a Regular block is written in sequence, the Regular block is directly replaced by a data block, and the data of the original Regular block is erased and released to be an unoccupied Regular block;
when the Irregular block is fully written, the corresponding data storage position of each page is found in sequence according to the page table, a new data block is read and written, the data of the original Irregular block is erased, and the Irregular block which is not occupied is released.
4. The method according to claim 1, wherein the data writing method for the SPI Nand is based on the logical-physical mapping table, and comprises the following steps: and recording a logical block value, a physical page value corresponding to the logical block value and a storage mode in back point of each page of the logical-physical mapping table.
5. The method according to claim 1, wherein the data writing method for the SPI Nand is based on the logical-physical mapping table, and comprises the following steps: in the process of sorting all data in the dynamic block into a new data block, the corresponding address relation of the written data is determined by reading the logical block value, the physical page value corresponding to the logical block value and the storage mode, and then the data is carried into the data block according to the page sequence.
6. An SPI Nand memory device, comprising: comprises that
A memory;
a controller that executes instructions to perform operations comprising:
resolving the logic address in the write command into a corresponding logic block and page;
judging whether a dynamic block corresponding to the logic block exists or not; and
when the corresponding dynamic block exists, storing the written data into one of the dynamic blocks, and recording the storage position in the logical physical mapping table;
if the corresponding dynamic block does not exist, judging whether an empty dynamic block exists, if so, storing the written data into the dynamic block, and recording the storage position in a logical-physical mapping table; if no empty dynamic block exists, extracting a dynamic block from all occupied dynamic blocks, sorting all data in the dynamic block into a new data block, completing the release of the dynamic block, updating the storage position in the logical-physical mapping table, storing the written data into the released dynamic block, and recording the storage position in the logical-physical mapping table.
7. An SPI Nand memory device as claimed in claim 6, wherein:
writing data into a corresponding dynamic block according to a storage mode of the write data, wherein the storage mode comprises a Regular mode and an Irregular mode; the corresponding dynamic blocks comprise Regular blocks and Irregular blocks;
when the storage mode is a Regular mode, writing down data in the Regular block in sequence;
when the storage mode is an Irregular mode, writing data in page disorder in an Irregular block, and recording a physical address corresponding to each page.
8. An SPI Nand memory device in accordance with claim 7, wherein:
the sorting of all data in the dynamic block into a new data block to complete the release of the dynamic block includes:
when a Regular block is written in sequence, the Regular block is directly replaced by a data block, and the data of the original Regular block is erased and released to be an unoccupied Regular block;
when the Irregular block is fully written, the corresponding data storage position of each page is found in sequence according to the page table, a new data block is read and written, the data of the original Irregular block is erased, and the Irregular block which is not occupied is released.
9. An SPI Nand memory device as claimed in claim 6, wherein: recording a logical block value, a physical page value corresponding to the logical block value and a storage mode in back point of each page of the logical-physical mapping table;
in the process of sorting all data in the dynamic block into a new data block, the corresponding address relation of the written data is determined by reading the logical block value, the physical page value corresponding to the logical block value and the storage mode, and then the data is carried into the data block according to the page sequence.
10. An SPI Nand memory device as claimed in claim 6, wherein: when the controller is in a relatively idle state or data writing is completed in a staged mode, a dynamic block is preferentially extracted from all occupied dynamic blocks, and all data in the dynamic block is sorted into a new data block to complete the release of the dynamic block.
CN202010870830.5A 2020-08-26 SPI Nand data writing method based on logical-physical mapping table Active CN111966302B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010870830.5A CN111966302B (en) 2020-08-26 SPI Nand data writing method based on logical-physical mapping table

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010870830.5A CN111966302B (en) 2020-08-26 SPI Nand data writing method based on logical-physical mapping table

Publications (2)

Publication Number Publication Date
CN111966302A true CN111966302A (en) 2020-11-20
CN111966302B CN111966302B (en) 2024-07-09

Family

ID=

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101030167A (en) * 2007-01-17 2007-09-05 忆正存储技术(深圳)有限公司 Flash-memory zone block management
US20120066443A1 (en) * 2009-10-23 2012-03-15 Shenzhen Netcom Electronics Co., Ltd. Reading/writing control method and system for nonvolatile memory storage device
US20120246399A1 (en) * 2009-12-03 2012-09-27 Hitachi, Ltd. Storage Device and Memory Controller
CN104461401A (en) * 2014-12-25 2015-03-25 珠海煌荣集成电路科技有限公司 Data reading and writing management method and device for SPI flash memory
CN104778127A (en) * 2015-03-25 2015-07-15 合肥格易集成电路有限公司 Method and device for writing data by NAND FLASH
CN105867834A (en) * 2015-01-22 2016-08-17 深圳市硅格半导体有限公司 Data arrangement method of storage device
CN107632941A (en) * 2017-08-16 2018-01-26 南京扬贺扬微电子科技有限公司 A kind of method for improving flash memory write performance

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101030167A (en) * 2007-01-17 2007-09-05 忆正存储技术(深圳)有限公司 Flash-memory zone block management
US20120066443A1 (en) * 2009-10-23 2012-03-15 Shenzhen Netcom Electronics Co., Ltd. Reading/writing control method and system for nonvolatile memory storage device
US20120246399A1 (en) * 2009-12-03 2012-09-27 Hitachi, Ltd. Storage Device and Memory Controller
CN104461401A (en) * 2014-12-25 2015-03-25 珠海煌荣集成电路科技有限公司 Data reading and writing management method and device for SPI flash memory
CN105867834A (en) * 2015-01-22 2016-08-17 深圳市硅格半导体有限公司 Data arrangement method of storage device
CN104778127A (en) * 2015-03-25 2015-07-15 合肥格易集成电路有限公司 Method and device for writing data by NAND FLASH
CN107632941A (en) * 2017-08-16 2018-01-26 南京扬贺扬微电子科技有限公司 A kind of method for improving flash memory write performance

Similar Documents

Publication Publication Date Title
US9582416B2 (en) Data erasing method, memory control circuit unit and memory storage apparatus
EP1739683A1 (en) Space management for managing high capacity nonvolatile memory
US20090198875A1 (en) Data writing method for flash memory, and controller and system using the same
CN106469122B (en) Valid data merging method, Memory Controller and memorizer memory devices
WO2000060605A1 (en) Space management for managing high capacity nonvolatile memory
US9141530B2 (en) Data writing method, memory controller and memory storage device
TWI498899B (en) Data writing method, memory controller and memory storage apparatus
US8429339B2 (en) Storage device utilizing free pages in compressed blocks
CN109669889B (en) Light Nor Flash control method and device
CN109521944A (en) data storage device and data storage method
US6967869B1 (en) Method and device to improve USB flash write performance
US20090210612A1 (en) Memory controller, nonvolatile memory device, and nonvolatile memory system
US11403018B2 (en) Method and apparatus for performing block management regarding non-volatile memory
EP2264602A1 (en) Memory device for managing the recovery of a non volatile memory
CN100456263C (en) Method for treating broken block when using flash memory in tax-controlled cashing machine
CN113986773A (en) Write amplification optimization method and device based on solid state disk and computer equipment
CN113885808A (en) Mapping information recording method, memory control circuit unit and memory device
CN113778907A (en) Storage device
CN105653466A (en) Data storage device and flash memory control method
CN115878033A (en) Solid state disk and mapping table management method thereof
US20100250837A1 (en) Method for Addressing Page-Oriented Non-Volatile Memories
CN111966302B (en) SPI Nand data writing method based on logical-physical mapping table
TW202024924A (en) A data storage device and a data processing method
CN111966302A (en) SPI Nand data writing method based on logical and physical mapping table
CN110442300B (en) Sorting instruction recording method, memory control circuit unit and memory device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
CB02 Change of applicant information

Country or region after: China

Address after: Building 63, Jinghui Science and Technology Innovation Park, 123 Jinghui West Road, Xinwu District, Wuxi City, Jiangsu Province, 214000

Applicant after: Jiangsu Yangheyang Microelectronics Technology Co.,Ltd.

Address before: 210000 building 12-80, 29 buyue Road, Qiaolin street, Pukou District, Nanjing City, Jiangsu Province

Applicant before: NANJING HEYANGTEK Co.,Ltd.

Country or region before: China

CB02 Change of applicant information
GR01 Patent grant