• Tidak ada hasil yang ditemukan

Efficient O(n) BIST algorithms for DDNPS faults in dual portmemories

N/A
N/A
Protected

Academic year: 2023

Membagikan "Efficient O(n) BIST algorithms for DDNPS faults in dual portmemories"

Copied!
1
0
0

Teks penuh

(1)

Efficient O(N) BIST Algorithms For DDNPS Faults In Dual Portmemories

Amin, A.A. Osman, M.Y. Abdel-Aal, R.E. Al-Muhtaseb, H.;King Fahd Univ. of Pet.Miner., Dhahran

;

Test Conference, 1994. Proceedings., International;Publication Date: 2-6 Oct1994;ISBN: 0-7803-2103-0

King Fahd University of Petroleum & Minerals

http://www.kfupm.edu.sa Summary

The testability problem of dual port memories is investigated. Architectural

modifications which enhance testability with minimal overhead on both silicon area and device performance are described. New fault models for both the memory array and the address decoders are proposed and efficient O(n) test algorithms are

presented. The new fault models account for the simultaneous dual access property of the device. In addition to the classical static neighborhood pattern sensitive faults, the array test algorithm covers a new class of pattern sensitive faults, Duplex Dynamic Neighborhood Pattern Sensitive faults (DDNPSF)

For pre-prints please write to:abstracts@kfupm.edu.sa

© Copyright: King Fahd University of Petroleum & Minerals; http://www.kfupm.edu.sa

Referensi

Dokumen terkait

Nasution street, as the outer ring road of the city of Medan, is growing rapidly with various types of functions with the dominance of modern shophouses,

The results showed that rice flour and incubation time of 96 hours produced the best premium tempeh instant starter with the number of fungi of 9.02 Log CFU/g, 9.17 Log CFU/g yeast,