• Finding placement-relevant clustersWith fast modularity-based clustering 

      Fogaça, Mateus Paiva (2020) [Tese]
      In advanced technology nodes, IC implementation faces an increasing design complexity as well as ever-more demanding design schedule requirements. This raises the need for new decomposition approaches that can help reduce ...
    • Initial detailed routing algorithms 

      Oliveira, André Saldanha (2021) [Dissertação]
      In this work, we present a study of the problem of routing in the context of the VLSI physical synthesis flow. We study the fundamental routing algorithms such as maze routing, A*, and Steiner tree-based algorithms, as ...
    • A new quadratic formulation for incremental timing-driven placement 

      Fogaça, Mateus Paiva (2016) [Dissertação]
      The interconnection delay is a dominant factor for achieving timing closure in nanoCMOS circuits. During physical synthesis, placement aims to spread cells in the available area while optimizing an objective function w.r.t. ...
    • Tackling the drawbacks of a lagrangian relaxation based discrete gate sizing algorithm 

      Plácido, Henrique (2018) [Dissertação]
      The shrink of the devices sizes allows the number of transistors in the integrated circuits to grow, leading to an increase in the leakage power. The discrete gate sizing technique consists in assigning each gate of the ...