• Title/Summary/Keyword: Automatic routing

Search Result 69, Processing Time 0.028 seconds

The Development of Automatic Schematic Generator (스키메틱 자동생성기의 개발)

  • 배영환;백영석;박성범;이성봉;장영조;이현찬
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.28A no.9
    • /
    • pp.761-773
    • /
    • 1991
  • In this paper, an algorithm for automatic schematic generation which creates schematic diagram from netlist are proposed. The important objectives on schematic generation are readability and clarity of resulting schematics. Each stage of generation should aim at enhancing these objectives. For this reason, schematic generation problem is divided into 5 subproblems` preprocessing, logical placement, pin assignment and improvement of placement, global routing, and detailed routing. The algorithm is implemented in C language, and it generates schematics from the results of logic synthesis in order to make it east for designers to understand the design and reflect their knowledge into design.

  • PDF

A Study on the PCB automatic routing by shape based method using the auction algorithm (Auction 알고리즘을 이용한 Shape Based 방식에 의한 PCB 자동 배선에 관한 연구)

  • Woo, Kyong-Hwan;Lee, Cheon-Hee
    • The KIPS Transactions:PartA
    • /
    • v.8A no.3
    • /
    • pp.269-278
    • /
    • 2001
  • Routing region modeling method of auto_routing systems are use the grid and the non-grid type. Though grid type has a few electrical and physical element on PCB, grid type has disadvantage which decrease the auto-routing speed dur to constraint with board and gird size. Thus it increase the memory capacity, Non-grid type(Shape baed type) use the region processing type, so it has 44.2% memory decrease effect than grid type in routing region. Thus, via number has 55% decrease effect, total routing time is increased 83.8% than conventional PCB system. In this paper we developed high speed PCB auto-routing system without memory waste by using shaped type applicant with auction algorithm which reaching the destination from one-point with best speed and solving the path problem. Also, this system developed by Visual C++ in IBM Pentium computer Window environment, and compatible with other PC.

  • PDF

A Study on the Automatic Placement and Routing System for Standard Cell (스텐다드 셀의 자동배치 배선시스템에 관한 연구)

  • 엄낙웅;강길순;박송배
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.24 no.6
    • /
    • pp.1049-1055
    • /
    • 1987
  • This paper describes a near-optimal standard cell layout strategy which consists of three consecutives steps` partition, placement, and routing. In the partition step, a given network is torn apart into many subnetworks such that each subnetworks contains as many cells as possible with minimum interocnnections between subnetwork. In the placement step, the conventional string placement algorithm was modified. Also, bonding pads were placed such that their connections to the related cells are shortest. As a result for the tested example, the placement time was saved by 60% and the total routing lengths were saved by more than 20% and substantial improvements in the number of feed-through cell and the track density were obtained. The layout program is coded in PASCAL and implemented on a VAX 11-750/UNIX computer.

  • PDF

