CN101510445A - Method and apparatus for storing and reading bad block meter of memory - Google Patents

Method and apparatus for storing and reading bad block meter of memory Download PDF

Info

Publication number
CN101510445A
CN101510445A CNA2009100801193A CN200910080119A CN101510445A CN 101510445 A CN101510445 A CN 101510445A CN A2009100801193 A CNA2009100801193 A CN A2009100801193A CN 200910080119 A CN200910080119 A CN 200910080119A CN 101510445 A CN101510445 A CN 101510445A
Authority
CN
China
Prior art keywords
bad block
block table
bad
storer
table storing
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
CNA2009100801193A
Other languages
Chinese (zh)
Other versions
CN101510445B (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.)
Wuxi Vimicro Corp
Original Assignee
Vimicro Corp
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 Vimicro Corp filed Critical Vimicro Corp
Priority to CN2009100801193A priority Critical patent/CN101510445B/en
Publication of CN101510445A publication Critical patent/CN101510445A/en
Application granted granted Critical
Publication of CN101510445B publication Critical patent/CN101510445B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention provides a memory bad block table storing and reading method and a device thereof, relating to the memory field. The storing method of the memory bad block table is as follows: whether each block of the memory is bad is determined and a determination result is generated; if the block is determined to be a bad one, bad block information is generated; a preset number of good blocks are searched from the memory and taken as bad block table storing blocks; a bad block table is generated according to the bad block information and the identifier of the bad block table storing blocks; and at least one bad block table is written into the bad block table storing block. The memory bad block table reading method is as follows: the bad block table storing blocks are searched in the memory according to the identifier of the bad block table storing blocks; and the bad block table is read from the searched bad block table storing blocks. The invention can improve the application reliability of the memory.

Description

