http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Auction 알고리즘을 이용한 Shape Based 방식에 의한 PCB 자동 배선에 관한 연구
우경환,이천희,Woo, Kyong-Hwan,Lee, Cheon-Hee 한국정보처리학회 2001 정보처리학회논문지 A Vol.8 No.3
자동배선 시스템의 배선영역 모델링 방법은 그리드와 논 그리드 방식을 사용하고 있다. 그리드 방식은 PCB상에 전기적, 물리적 요소들이 적다 할지라도 보드와 그리드의 크기에 제약을 받기 때문에 자동배선 속도를 감소시키는 단점을 가지고 있다. 따라서 메모리 용량을 증가 시키게 된다. 논 그리드 방식(Shape based type)은 영역처리 방식을 사용하며, 배선영역에서 그리드 방식보다 44.2% 메모리 감소효과가 있다. 따라서 Via 수는 55.5%의 감소 효곽가 있으며, 총 배선 시간도 기존 PCB시스템보다 83.3% 향상되었다. 본 논문에서는 단일 원점에서 여러 목적지에 가장 빠르게 도달 할 수 있고 최단 경로 문제를 해결하는 auction 알고리즘을 적용한 Shape based 방식에 의하여 메모리 낭비 없이 빠른 속도로 자동 배선할 수 있는 PCB 자동 배선 시스템을 개발하였다. 또한 본 시스템은 IBM Pentium 컴퓨터 Windows 환경에서 Visual C++언어로 개발하였으며 다른 PC 와도 호환성을 가질수 있도록 개발 하였다. 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.
최단거리 및 최소비용을 위한 클럭라우팅 알고리즘에 관한 연구
우경환,이용희,이천희 청주대학교 산업과학연구소 1999 産業科學硏究 Vol.17 No.1
In this paper, we are clock routing algorithm for shortest distance and minimum cost of total wirelength under given path length hounded skew in linear network flow problem. The algorithm construct a bounded-skew tree in two steps for produce of shortest distance and minimum cost of total wirelength. One step; a bottom-up phase to construct a binary tree of shortest distance and minimum cost feasible regions which approach possible shortest distance routing placements of each clock entry points. Two; a top-down phase to construct of it feasible regions which approach possible placements of each clock entry points. We are was produce a set of clock routing solutions with bounded-skew and wirelength trade-off.
수정된 Auction 알고리즘을 이용한 망 흐름 문제에서 최단경로에 관한 연구
우경환,이재영,이천희 청주대학교 산업과학연구소 1998 産業科學硏究 Vol.16 No.-
The classical algorithm for solving network flow problem ate primal cost Improvement methods. including simplex methods, which iteratively improve the primal cost by moving, flow around simple cycles. We use simple algorithm for finding a shortest path from several origins to a sing1e destination The algorithm is well suited for parallel computation. We proposed modified auction algorithm for shortest path in the network flow problem, it used more a number of increase price then primary method. Also impulse by the algorithm, propose of the modified auction algorithm in the alternative proposal used furthermore increase price.
PCB 상에서 최단 경로를 위한 Auction 알고리즘에 관한 연구
우경환,이용희,이천희 청주대학교 산업과학연구소 2000 産業科學硏究 Vol.18 No.1
In this paper we study auction algorithm for shortest path problem can reached short time from one original point to various destination. These variation based on graph reduction concept by delete unnecessary circle using the certain boundary obtained during algorithm performance process. We studied graph structure and developed graph reduction to obtain performance O(nmin{m, logn}) algorithm. Also performed iteration process by change a pair(P, p) meet Complementary Salckness(CS) condition to solve the shortest path problem. And we studied typical iteration/shortest algorithms that calculate the shortest path by delete terminal node iteration process or expanded path P by new node in each iteration process. As a result we obtained good auction algorithm resultant by solved the various uncertain problem than any algorithm.
Wormhole 라우팅 적응력을 이용한 교착상태 회복에 관한 연구
우경환,정상범,이천희 청주대학교 산업과학연구소 1997 産業科學硏究 Vol.15 No.-
The performance of interconnection networks can be improved by pipelining packet transmission and using adaptive routing. Wormhole switching, which is an efficient pipehned switching technique, is unfortunately prone to deadlock be cause each packet usually holds several channels simultaneously. Until recently, most proposals have focussed on deadlock avoidance. In this paper, we proposed an efficient and cost effective deadlock recovery strategy which is based on the concept of routing deadlocked message on a deadlock-free lance. It generalized the theory on the deadlock recovery by considering a mixed set of resources (edge and central buffers) using the notion of buffers as apposed to channels This paper extends the work by appling the generalized theory developed to relax the sequential recovery requirement all allow simultaneous recovery from deadlocks.
최단경로 알고리즘을 이용한 PCB 자동 배선에 관한 연구
우경환,김현호,이천희 청주대학교 산업과학연구소 2001 産業科學硏究 Vol.19 No.1
Routing region modeling methods for auto-routing system is used grid and non-grid methods Although physical elements are small, the grid method has disadvantage that decrease the auto-routing speed due to constraint with size of grid and board, which in it is increase memory size Shape based type(non-grid method) used region process type and the shape located in memory as a individual element, and this element consumed small memory due to unique data size In this paper we developed PCB(Print Circuit Board) auto-routing system using the auction algorithm method that 1) Could be reached by solving the shortest path from single original point to various destination, and 2) without any memory dissipation with the best speed. Also, the auto-routing system developed by Visual C++ in Window environment, and can be used in IBM Pentium computer or in various individual PC system
흐름도를 이용한 인터페이스 회로 생성 알고리즘에 관한 연구
우경환,이천희 한국시뮬레이션학회 2001 한국시뮬레이션학회 논문지 Vol.10 No.1
In this paper, we describe the generation method of interface logic which replace between IP & IP handshaking signal with asynchronous logic circuit. Especially, we suggest the new asynchronous sequential "Waveform to VHDL" code creation algorithm by flow chart conversion : Wave2VHDL - if only mixed asynchronous timing waveform is presented the level type input and pulse type input for handshaking, we convert waveform to flowchart and then replace with VHDL code according to converted flowchart. Also, we confirmed that asynchronous electronic circuits are created by applying extracted VHDL source code from suggest algorithm to conventional domestic/abroad CAD Tool, Finally, we assured the simulation result and the suggest timing diagram are identical.
최단경로 및 최소비용 할당을 위한 Auction 알고리즘에 관한 연구
우경환(Woo Kyong Hwan),이재영(Yi Jae Young),임태영(Lim Tae Young),이천희(Yi Cheon Hee) 한국정보과학회 1999 한국정보과학회 학술발표논문집 Vol.26 No.1A
auction 알고리즘이 각각의 반복에서 분산계산을 제시하는 개체와 초기의 대상 가격을 선택하기 위하여 몇 개의 특별한 법칙과 함께 동일한 문제에 적용이 될 때, 일반적으로 개체는 ε-이완법의 형태에서 획득할 수 있다. 본 논문은 할당 문제를 해결하기 위한 방법으로 최소비용 흐름 문제를 일반화시키며, 전형적인 반복에 의한 최단경로 문제, 최소비용 흐름 측면에서 auction/수송문제 확장을 이용하여 최소비용 흐름 문제에 대하여 연구하였다.