VLSI Planarization Methods, Models, Implementation :  Methods, Models, Implementation - V.Z. Feinberg

VLSI Planarization Methods, Models, Implementation

Methods, Models, Implementation

By: V.Z. Feinberg, A.G. Levin, E.B. Rabinovich

Hardcover | 1 April 1997

At a Glance

Hardcover


$169.00

or 4 interest-free payments of $42.25 with

 or 

Ships in 5 to 7 business days

At the beginning we would like to introduce a refinement. The term 'VLSI planarization' means planarization of a circuit of VLSI, Le. the embedding of a VLSI circuit in the plane by different criteria such as the minimum number of connectors, the minimum total length of connectors, the minimum number of over-the-element routes, etc. A connector is designed to connect the broken sections of a net. It can be implemented in different ways depending on the technology. Connectors for a bipolar VLSI are implemented by diffused tun­ nels, for instance. By over-the-element route we shall mean a connection which intersects the enclosing rectangle of an element (or a cell). The possibility of the construction such connections during circuit planarization is reflected in element models and can be ensured, for example, by the availability of areas within the rectangles where connections may be routed. VLSI planarization is one of the basic stages (others will be discussed below) of the so called topological (in the mathematical sense) approach to VLSI design. This approach does not lie in the direction of the classical approach to automation of VLSI layout design. In the classical approach to computer­ aided design the placement and routing problems are solved successively. The topological approach, in contrast, allows one to solve both problems at the same time. This is achieved by constructing a planar embedding of a circuit and obtaining the proper VLSI layout on the basis of it.
Industry Reviews
`Altogether, the book is very well written and a good piece of work. All the notions are clearly defined and the proofs are presented in detail. Many pictures illustrate the subjects discussed and help to make things clear and understandable.'
Mathematical Reviews, 98m

More in Mathematical Theory of Computation

AI Engineering : Building Applications with Foundation Models - Chip Huyen
Discrete Mathematics for Computing : Grassroots - Peter Grossman
The Times Codeword: Book 13 : 200 Cracking Logic Puzzles - The Times Mind Games
Introduction to Modern Cryptography : Revised Third Edition - Jonathan Katz
Foundation Mathematics - K. A. Stroud

RRP $128.99

$109.99

15%
OFF
BEADING WITH ALGORITHMS : CELLULAR AUTOMATA IN PEYOTE STITCH - Gwen Fisher
Applied Mathematics with F# - Sudipta Mukherjee
Axiomatic Set Theory : An Introduction - George Tourlakis
AI Value Creators : Beyond the Generative AI User Mindset - Dario Gil
Hands-On Generative AI with Transformers and Diffusion Models - Omar Sanseviero
Practical Weak Supervision : Doing More with Less Data - Amit Bahree