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 (US) |
|---|---|
| Pages | 78-83 |
| Number of pages | 6 |
| State | Published - 1996 |
| Externally published | Yes |
| Event | Proceedings of the 1996 International Conference on Computer Design, ICCD'96 - Austin, TX, USA Duration: Oct 7 1996 → Oct 9 1996 |
Other
| Other | Proceedings of the 1996 International Conference on Computer Design, ICCD'96 |
|---|---|
| City | Austin, TX, USA |
| Period | 10/7/96 → 10/9/96 |
ASJC Scopus subject areas
- Hardware and Architecture
- Electrical and Electronic Engineering