Memory bad block table storing and the method and the device that read
Technical field
The present invention relates to memory area, be meant a kind of memory bad block table storing and the method and the device that read especially.
Background technology
Storer is used very extensive in electronic product, so the bad block management of storer is also extremely important.With NAND flash (flash memory) is example, and the management method of existing bad piece of NAND flash is, several block (piece) of NANDflash front or back are stored bad block table (BBT, Bad Block Table).Usually, the position of the piece of storage bad block table is fixed, and is generally top several or rearmost several of storer.And the quantity of the piece of storage bad block table is also fixed, and is generally 4.In case so several of storer front or back all out of joint, the place of then depositing bad block table is just bad.Even NAND flash is formatd, system still can be created in bad block table the place of bad piece, after the system start-up, searches bad block table on the foremost of NAND flash or rearmost, and the data of the bad block table that reads during use will be wrong.Because system's reading or writing to the data on the NAND flash, all will be through the screening of bad block table, in case the data of bad block table are made mistakes, all there is the hidden danger of makeing mistakes in the data that will cause reading and writing on the NAND flash, and have therefore reduced the dependability of NAND flash.
Summary of the invention
The technical problem to be solved in the present invention provides a kind of storage of bad block meter of memory and method that reads and device, can improve the reliability that storer uses.
For solving the problems of the technologies described above, embodiments of the invention provide technical scheme as follows:
On the one hand, provide a kind of memory bad block table storing method, comprising:
Whether each piece of judging storer is bad piece, produces judged result;
If described judged result is: described is bad piece, then generates bad block message;
The good piece of searching predetermined quantity in described storer is as bad block table storing blocks;
Identifier according to described bad block message and bad block table storing blocks generates bad block table;
At least a described bad block table is write in the described bad block table storing blocks.
Described memory bad block table storing method also comprises:
According to described judged result, calculate bad number of blocks;
According to the quantity of bad block table reservation storage block in the quantity of bad block table storing blocks, described bad number of blocks and the described storer, calculate the quantity of the piece that has used in the described storer;
The quantity of the piece that used in the described storer is recorded in the described bad block table.
Before the step of the quantity of the piece that has used in the described storer of described calculating, also comprise:
According to described bad block message, determine the quantity of bad block table reservation storage block in the described storer.
In described storer, search before the step of good piece as bad block table storing blocks of predetermined quantity, also comprise:
According to described bad block message, determine the backup quantity of bad block table;
According to the backup quantity of described bad block table, determine described predetermined quantity;
The step that described identifier according to described bad block message and bad block table storing blocks generates bad block table is specially:
Generate bad block table according to the identifier of described bad block message, bad block table storing blocks and the backup quantity of described bad block table.
Described the step that a at least described bad block table writes in the described bad block table storing blocks is specially:
The a described bad block table of storage in described bad block table storing blocks;
According to the backup quantity of described bad block table, the described bad block table of backup in described bad block table storing blocks.
Described storer is NAND flash, NOR flash or ROM.
On the other hand, provide a kind of memory bad block table storing device, comprising:
Judge module is used to judge whether each piece of storer is bad piece, produces judged result;
Bad block message generation module is used for if described judged result is: described is bad piece, then generates bad block message;
Search module, be used for searching the good piece of predetermined quantity as bad block table storing blocks at described storer;
The bad block table generation module is used for generating bad block table according to the identifier of described bad block message and bad block table storing blocks;
Writing module is used for a at least described bad block table is write described bad block table storing blocks.
Described memory bad block table storing device also comprises:
First computing unit is used for calculating bad number of blocks according to described judged result;
Second computing unit is used for the quantity that the quantity according to bad block table storing blocks, described bad number of blocks and described storer bad block table are reserved storage block, calculates the quantity of the piece that has used in the described storer;
Record cell, the quantity that is used for piece that described storer has been used is recorded in the described bad block table.
On the other hand, provide a kind of read method of bad block meter of memory, comprising:
According to the identifier of bad block table storing blocks, from storer, search bad block table storing blocks;
From the described bad block table storing blocks that finds, read bad block table.
On the other hand, provide a kind of reading device of bad block meter of memory, comprising:
Search module, be used for identifier, from storer, search bad block table storing blocks according to the storer bad block table storing blocks;
Read module is used for reading bad block table from the described bad block table storing blocks that finds.
Embodiments of the invention have following beneficial effect:
In the such scheme, judge whether each piece of storer is bad piece, produce judged result; If described judged result is: described is bad piece, then generates bad block message; The good piece of searching predetermined quantity in described storer is as bad block table storing blocks; Identifier according to described bad block message and bad block table storing blocks generates bad block table; At least a described bad block table is write in the described bad block table storing blocks.Like this, the position of piece of storage bad block table is no longer fixing, has guaranteed bad block table storing on good piece, when using storer, has guaranteed the correctness of the bad block meter of memory data that read, therefore, has improved and makes memory-aided reliability.
Description of drawings
Fig. 1 is the schematic flow sheet of memory bad block table storing method one embodiment of the present invention;
Fig. 2 is the schematic flow sheet of another embodiment of memory bad block table storing method of the present invention;
Fig. 3 is the structural representation of memory bad block table storing device one embodiment of the present invention;
Fig. 4 is the structural representation of another embodiment of memory bad block table storing device of the present invention;
Fig. 5 is the schematic flow sheet of the read method of bad block meter of memory of the present invention;
Fig. 6 is the structural representation of the reading device of bad block meter of memory of the present invention;
Fig. 7 is the schematic flow sheet of memory bad block table storing of the present invention with the application scenarios that reads.
Embodiment
For technical matters, technical scheme and advantage that embodiments of the invention will be solved is clearer, be described in detail below in conjunction with the accompanying drawings and the specific embodiments.
Embodiments of the invention provide a kind of memory bad block table storing and the method and the device that read at the low problem of storer dependability in the prior art.
As shown in Figure 1, the process flow diagram for memory bad block table storing method one embodiment of the present invention comprises:
101, judge whether each piece of storer is bad piece, produce judged result;
In this step, can be for successively from front to back or from back to front, each piece of swept memory judges whether each piece has been piece.
102, if described judged result is: described is bad piece, then generates bad block message;
In this step, after whole storer is finished in scanning, generate bad block message.
103, the good piece of searching predetermined quantity in described storer is as bad block table storing blocks;
In this step, can search piece as bad block table storing blocks according to judged result.
104, according to the identifier generation bad block table of described bad block message and bad block table storing blocks;
105, a at least described bad block table is write in the described bad block table storing blocks.
In the said method, can create the processing of bad block table at new storer or firm formative storer.The good piece of searching predetermined quantity in described storer is as bad block table storing blocks; Like this, the position of piece of storage bad block table is no longer fixing, has guaranteed bad block table storing on good piece, when using storer, has guaranteed the correctness of the bad block meter of memory data that read, therefore, has improved and makes memory-aided reliability.
As shown in Figure 2, the process flow diagram for another embodiment of memory bad block table storing method of the present invention comprises:
201, judge whether each piece of storer is bad piece, produce judged result;
In this step, can be for successively from front to back or from back to front, each piece of swept memory judges whether each piece has been piece.
202, if described judged result is: described is bad piece, then generates bad block message;
In this step, after whole storer is finished in scanning, generate bad block message.
203, according to described bad block message, determine the backup quantity of bad block table;
The backup of bad block table is used for piece when a bad block table of storage when breaking down, and can obtain bad block table from other back up the piece of bad block table, and the information of bad block table can not lost, and has improved to make memory-aided reliability.The backup quantity of bad block table is many more, and the reliability of storer is high more.In addition, the backup quantity of bad block table is not fixed, and can determine according to the bad block message of storer, when the bad piece of storer is many, the mass ratio that memory chip is described is relatively poor, for the piece that prevents to store a bad block table breaks down, the backup quantity of more bad block table can be set; When the bad piece of storer is fewer, illustrate that the mass ratio of memory chip is better, the backup quantity of less bad block table can be set.The backup quantity of bad block table is set flexibly according to the chip quality of storer like this.
204, according to the backup quantity of described bad block table, determine predetermined quantity;
Wherein, the predetermined quantity of bad block table storing blocks can be unfixed, can determine according to the bad block message of storer, when the bad piece of storer is many, the number of more bad block table storing blocks can be set; When the bad piece of storer is fewer, the number of less bad block table storing blocks can be set.The quantity of bad block table storing blocks is set flexibly according to the chip quality of storer like this.
205, the good piece of searching predetermined quantity in described storer is as bad block table storing blocks;
By top step as can be seen, do not fix, can be provided with flexibly as required as the predetermined quantity of the good piece of bad block table storing blocks.According to judged result, searched piece as bad block table storing blocks.
206, generate bad block table according to the identifier of described bad block message, bad block table storing blocks and the backup quantity of described bad block table.
Wherein, bad block message is used for the bad piece situation of instruction memory.The identifier of bad block table storing blocks is used to indicate this piece for preserving the piece of bad block table, in follow-up, finds the preservation bad block table storing blocks according to the identifier of bad block table storing blocks.The backup quantity of described bad block table is used to indicate the backup quantity of bad block table, when the piece of preserving a bad block table breaks down, can also continue to search the piece that other preserve bad block table according to the backup quantity of bad block table.In addition, bad block table also comprises version number, is used for the bad block table of identification renewal.
207, a at least described bad block table is write in the described bad block table storing blocks.
Wherein, this step is specially:
2071, a described bad block table of storage in described bad block table storing blocks;
2072, according to the backup quantity of described bad block table, the described bad block table of backup in described bad block table storing blocks.
Wherein, bad block table can be recorded in first page of reserved area (spare area) of piece, if some storer, for example the reserved area of NAND flash is too small, can be recorded in the 2nd, 3 page reserved area.
208, according to described judged result, calculate bad number of blocks;
In this step, calculate the quantity of all the bad pieces in the storer.
209, according to described bad block message, determine the quantity of described bad block table reservation storage block.
It is to be used for that bad block table is reserved storage block, and when the piece of preserving bad block table broke down, bad block table was reserved storage block and preserved bad block table as bad block table storing blocks, like this, makes on the piece that bad block table is kept at all the time.Wherein, the quantity that bad block table is reserved storage block can be unfixed, can determine according to the bad block message of storer, when the bad piece of storer is many, the number that more bad block table is reserved storage block can be set; When the bad piece of storer is fewer, the number that less bad block table is reserved storage block can be set.Like this, the chip quality according to storer is provided with the quantity that bad block table is reserved storage block flexibly.
210, according to the quantity of bad block table reservation storage block in the quantity of bad block table storing blocks, described bad number of blocks and the described storer, calculate the quantity of the piece that has used in the described storer;
The quantity of the piece that has used comprise storer bad number of blocks, preserve bad block table and the quantity of the piece that uses and be the summation of the quantity of preserving the bad block table reserved block, total the piece number of storer deducts the quantity that the quantity of the piece that has used is exactly the remaining available block of storer.
211, the quantity of the piece that used in the described storer is recorded in the described bad block table.
Described storer can be NAND flash, NOR flash or ROM (ROM (read-only memory)) etc.ROM can be EEPROM (electricallyerasable ROM (EEROM)).
In the foregoing description, the fixing preservation position of bad block table not, the also fixing preservation umber of bad block table not, and be not fixed for preserving the quantity of the reserved block of bad block table yet, even under the environment of more abominable storer slice, thin piece (for example all there is a sheet of continuous bad piece the front and back of storer), still can read the data of storer reliably.Do not store bad block table owing to there is to use fixing piece number; so even a lot of pieces in back have all been gone bad; the meeting of the piece of record bad block table pushes away forward automatically; though make that like this free space of whole storer is few; but can guarantee that bad block table has been recorded on the piece, can not make mistakes when making read-write memory.
As shown in Figure 3, the invention provides a kind of memory bad block table storing device 3, comprising:
Judge module 31 is used to judge whether each piece of storer is bad piece, produces judged result;
Bad block message generation module 32 is used for if described judged result is: described is bad piece, then generates bad block message;
Search module 33, be used for searching the good piece of predetermined quantity as bad block table storing blocks at described storer;
Bad block table generation module 34 is used for generating bad block table according to the identifier of described bad block message and bad block table storing blocks;
Writing module 35 is used for a at least described bad block table is write described bad block table storing blocks.
Described storer can be NAND flash, NOR flash or ROM (ROM (read-only memory)) etc.ROM can be EEPROM (electricallyerasable ROM (EEROM)).
In the such scheme, can create the processing of bad block table at new storer or firm formative storer.The good piece of searching predetermined quantity in described storer is as bad block table storing blocks; Like this, the position of piece of storage bad block table is no longer fixing, has guaranteed bad block table storing on good piece, when using storer, has guaranteed the correctness of the bad block meter of memory data that read, therefore, has improved and makes memory-aided reliability.
As shown in Figure 4, the present invention also provides a kind of memory bad block table storing device 3, comprising:
Judge module 31 is used to judge whether each piece of storer is bad piece, produces judged result;
Bad block message generation module 32 is used for if described judged result is: described is bad piece, then generates bad block message;
Search module 33, be used for searching the good piece of predetermined quantity as bad block table storing blocks at described storer;
Bad block table generation module 34 is used for generating bad block table according to the identifier of described bad block message and bad block table storing blocks;
Writing module 35 is used for a at least described bad block table is write described bad block table storing blocks.
First computing unit 36 is used for calculating bad number of blocks according to described judged result;
Second computing unit 37 is used for the quantity that the quantity according to bad block table storing blocks, described bad number of blocks and described storer bad block table are reserved storage block, calculates the quantity of the piece that has used in the described storer;
Record cell 38, the quantity that is used for piece that described storer has been used is recorded in the described bad block table.
In the such scheme, the quantity of the piece that has used comprise storer bad number of blocks, preserve bad block table and the quantity of the piece that uses and be the summation of the quantity of preserving the bad block table reserved block, total the piece number of storer deducts the quantity that the quantity of the piece that has used is exactly the remaining available block of storer.In the subsequent treatment, can know the quantity of the available block that storer is remaining according to the quantity of the piece that has used of storer.
As shown in Figure 5, the invention provides a kind of read method of bad block meter of memory, comprising:
501, according to the identifier of bad block table storing blocks, from storer, search bad block table storing blocks;
In this step, during each system start-up, (also can the invention is not restricted to this in the past backward) from behind forward, find the piece of preserving bad block table according to the identifier of bad block table storing blocks.
502, from the described bad block table storing blocks that finds, read bad block table.
Described bad block table can comprise: the quantity of the piece that has used in the identifier of described bad block message, bad block table storing blocks, the storer.
In this step, from bad block table, read the quantity of the piece that has used in the storer, in the subsequent treatment, can calculate available block number remaining in the storer according to the quantity of the piece that has used.
Described storer can be NAND flash, NOR flash or ROM (ROM (read-only memory)) etc.ROM can be EEPROM (electricallyerasable ROM (EEROM))
In the such scheme, when searching bad block meter of memory, be not fixed in and search top several or rearmost several of storer, but the piece in the storer is searched successively, till finding bad block table storing blocks.
As shown in Figure 6, the invention provides a kind of reading device 6 of bad block meter of memory, comprising:
Search module 61, be used for identifier, from storer, search bad block table storing blocks according to bad block table storing blocks;
Read module 62 is used for reading bad block table from the described bad block table storing blocks that finds.
Described bad block table comprises: the quantity of the piece that has used in the identifier of described bad block message, bad block table storing blocks, the storer.In this scheme, read the quantity of the piece that has used in the storer from bad block table, the quantity according to the piece that has used in the subsequent treatment can calculate remaining available block number.
In the such scheme, when searching bad block meter of memory, be not fixed in and search top several or rearmost several of storer, but the piece in the storer is searched successively, till finding bad block table storing blocks.
As shown in Figure 7, be the schematic flow sheet of storer in the system (is example with Nand flash) bad block table storing, comprise with the application scenarios that obtains:
701, elder generation's allocation space in internal memory is as the buffer zone of preserving bad block table information.
702, swept memory piece (the invention is not restricted to this, also swept memory piece) from front to back from back to front.
703, according to the identifier whether bad block table storing blocks is arranged, judge whether this piece is bad block table storing blocks.If then execution in step 704; If not, then execution in step 707.
704, find bad block table record block after, read the bad block table in the bad block table record block, and the buffer zone of the bad block table information of distributing before the data of the bad block table in this piece are covered.
705, from bad block table, read the piece number that has used.
706, memory-aided total block data deducts the piece number that has used, calculates the available block number of storer, and the available block number of this storer is passed to system.
707, call the fine or not state of judging this piece that drives.
708, judged result is recorded in the buffer zone of bad block table information.
709, judge whether to scan first, if for being that then execution in step 710; If, then return step 702, next piece is continued scanning for not.
710, if find first, be much to seek bad piece record block, show that this is new storer or firm formative storer, according to the buffer zone of bad block table information from after search several good pieces forward and (the invention is not restricted to this, also can search backward in the past), before be recorded in the buffer zone of bad block table information information write on these several good pieces of storer.
711, calculate the piece number that has used in the storer, write on these several good pieces of storer.
712, memory-aided total block data deducts the piece number that has used, obtains the available block number of storer, and the system that passes to uses with the available block number of this storer.
One of ordinary skill in the art will appreciate that all or part of step that realizes in the foregoing description method is to instruct relevant hardware to finish by program, described program can be stored in the read/write memory medium of a portable terminal, this program is when carrying out, comprise step, described storage medium etc. as above-mentioned method embodiment.
The above is a preferred implementation of the present invention; should be pointed out that for those skilled in the art, under the prerequisite that does not break away from principle of the present invention; can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.

