conference paper
On the Complexity of the Port Assignment Problem for Binary Commutative Operators in High-Level Synthesis
2009
2009 International Symposium On Vlsi Design, Automation And Test (Vlsi-Dat), Proceedings Of Technical Program
The present formulation of the port assignment problem for binary commutative operators tries to minimize the number of wires connected to both the left and right inputs of the operator; intuitively, this minimizes the total number of inputs connected to both inputs, which reduces the size of the multiplexers that are instantiated. This paper revises the formulation to attempt to balance the difference between the number of wires connected to both inputs; minimizing the size of the larger multiplexer place oil the input minimizes the delay through the operator.
Type
conference paper
Web of Science ID
WOS:000271941200085
Author(s)
Brisk, Philip
Date Issued
2009
Published in
2009 International Symposium On Vlsi Design, Automation And Test (Vlsi-Dat), Proceedings Of Technical Program
Start page
339
End page
342
Subjects
Editorial or Peer reviewed
REVIEWED
Written at
EPFL
EPFL units
| Event name | Event place | Event date |
Hsinchu, TAIWAN | Apr 27-30, 2009 | |
Available on Infoscience
November 30, 2010
Use this identifier to reference this record