Sciweavers

31 search results - page 5 / 7
» Circuits with arbitrary gates for random operators
Sort
View
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
16 years 4 days ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
ITC
1995
IEEE
104views Hardware» more  ITC 1995»
15 years 3 months ago
Synthesis of Mapping Logic for Generating Transformed Pseudo-Random Patterns for BIST
During built-in self-test (BIST), the set of patterns generated by a pseudo-random pattern generator may not provide a sufficiently high fault coverage. This paper presents a new ...
Nur A. Touba, Edward J. McCluskey
DAC
2005
ACM
16 years 17 days ago
Designing logic circuits for probabilistic computation in the presence of noise
As Si CMOS devices are scaled down into the nanoscale regime, current computer architecture approaches are reaching their practical limits. Future nano-architectures will confront...
Kundan Nepal, R. Iris Bahar, Joseph L. Mundy, Will...
ISLPED
2010
ACM
153views Hardware» more  ISLPED 2010»
14 years 11 months ago
Leakage minimization using self sensing and thermal management
We have developed a system architecture, measuring and modeling techniques, and algorithms for on-line power and energy optimization and thermal management. The starting point for...
Alireza Vahdatpour, Miodrag Potkonjak
ICCD
2006
IEEE
113views Hardware» more  ICCD 2006»
15 years 8 months ago
A theory of Error-Rate Testing
— We have entered an era where chip yields are decreasing with scaling. A new concept called intelligible testing has been previously proposed with the goal of reversing this tre...
Shideh Shahidi, Sandeep Gupta