Claims (10)

1. a memory bad block table storing method is characterized in that, comprising:
Whether each piece of judging storer is bad piece, produces judged result;
If described judged result is: described is bad piece, then generates bad block message;
The good piece of searching predetermined quantity in described storer is as bad block table storing blocks;
Identifier according to described bad block message and bad block table storing blocks generates bad block table;
At least a described bad block table is write in the described bad block table storing blocks.
2. memory bad block table storing method according to claim 1 is characterized in that, also comprises:
According to described judged result, calculate bad number of blocks;
According to the quantity of bad block table reservation storage block in the quantity of bad block table storing blocks, described bad number of blocks and the described storer, calculate the quantity of the piece that has used in the described storer;
The quantity of the piece that used in the described storer is recorded in the described bad block table.
3. memory bad block table storing method according to claim 2 is characterized in that, before the step of the quantity of the piece that has used in the described storer of described calculating, also comprises:
According to described bad block message, determine the quantity of bad block table reservation storage block in the described storer.
4. memory bad block table storing method according to claim 1 is characterized in that,
In described storer, search before the step of good piece as bad block table storing blocks of predetermined quantity, also comprise:
According to described bad block message, determine the backup quantity of bad block table;
According to the backup quantity of described bad block table, determine described predetermined quantity;
The step that described identifier according to described bad block message and bad block table storing blocks generates bad block table is specially:
Generate bad block table according to the identifier of described bad block message, bad block table storing blocks and the backup quantity of described bad block table.
5. memory bad block table storing method according to claim 4 is characterized in that,
Described the step that a at least described bad block table writes in the described bad block table storing blocks is specially:
The a described bad block table of storage in described bad block table storing blocks;
According to the backup quantity of described bad block table, the described bad block table of backup in described bad block table storing blocks.
6. memory bad block table storing method according to claim 1 is characterized in that, described storer is NAND flash, NOR flash or ROM.
7. a memory bad block table storing device is characterized in that, comprising:
Judge module is used to judge whether each piece of storer is bad piece, produces judged result;
Bad block message generation module is used for if described judged result is: described is bad piece, then generates bad block message;
Search module, be used for searching the good piece of predetermined quantity as bad block table storing blocks at described storer;
The bad block table generation module is used for generating bad block table according to the identifier of described bad block message and bad block table storing blocks;
Writing module is used for a at least described bad block table is write described bad block table storing blocks.
8. memory bad block table storing device according to claim 7 is characterized in that, also comprises:
First computing unit is used for calculating bad number of blocks according to described judged result;
Second computing unit is used for the quantity that the quantity according to bad block table storing blocks, described bad number of blocks and described storer bad block table are reserved storage block, calculates the quantity of the piece that has used in the described storer;
Record cell, the quantity that is used for piece that described storer has been used is recorded in the described bad block table.
9. the read method of a bad block meter of memory is characterized in that, comprising:
According to the identifier of bad block table storing blocks, from storer, search bad block table storing blocks;
From the described bad block table storing blocks that finds, read bad block table.
10. the reading device of a bad block meter of memory is characterized in that, comprising:
Search module, be used for identifier, from storer, search bad block table storing blocks according to the storer bad block table storing blocks;
Read module is used for reading bad block table from the described bad block table storing blocks that finds.
CN2009100801193A 2009-03-19 2009-03-19 Method and apparatus for storing and reading bad block meter of memory Expired - Fee Related CN101510445B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2009100801193A CN101510445B (en) 2009-03-19 2009-03-19 Method and apparatus for storing and reading bad block meter of memory

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2009100801193A CN101510445B (en) 2009-03-19 2009-03-19 Method and apparatus for storing and reading bad block meter of memory

