본문 바로 가기

로고

국내 최대 기계 및 로봇 연구정보
통합검색 화살표
  • 유니맷 메탈에듀
  • 기술보고서

    기술보고서 게시판 내용
    타이틀 A FORMAL ALGORITHM FOR ROUTING TRACES ON A PRINTED CIRCUIT BOARD
    저자 David R. Hedgley, Jr
    Keyword Artificial intelligence; Printed circuit board; Routing
    URL http://www.dfrc.nasa.gov/DTRS/1996/PDF/H-2104.pdf
    보고서번호 NASA-TP-3639
    발행년도 1996
    출처 NASA Dryden Flight Research Center
    ABSTRACT 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 printed 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.

    서브 사이드

    서브 우측상단1