• Home
  • Search
  • Placement Algorithms for Arbitrarily Shaped Blocks
  • Cite Icon46
  • https://doi.org/10.1109/dac.1979.1600152Copy DOI Icon

Placement Algorithms for Arbitrarily Shaped Blocks

  • Jan 1, 1979
  • B.t Preas +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

New placement algorithms have been developed which are suitable for the layout of Very Large Scale Integrated (VLSI) circuits. Hierarchical decomposition is used to reduce the circuit function to a size that can be comprehended by the designer and is computationally feasible to layout. At each hierarchical level the problem consists of the placement of interconnected rectangular blocks of arbitrary size and shape such that the area occupied by the blocks and their interconnections is minimal. Constructive initial placement and iterative improvement algorithms are presented.

Similar Papers
  • Research Article
  • Citations33

Model and solution strategy for placement of rectangular blocks in the Euclidean plane

  • Mar 01, 1988
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • A Alon +1
  • Conference Article
  • Citations1

Iterative Improvement Algorithm Used in Distribution Network Reconfiguration for Power Losses Minimization

  • Mar 25, 2021
  • Valentin A Boicea +2
  • Research Article
  • Citations1

Automated design flow for diode-based nanofabrics

  • Jul 01, 2006
  • ACM Journal on Emerging Technologies in Computing Systems
  • Kushal Datta +2
  • Conference Article
  • Citations81

A general purpose multiple way partitioning algorithm

  • Jan 01, 1991
  • Ching-Wei Yeh +2
  • Research Article
  • Citations10

An improved linear placement algorithm using node compaction

  • Jan 01, 1996
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • Y.G Saab
  • Research Article
  • Citations5

Variable-size data item placement for load and storage balancing

  • Apr 25, 2003
  • Journal of Systems and Software
  • Yung-Cheng Ma +3
  • Research Article
  • Citations3

Hardware accelerated FPGA placement

  • Nov 06, 2008
  • Microelectronics Journal
  • Christian Fobel +2
  • Research Article
  • Citations23

Parallel techniques for solving large scale travelling salesperson problems

  • Jan 01, 1992
  • Microprocessors and Microsystems
  • Cp Ravikumar
  • Research Article

Reduction of Area per Good Die for SoC Memory Built-In Self-Test

  • Jan 01, 2010
  • IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
  • Masayuki Arai +4
  • Book Chapter

Introduction

  • Jan 01, 1992
  • Pranav Ashar +2
  • Conference Article
  • Citations6

A new faster algorithm for iterative placement improvement

  • Mar 22, 1996
  • M Hossain +2
  • Research Article

Stochastic dominance-based comparison between iterative improvement and simulated annealing algorithms for minimum losses distribution systems reconfiguration

  • Jan 01, 2023
  • EMERG - Energy. Environment. Efficiency. Resources. Globalization
  • Valentin Mohanu +1
  • Conference Article

Deep fully Connectedness Convolutional Broken Stick Regressive Brent-Kung Adder Enhancement for Efficient VLSI Design

  • Dec 28, 2022
  • Renuka M +1
  • Research Article
  • Citations1

S-visibility problem in VLSI chip design

  • Jan 01, 2017
  • TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES
  • Marzieh Ekandari +1
  • PDF
  • Book Chapter

VLSI Design of Sorting Networks in CMOS Technology

  • Jan 20, 2012
  • Vctor M. +8
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.