• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2004년도 가을 학술발표논문집 Vol.31 No.2 (1)
• /
• pp.742-744
• /
• 2004

본 논문에서는 표준 셀 배치기 Mongrel의 성능을 개선하기 위해 사용된 다양한 기법에 관해 살펴보고 top-down방식의 계층적 분할 기법을 이용한 광역 배치(Hierarchical Global Placement)를 제안한다. 계층적 분할 기법을 이용한 광역 배치는 RBLS(Relaxation Based Local Search) 기법과 더불어 Mongrel의 성능 개선에 결정적인 역할을 하고 있으며 분할 기법으로 hMETIS(클러스터링을 이용한 다단계 분할 기법)를 사용한다. 우리는 표준 벤치마크 회로를 이용한 실험을 통해 계층적 분할 기법을 이용한 광역 배치 기법이 안정적이면서 효율적인 배치 결과를 가져옴을 보인다.

• 대한전자공학회논문지
• /
• 제27권4호
• /
• pp.628-635
• /
• 1990

This paper describes a new gate array layout system, HAN-LACAD-G(HANyang LAyout CAD system for Gate array). HAN-LACAD-G is composed of placer, global router, detailed router, and output processor. In placement design, initial placement is performed by repetitive clustering and min-cut partitioning followed by placement improvement using the concept of pairwise interchange. In global routing phase, pins are assigned in each channel considering the routing congestion estimation and overflows in feedthroughs are restricted. For the detailed routing, we use layer and three layer channel routing techniques. Layout results are displayed graphically and modified interactively by the user using the layout editor.

• 대한전자공학회논문지
• /
• 제25권5호
• /
• pp.572-579
• /
• 1988

In this paper, a system of automatic placement and routing for gate array layout design is proposed. In the placement stage, the circuit is partitioned and using the concept of min-cut slicing, and each partitioned module is placed, so that the routing density over the entire chip be uniformized and the total wiring length be minimized. In the global routing stage, the concept of the probabilistic routing density is introduced to unify the wiring congestions in each channel. In the detailed routing stage, the multi-terminal nets are partitioned into the two-terminal nets. The ordered channel graph is proposed which implies the vertical and the horizontal constranint graphs simultaneously. And using the ordered channel graph, the proposed routing algorithm assigns the signal nets to the tracks. Also the proposed placement and routing algorithms are implimented on IBM/PC-AT to construct PC-level gate array layout system.

• ETRI Journal
• /
• 제43권2호
• /
• pp.260-271
• /
• 2021

This paper addresses Very large-scale integration (VLSI) placement optimization, which is important because of the rapid development of VLSI design technologies. The goal of this study is to develop a hybrid algorithm for VLSI placement. The proposed algorithm includes a sequential combination of a genetic algorithm and an evolutionary algorithm. It is commonly known that local search algorithms, such as random forest, hill climbing, and variable neighborhoods, can be effectively applied to NP-hard problem-solving. They provide improved solutions, which are obtained after a global search. The scientific novelty of this research is based on the development of systems, principles, and methods for creating a hybrid (combined) placement algorithm. The principal difference in the proposed algorithm is that it obtains a set of alternative solutions in parallel and then selects the best one. Nonstandard genetic operators, based on problem knowledge, are used in the proposed algorithm. An investigational study shows an objective-function improvement of 13%. The time complexity of the hybrid placement algorithm is O(N2).

• 한국정보과학회논문지:시스템및이론
• /
• 제33권1_2호
• /
• pp.92-104
• /
• 2006

본 논문에서 제안하는 기법은 기존의 첨단 배치기인 Kraftwerk (& KraftwerkNC)와 Mongrel을 개선 확장한 것으로써, 광역배치에서 셀 중첩을 효과적으로 해결하는 Mongrel의 ripple move 기법과 force directed 광역배치기인 KraftwerkNC의 강력한 성능을 결합한 것이다. 제안한 기법에서는 Mongrel의 ripple move를 최적화하기 위해 Kraftwerk에서 사용한 힘 분산(force spreading)기법을 이용한다. 셀 밀집을 개선시키고, 배선길이를 최적화하는 과정에서 타이밍을 위해 넷 제약조건들이 고려된다. 제안된 기법을 통해 얻은 실험 결과는 배선길이 뿐만 아니라 타이밍에서 향상된 결과를 보여준다.

• Smart Structures and Systems
• /
• 제25권2호
• /
• pp.169-181
• /
• 2020

