In this paper, we consider a redesign technique applicable to combinational circuits implemented with gate-array or standard-cell technology, where we rectify an existing circuit only by reconnecting gates on the circuit with all the gate types unchanged. This constraint allows us to reuse the original placement as is, thereby speeding up the total time needed for a redesign. We formulate this problem as a Boolean-constraint problem and give a BDD-based algorithm to check the feasibility of redesign.
This paper presents a new technique for decomposition and technology mapping of speed-independent ci...
Abstract: Given a system design (SD), a key task is to optimize this design to reduce the probabilit...
127 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.With the advent of deep submi...
[[abstract]]This paper presents a very efficient optimization method suitable for multilevel combina...
[[abstract]]©1998 IEEE-Redundancy removal is an important step in combinational logic optimization. ...
[[abstract]]©2001 IEICE-The single wire replacement attempts to replace a target wire by another wir...
[[abstract]]We address the problem of rectifying an incorrect combinational circuit against a given ...
Reversible logic circuit synthesis has applications in various modern computational problems, low po...
International audienceA non classical approach to the logic synthesis of Boolean functions based on ...
[[abstract]]In this paper, we discuss the problem of optimizing a multi-level logic combinational Bo...
[[abstract]]In this paper, we propose a layout-driven synthesis approach for field programmable gate...
Most problems in logic synthesis are computationally hard, and are solved using heuristics. This oft...
Abstract. We propose a synthesis algorithm for combinational circuits which optimizes the expected n...
Abstract: In CMOS (Complementary Metal Oxide Semiconductor) technology AND-OR combination logic is u...
This paper presents a rewriting method for Boolean circuits that minimizes small subcircuits with ex...
This paper presents a new technique for decomposition and technology mapping of speed-independent ci...
Abstract: Given a system design (SD), a key task is to optimize this design to reduce the probabilit...
127 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.With the advent of deep submi...
[[abstract]]This paper presents a very efficient optimization method suitable for multilevel combina...
[[abstract]]©1998 IEEE-Redundancy removal is an important step in combinational logic optimization. ...
[[abstract]]©2001 IEICE-The single wire replacement attempts to replace a target wire by another wir...
[[abstract]]We address the problem of rectifying an incorrect combinational circuit against a given ...
Reversible logic circuit synthesis has applications in various modern computational problems, low po...
International audienceA non classical approach to the logic synthesis of Boolean functions based on ...
[[abstract]]In this paper, we discuss the problem of optimizing a multi-level logic combinational Bo...
[[abstract]]In this paper, we propose a layout-driven synthesis approach for field programmable gate...
Most problems in logic synthesis are computationally hard, and are solved using heuristics. This oft...
Abstract. We propose a synthesis algorithm for combinational circuits which optimizes the expected n...
Abstract: In CMOS (Complementary Metal Oxide Semiconductor) technology AND-OR combination logic is u...
This paper presents a rewriting method for Boolean circuits that minimizes small subcircuits with ex...
This paper presents a new technique for decomposition and technology mapping of speed-independent ci...
Abstract: Given a system design (SD), a key task is to optimize this design to reduce the probabilit...
127 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.With the advent of deep submi...