A Study on the Automatic Placement System for Standard Cell (스텐다드 셀의 자동배치 시스템에 관한 연구)

  • Kang, Gil Soon;Kyung, Chong Min;Park, Song Bai
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.23 no.4
    • /
    • pp.557-564
    • /
    • 1986
  • This paper describes a standard cell placement strategy which consists of three kconsecutive steps` initial placement, iterative placement improvement, and string placement. In the initial placement step, cell placement was done by solving the linear ordering problem for a one-dimensional layout of standard cells and then zigzaging the resultant linear order width in the chip plane. The iterative placement improvement step is based on the iterative pairwise interchange using the estimated total routing length as a figure-or -merit. The string placement is used to reorder cells and terminals in each etandard cell row such that channel routing in the adjacent channels is not blocked by cyclic constraints and needs fewer routing tracks. The placement program is coded in PASCAL and kimplemented on a VAX-11/750 computer. Experimental results for several examples are included.

  • PDF

Vehicle Routing Model Based on AVL System (자동 위치 조회시스템을 이용한 차량운송계획모델)

  • 황흥석;조규성
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.10a
    • /
    • pp.279-282
    • /
    • 2000
  • 물류시스템설계 및 개선의 일환으로 차량운송계획 문제는 매우 중요시되는 분야이다. 본 연구는 유전자 알고리즘을 이용한 통합물류 운송계획문제(Integrated Vehicle Routing Problem : IVRP)를 위한 전산화 모델의 개발로서 운송 중인 차량의 자동위치 조회시스템(Automatic Vehicle Location System : AVL)을 이용하여 차량운송의 통제기능을 높이며, 차량운송 효율을 높이는 목적으로 VRP문제와 AVL문제를 연계하는 통합운송시스템의 개념 연구이다. 본 연구에서는 다-물류센터를 고려한 운송 영역할당(Sector Clustering), 경로계획 문제(VRP) 및 유전자 알고리즘을 이용한 운송순서 계획(GA-TSP)을 고려한 통합운송계획모델의 개발을 목적으로 차량의 운송간의 통신 및 통제 등의 기능을 위하여 위치 추적을 가진 GPS와 통신시스템을 위한 TRS 및 위치설정을 위한 GIS를 고려하였다. 본 연구에서의 AVL시스템 개발을 위한 GPS, GIS 및TRS 등 AVL시스템의 구성요소에 대하여 그 개요를 조사 연구하였다. 또한 GPS, GIS을 기반으로한 물류시스템의 구성과 시스템에 필요한 기능 및 구성요소를 파악하고 서브 시스템을 구성하여 각 서브 시스템의 기본설계를 실시하기 위한 연구이다.

  • PDF

A Study about Finding Optimal Path Using HAS Dynamic Programming (RAS Dynamic Programming을 이용한 최적 경로 탐색에 관한 연구)

  • Kim, Jeong-Tae;Cho, Hyun-Chul;Lee, Kwon-Soon
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2007.12a
    • /
    • pp.226-227
    • /
    • 2007
  • Significant increase of container flows in marine terminals requires more efficient automatic port systems. This paper presents a novel routing and collision avoidance algorithm of linear motor based shuttle cars using random access sequence dynamic programming (RAS DP). The proposed RAS DP is accomplished online for determining optimal paths for each shuttle car.

  • PDF

P&R Porting & Test-chip implementation Using Standard Cell Libraries (표준 셀 라이브러리 P&R 포팅과 테스트 칩의 설계)

  • Lim, Ho-Min;Kim, Nam-Sub;Kim, Jin-Sang;Cho, Won-Kyung
    • Journal of Advanced Navigation Technology
    • /
    • v.7 no.2
    • /
    • pp.206-210
    • /
    • 2003
  • In this paper, we design standard cell libraries using the 0.18um deep submircom CMOS process, and port them into a P&R (Placement and Routing) CAD tool. A simple test chip has been designed in order to verify the functionalities of the 0.18um standard cell libraries whose technical process was provided by Anam semiconductor. Through these experiments, we have found that the new 0.18um CMOS process can be successfully applied to automatic digital system design.

  • PDF

Realization of Water AMR Network using ZigBee Protocol (ZigBee 무선표준을 이용한 상수도 원격검침 네트워크 구현)

  • Kwon, Jong-Won;Park, Yong-Man;Odgerel, Odgerel;Kim, Hie-Sik
    • Proceedings of the KIEE Conference
    • /
    • 2006.04a
    • /
    • pp.168-170
    • /
    • 2006
  • In this paper, authors realize water AMR(Automatic Meter Reading) network using low power ZigBee protocol included routing ability for improving wireless communitation error detection and network range. ZigBee wireless standard is an important standard of the field related Ubiquitous industry and recently has application to Home-Network. It's special features are to spend low power and to include routing ability each terminator. Because of these features, authors realize water AMR system on Embedded system using ZigBee protocol for applying to transfer data between a water meter and RF module equipped with a water meter in each house.

  • PDF

Design of an Automatic Placement System for PCBs (PCB 자동 배치 시스템의 설계)

  • 장명수;이장순;황선영
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.2
    • /
    • pp.104-115
    • /
    • 1994
  • This paper presents the design of a placement sysyem integrated in PCB design system. to get an optimal component positioning from part and net list. Unplaced components are placed in initial process using modified cluster development algorithm and are swapped in improvement process using the GFDR(Generalized Force Directed Relaxation) algorithm. The result is optimized in post process by component rotating or pin/gate swapping. Experimental results shwo that the placement system produces manufacturable layouts which are optimal in terms of total routing length.

  • PDF

A Study about Finding Optimal Path Using RAS Dynamic Programming (RAS Dynamic Programming을 이용한 최적 경로 탐색에 관한 연구)

  • Kim, Jeong-Tae;Lee, John-Tak;Lee, Kwon-Soon
    • Proceedings of the KIEE Conference
    • /
    • 2007.07a
    • /
    • pp.1736-1737
    • /
    • 2007
  • Significant increase of container flows in marine terminals requires more efficient automatic port systems. This paper presents a novel routing and collision avoidance algorithm of linear motor based shuttle cars using random access sequence dynamic programming (RAS DP). The proposed RAS DP is accomplished online for determining optimal paths for each shuttle car.

  • PDF