Publications (2)

Publication Number Publication Date
CN101510445A true CN101510445A (en) 2009-08-19
CN101510445B CN101510445B (en) 2012-11-21

Family

ID=41002807

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2009100801193A Expired - Fee Related CN101510445B (en) 2009-03-19 2009-03-19 Method and apparatus for storing and reading bad block meter of memory

Country Status (1)

Country Link
CN (1) CN101510445B (en)

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102253899A (en) * 2011-07-28 2011-11-23 张岭 Method for improving utilization efficiency of flash memory chip storage unit
CN102722443A (en) * 2012-05-21 2012-10-10 三星半导体(中国)研究开发有限公司 Bad block management method for flash memory
CN103186471A (en) * 2011-12-30 2013-07-03 深圳市共进电子股份有限公司 Method and system for managing bad blocks in storage equipment
CN103593303A (en) * 2013-10-29 2014-02-19 福建星网视易信息系统有限公司 Bad block table storage method and device and NAND gate nonvolatile memory
CN102063382B (en) * 2009-11-12 2014-08-27 慧荣科技股份有限公司 Data storage device, controller and method for accessing data in suborder memory
CN104461750A (en) * 2013-09-25 2015-03-25 北京兆易创新科技股份有限公司 Method and device for accessing NAND flash
CN106486170A (en) * 2016-09-06 2017-03-08 深圳忆数存储技术有限公司 The potential bad block localization method of solid state hard disc and device
CN107908500A (en) * 2017-11-30 2018-04-13 新华三技术有限公司 A kind of bad block identifying method and device
CN108614745A (en) * 2016-12-09 2018-10-02 北京京存技术有限公司 Manufacture bad block processing method based on NAND flash and NAND flash storage devices
CN109582239A (en) * 2018-12-03 2019-04-05 郑州云海信息技术有限公司 A kind of store method, device, equipment and the storage medium of SSD bad block table
CN110287068A (en) * 2019-07-04 2019-09-27 四川长虹空调有限公司 A kind of NandFlash driving method
CN110471625A (en) * 2019-08-15 2019-11-19 深圳忆联信息系统有限公司 Bad block message guard method, device, computer equipment and storage medium
CN110795044A (en) * 2019-10-31 2020-02-14 深圳市友华通信技术有限公司 Bad block management method and system for NAND Flash memory
CN112083873A (en) * 2019-06-14 2020-12-15 北京忆芯科技有限公司 Method and device for intelligently identifying unreliable blocks of nonvolatile storage medium
CN113176970A (en) * 2021-06-28 2021-07-27 中国核动力研究设计院 System and method for managing bad blocks of nor flash based on FPGA

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2003505812A (en) * 1999-07-16 2003-02-12 コーニンクレッカ フィリップス エレクトロニクス エヌ ヴィ Recording medium having write-protection defect list
US6801471B2 (en) * 2002-02-19 2004-10-05 Infineon Technologies Ag Fuse concept and method of operation
TWI295021B (en) * 2004-12-10 2008-03-21 Infortrend Technology Inc Storage system and method for handling bad storage device data therefor
US20070083697A1 (en) * 2005-10-07 2007-04-12 Microsoft Corporation Flash memory management

