• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.2
• /
• pp.155-162
• /
• 1989

In this paper, we propose a channel router for non-rectangular channels with variable channel height and via minimization method. Non-rectangular routing areas are splitted into 3 parts, upper, lower and rectangular channel. The upper and lower parts are routed by a modified "left edge algorithm." The rectangular channel is routed by channel routing method using the channel representation graph. After routing, redundant vias are eliminated by the rules composed of 3 groups.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.11
• /
• pp.135-143
• /
• 1990

A new over-the-cell routing system is proposed in this paper. The proposed system efficiently reduces not only the channel density but also the routing density in cell region. Generally, the over-the-cell system consists of three phases. Namely, over-the-cell routing, terminal selection and channel routing. In this paper, to select the nets to be routed over the cells, weights are assigned on the intersection graph considering both the channel density and the intersection relations among other nets. When selected nets are blocked by feedthroughs or metal layers for internal logic, they are routed by maze algorithm. Also, in order to reduce channel density, the terminals to be routed in a channel are selected using the minimum weight spanning tree. Channel routing is carried out with a channel router of HAN-LACAD_G. The effectiveness of the over-the-cell routing system is shown by the experiments with benchmark data and its application to the gate array layout system.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.42 no.1
• /
• pp.1-6
• /
• 2005

Channel routing is a problem assigning each net to a track after global routing and minimizing the track that assigned each net. In this paper we propose a genetic algorithm searching solution space for 4-layer channel routing problem. We compare the performance of proposed genetic algorithm(GA) for channel routing with that of other 4-layer channel routing algorithm by analyzing the results of each implementation.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1649-1652
• /
• 2005

채널 배선은 VLSI 설계 과정중의 하나로, 글로벌 배선을 수행한 후 각 배선 영역에 할당된 네트들을 트랙에 할당하여 구체적인 네트들의 위치를 결정하는 문제이며, 네트들이 할당된 트랙의 수를 최소화하는 문제이다. 본 논문에서는 4-레이어 채널 배선 문제에 대하여 효율적인 유전자 알고리즘(genetic algorithm; GA)을 이용한 해 공간 탐색(solution space search) 방식을 제안하였으며, 제안한 방식을 기존의 4-레이어 채널 배선 알고리즘과 비교, 분석하였다.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.5
• /
• pp.145-151
• /
• 1989

A new preprocess technique is presented which can improve the routing efficiency in the gate array layout designs. In order to resolve the cycle problem in the detailed routing, we exchange the logically equivalent pins in each channel. The signal nets are divided, and doubly connected signal net components are removed, so that the increase in the number of tracks can be controlled.

• Electronics and Telecommunications Trends
• /
• v.3 no.1
• /
• pp.3-23
• /
• 1988

VLSI 설계시 응용되는 CAD 기술중 배선과 관련된 내용에 대해 기술동향을 소개하였다. 특히, 미로법, 선분탐색법, 채널배선법에 대하여 연구의 발전과정, 연구내용, 현황 등을 상세히 기술하였으며, 반주문형 설계시 많이 이용되는 개략 배선법에 대해서도 기술하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.2
• /
• pp.287-295
• /
• 2010

In this paper, we introduce a novel approach to optimization algorithm which is a distributed Mean field Genetic algorithm (MGA) implemented in MPI(Message Passing Interface) environments. Distributed MGA is a hybrid algorithm of Mean Field Annealing(MFA) and Simulated annealing-like Genetic Algorithm(SGA). The proposed distributed MGA combines the benefit of rapid convergence property of MFA and the effective genetic operations of SGA. The proposed distributed MGA is applied to the channel routing problem, which is an important issue in the automatic layout design of VLSI circuits. Our experimental results show that the composition of heuristic methods improves the performance over GA alone in terms of mean execution time. It is also proved that the proposed distributed algorithm maintains the convergence properties of sequential algorithm while it achieves almost linear speedup as the problem size increases.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.8
• /
• pp.2143-2151
• /
• 1997

As inter-wire spacing on a VLSI chip becomes smaller with the evolution of VLSI fabrication technology, coupling capacitance between adjacent wires is increasing rapidly over ground capacitance. Therefore, it becomes necessary to take into account the crosstalk caused mainly by coupling capacitance during the layout design of VLSI systems. This paper deals with layer assignment problem to minimize crosstalk in three layers gridded channel routing. The problem is formulated in 0/1 integer linear programming style. Upper bound for cost function is estimated for the fast termination. Experiment shows the effectiveness of our approach to minimize crosstalk.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.1
• /
• pp.64-70
• /
• 2003

Current growth of VLSI design depends critically on the research and development (If automatic layout tool. Automatic layout is composed of placement assigning a specific shape to a block and arranging the block on the layout surface and routing finding the interconnection of all the nets. Algorithms Performing placement and routing impact on Performance and area of VLSI design. Channel routing is a problem assigning each net to a track after global routing and minimizing the track that assigned each net. In this paper we propose a genetic algorithm searching solution space for the netlist partitioning problem for 4-layer channel routing. We compare the performance of proposed genetic algorithm(GA) for channel routing with that of simulated annealing(SA) algorithm by analyzing the results which are the solution of given problems. Consequently experimental results show that out proposed algorithm reduce area over the SA algorithm.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.7
• /
• pp.9-17
• /
• 1997

This paper proposes a routing model based on the HVHD for four-layer routing problems. Differing from the HVHV and HVHH models, the proposed HVHD model permits diagonal routing on the fourth laye rwith a grid of 45.deg., 90.deg. and 135.deg. directions. The developed algorithm which uses a channel-graph including weights routes a layer using diagonal model and the othe rthree layers using HVH model. Applications to several benchmark examples verify that approximately 10~25 percent reduction of channel density can be achieved compared to the conventional four-layer channel routing algorithms.