6

www.fairchildsemi.com

Turbo Programming Algorithm Flow Chart

FIGURE 1.

V

n = 0

ADDRESS = FIRST LOCATION

CHECK ALL BYTES

1ST: V

2ND: V

PROGRAM ONE 50

µs PULSE

INCREMENT n

ADDRESS = FIRST LOCATION

VERIFY

BYTE

n = 10?

DEVICE

FAILED

LAST

ADDRESS

?

INCREMENT

ADDRESS

n = 0

PROGRAM ONE

50

µs

PULSE

INCREMENT

ADDRESS

VERIFY

BYTE

LAST

ADDRESS

?

PASS

NO

FAIL

YES

YES

PASS

NO

FAIL

NO

YES

DS011093-6

Note:

The standard National Semiconductor algorithm may also be used but it will have longer programming time.