Quasi Dynamic Approach to Layout Compaction

Balakrishnan, S and Nandy, SK (1990) Quasi Dynamic Approach to Layout Compaction. In: Microprocessing and Microprogramming, 30 (1-5). pp. 231-236.

PDF Quasi_Dynamic_Approach_to_Layout_Compaction.pdf Restricted to Registered users only Download (460kB) | Request a copy

Abstract

Symbolic layout and layout compaction are closely related topics. Symbolic layout captures more of a designer's intent than does pure layout and allows it to be updated to new technologies. Compaction free the designer from the tedium of adhering to the design rules during layout design. The two techniques together form a powerful tool for automating the design process. In a graph based approach to layout compaction, the most time consuming tasks are constraint graph generation and compaction, In the paper, an incremental algorithm to perform layout compaction is proposed that incrementally decreases the number of edges to be searched in the constraint graph. A theoretical proof to establish the correction of the approach is also provided.

Item Type:	Journal Article
Publication:	Microprocessing and Microprogramming
Publisher:	Elsevier
Additional Information:	Copyright of this article belongs to Elsevier.
Department/Centre:	Division of Interdisciplinary Sciences > Supercomputer Education & Research Centre
Date Deposited:	29 Aug 2007
Last Modified:	19 Sep 2010 04:38
URI:	http://eprints.iisc.ac.in/id/eprint/11419

Actions (login required)

View Item