11.3.1. Basics for partitioning
Most partitioning algorithms solve the bipartitioning (or 2-way partitioning) problem, which is to divide a circuit into two subcircuits. The bipartitioning problem will be discussed in the following.
11.3.1.1. Problem formulation
The circuit bipartitioning problem can be formulated as a hypergraph bipartitioning problem by modeling a circuit as a hypergraph. A circuit module is represented by a vertex, and the area of the module is modeled as the vertex size. A net is represented by a hyperedge, and the criticality of the net is modeled as the hyperedge weight. For example, the circuit in Figure 11.2a can be modeled by the hypergraph in Figure 11.2b in which the set of vertices is {A, B, C, D, E}) and the ...
Get Electronic Design Automation now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
