Excerpt from Dynamic Grid Embedding: Optimizing the Compression of Partial Grids
One major goal of circuit integration is the ability to pack dense circuits in very small areas. The model most often used is the one that views the circuit as a graph and the chip as a grid. One lays out the circuit by embedding it in the grid so that graph edges map onto disjoint paths in the grid. The two major measures of embedding efficiency are the area of the smallest rectangle that encloses the circuit layout and the time involved in traversing long runs of wire [thom79]. Vlsi theory has been involved with the study of computational structures that fill specific needs in the new computational environment. These structures resemble cellular automata and iterative arrays of finite automata. The development and analysis of algorithms that aid in the logical and physical design process of integrated circuits is very much needed in order to replace the up to now ad hoc method of circuit design by the human designer.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"synopsis" may belong to another edition of this title.
Seller: Forgotten Books, London, United Kingdom
Paperback. Condition: New. No Jacket. Print on Demand. Explore how partial grids can be compressed without losing shape or speed. This book presents methods for embedding partial grids into near-ideal squares, balancing expansion and dilation to control layout quality. It covers key techniques like folding and compression, with practical insights for VLSI design and graph layouts.Partial-grid concepts are introduced with step-by-step ideas on partitioning, critical lines, and how holes or corners affect embedding. The work also surveys theoretical limits, including when dilation remains small and when problems become computationally hard. Clear explanations of embedding partial grids, dilation, and expansion concepts. Detailed discussion of folding and compression methods and when they work best. Connections to practical design problems in VLSI and graph layouts. Notes on conjectures, complexity results, and potential extensions.Ideal for readers involved in graph theory, algorithm design, and grid-based layout optimization who want a rigorous, application-focused reference. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781333364960_0
Quantity: Over 20 available
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781333364960
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781333364960
Quantity: 15 available