Basic principles and generalizations of algorithmic methods of flexible-connection routing
Abstract
The paper considers methods of flexible routing of connections which enable the development of a broad algorithmic base and software for the computer design of printed-circuit boards. Flexible routing consists of two stages: (1) the construction of a model of route topology, ensuring a flat imbedding of routes in the analog model of the working field (macrorouting) and (2) the construction of models of route geometry, where the coordinates of all route points on the structural element are determined (microrouting). Flexible routing has the advantages of good quality of results, high operational-speed, low memory-requirement and the possibility of evaluating and correcting the results.
- Publication:
-
Upravliaiushchie Sistemy i Mashiny
- Pub Date:
- December 1977
- Bibcode:
- 1977UpSM.......103B
- Keywords:
-
- Algorithms;
- Circuit Boards;
- Computer Aided Design;
- Printed Circuits;
- Computer Programs;
- Network Synthesis;
- Electronics and Electrical Engineering