Erase verify scheme for NAND flash

Static information storage and retrieval – Floating gate – Particular biasing

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

36518529, 365218, 36518526, 36518533, G11C 1606

Patent

active

060090146

ABSTRACT:
The present invention provides a method of verifying that all flash EEPROM transistors in a NAND string are properly erased without overerasing by applying a bias voltage to the source of the bottom select gate of the NAND array and applying a non-negative erase verify voltage to the control gates of each transistor during an erase verify. The bias voltage is at least equal to the erased threshold voltage of the worst case transistor to ensure proper erase verification. If all transistors are not erased, then another erase operation is performed. Erasing is repeated until the erase verify operation indicates that all transistors are properly erased. By erasing and verifying according to the present invention, the NAND array is completely and properly erased while minimizing overerasing the array.

REFERENCES:
patent: 5473563 (1995-12-01), Suh et al.
patent: 5671178 (1997-09-01), Park et al.
patent: 5696717 (1997-12-01), Koh
patent: 5726934 (1998-03-01), Tran et al.
patent: 5748538 (1998-05-01), Lee et al.
patent: 5862074 (1999-01-01), Park

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Erase verify scheme for NAND flash does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Erase verify scheme for NAND flash, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Erase verify scheme for NAND flash will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2386725

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.