Cited By (25)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102063382B (en) * 2009-11-12 2014-08-27 慧荣科技股份有限公司 Data storage device, controller and method for accessing data in suborder memory
CN102253899A (en) * 2011-07-28 2011-11-23 张岭 Method for improving utilization efficiency of flash memory chip storage unit
CN103186471A (en) * 2011-12-30 2013-07-03 深圳市共进电子股份有限公司 Method and system for managing bad blocks in storage equipment
CN103186471B (en) * 2011-12-30 2016-10-12 深圳市共进电子股份有限公司 The management method of bad block and system in storage device
CN102722443A (en) * 2012-05-21 2012-10-10 三星半导体(中国)研究开发有限公司 Bad block management method for flash memory
CN102722443B (en) * 2012-05-21 2014-12-17 三星半导体(中国)研究开发有限公司 Bad block management method for flash memory
CN104461750A (en) * 2013-09-25 2015-03-25 北京兆易创新科技股份有限公司 Method and device for accessing NAND flash
CN103593303A (en) * 2013-10-29 2014-02-19 福建星网视易信息系统有限公司 Bad block table storage method and device and NAND gate nonvolatile memory
CN106486170B (en) * 2016-09-06 2019-11-26 深圳忆数存储技术有限公司 The potential bad block localization method and device of solid state hard disk
CN106486170A (en) * 2016-09-06 2017-03-08 深圳忆数存储技术有限公司 The potential bad block localization method of solid state hard disc and device
CN108614745A (en) * 2016-12-09 2018-10-02 北京京存技术有限公司 Manufacture bad block processing method based on NAND flash and NAND flash storage devices
CN107908500B (en) * 2017-11-30 2021-02-26 新华三技术有限公司 Bad block identification method and device
CN107908500A (en) * 2017-11-30 2018-04-13 新华三技术有限公司 A kind of bad block identifying method and device
CN109582239B (en) * 2018-12-03 2022-02-18 郑州云海信息技术有限公司 SSD bad block table storage method, device, equipment and storage medium
CN109582239A (en) * 2018-12-03 2019-04-05 郑州云海信息技术有限公司 A kind of store method, device, equipment and the storage medium of SSD bad block table
CN112083873A (en) * 2019-06-14 2020-12-15 北京忆芯科技有限公司 Method and device for intelligently identifying unreliable blocks of nonvolatile storage medium
WO2020248798A1 (en) * 2019-06-14 2020-12-17 北京忆芯科技有限公司 Method and device for intelligently identifying unreliable block in non-volatile storage medium
CN112083873B (en) * 2019-06-14 2023-06-20 北京忆芯科技有限公司 Method and device for intelligently identifying unreliable blocks of nonvolatile storage medium
CN110287068A (en) * 2019-07-04 2019-09-27 四川长虹空调有限公司 A kind of NandFlash driving method
CN110287068B (en) * 2019-07-04 2023-02-28 四川长虹空调有限公司 NandFlash driving method
CN110471625A (en) * 2019-08-15 2019-11-19 深圳忆联信息系统有限公司 Bad block message guard method, device, computer equipment and storage medium
CN110795044A (en) * 2019-10-31 2020-02-14 深圳市友华通信技术有限公司 Bad block management method and system for NAND Flash memory
CN110795044B (en) * 2019-10-31 2023-04-11 深圳市友华通信技术有限公司 Bad block management method and system of NAND Flash memory
CN113176970A (en) * 2021-06-28 2021-07-27 中国核动力研究设计院 System and method for managing bad blocks of nor flash based on FPGA
CN113176970B (en) * 2021-06-28 2021-10-22 中国核动力研究设计院 System and method for managing bad blocks of nor flash based on FPGA

