Sciweavers

188 search results - page 13 / 38
» Timing-driven optimization using lookahead logic circuits
Sort
View
WEA
2010
Springer
397views Algorithms» more  WEA 2010»
14 years 4 months ago
A New Combinational Logic Minimization Technique with Applications to Cryptology
Abstract. A new technique for combinational logic optimization is described. The technique is a two-step process. In the first step, the nonlinearity of a circuit – as measured ...
Joan Boyar, René Peralta
GECCO
2006
Springer
143views Optimization» more  GECCO 2006»
14 years 1 months ago
A hybridized genetic parallel programming based logic circuit synthesizer
Genetic Parallel Programming (GPP) is a novel Genetic Programming paradigm. Based on the GPP paradigm and a local search operator - FlowMap, a logic circuit synthesizing system in...
Wai Shing Lau, Kin-Hong Lee, Kwong-Sak Leung
JUCS
2007
102views more  JUCS 2007»
13 years 10 months ago
The Use of Runtime Reconfiguration on FPGA Circuits to Increase the Performance of the AES Algorithm Implementation
: This article presents an architecture that encrypts data with the AES algorithm. This architecture can be implemented on the Xilinx Virtex II FPGA family, by applying pipelining ...
Oscar Pérez, Yves Berviller, Camel Tanougas...
TCAD
2002
73views more  TCAD 2002»
13 years 9 months ago
A timing-constrained simultaneous global routing algorithm
In this paper, we propose a new approach for VLSI interconnect global routing that can optimize both congestion and delay, which are often competing objectives. Our approach provi...
Jiang Hu, Sachin S. Sapatnekar
ISPD
1999
ACM
98views Hardware» more  ISPD 1999»
14 years 2 months ago
Towards synthetic benchmark circuits for evaluating timing-driven CAD tools
For the development and evaluation of CAD-tools for partitioning, floorplanning, placement, and routing of digital circuits, a huge amount of benchmark circuits with suitable cha...
Dirk Stroobandt, Peter Verplaetse, Jan Van Campenh...