Conference Proceedings on 27th ACM/IEEE Design Automation Conference - DAC '90 1990
DOI: 10.1145/123186.123350
|View full text |Cite
|
Sign up to set email alerts
|

Data path allocation based on bipartite weighted matching

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
81
0

Year Published

1991
1991
2005
2005

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 137 publications
(81 citation statements)
references
References 17 publications
0
81
0
Order By: Relevance
“…It was based on the original bipartite-matching algorithm published in [13]. As shown in the Introduction, [13] Case B: S > 1 For each d_i that belongs to the set {d_1, d_2, …, d_S}, perform operations 1 to 3 as in the Case A.…”
Section: Resultsmentioning
confidence: 99%
See 4 more Smart Citations
“…It was based on the original bipartite-matching algorithm published in [13]. As shown in the Introduction, [13] Case B: S > 1 For each d_i that belongs to the set {d_1, d_2, …, d_S}, perform operations 1 to 3 as in the Case A.…”
Section: Resultsmentioning
confidence: 99%
“…It was based on the original bipartite-matching algorithm published in [13]. As shown in the Introduction, [13] Case B: S > 1 For each d_i that belongs to the set {d_1, d_2, …, d_S}, perform operations 1 to 3 as in the Case A. If all the swapping is successful, R will only drive port p and total MUX input number is reduced by 1. input reduction compared to other algorithms when the variables are bound into the minimum number of registers required.…”
Section: Resultsmentioning
confidence: 99%
See 3 more Smart Citations