Also Published As

Publication number Publication date
CN101510445B (en) 2012-11-21

Similar Documents

Publication Publication Date Title
CN101510445B (en) Method and apparatus for storing and reading bad block meter of memory
CN101369246B (en) System and method for using a memory mapping function to map memory defects
CN101446921B (en) Dynamic storage method of Flash memory
US8745443B2 (en) Memory system
CN1645516B (en) Data recovery apparatus and method used for flash memory
CN102722443B (en) Bad block management method for flash memory
CN103064760B (en) Backup method and backup device
KR940704028A (en) METHOD FOR IMPROVING PARTIAL STRIPE WRITE PERFORMANCE IN DISK ARRAY SUBSYSTEMS
CN106776362A (en) The control method and device of memory
CN102306503A (en) Method and system for detecting false capacity memory
CN103778964B (en) Process, using method and the device of a kind of NAND Flash programming data, system
CN100433195C (en) Flash memory medium data writing method
CN109976673B (en) Data writing method and device
CN104978154A (en) Cache operation-based flash rapid read-write method and system
CN102243884B (en) Method for storing streaming media data and apparatus thereof
CN103514101A (en) Method for accessing flash memory and related memory device
CN110444243A (en) Store test method, system and the storage medium of equipment read error error correcting capability
CN112133357B (en) eMMC test method and device
CN108664208B (en) File additional writing operation method and device based on FLASH memory
CN106816175A (en) The control method and device of memory
CN110119947A (en) Shared proof of work calculates the method and apparatus that power generates symbiosis block chain
CN102737716B (en) Memorizer memory devices, Memory Controller and method for writing data
CN113434476B (en) Data synchronization method, device, equipment, system, storage medium and program product
CN106875977A (en) A kind of solid state hard disc adjustment method and device
CN102375779A (en) Data processing method and data processing module

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
ASS Succession or assignment of patent right

Owner name: WUXI VIMICRO CORP.

Free format text: FORMER OWNER: BEIJING ZHONGXING MICROELECTRONICS CO., LTD.

Effective date: 20110602

C41 Transfer of patent application or patent right or utility model
COR Change of bibliographic data

Free format text: CORRECT: ADDRESS; FROM: 100083 15/F, SHINING BUILDING, NO. 35, XUEYUAN ROAD, HAIDIAN DISTRICT, BEIJING TO: 214028 610, NATIONAL INTEGRATED CIRCUIT DESIGN PARK (CHUANGYUAN BUILDING), NO. 21-1, CHANGJIANG ROAD, WUXI NEW DISTRICT, JIANGSU PROVINCE, CHINA

TA01 Transfer of patent application right

Effective date of registration: 20110602

Address after: 214028 national integrated circuit design Park, 21-1 Changjiang Road, New District, Jiangsu, Wuxi, China, 610

Applicant after: Wuxi Vimicro Co., Ltd.

Address before: 100083, Haidian District, Xueyuan Road, Beijing No. 35, Nanjing Ning building, 15 Floor

Applicant before: Beijing Vimicro Corporation

C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20121121

Termination date: 20190319

CF01 Termination of patent right due to non-payment of annual fee