INTRODUCTION 1.1. Motivation During the past few years, we have seen the complexity of VLSI circuit designs increase rapidly. One reason for the increase in complexity is the technological advances in the area of mask production and fabrication, making it possible to use smaller and smaller devices. Another reason for the increase in complexity is the automation of the design process, through the use of Computer-Aided Design (CAD) tools. Without the aid of computer programs in the design process, the complexity of the design would be far too great for any engineer to handle. The design process can be divided up primarily into eight stages as follows [1]: 1) System Specification (Architectural Design I) 2) Functional Design (Architectural De...
As our reliance on electric and electronic devices increases, the need to improve the design and man...
Efficient automatic layout tools are clearly essential for designing complex VLSI systems. Recent ef...
We present a library, CRoP, of combinatorial algorithms for routing problems that occur during the d...
177 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986.In this thesis, we study an a...
In the process of automatic design for printed circuit boards (PCBs), the phase following cell place...
In VLSI physical design, the routing task consists of using over-the-cell metal wires to connect pin...
In the process of automatic design for printed circuit boards (PCBs), the phase following cell place...
Many times, routing of signal nets in the layout design of VLSI circuits turns out to be a bottlenec...
Data parallel programming provides a simple and powerful framework for designing parallel algorithms...
The inter-wire spacing in a VLSI chip becomes closer as the VLSI fabrication technology rapidly evol...
Two algorithms for channel routing using simulated annealing are presented. Many of the channel rout...
162 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1987.The thesis addresses the algo...
The advent of the nanotechnology has introduced new challenges and non-conventional problems to high...
The computational requirements for high quality synthesis, analysis, and verification of VLSI design...
We discuss the problem of approximately sotvlng circuit layout problems by simulated annealing. For ...
As our reliance on electric and electronic devices increases, the need to improve the design and man...
Efficient automatic layout tools are clearly essential for designing complex VLSI systems. Recent ef...
We present a library, CRoP, of combinatorial algorithms for routing problems that occur during the d...
177 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986.In this thesis, we study an a...
In the process of automatic design for printed circuit boards (PCBs), the phase following cell place...
In VLSI physical design, the routing task consists of using over-the-cell metal wires to connect pin...
In the process of automatic design for printed circuit boards (PCBs), the phase following cell place...
Many times, routing of signal nets in the layout design of VLSI circuits turns out to be a bottlenec...
Data parallel programming provides a simple and powerful framework for designing parallel algorithms...
The inter-wire spacing in a VLSI chip becomes closer as the VLSI fabrication technology rapidly evol...
Two algorithms for channel routing using simulated annealing are presented. Many of the channel rout...
162 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1987.The thesis addresses the algo...
The advent of the nanotechnology has introduced new challenges and non-conventional problems to high...
The computational requirements for high quality synthesis, analysis, and verification of VLSI design...
We discuss the problem of approximately sotvlng circuit layout problems by simulated annealing. For ...
As our reliance on electric and electronic devices increases, the need to improve the design and man...
Efficient automatic layout tools are clearly essential for designing complex VLSI systems. Recent ef...
We present a library, CRoP, of combinatorial algorithms for routing problems that occur during the d...