نتایج جستجو برای: march test algorithm

تعداد نتایج: 1574761  

2006
PETRU CAŞCAVAL

− A march test of length 30n for detecting static 3-coupling faults in n × 1 random-access memories (RAMs) is presented. To reduce the length of the test, only the coupling faults between physically adjacent memory cells have been considered. The test assumes that the storage cells are arranged in a rectangular grid and that the mapping from logical addresses to physical cell locations is known...

2010
J. Lee J. Kim D. Kwon C. Kim

This document describes the ARIA encryption algorithm. ARIA is a 128-bit block cipher with 128-, 192-, and 256-bit keys. The algorithm consists of a key scheduling part and data randomizing part. Status of This Memo This document is not an Internet Standards Track specification; it is published for informational purposes. This is a contribution to the RFC Series, independently of any other RFC ...

پایان نامه :وزارت بهداشت، درمان و آموزش پزشکی - دانشگاه علوم پزشکی و خدمات بهداشتی درمانی استان کرمان 1386

چکیده ندارد.

2002
Jin-Fu Li Ruey-Shing Tzeng Cheng-Wen Wu

Embedded content addressable memories (CAMs) are important components in many system chips. In this paper two efficient March-like test algorithms are proposed. In addition to typical RAM faults, they also cover CAMspecific comparison faults. The first algorithm requires 9N Read/Write operations and 2(N + W ) Compare operations to cover comparison and RAM faults (but does not fully cover the in...

Journal: :IEEE Trans. VLSI Syst. 2001
Kamran Zarrineh Shambhu J. Upadhyaya Sreejit Chakravarty

Given a set of memory array faults the problem of computing a compact March test that detects all specified memory array faults is addressed. In this paper, we propose a novel approach in which every memory array fault is modeled by a set of primitive memory faults. A primitive March test is defined for each primitive memory fault. We show that March tests that detect the specified memory array...

2015
A. Bosio S. Di Carlo G. Di Natale P. Prinetto

Memory testing commonly faces two issues: the characterization of detailed and realistic fault models, and the definition of time-efficient test algorithms able to detect them. Among the different types of algorithms proposed for testing Static Random Access Memories (SRAMs), march tests have proven to be faster, simpler and regularly structured. The continuous evolution of the memory technolog...

1967
H. Merskey

Professor Hinton is a psychiatrist who has made careful studies of the reactions of dying people, the awareness they have that they are dying, and the ways in which their doctors and nurses may help to bring them solace. His original work is deservedly much esteemed. It has lost nothing by presentation in this volume together with additional information on the circumstances, customs and attitud...

Journal: :IET Computers & Digital Techniques 2007
Alberto Bosio Stefano Di Carlo Giorgio Di Natale Paolo Prinetto

Memory testing commonly faces two issues: the characterization of detailed and realistic fault models, and the definition of time-efficient test algorithms able to detect them. Among the different types of algorithms proposed for testing Static Random Access Memories (SRAMs), march tests have proven to be faster, simpler and regularly structured. The continuous evolution of the memory technolog...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید