Sciweavers

10988 search results - page 1792 / 2198
» Algorithmic Folding Complexity
Sort
View
ICCD
2006
IEEE
113views Hardware» more  ICCD 2006»
16 years 1 months ago
High-speed Factorization Architecture for Soft-decision Reed-Solomon Decoding
Reed-Solomon (RS) codes are among the most widely utilized error-correcting codes in modern communication and computer systems. Among the decoding algorithms of RS codes, the rece...
Xinmiao Zhang
ICCD
2003
IEEE
127views Hardware» more  ICCD 2003»
16 years 1 months ago
Structural Detection of Symmetries in Boolean Functions
Functional symmetries provide significant benefits for multiple tasks in synthesis and verification. Many applications require the manual specification of symmetries using spe...
Guoqiang Wang, Andreas Kuehlmann, Alberto L. Sangi...
ICCAD
2007
IEEE
99views Hardware» more  ICCAD 2007»
16 years 1 months ago
Automating post-silicon debugging and repair
Modern IC designs have reached unparalleled levels of complexity, resulting in more and more bugs discovered after design tape-out However, so far only very few EDA tools for post...
Kai-Hui Chang, Igor L. Markov, Valeria Bertacco
101
Voted
ICCAD
2006
IEEE
124views Hardware» more  ICCAD 2006»
16 years 1 months ago
A linear-time approach for static timing analysis covering all process corners
Abstract—Manufacturing process variations lead to circuit timing variability and a corresponding timing yield loss. Traditional corner analysis consists of checking all process c...
Sari Onaissi, Farid N. Najm
ICCAD
2005
IEEE
90views Hardware» more  ICCAD 2005»
16 years 1 months ago
Scalable compositional minimization via static analysis
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...
Fadi A. Zaraket, Jason Baumgartner, Adnan Aziz
« Prev « First page 1792 / 2198 Last » Next »