지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- Korean Institute of Information Scientists and Engineers Journal of Electrical Engineering and Information Science Journal of Electrical Engineering and Information Science Vol.4 No.6
- 발행연도
- 1999.12
- 수록면
- 660 - 667 (8page)
이용수
초록· 키워드
오류제보하기
The channel routing problem we consider is to assign a set of nets given by horizontal segments S={S₁S₂…S_n} to a set of track T={t₁, t₂.…, t_k} in the channel such that no two intervals assigned to the same track overlap. One important goal is to find a channel routing with the minimum number of tracks such that the signal interference between nets assigned to neighboring tracks is minimized, and thus power consumption is reduced and signal integrity is improved. This problem is called crosstalk-minimum channel routing. For a given net assignment with k tracks, crosstalk can be reduced by finding another net assignment for S with k tracks (i.e., by permuting nets in tracks). However, considering all possible permutations requires O(n!) time. For general cost function for crosstalk measure, the problem is NP-hard. Several heuristic approaches were previously presented. In this paper, we consider special instances of the crosstalk-minimization problem where the cost function depends only on the length of the segments that runs in parallel. A fast near-optimal algorithm solving this problem in O(nlog n) is presented. The channel routing uses a small number of 45˚ wire patterns that leads to an efficient crosstalk-minimum channel routing. Experimental results showed the effectiveness of the proposed algorithm.
목차
Abstract
Ⅰ. Introduction
Ⅱ. Problem Formulation
Ⅲ. A New Algorithm for Crosstalk-Minimum Channel Routing
Ⅳ. Experimental Results
Ⅴ. Conclusions
References
저자소개
참고문헌 (0)
참고문헌 신청함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
Lower Power Channel Routing by Crosstalk Minimization for Deep Submicron VLSI Design
Journal of Electrical Engineering and information Science
1999 .12
-
A Crosstalk Minimization Technique for Gridded Channel Routing
ITC-CSCC :International Technical Conference on Circuits Systems, Computers and Communications
1996 .01
-
Layer Assignment for Crosstalk Minimization in a Three Layers Gridded Channel Routing
ICVC : International Conference on VLSI and CAD
1997 .01
-
혼선을 고려한 채널 배선 방법
(구)정보과학회논문지
1994 .10
-
CHANNEL ROUTING : MODEL AND ALGORITHMS
JTC-CSCC : Joint Technical Conference on Circuits Systems, Computers and Communications
1992 .01
-
High - Speed VLSI System에서의 Crosstalk에 관한 연구
대한전자공학회 기타 간행물
2001 .11
-
고속 디지털 신호 전송선로에서의 Crosstalk 에 관한 연구 ( A Study on Crosstalk in High Speed Digital Signal Transmission Line )
전자공학회논문지-A
1994 .08
-
채널 그래프에 의한 Channel Routing 알고리즘 ( Channel Routing algorithm using Channel Graph )
대한전자공학회 학술대회
1984 .01
-
Crosstalk Avoidance Method Considering Multi-Aggressors
대한전자공학회 ISOCC
2008 .11
-
열 잉크젯 프린트헤드의 채널간 간섭현상의 저감설계
대한기계학회 춘추학술대회
2006 .11
-
인접선 신호선의 누화(Crosstalk)에 대한 해석 및 회로 모델에 관한 연구
대한전기학회 학술대회 논문집
2009 .07
-
신호선 방향에 의한 3-layer channel routing
대한전자공학회 학술대회
1985 .06
-
A Double-Track Greedy Channel Routing Algorithm
ICVC : International Conference on VLSI and CAD
1997 .01
-
화소 전압 보상 방법에 대한 Crosstalk 특성 시뮬레이션
대한전기학회 학술대회 논문집
2000 .11
-
혼신 최소화를 위한 선분 재배치 방식의 채널 배선 방법 ( A Segment Rearrangement Approach to Channel Routing for Crosstalk Minimization )
전자공학회논문지-A
1994 .11
-
A/D 변환기 회로에서 터미네이션 임피던스의 crosstalk에 대한 영향 분석
전자공학회논문지-SC
2010 .03
-
디지털/RF 광 링크용 inter-channel crosstalk 감소 필터 제안
한국통신학회 기타 간행물
2004 .11
-
Analysis of Crosstalk in On-chip I/O Bus Line in Presence of Electromagnetic Interference
대한전자공학회 학술대회
2012 .06
-
재구성 가능한 분기 / 결합장치의 구성 및 Crosstalk의 영향 ( A Reconstruction Optical ADM and the Effect of Crosstalk on It )
한국통신학회 광전자공학 학술회의
1997 .01
-
열 잉크젯 프린트헤드의 채널간 간섭현상의 모델링
대한기계학회 논문집 B권
2007 .02
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2009-569-017770240