Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleJune 1989
Fast online/offline netlist compilation of hierarchical schematics
DAC '89: Proceedings of the 26th ACM/IEEE Design Automation ConferenceJune 1989, Pages 822–825https://doi.org/10.1145/74382.74539We present fast techniques for creating the netlist underlying a hierarchical schematic design. The methods can be used either for creating the netlist as a data structure for further online processing or for creating the netlist as a file for use with ...
- ArticleJune 1989
An object-oriented datamodel for the VLSI design system PLAYOUT
DAC '89: Proceedings of the 26th ACM/IEEE Design Automation ConferenceJune 1989, Pages 814–817https://doi.org/10.1145/74382.74537A complete datamodel for an integrated VLSI design system is developed in a stepwise manner. This datamodel introduces a unified view of all design domains and hierarchy levels that result in a considerable simplification of the communication among the ...
- ArticleJune 1989
The object-oriented integration methodology of the Cadlab work station design environment
DAC '89: Proceedings of the 26th ACM/IEEE Design Automation ConferenceJune 1989, Pages 807–810https://doi.org/10.1145/74382.74535The Cadlab Work Station Design Environment is an integrated CAD environment. Like other integrated CAD environments, it consists of a single design management sub-environment and a set of application sub-environments integrated into a CAD framework. ...
- ArticleJune 1989
A unified data exchnage environment based on EDIF
DAC '89: Proceedings of the 26th ACM/IEEE Design Automation ConferenceJune 1989, Pages 803–806https://doi.org/10.1145/74382.74534This paper describes the work to unify a data exchange environment based on EDIF. Concepts of common specification, common data structure, and common EDIF reader/writer to synchronize the interpretations of EDIF syntax and semantics in an EDIF-based ...
- ArticleJune 1989
VIA minimization by layout modification
DAC '89: Proceedings of the 26th ACM/IEEE Design Automation ConferenceJune 1989, Pages 799–802https://doi.org/10.1145/74382.74533We present in this paper a new approach to the two-layer via minimization problem. Our approach is to systematically eliminate vias by modifying the routing layout. We have implemented our algorithm and applied it to benchmark routing layouts published ...
-
- ArticleJune 1989
DTR: a defect-tolerant routing algorithm
DAC '89: Proceedings of the 26th ACM/IEEE Design Automation ConferenceJune 1989, Pages 795–798https://doi.org/10.1145/74382.74532A new channel routing algorithm called DTR (Defect-Tolerant Routing) is investigated. This algorithm minimizes the total area and simultaneously maximizes the performance by reducing the critical area which can potentially be the source of logical ...
- ArticleJune 1989
DYNAJUST: an efficient automatic routing technique optimizing delay conditions
DAC '89: Proceedings of the 26th ACM/IEEE Design Automation ConferenceJune 1989, Pages 791–794https://doi.org/10.1145/74382.74531A new routing technique DYNAJUST, Dynamic Wire Length Adjustment, is described. It accurately realizes specified wire lengths to fulfill delay conditions. The implementation, based on the combination of shortest path algorithms, is proposed to achieve a ...
- ArticleJune 1989
Optimum design of reliable IC power networks having general graph topologies
DAC '89: Proceedings of the 26th ACM/IEEE Design Automation ConferenceJune 1989, Pages 787–790https://doi.org/10.1145/74382.74530This paper deals with the problem of sizing integrated-circuit power and ground distribution systems external to the logic modules constituting an integrated circuit. Several constraints associated with the reliability of the power and ground ...
- ArticleJune 1989
Automatic sizing of power/ground (P/G) networks in VLSI
DAC '89: Proceedings of the 26th ACM/IEEE Design Automation ConferenceJune 1989, Pages 783–786https://doi.org/10.1145/74382.74529This paper presents a fast and efficient method for sizing power/ground networks. No restrictions on network topology or number of supplying pads are imposed. Wire widths are calculated such that the weighted area of wire segments is minimized while ...
- ArticleJune 1989
Compaction of a routed channel on the connection machine
DAC '89: Proceedings of the 26th ACM/IEEE Design Automation ConferenceJune 1989, Pages 779–782https://doi.org/10.1145/74382.74528A parallel algorithm for symbolic compaction of two layered channels has been developed and implemented on the Connection Machine. It allows fast channel compaction with very little wasted space.
- ArticleJune 1989
Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms
DAC '89: Proceedings of the 26th ACM/IEEE Design Automation ConferenceJune 1989, Pages 775–778https://doi.org/10.1145/74382.74527In this paper, we compare the performance of two popular graph bisection algorithms. We also present an empirical study of a new heuristic, first proposed in [B87], that dramatically improves the performance of these bisection algorithms on graphs with ...
- ArticleJune 1989
Min-cost partitioning on a tree structure and applications
DAC '89: Proceedings of the 26th ACM/IEEE Design Automation ConferenceJune 1989, Pages 771–774https://doi.org/10.1145/74382.74526We introduce a generalization of the min-cut partitioning problem, called Min-Cost Tree Partitioning, in which the nodes of an hypergraph G are to be mapped on to the vertices of a tree structure T, and the cost function to be minimized is the cost of ...
- ArticleJune 1989
An evolution-based approach to partitioning ASIC systems
DAC '89: Proceedings of the 26th ACM/IEEE Design Automation ConferenceJune 1989, Pages 767–770https://doi.org/10.1145/74382.74525In the design of application specific integrated circuits (ASIC), it is often required to partition a logic complex into smaller subcomplexes satisfying a number of constraints. Due to the complexity of the problem, most existing algorithms try to ...
- ArticleJune 1989
Fast hypergraph partition
DAC '89: Proceedings of the 26th ACM/IEEE Design Automation ConferenceJune 1989, Pages 762–766https://doi.org/10.1145/74382.74524We present a new Ο(n2) heuristic for hypergraph min-cut bipartitioning, an important problem in circuit placement. Fastest previous methods for this problem are Ο(n2 log n). Our approach is based on the intersection graph G dual to the input hypergraph. ...
- ArticleJune 1989
Designer controlled behavioral synthesis
DAC '89: Proceedings of the 26th ACM/IEEE Design Automation ConferenceJune 1989, Pages 754–757https://doi.org/10.1145/74382.74522This paper describes features of EXEL, a graphic language that gives the designer control over the behavioral synthesis process. Control is achieved by allowing the designer to partially specify the structural design into which the description is going ...
- ArticleJune 1989
COMP: a VHDL composition system
DAC '89: Proceedings of the 26th ACM/IEEE Design Automation ConferenceJune 1989, Pages 750–753https://doi.org/10.1145/74382.74521An automated system for creating and managing VHDL design units is described in this paper. This system helps the hardware designer to learn the syntax of the VHSIC Hardware Description Language (VHDL) and to produce code which can be used for ...
- ArticleJune 1989
Behavioral modeling of transmission gates in VHDL
DAC '89: Proceedings of the 26th ACM/IEEE Design Automation ConferenceJune 1989, Pages 746–749https://doi.org/10.1145/74382.74520This paper presents a technique for describing the behavior of transmission gates (TGs) in VHDL. The concept of virtual signal is introduced into the TG's data structure to represent the nature of the connection. The model's semantics are coded in three ...
- ArticleJune 1989
Toward synthesis from English descriptions
DAC '89: Proceedings of the 26th ACM/IEEE Design Automation ConferenceJune 1989, Pages 742–745https://doi.org/10.1145/74382.74519This paper reports on a research project to design a system for automatically interpreting English specifications of digital systems in terms of design representation formalisms currently employed in CAD systems. The necessary processes involve the ...
- ArticleJune 1989
Semantics of a hardware design language for Japanese standardization
DAC '89: Proceedings of the 26th ACM/IEEE Design Automation ConferenceJune 1989, Pages 836–839https://doi.org/10.1145/74382.74518We propose a new approach to define a formal semantics of a hardware design language (HDL) in Japanese LSI design language standardization project. Our approach is to separate the definition of semantics from simulators. Since the semantics includes ...