PRELIMINARY
How the Algorithms Fit Into the
Figure 3±1. Algorithms 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
PRELIMINARY | Algorithm Implementations and Software Considerations |