Overview

This paper addresses the classical problem of printed circuit board routing: that is, the problem of automatic routing by a computer other than by brute force that causes the execution time to grow exponentially as a function of the complexity. Most of the present solutions are either inexpensive but not efficient and fast, or efficient and fast but very costly. Many solutions are proprietary, so not much is written or known about the actual algorithms upon which these solutions are based. This paper presents a formal algorithm for routing traces on a print- ed circuit board. The solution presented is very fast and efficient and for the first time speaks to the question eloquently by way of symbolic statements. Hedgley, David R., Jr. Armstrong Flight Research Center NASA-TP-3639, H-2104, NAS 1.60:3639 RTOP 505-68-84...

Full Product Details

9781724991959

Table of Contents

Reviews

Author Information

Tab Content 6

Countries Available