✦ LIBER ✦

Optimal min-area min-cut replication in partitioned circuits

✍ Scribed by Yang, H.H.; Wong, D.F.

Book ID: 119778389
Publisher: IEEE
Year: 1998
Tongue: English
Weight: 357 KB
Volume: 17
Category: Article
ISSN: 0278-0070
DOI: 10.1109/43.736190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum replication min-cut partitioning

✍ Wai-Kei Mak; Wong, D.F. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 229 KB

Min-cut partitioning with functional rep

Min-cut partitioning with functional replication for technology-mapped circuits using minimum area overhead

✍ Wai-Kei Mak 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 319 KB

A fast hypergraph min-cut algorithm for

A fast hypergraph min-cut algorithm for circuit partitioning

✍ Wai-Kei Mak; D.F. Wong 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 215 KB

Circuit partitioning is one of the central problems in VLSI system design. The primary objective of circuit partitioning is to minimize the number of interconnections between di!erent components of the partitioned circuit. So the circuit partitioning problem is closely related to the minimum cut pro

An improved circuit-partitioning algorit

An improved circuit-partitioning algorithm based on min-cut equivalence relation

✍ Xianyang Jiang; Xubang Shen; Tianxu Zhang; Huayu Liu 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 330 KB

Network flow is an excellent approach to finding min-cuts in network because of the celebrated maxflow/min-cut theorem. For a long time, however, it has not been a practical circuit partitioning method for its relatively high computational complexity. Algorithm FBB is the first one to apply network