Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 5 of 5 for “"Quadratic placement"”.

  1. A new quadratic formulation for incremental timing-driven placement

    … in nanoCMOS circuits. During physical synthesis, placement aims to spread cells in the available area while optimizing an objective function w.r.t. the design constraints. Therefore, it is a key step to determine the total wirelength and hence to achieve timing closure. Incremental placement …

    brazil-ufrgs Repository record for A new quadratic formulation for incremental timing-driven placement (opens in a new tab)

  2. Minimum Cost Flow Based Fast Placement Algorithm

    <p>Placement is a very important and critical procedure during VLSI design. In this thesis, we propose a new force-directed quadratic placement algorithm called Minimum Cost Flow Based Fast Placement Algorithm(MCFPlace) for large-scale circuits. We mainly have three contributions:</p> <p>(1) In …

    iastate Repository record for Minimum Cost Flow Based Fast Placement Algorithm (opens in a new tab)

  3. An efficient analytical placement algorithm using cell shifting, iterative local refinement and a hybrid net model

    … we present FastPlace-a fast, iterative, flat placement algorithm for large scale standard cell designs in the fixed-die context. FastPlace is based on the quadratic placement approach. The quadratic approach formulates the wirelength minimization problem as a convex quadratic program, which …

    iastate Repository record for An efficient analytical placement algorithm using cell shifting, iterative local refinement and a hybrid net model (opens in a new tab)

  4. Algorithms for wire length improvement of VLSI circuits with concern to critical paths

    … de posicionamento global baseado no algorítmo de Quadratic Placement considera informações da tecnologia e requerimento de espaçamento de 3D-Vias para reduzir o comprimento das conexões e equilibrar a distrubuição das células em 3D. Conexes críticas podem ser tratadas através da insercão de redes …

    brazil-ufrgs Repository record for Algorithms for wire length improvement of VLSI circuits with concern to critical paths (opens in a new tab)

  5. Timing Driven Analytical Placement for FPGA

    Conventional Simulated Annealing (SA) based placement methods for FPGAs give best results in terms of wirelength and critical path delay. The runtime for these SA based methods is directly proportional to the total number of cells to be placed. In case of modern multi-million gate FPGAs, SA based …

    umn Repository record for Timing Driven Analytical Placement for FPGA (opens in a new tab)