Sciweavers

10718 search results - page 515 / 2144
» On the Circuit Implementation Problem
Sort
View
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
15 years 11 months ago
Fast Analytic Placement using Minimum Cost Flow
Many current integrated circuits designs, such as those released for the ISPD2005[14] placement contest, are extremely large and can contain a great deal of white space. These new...
Ameya R. Agnihotri, Patrick H. Madden
ASPDAC
2007
ACM
132views Hardware» more  ASPDAC 2007»
15 years 11 months ago
Fast Decoupling Capacitor Budgeting for Power/Ground Network Using Random Walk Approach
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
Le Kang, Yici Cai, Yi Zou, Jin Shi, Xianlong Hong,...
CTRSA
2009
Springer
106views Cryptology» more  CTRSA 2009»
15 years 11 months ago
Communication-Efficient Private Protocols for Longest Common Subsequence
We design communication efficient two-party and multi-party protocols for the longest common subsequence (LCS) and related problems. Our protocols achieve privacy with respect to p...
Matthew K. Franklin, Mark Gondree, Payman Mohassel
AHS
2006
IEEE
113views Hardware» more  AHS 2006»
15 years 10 months ago
A Honeycomb Development Architecture for Robust Fault-Tolerant Design
A new hardware developmental model that shows strong robust transient fault-tolerant abilities and is motivated by embryonic development and a honeycomb structure is presented. Ca...
Andy M. Tyrrell, Hong Sun
ASPDAC
2006
ACM
125views Hardware» more  ASPDAC 2006»
15 years 10 months ago
Efficient identification of multi-cycle false path
Due to false paths and multi-cycle paths in a circuit, using only topological delay to determine the clock period could be too conservative. In this paper, we address the timing a...
Kai Yang, Kwang-Ting Cheng