SearcharxivSearch

arXiv subjects

Jordi Cortadella

Publications and source records attributed to Jordi Cortadella.

2 recordsLinked to original sources

Chip Floorplanning Combining Convex and Non-convex Optimization

Floorplanning is a critical early stage of VLSI physical design, and its quality directly impacts interconnect wirelength, chip performance, and downstream design efficiency. This article presents a multi-stage fixed-outline floorplanning framework that combines non-convex and convex optimization. The framework operates in three successive phases. In the initial floorplanning phase, a quadratic placement optimizes module connectivity to produce a topology-aware starting configuration with strong net clustering, albeit with significant module overlaps. In the global floorplanning phase, Adam-based projected gradient method is employed to solve non-convex optimization that minimizes wirelength and overlap. In the legalization phase, a log-transformed model exploiting horizontal and vertical constraint graphs eliminates residual overlaps under a convex formulation. Experiments on the MCNC, GSRC and HB+ benchmarks demonstrate that the framework achieves state-of-the-art wirelength quality, reducing average HPWL by at least 1\% and 5\% compared to state-of-the-art floorplanners on tested benchmarks.

cs.AR

Decomposition of transition systems into sets of synchronizing state machines

Transition systems (TS) and Petri nets (PN) are important models of computation ubiquitous in formal methods for modeling systems. An important problem is how to extract from a given TS a PN whose reachability graph is equivalent (with a suitable notion of equivalence) to the original TS. This paper addresses the decomposition of transition systems into synchronizing state machines (SMs), which are a class of Petri nets where each transition has one incoming and one outgoing arc and all markings have exactly one token. This is an important case of the general problem of extracting a PN from a TS. The decomposition is based on the theory of regions, and it is shown that a property of regions called excitation-closure is a sufficient condition to guarantee the equivalence between the original TS and a decomposition into SMs. An efficient algorithm is provided which solves the problem by reducing its critical steps to the maximal independent set problem (to compute a minimal set of irredundant SMs) or to satisfiability (to merge the SMs). We report experimental results that show a good trade-off between quality of results vs. computation time.

cs.FL