Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

A Procedure for Placement of Standard-Cell VLSI Circuits

Published: 01 November 2006 Publication History

Abstract

This paper describes a method of automatic placement for standard cells (polycells) that yields areas within 10-20 percent of careful hand placements. The method is based on graph partitioning to identify groups of modules that ought to be close to each other, and a technique for properly accounting for external connections at each level of partitioning. The placement procedure is in production use as part of an automated design system; it has been used in the design of more than 40 chips, in CMOS, NMOS, and bipolar technologies.

Cited By

View all
  • (2025)Efficient Quantum Circuit Design with a Standard Cell Approach, with an Application to Neutral Atom Quantum ComputersACM Transactions on Quantum Computing10.1145/36704176:1(1-18)Online publication date: 14-Jan-2025
  • (2023)TAPA: A Scalable Task-parallel Dataflow Programming Framework for Modern FPGAs with Co-optimization of HLS and Physical DesignACM Transactions on Reconfigurable Technology and Systems10.1145/360933516:4(1-31)Online publication date: 5-Dec-2023
  • (2023)RapidStream 2.0: Automated Parallel Implementation of Latency–Insensitive FPGA Designs Through Partial ReconfigurationACM Transactions on Reconfigurable Technology and Systems10.1145/359302516:4(1-30)Online publication date: 1-Sep-2023
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  Volume 4, Issue 1
November 2006
122 pages

Publisher

IEEE Press

Publication History

Published: 01 November 2006

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2025)Efficient Quantum Circuit Design with a Standard Cell Approach, with an Application to Neutral Atom Quantum ComputersACM Transactions on Quantum Computing10.1145/36704176:1(1-18)Online publication date: 14-Jan-2025
  • (2023)TAPA: A Scalable Task-parallel Dataflow Programming Framework for Modern FPGAs with Co-optimization of HLS and Physical DesignACM Transactions on Reconfigurable Technology and Systems10.1145/360933516:4(1-31)Online publication date: 5-Dec-2023
  • (2023)RapidStream 2.0: Automated Parallel Implementation of Latency–Insensitive FPGA Designs Through Partial ReconfigurationACM Transactions on Reconfigurable Technology and Systems10.1145/359302516:4(1-30)Online publication date: 1-Sep-2023
  • (2022)RapidStreamProceedings of the 2022 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays10.1145/3490422.3502361(1-12)Online publication date: 13-Feb-2022
  • (2021)Still Benchmarking After All These YearsProceedings of the 2021 International Symposium on Physical Design10.1145/3439706.3446885(47-52)Online publication date: 22-Mar-2021
  • (2021)AutoBridgeThe 2021 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays10.1145/3431920.3439289(81-92)Online publication date: 17-Feb-2021
  • (2018)Wot the LProceedings of the 2018 International Symposium on Physical Design10.1145/3177540.3178238(2-9)Online publication date: 25-Mar-2018
  • (2017)Blockage-aware terminal propagation for placement wirelength minimizationProceedings of the 36th International Conference on Computer-Aided Design10.5555/3199700.3199710(73-80)Online publication date: 13-Nov-2017
  • (2017)On solving partition driven standard cell placement problem using firefly-based metaheuristic approachInternational Journal of Bio-Inspired Computation10.1504/IJBIC.2017.0831019:2(121-127)Online publication date: 1-Jan-2017
  • (2017)A square lattice probability model for optimising the Graph Partitioning Problem2017 IEEE Congress on Evolutionary Computation (CEC)10.1109/CEC.2017.7969497(1629-1636)Online publication date: 5-Jun-2017
  • Show More Cited By

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media