Interconnection allocation between functional units and registers in High-Level Synthesis

Cong Hao, Nan Wang, Song Chen, Takeshi Yoshimura, Min You Wu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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 interconnection allocation problem conducted after operation scheduling and binding in High-Level Synthesis, aimed at minimum interconnection complexity, power consumption and area cost. During interconnection allocation, the port assignment step, that connects the registers to the operator ports through multiplexers (MUXes), is extraordinarily crucial to the final result in terms of the interconnection complexity. We formulate the port assignment problem for binary commutative operators as a bipartite graph partition problem followed by a vertex cover, and adopt the Fiduccia and Mattheyses (FM) Algorithm to iteratively improve the partition by moving or swapping the graph vertices. The experimental results show that our proposed algorithm is able to achieve 35.9% optimality increasing and 33.1% execution time reduction compared with the previous works.

Original languageEnglish
Title of host publicationProceedings of International Conference on ASIC
PublisherIEEE Computer Society
ISBN (Print)9781467364157
DOIs
Publication statusPublished - 2013
Event2013 IEEE 10th International Conference on ASIC, ASICON 2013 - Shenzhen
Duration: 2013 Oct 282013 Oct 31

Other

Other2013 IEEE 10th International Conference on ASIC, ASICON 2013
CityShenzhen
Period13/10/2813/10/31

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Interconnection allocation between functional units and registers in High-Level Synthesis'. Together they form a unique fingerprint.

Cite this