On the contact-minimization problem
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Optimal-time multipliers and C-testability
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Reuse of design objects in CAD frameworks
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
A notation for describing multiple views of VLSI circuits
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
A graphical system for hierarchical specifications and checkups of VLSI circuits
EURO-DAC '90 Proceedings of the conference on European design automation
Cell based performance optimization of combinational circuits
EURO-DAC '90 Proceedings of the conference on European design automation
A dynamic programming approach to the power supply net sizing problem
EURO-DAC '90 Proceedings of the conference on European design automation
A hierarchical environment for interactive test engineering
ITC'94 Proceedings of the 1994 international conference on Test
Wired: wire-aware circuit design
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
Hi-index | 0.00 |
We present an algebraic approach to hierarchical design of integrated circuits. This approach is based on a “calculus of nets” which includes topological as well as behavioural aspects of integrated circuits. We have developed a hierarchical design system called CADIC which is build around this calculus in much the same way as e.g. Algol is build around numerics. An example for the design of a family of fast adders will demonstrate the power of this calculus. Finally we will give a summary outline on the structure of procedures which automatically transform the design into lower design levels.