### Abstract

An LSI compaction method which minimizes total wire length as well as layout area is discussed. First, the compaction problem is formulated as a linear programming problem and reduced to a problem involving finding a tree which has some properties in a constraint graph. Then, a method which finds the tree by a sequence of elementary tree transformations in the graph is proposed. It corresponds to the primal simplex method for LP. However, the proposed method is much more efficient, because it does not deal with any matrices in solving the problem.

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

Title of host publication | Proceedings - IEEE International Symposium on Circuits and Systems |

Publisher | IEEE |

Pages | 1455-1458 |

Number of pages | 4 |

Publication status | Published - 1985 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Electrical and Electronic Engineering
- Electronic, Optical and Magnetic Materials

### Cite this

*Proceedings - IEEE International Symposium on Circuits and Systems*(pp. 1455-1458). IEEE.

**GRAPH THEORETICAL COMPACTION ALGORITHM.** / Yoshimura, Takeshi.

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

*Proceedings - IEEE International Symposium on Circuits and Systems.*IEEE, pp. 1455-1458.

}

TY - GEN

T1 - GRAPH THEORETICAL COMPACTION ALGORITHM.

AU - Yoshimura, Takeshi

PY - 1985

Y1 - 1985

N2 - An LSI compaction method which minimizes total wire length as well as layout area is discussed. First, the compaction problem is formulated as a linear programming problem and reduced to a problem involving finding a tree which has some properties in a constraint graph. Then, a method which finds the tree by a sequence of elementary tree transformations in the graph is proposed. It corresponds to the primal simplex method for LP. However, the proposed method is much more efficient, because it does not deal with any matrices in solving the problem.

AB - An LSI compaction method which minimizes total wire length as well as layout area is discussed. First, the compaction problem is formulated as a linear programming problem and reduced to a problem involving finding a tree which has some properties in a constraint graph. Then, a method which finds the tree by a sequence of elementary tree transformations in the graph is proposed. It corresponds to the primal simplex method for LP. However, the proposed method is much more efficient, because it does not deal with any matrices in solving the problem.

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

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

M3 - Conference contribution

AN - SCOPUS:0022291077

SP - 1455

EP - 1458

BT - Proceedings - IEEE International Symposium on Circuits and Systems

PB - IEEE

ER -