Floating Steiner trees

Author

Sarrafzadeh, Majid ; Lin, Wei-Liang ; Wong, C.K.

Author_Institution

Dept. of Electr. & Comput. Eng., Northwestern Univ., Evanston, IL, USA

Volume

47

Issue

2

fYear

1998

fDate

2/1/1998 12:00:00 AM

Firstpage

197

Lastpage

211

Abstract

We study the reproducing placement problem, which finds application in layout-driven logic synthesis. In each phase, a module (or gate) is decomposed into two (or more) simpler modules. The goal is to find a “good” placement in each phase. The problem, being iterative in nature, requires an iterative algorithm. In solving the RPP, we introduce the notion of minimum floating Steiner trees (MFST). We employ an MFST algorithm as a central step in solving the RPP. A Hanan-like theorem is established for the MFST problem, and two approximation algorithms are proposed. Experiments on commonly employed benchmarks verify the effectiveness of the proposed technique

Keywords

circuit layout CAD; logic CAD; tree data structures; Hanan-like theorem; Steiner trees; gate level design; iterative algorithm; logic synthesis; minimum floating Steiner trees; placement problem; reproducing placement problem; Algorithm design and analysis; Application software; Approximation algorithms; Circuits; Design optimization; Iterative algorithms; Iterative methods; Logic; Signal generators; Solids;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.663766

Filename

663766