Proceedings of the 34th Annual Conference on Design Automation Conference - DAC '97 1997
DOI: 10.1145/266021.266105
|View full text |Cite
|
Sign up to set email alerts
|

System level fixed-point design based on an interpolative approach

Abstract: The design process for xed-point implementations either in software or in hardware requires a bit-true specication of the algorithm in order to analyze quantization eects on an algorithmical level, abstracting from implementational details. On the other hand, system design starts from a oating-point description, so that a transformation of a oating-point description into a xed-point description becomes necessary. Within this paper we present a tool that allows an automated, interactive transformation from oati… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
47
0
2

Year Published

1999
1999
2021
2021

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 62 publications
(49 citation statements)
references
References 5 publications
0
47
0
2
Order By: Relevance
“…Moreover, global annotations can be defined in order to specify some rules for the entire system (maximal data wordlength, casting rules). The second step called interpolation [16][6] corresponds to the determination for each data of the word-length of the integer and fractional parts. The fixedpoint data formats are obtained from a set of propagation rules and the analysis of the program control flow.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Moreover, global annotations can be defined in order to specify some rules for the entire system (maximal data wordlength, casting rules). The second step called interpolation [16][6] corresponds to the determination for each data of the word-length of the integer and fractional parts. The fixedpoint data formats are obtained from a set of propagation rules and the analysis of the program control flow.…”
Section: Related Workmentioning
confidence: 99%
“…Thus, this technique can not be used if there is cycles in the graph like in the case of recursive structures. The determination of the data dynamic range in the tool FRIDGE [6] is based on this technique [16].…”
Section: Data Dynamic Range Determinationmentioning
confidence: 99%
“…According to Willems et al [14], the implementation of algorithms for specific target machines requires a bit-true specification at source level. This specification can then be transferred into a HDL or a programming language.…”
Section: Related Workmentioning
confidence: 99%
“…The work in this area can be classified in many different ways, and one such classification is static analysis versus dynamic analysis. Dynamic analysis [2]- [7] relies on the use of stimuli input signals. Though this approach provides bit widths closer to the optimal set for those particular stimuli when compared to static-analysis techniques, it can be problematic since a large set of stimuli signals is required to analyze a design with sufficient confidence, possibly leading to prohibitively long simulation times and without guarantees for alternative input stimuli encountered in practice.…”
mentioning
confidence: 99%