Port assignment for multiplexer and interconnection optimization

Cong Hao, Hao Ran Zhang, Song Chen, Takeshi Yoshimura, Min You Wu

研究成果

2 被引用数 (Scopus)

抄録

Data path connection elements usually consume a significant amount of both power and area on a VLSI chip. In this paper, we focus on the port assignment problem for multiplexer (MUX) and interconnection optimization in High-Level Synthesis. Given a binding solution of operations and variables, the port assignment problem connects the registers to the operator ports through MUXes, to minimize the interconnections between MUXes and operator ports, as well as the MUX power and area. We formulate the port assignment problem for binary commutative operators as a vertex partition problem on a graph, and propose a local search based heuristic algorithm that iteratively performs the elementary spanning tree transformation on the graph to solve it. We also propose a method to estimate the result of the tree transformation and filter a considerable amount of bad solutions in advance which greatly accelerate the algorithm. The experimental results show that our proposed algorithm is able to achieve 48% execution time reduction and 8.3% power reduction compared with the previous work, and the power reduction can be obtained for 37% test benches.

本文言語English
ホスト出版物のタイトルProceedings of the 5th Asia Symposium on Quality Electronic Design, ASQED 2013
出版社IEEE Computer Society
ページ136-143
ページ数8
ISBN(印刷版)9781479913145
DOI
出版ステータスPublished - 2013
イベント5th Asia Symposium on Quality Electronic Design, ASQED 2013 - Penang
継続期間: 2013 8 262013 8 28

Other

Other5th Asia Symposium on Quality Electronic Design, ASQED 2013
CityPenang
Period13/8/2613/8/28

ASJC Scopus subject areas

  • 電子工学および電気工学
  • 安全性、リスク、信頼性、品質管理

フィンガープリント

「Port assignment for multiplexer and interconnection optimization」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル