Sciweavers

4679 search results - page 332 / 936
» Modeling When Connections Are the Problem
Sort
View
DAC
1994
ACM
15 years 10 months ago
Routing in a New 2-Dimensional FPGA/FPIC Routing Architecture
- This paper studies the routing problem for a new Field-Programmable Gate Array (FPGA) and Field-Programmable Interconnect Chip (FPIC) routing architecture which improves upon the...
Yachyang Sun, C. L. Liu
ENTCS
2008
138views more  ENTCS 2008»
15 years 6 months ago
Compositionality of Statically Scheduled IP
Timing Closure in presence of long global wire interconnects is one of the main current issues in System-onChip design. One proposed solution to the Timing Closure problem is Late...
Julien Boucaron, Jean-Vivien Millo
CORR
2006
Springer
93views Education» more  CORR 2006»
15 years 6 months ago
Crosstalk-free Conjugate Networks for Optical Multicast Switching
High-speed photonic switching networks can switch optical signals at the rate of several terabits per second. However, they suffer from an intrinsic crosstalk problem when two opti...
Yun Deng, Tony T. Lee
DSE
1998
80views more  DSE 1998»
15 years 6 months ago
The Voltan application programming environment for fail-silent processes
The Voltan software library for building distributed applications provides the support for (i) a processpair to act as single Voltan self-checking ‘fail-silent’ process; and (...
Dave Black, C. Low, Santosh K. Shrivastava
JOC
2002
99views more  JOC 2002»
15 years 6 months ago
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
Phong Q. Nguyen, Igor Shparlinski