1997
DOI: 10.1007/978-1-4419-8720-4
|View full text |Cite
|
Sign up to set email alerts
|

Accelerator Data-Path Synthesis for High-Throughput Signal Processing Applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0
8

Year Published

1998
1998
2013
2013

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 28 publications
(30 citation statements)
references
References 0 publications
0
22
0
8
Order By: Relevance
“…Whether a truly optimal algorithmic flow exists is still an open-research question. We believe that our solution can still be improved by the following extensions: 1) combining our approach with pattern-matching techniques [16], [27]- [29] in order to improve the utilization of the custom instructions we generate and 2) integrating our approach with datapathmerging techniques [32]- [34] in order to exploit partial resource sharing across custom instructions for area-efficient synthesis.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Whether a truly optimal algorithmic flow exists is still an open-research question. We believe that our solution can still be improved by the following extensions: 1) combining our approach with pattern-matching techniques [16], [27]- [29] in order to improve the utilization of the custom instructions we generate and 2) integrating our approach with datapathmerging techniques [32]- [34] in order to exploit partial resource sharing across custom instructions for area-efficient synthesis.…”
Section: Discussionmentioning
confidence: 99%
“…Dimond et al [31] introduced a customizable soft processor with multithreading support. Techniques that can exploit structural similarities across custom instructions for area-efficient synthesis are described in [32]- [34].…”
Section: Background and Related Workmentioning
confidence: 99%
“…Constraint (7) ensures that each incoming edge to a commutative operation connects to one input port; constraint (8) ensures that each input port has one incoming edge connecting to it. To simplify notation, let…”
Section: Optimal Integer Linear Program (Ilp) Formulationmentioning
confidence: 99%
“…Geurts [7] presented a DPM heuristic based on maximum bipartite matching; van der Werf et al [16] built a similar heuristic, but used simulated annealing instead. These approaches estimate an upper bound on the cost of muxes, but do not model the cost exactly.…”
Section: Related Workmentioning
confidence: 99%
“…the granularity at which code is considered: fine-grained and coarse-grained. The first one works at the operation level and implements small clusters of operations in HW [7,10,12,13,14,43,59,44]; the second one operates at the loop or procedure level and identifies critical loops or procedures in the application, and displaces them from SW to HW as a whole [16,17,18,19,20,21]. The main differences are in terms of speedups and flexibility: although a coarse-grained approach could produce a large speedup, its flexibility is limited, given that this approach is often performed on a per application basis and it is difficult that other applications have the same loop or procedure as critical part.…”
Section: Introduction To the Problemmentioning
confidence: 99%