Sciweavers

165 search results - page 9 / 33
» From the bitstream to the netlist
Sort
View
DAC
1998
ACM
14 years 8 months ago
Practical Experiences with Standard-Cell Based Datapath Design Tools: Do We Really Need Regular Layouts?
Commercial tools for standard-cell based datapath design are here classed according to design flows, and the advantages of each class are discussed with the results of two test ci...
Alexander Grießing, Paolo Ienne
GLVLSI
2009
IEEE
125views VLSI» more  GLVLSI 2009»
14 years 2 months ago
Timing-driven N-way decomposition
Logic decomposition has been extensively used to optimize the worst-case delay and the area in the technology independent phase. Bi-decomposition is one of the state-of-art techni...
David Bañeres, Jordi Cortadella, Michael Ki...
ISLPED
1997
ACM
96views Hardware» more  ISLPED 1997»
13 years 12 months ago
Re-mapping for low power under tight timing constraints
In this paper1 we propose a novel approach to synthesis for low power under tight timing constraints. Starting from a mapped netlist, we apply a powerful generalized matching algo...
Patrick Vuillod, Luca Benini, Giovanni De Micheli
RECOSOC
2007
118views Hardware» more  RECOSOC 2007»
13 years 9 months ago
Latch Inference for Equivalence Checking
A method for inferring latches from combinational loops in a netlist using boolean equations is proposed in this paper. The method takes advantage of the solutions structure of th...
Anatol Ursu
FPGA
2009
ACM
159views FPGA» more  FPGA 2009»
14 years 2 months ago
Choose-your-own-adventure routing: lightweight load-time defect avoidance
Aggressive scaling increases the number of devices we can integrate per square millimeter but makes it increasingly difficult to guarantee that each device fabricated has the inte...
Raphael Rubin, André DeHon