Erase Algorithm
PRELIMINARY
3.3 Erase Algorithm
The erase algorithm follows the clear algorithm in executing the entire initial- ization flow. Figure 3±4 highlights the erase algorithm's place in the overall flow.
Figure 3±4. Erase Algorithm in the Overall Flow
Clear algorithm
Erase algorithm
Start
X = 1
Clear the
array
Erase the
array
Bits in
depletion?
No
Initialization flow
|
|
|
|
|
|
|
|
| |
|
|
|
| |
| Recover using | |||
| algorithm |
| ||
|
| |||
|
|
| ||
|
|
| X = X+1 | |
|
|
|
|
|
Yes |
|
| Yes | |
|
| |||
|
|
| ||
|
|
| X < 10 ? | |
|
|
| ||
No
Fail
Yes
No
Reprogram?
Done/Stop
Program the array
Programming algorithm
The erase algorithm consists of multiple iterations of a loop with one erase pulse applied in each iteration. Table 3±2 outlines the steps involved in apply- ing a single erase pulse.
PRELIMINARY |