Sensor placement is a crucial aspect of bridge health monitoring (BHM) dedicated to accurately estimate and locate structural damages. In addressing this goal, a sensor placement framework based on the deflection influence line (DIL) analysis is here proposed, for the optimal design of damage detection-oriented BHM system. In order to improve damage detection accuracy, we explore the change of global stiffness matrix, damage coefficient matrix and DIL vector caused by structural damage, and thus develop a novel sensor placement framework based on the Fisher information matrix. Our approach seeks to determine the contribution of each sensing node to damage detection, and adopts a distance correction coefficient to eliminate the information redundancy among sensors. The proposed damage detection-oriented optimal sensor placement (OSP) method is verified by two examples: (1) a numerically simulated three-span continuous beam, and (2) the Pinghu bridge which has existing real damage conditions. These two examples verify the performance of the distance corrected damage sensitivity of influence line (DSIL) method in significantly higher contribution to damage detection and lower information redundancy, and demonstrate the proposed OSP framework can be potentially employed in BHM practices.

• Smart Structures and Systems
• /
• 제13권3호
• /
• pp.389-406
• /
• 2014

Optimal sensor placement techniques play a significant role in enhancing the quality of modal data during the vibration based health monitoring of civil structures, where many degrees of freedom are available despite a limited number of sensors. The literature has shown a shift in the trends for solving such problems, from expansion or elimination approach to the employment of heuristic algorithms. Although these heuristic algorithms are capable of providing a global optimal solution, their greatest drawback is the requirement of high computational effort. Because a highly efficient optimisation method is crucial for better accuracy and wider use, this paper presents an improved simulated annealing (SA) algorithm to solve the sensor placement problem. The algorithm is developed based on the sensor locations' coordinate system to allow for the searching in additional dimensions and to increase SA's random search performance while minimising the computation efforts. The proposed method is tested on a numerical slab model that consists of two hundred sensor location candidates using three types of objective functions; the determinant of the Fisher information matrix (FIM), modal assurance criterion (MAC), and mean square error (MSE) of mode shapes. Detailed study on the effects of the sensor numbers and cooling factors on the performance of the algorithm are also investigated. The results indicate that the proposed method outperforms conventional SA and Genetic Algorithm (GA) in the search for optimal sensor placement.

• Journal of Electrical Engineering and Technology
• /
• 제6권6호
• /
• pp.786-792
• /
• 2011

The present paper presents an optimal capacitor placement (OCP) algorithm for voltagestability enhancement. The OCP issue is represented using a mixed-integer problem and a highly nonlinear problem. The hybrid particle swarm optimization (HPSO) algorithm is proposed to solve the OCP problem. The HPSO algorithm combines the optimal power flow (OPF) with the primal-dual interior-point method (PDIPM) and ordinary PSO. It takes advantage of the global search ability of PSO and the very fast simulation running time of the OPF algorithm with PDIPM. In addition, OPF gives intelligence to PSO through the information provided by the dual variable of the OPF. Numerical results illustrate that the HPSO algorithm can improve the accuracy and reduce the simulation running time. Test results evaluated with the three-bus, New England 39-bus, and Korea Electric Power Corporation systems show the applicability of the proposed algorithm.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2002년도 하계학술대회 논문집 A
• /
• pp.124-126
• /
• 2002

The general capacitor placement problem is a combinatorial optimization problem having an objective function composed of power losses and capacitor installation costs subject to bus voltage constraints. In this paper, the method employing the chaos search algorithm is proposed to solve optimal capacitor placement problem with reducing computational effort and enhancing optimality of the solution. Chaos method in optimization problem searches the global optimal solution on the regularity of chaotic motions and easily escapes from local or near optimal solution than stochastic optimization algorithms. The chaos optimization method is tested on 9 buses and 69 buses system to illustrate the effectiveness of the proposed method.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 C
• /
• pp.1195-1198
• /
• 1999

This paper presents optimal placement of minimal set of phasor measurement units(PMU's) and observability of measurement system with PMU. By using the incidence matrix symbolic method which directly assigns measurement and pseudo-measurement to incidence matrix, it is much simpler and easier to analyze observability. The optimal PMU set is found through the simulated-annealing(SA) and the direct combinational method. The cooling schedule parameter which is suitable to the property of problem to solve is specified and optimal placement is proven by presented direct combinational method. Search spaces are limited within reasonable feasible solution region to reduce a unnecessary one in the SA implementation based on global search. The proposed method presents to save CPU time and estimate state vectors based on optimal PMU set.