Abstract
In high level synthesis, after the binding stage, multiplexor network is generated to connect the outputs of modules (functional-units/registers) to the inputs of modules. In this paper, we present an algorithm to generate a 2-to-1 multiplexor network with minimum number of multiplexors. Our algorithm is based on iteratively solving minimum vertex cover problems. Experimental results show that our approach obtains 8 to 25% improvement over a direct multiplexor-forest approach.
Original language | English |
---|---|
Title of host publication | 1996 International Conference on Computer Design, ICCD 1996: VLSI in Computers and Processors |
Publisher | IEEE |
Pages | 78-83 |
Number of pages | 6 |
ISBN (Print) | 0818675543 |
DOIs | |
Publication status | Published - Oct 1996 |
Event | 1996 International Conference on Computer Design, ICCD 1996: VLSI in Computers and Processors - Austin, United States Duration: 7 Oct 1996 → 9 Oct 1996 https://ieeexplore.ieee.org/xpl/conhome/4128/proceeding (Link to conference proceedings) |
Publication series
Name | Proceedings of 1996 International Conference on Computer Design, ICCD 1996: VLSI in Computers and Processors |
---|
Conference
Conference | 1996 International Conference on Computer Design, ICCD 1996: VLSI in Computers and Processors |
---|---|
Country/Territory | United States |
City | Austin |
Period | 7/10/96 → 9/10/96 |
Internet address |
|
Scopus Subject Areas
- Hardware and Architecture
- Electrical and Electronic Engineering