Logic replication is known to be an effective technique to reduce the number of cut nets in partitioned circuits. A new replication model called functional replication is particularly useful for partitioning technology mapped circuits [7]. Functional replication differs from traditional replication because it considers the functional dependency of the different output signals of a logic cell on its input signals. Functional replication can lead to a higher reduction in the number of cut nets than traditional replication. In this paper, we give the first theoretical treatment of the min-cut partitioning problem with functional replication. We present a novel two-phase algorithm to compute a min-cut bipartition of a technology mapped circuit ...
[[abstract]]Circuit partitioning is one of the central problems in VLSI system design. The primary o...
1 Traditionally, the circuit partitioning problem is done by rst modeling a circuit as a graph and t...
The Kernighan/Lin graph partitioning heuristic, also known as min-cut or group migration, has been e...
[[abstract]]Logic replication is known to be an effective technique to reduce the number of cut nets...
[[abstract]]Logic replication is known to be an effective technique to reduce the number of cut nets...
[[abstract]]Logic replication is known to be an effective technique to reduce the number of cut nets...
[[abstract]]Logic replication is known to be an effective technique to reduce the number of cut nets...
[[abstract]]Logic replication has been shown to be very effective in reducing the number of cut nets...
[[abstract]]Logic replication has been shown to be very effective in reducing the number of cut nets...
[[abstract]]Logic replication has been shown to be very effective in reducing the number of cut nets...
Hwang and El Gamal [HE92, HE95] formulated the min-cut replication problem, which is to determine mi...
[[abstract]]In this paper, we propose the idea of temporal logic replication in dynamically reconfig...
[[abstract]]In this paper, we propose the idea of temporal logic replication in dynamically reconfig...
The problem of partitioning a logical circuit into subcircuits is considered. It is of great importa...
The Kernighan/Lin heuristic, also known as min-cut, has been extended very successfully for circuit ...
[[abstract]]Circuit partitioning is one of the central problems in VLSI system design. The primary o...
1 Traditionally, the circuit partitioning problem is done by rst modeling a circuit as a graph and t...
The Kernighan/Lin graph partitioning heuristic, also known as min-cut or group migration, has been e...
[[abstract]]Logic replication is known to be an effective technique to reduce the number of cut nets...
[[abstract]]Logic replication is known to be an effective technique to reduce the number of cut nets...
[[abstract]]Logic replication is known to be an effective technique to reduce the number of cut nets...
[[abstract]]Logic replication is known to be an effective technique to reduce the number of cut nets...
[[abstract]]Logic replication has been shown to be very effective in reducing the number of cut nets...
[[abstract]]Logic replication has been shown to be very effective in reducing the number of cut nets...
[[abstract]]Logic replication has been shown to be very effective in reducing the number of cut nets...
Hwang and El Gamal [HE92, HE95] formulated the min-cut replication problem, which is to determine mi...
[[abstract]]In this paper, we propose the idea of temporal logic replication in dynamically reconfig...
[[abstract]]In this paper, we propose the idea of temporal logic replication in dynamically reconfig...
The problem of partitioning a logical circuit into subcircuits is considered. It is of great importa...
The Kernighan/Lin heuristic, also known as min-cut, has been extended very successfully for circuit ...
[[abstract]]Circuit partitioning is one of the central problems in VLSI system design. The primary o...
1 Traditionally, the circuit partitioning problem is done by rst modeling a circuit as a graph and t...
The Kernighan/Lin graph partitioning heuristic, also known as min-cut or group migration, has been e...