Prerouting analysis of printed circuit boards

Computer-Aided Design - Tập 13 - Trang 367-375 - 1981
Michal Servit1
1Czech Technical University, Department of Computers, 121 35 Praha 2, Czechoslovakia

Tài liệu tham khảo

Foster, 1975, Prerouting analysis programs, Vol 12, 306 Akers, 1972, Routing Agrawal, 1976, On the probability of success in a routing process, Vol 64, 1624 Servit, 1980, Some experiments with routing on printed circuit boards, Comput. Aided Des., Vol. 12, 231, 10.1016/0010-4485(80)90027-5 Sutherland, 1973, How big should a printed circuit board be?, IEEE Trans. Comput., Vol C-22, 537, 10.1109/T-C.1973.223759 Rager, 1978, The design of a dense PCB using an interactive DA system, Vol 15 Donath, 1979, Placement and average interconnection length of computer logic, IEEE Trans. Circuit Syst., Vol CAS-26, 272, 10.1109/TCS.1979.1084635 Servit, M ‘Heuristic algorithms for rectilinear Steiner trees’ (unpublished paper) Servit, 1979 Lee, 1961, An algorithm for path connections and its applications, IRE Trans. Electron. Comput., Vol EC-10, 346, 10.1109/TEC.1961.5219222 Wallis, 1951, Tolerance intervals for linear regression, 43