### Abstract

In this paper a new approach to the placement problem is introduced. The main idea is to take advantage of what one can do in linear placement in tackling the two-dimensional placement problem. The method consists of three distinct phases, namely: decomposition, linear placement, and iterative improvement. Each is clearly spelled out. Both constructive and iterative algorithms are developed. The complexity of computation is analyzed and the method has been tried with practical examples.

Original language | English |
---|---|

Title of host publication | IEEE Trans Circuits Syst |

Pages | 208-214 |

Number of pages | 7 |

Volume | CAS-25 |

Edition | 4 |

Publication status | Published - 1978 Apr |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*IEEE Trans Circuits Syst*(4 ed., Vol. CAS-25, pp. 208-214)

**APPROACH TO THE TWO-DIMENSIONAL PLACEMENT PROBLEM IN CIRCUIT LAYOUT.** / Goto, Satoshi; Kuh, Ernest S.

Research output: Chapter in Book/Report/Conference proceeding › Chapter

*IEEE Trans Circuits Syst.*4 edn, vol. CAS-25, pp. 208-214.

}

TY - CHAP

T1 - APPROACH TO THE TWO-DIMENSIONAL PLACEMENT PROBLEM IN CIRCUIT LAYOUT.

AU - Goto, Satoshi

AU - Kuh, Ernest S.

PY - 1978/4

Y1 - 1978/4

N2 - In this paper a new approach to the placement problem is introduced. The main idea is to take advantage of what one can do in linear placement in tackling the two-dimensional placement problem. The method consists of three distinct phases, namely: decomposition, linear placement, and iterative improvement. Each is clearly spelled out. Both constructive and iterative algorithms are developed. The complexity of computation is analyzed and the method has been tried with practical examples.

AB - In this paper a new approach to the placement problem is introduced. The main idea is to take advantage of what one can do in linear placement in tackling the two-dimensional placement problem. The method consists of three distinct phases, namely: decomposition, linear placement, and iterative improvement. Each is clearly spelled out. Both constructive and iterative algorithms are developed. The complexity of computation is analyzed and the method has been tried with practical examples.

UR - http://www.scopus.com/inward/record.url?scp=0017959499&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0017959499&partnerID=8YFLogxK

M3 - Chapter

VL - CAS-25

SP - 208

EP - 214

BT - IEEE Trans Circuits Syst

ER -