Global router for analog function blocks based on the branch-and-bound algorithm

Tadanao Tsubota*, Masahiro Kawakita, Takahiro Watanabe

*この研究の対応する著者

研究成果: Article査読

抄録

A method based on the branch-and-bound algorithm capable of generating all possible solutions to find the best one is proposed for analog function blocks. Since the method has some drawbacks, constraints are classified into two groups; constraints on single side and constraints between two nets. Thus, the method has two parts; (a) only constraints on single nets are processed and (b) only constraints between two nets are processed. Due to the fact that many possible routes that violate layout constraints are rejected immediately in each part, the method can be efficient. In fact, experimental results indicate that the proposed method is capable of finding a good global route for hard layout constraints in practical processing time and also show that it is superior to the well-known simulated annealing method in quality of solutions and in processing time.

本文言語English
ページ(範囲)345-351
ページ数7
ジャーナルIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
E78-A
3
出版ステータスPublished - 1995 3 1
外部発表はい

ASJC Scopus subject areas

  • 信号処理
  • コンピュータ グラフィックスおよびコンピュータ支援設計
  • 電子工学および電気工学
  • 応用数学

フィンガープリント

「Global router for analog function blocks based on the branch-and-bound algorithm」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル