Sciweavers

418 search results - page 15 / 84
» On the Adders with Minimum Tests
Sort
View
ICCAD
2001
IEEE
84views Hardware» more  ICCAD 2001»
14 years 4 months ago
Minimum-Buffered Routing of Non-Critical Nets for Slew Rate and Reliability Control
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...
Charles J. Alpert, Andrew B. Kahng, Bao Liu, Ion I...
DATE
2007
IEEE
81views Hardware» more  DATE 2007»
14 years 2 months ago
Using the inter- and intra-switch regularity in NoC switch testing
This paper proposes an efficient test methodology to test switches in a Network-on-Chip (NoC) architecture. A switch in an NoC consists of a number of ports and a router. Using th...
Mohammad Hosseinabady, Atefe Dalirsani, Zainalabed...
ISCAS
1999
IEEE
106views Hardware» more  ISCAS 1999»
13 years 12 months ago
Test pattern generation for width compression in BIST
The main objectives of Built-In Self Test (BIST) are the design of test pattern generator circuits which achieve the highest fault coverage, require the shortest sequence of test ...
Paulo F. Flores, Horácio C. Neto, K. Chakra...
JCO
2007
56views more  JCO 2007»
13 years 7 months ago
An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure
This paper discusses the relation among four problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. We prove a surprising equivalence relat...
H. B. Chen, Ding-Zhu Du, Frank K. Hwang
FOCS
2009
IEEE
14 years 2 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...