2004 International Conference on Communications, Circuits and Systems (IEEE Cat. No.04EX914)
DOI: 10.1109/icccas.2004.1346409
|View full text |Cite
|
Sign up to set email alerts
|

Optimal MST-based graph algorithm on FPGA segmentation design

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…These segments were then packed into channels in a tree-like fashion. Later work [243] extended this effort by using a maximum spanning tree algorithm to perform the graph matching. The need for a mix of segment lengths in island-style FPGA devices is motivated by the characteristics of benchmark designs targeted to the devices.…”
Section: Detailed Island-style Routing Architecturementioning
confidence: 99%
“…These segments were then packed into channels in a tree-like fashion. Later work [243] extended this effort by using a maximum spanning tree algorithm to perform the graph matching. The need for a mix of segment lengths in island-style FPGA devices is motivated by the characteristics of benchmark designs targeted to the devices.…”
Section: Detailed Island-style Routing Architecturementioning
confidence: 99%