메뉴 건너뛰기
소속 기관 / 학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
고객센터 ENG
주제분류

피인용 0

검색

    초록·키워드

    In this paper, we present a new approach for placement of standard cells. To minimize the channel area, internets between cell rows (subsets) should be minimized. To solve the problem, we propose a simultaneous multiple-way network partitioning algorithm that partitions the cells in a VLSI network into linearly ordered multiple subsets. The algorithm is applied to the horizontal partitioning of cells that is to assign cells to cell rows. Experiments were performed for the placement of standard cells, in order to evaluate the performance of the new approach and to compare it with that of the traditional slicing min-cut placement.

    최근 본 자료 전체보기

      UCI(KEPA) : I410-ECN-0101-2009-569-013206749