Geometrical compaction in one dimension for channel routing
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
A three-layer gridless channel router with compaction
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Nutcracker: an efficient and intelligent channel spacer
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
A “gridless” variable-width channel router for marco cell design
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
DAC '83 Proceedings of the 20th Design Automation Conference
An optimum channel-routing algorithm for polycell layouts of integrated circuits
DAC '73 Proceedings of the 10th Design Automation Workshop
LTX - a system for the directed automatic design of LSI circuits
DAC '76 Proceedings of the 13th Design Automation Conference
DAC '76 Proceedings of the 13th Design Automation Conference
Wire routing by optimizing channel assignment within large apertures
DAC '71 Proceedings of the 8th Design Automation Workshop
DAC '82 Proceedings of the 19th Design Automation Conference
Compaction of a routed channel on the connection machine
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
MISER: an integrated three layer gridless channel router and compactor
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
An optimal chip compaction method based on shortest path algorithm with automatic jog insertion
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Optimal via-shifting in channel compaction
EURO-DAC '90 Proceedings of the conference on European design automation
On the k-layer planar subset and via minimization problems
EURO-DAC '90 Proceedings of the conference on European design automation
| Hi-index | 0.00 |
Channel routing area improvement by means of via minimization and via shifting in two dimensions (compaction) is readily achievable. Routing feature area can be minimized by wire straightening. The implementation of algorithms for each of these procedures has produced a solution for Deutsch's Difficult Example, the standard channel routing benchmark, that is more than 5% smaller than the best result published heretofore. Suggestions for possible future work are also given.