Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2004.11A.4.267

A Study on the Development Automatic Placement/Routing System in the PCB  

Kim, Hyun-Gi (극동정보대학 정보통신과)
Woo, Kyong-Hwan (우송공업대학 의료복지과)
Publication Information
The KIPS Transactions:PartA / v.11A, no.4, 2004 , pp. 267-276 More about this Journal
Abstract
The modeling methods of routing region used in the automatic placement/routing system are a grid and non-grid. Because the gird method is curbed by its size and a board if the electrical and physical elements on PCB are of small quantity, it has many memories. Therefore, it has demerit which decreases the speed of automatic placement/routing. The Shape-based type, non-grid method, makes the shapes exist as an in dividual element in a memory by using a region-processing method. Each individual element needs very small memory since it has its unique data size. Therefore, this paper aimed to develope the automatic placement/routing system which can automatically place and route the PCB without dissipation of memory at a high speed. To this aim, the auction algorithm method was applied which can make the memories be most rapidly reached from the original point to various destinations. Also, this system was developed by the Visual C++ in the Widows environment of IBM Pentium computer in order to use it in an individual PC system.
Keywords
Shape-based Type; PCB; Non-grid;
Citations & Related Records
연도 인용수 순위
  • Reference
1 John H. Holland, Adaptation in Natural and Artificial Systems, The University of Michigan, 1992
2 D. Hoey, C. E. Leiserson, 'A layout for the shuffle-exchange network,' Proc. of the 13th Annual ACM Sym. on the Theory of Computing, pp. 334-341, 1981
3 E. Berkean and E. Kinnen, 'IC layout planning and placement by dimensional relaxation', IEEE Int Conference on Computer Design, pp.449-451, 1985
4 Bertsekas, D. P., 'A The Auction Algorithm for Shortest Paths,' SIAM H. on Optimization, Vol.1, pp.425-447, 1991   DOI
5 Hightower, David, 'The interconnect Problem : A Tutorial,' Proceedings of the Design Automation Workshop, IEEE, pp.1-21, 1973
6 Pallottino, S. and Scutella, M. G., 'Strongly polynomial Algorithms for Shortest Paths,' Dipartimento di Informatica Report TR-19/91, University of Pisa, Italy, 1991
7 Bertsekas, D. P., Linear Network Optimization: Algorithms and Codes, M. I. T. Press, Cambridge, Mass., 1991
8 Watanabe, Hiroyuki, 'IC Layout Generation and Compaction using Mathematical Optimization,' The University of Rochester, Ph. D. 1984