We propose an algorithm for minimal-delay technology mapping for library-based designs. We show that subject graphs need not be decomposed into trees for delay minimization; they can be mapped directly as DAGs. Experimental results demonstrate that significant delay improvement is possible by this new approach.
[[abstract]]We combine technology mapping and placement into a single procedure, M.map, for the desi...
[[abstract]]We combine technology mapping and placement into a single procedure, M.map, for the desi...
Delay budget is an excess delay each component of a design can tolerate under a given timing constra...
This paper proposes a library-free technology mapping algorithm to reduce delay in combinational cir...
This paper proposes “path mapping”, a method of delay es-timation for technology independent combina...
This paper presents a new approach to technology mapping for arbitrary technologies with single outp...
The field programmable gate-array (FPGA) has become an important technology in VLSI ASIC designs. Mo...
Routing congestion has become a serious concern in today’s VLSI designs. In this paper, we propose a...
Abstract — Routing congestion has become a serious concern in today’s VLSI designs. To address the s...
We study the nominal delay minimization problem in LUT-based FPGA technology mapping, where intercon...
Technology mapping is the task to transform a technology independent logic network into a mapped net...
A6struct- The field programmable gate-array (FPGA) has become an important technology in VLSI ASIC d...
[[abstract]]We combine technology mapping and placement into a single procedure, M.map, for the desi...
ABSTRACT dependent on the library gates, technology mapping (TM) which The gain-based technology map...
The paper presents several improvements to our synthesis platform Xsynth that was developed targetin...
[[abstract]]We combine technology mapping and placement into a single procedure, M.map, for the desi...
[[abstract]]We combine technology mapping and placement into a single procedure, M.map, for the desi...
Delay budget is an excess delay each component of a design can tolerate under a given timing constra...
This paper proposes a library-free technology mapping algorithm to reduce delay in combinational cir...
This paper proposes “path mapping”, a method of delay es-timation for technology independent combina...
This paper presents a new approach to technology mapping for arbitrary technologies with single outp...
The field programmable gate-array (FPGA) has become an important technology in VLSI ASIC designs. Mo...
Routing congestion has become a serious concern in today’s VLSI designs. In this paper, we propose a...
Abstract — Routing congestion has become a serious concern in today’s VLSI designs. To address the s...
We study the nominal delay minimization problem in LUT-based FPGA technology mapping, where intercon...
Technology mapping is the task to transform a technology independent logic network into a mapped net...
A6struct- The field programmable gate-array (FPGA) has become an important technology in VLSI ASIC d...
[[abstract]]We combine technology mapping and placement into a single procedure, M.map, for the desi...
ABSTRACT dependent on the library gates, technology mapping (TM) which The gain-based technology map...
The paper presents several improvements to our synthesis platform Xsynth that was developed targetin...
[[abstract]]We combine technology mapping and placement into a single procedure, M.map, for the desi...
[[abstract]]We combine technology mapping and placement into a single procedure, M.map, for the desi...
Delay budget is an excess delay each component of a design can tolerate under a given timing constra...
DOI
Add to ORKG