Abstract routing of logic networks for custom module generation
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Wire routing by optimizing channel assignment within large apertures
25 years of DAC Papers on Twenty-five years of electronic design automation
Comparative router performance
ACM SIGDA Newsletter
A topologically based non-minimum distance routing algorithm
DAC '78 Proceedings of the 15th Design Automation Conference
The interconnection problem - a tutorial
DAC '73 Proceedings of the 10th Design Automation Workshop
DAC '80 Proceedings of the 17th Design Automation Conference
A new philosophy for interconnection on multilayer boards
DAC '76 Proceedings of the 13th Design Automation Conference
On the topological aspects of the circuit layout problem
DAC '76 Proceedings of the 13th Design Automation Conference
Topologic class routing for printed circuit boards
DAC '72 Proceedings of the 9th Design Automation Workshop
Wire routing by optimizing channel assignment within large apertures
DAC '71 Proceedings of the 8th Design Automation Workshop
Optimising automatic tracking of multilayer boards
ACM SIGDA Newsletter
Generation of Steiner tree connections in a barrier-free environment
ACM SIGDA Newsletter
ACM SIGDA Newsletter
IEEE Transactions on Computers
On the Ordering of Connections for Automatic Wire Routing
IEEE Transactions on Computers
IBM Journal of Research and Development
The benefits of external wires in single row routing
Information Processing Letters
| Hi-index | 0.01 |
In cellular modeling a given structure is broken up into a collection of substructures called “cells.” Gross topology is then determined from the inter-cellular relation ships while only the essential intra cellular details are retained as parameters. Applying this method in printed circuit wiring programs results in dramatic savings in storage requirements and running times over conventional programs which consider each coordinate in their model. Storage requirements are reduced since only the inter-cellular wire routes are stored, Running time is shorter because one can determine when a wire is unroutable without computing the fine details of the routing. However, once the wiring is determined on the gross level, a significant problem remains—the overall routings must be transformed into specific coordinates with in each cell. The purpose of this paper is not to describe these programs, since they follow easily from the modeling technique, but rather to describe the ideas and concepts behind them.