2006 IEEE International SOC Conference 2006
DOI: 10.1109/socc.2006.283875
|View full text |Cite
|
Sign up to set email alerts
|

Bit-Width Aware High-Level Synthesis for Digital Signal Processing Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
14
0

Year Published

2006
2006
2021
2021

Publication Types

Select...
3
2
1

Relationship

2
4

Authors

Journals

citations
Cited by 11 publications
(14 citation statements)
references
References 6 publications
0
14
0
Order By: Relevance
“…Later work, however, has shown there to be little value in functional unit sharing in FPGA technology [9], owing to the high costs of implementing multiplexers in FPGAs. Other works include [10], which applied range analysis for bitwidth minimization in DSP circuits. [12] optimized bitwidth such that a limited amount of error is permitted in the generated hardware.…”
Section: B Bitwidth-aware High-level Synthesismentioning
confidence: 99%
“…Later work, however, has shown there to be little value in functional unit sharing in FPGA technology [9], owing to the high costs of implementing multiplexers in FPGAs. Other works include [10], which applied range analysis for bitwidth minimization in DSP circuits. [12] optimized bitwidth such that a limited amount of error is permitted in the generated hardware.…”
Section: B Bitwidth-aware High-level Synthesismentioning
confidence: 99%
“…2. The second one was proposed in [31] and assumes word-length unaware scheduling and binding tasks.…”
Section: Methodsmentioning
confidence: 99%
“…The scheduling and binding stages use the clusters previously identified to generate architectures with variable word-lengths. Multiple word-length approaches proposed in [31] and [32] are dedicated to pipeline scheduling. First approach [31] performs scheduling and binding without considering data-width information trying to minimize interconnection resource cost.…”
Section: High-level Synthesis With Variable Datapathmentioning
confidence: 99%
See 1 more Smart Citation
“…The implementation bit-width Ω(n) considers the data coding, including sign extension named ψ(n) (if required) [13]. In order to optimally compute the size of each data manipulated by the application, the previously presented formal model is used to spread the dynamic range of the inputs to all the nodes of the graph.…”
Section: A Bit-width Analysismentioning
confidence: 99%