 |
|||
|
|
|||
| ||||||||||
|
|  MIL-M-38510/245B
APPENDIX A
b. Verify each location by the address sequence: address, address complement, address, address +1, etc.
c. Read out data pattern from memory.
A.3.4 Algorithm D.
A.3.4.1 MARCH.
a. i = address 0 to 1023
b. Write 0's into all address locations.
c. Starting at cell 0, read a 0, write a 1, read a 1.
d. Address sequence: i, i+1, i+2 ---i+n (1 ≤ n ≤ 1023) (T = 0).
e. Starting at cell 1023, read a 1, write a 0, read a 0.
Address sequence: i, i-1, i-2, ---i-n (1 ≤ n ≤ 1023) (T = 1023).
f.
g. Repeat with opposite data.
A.3.5 Algorithm E.
A.3.5.1 MASEST
a. i = address 0 to 1023
b. Write alternating pattern 101010 --- into all cells.
c. Read cell i+n, go to cell i+n, and read the complement of cell i+n.
d. Address sequence i, i , i+1, i + 1 , ---1+n, 1+ n (0 ≤ n ≤ 1023) (i = 0).
e. Repeat steps b and c with the complement checkerboard pattern.
A.3.6 Algorithm F.
A.3.6.1 DISTURB.
a. Write 1's into all memory locations.
b. Read all 1's.
c. Disable write as follows: Make CS = VDD.
d. Attempt to write 0's into all memory locations.
e. Read all 1's to verify original data.
f.
Repeat with opposite data.
77
|
|
Privacy Statement - Press Release - Copyright Information. - Contact Us |
Click
here for thousands of PDF manuals