.png){kind=icon}
返回
A bit-width optimization methodology for polynomial-based function evaluation
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2007.1013.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present an automated bit-width optimization methodology for polynomial-based hardware function evaluation. Due to the analytical nature of the approach, overflow protection and precision accurate to one unit in the last place (ulp) can be guaranteed. A range analysis technique based on computing the root of the derivative of a signal is utilized to determine the minimal number of integer bits. Fractional bit requirements are established using an analytical error expression derived from the functions that occur along the data path. Global fractional bit optimization across multiple computation stages is performed using simulated annealing and circuit area estimation functions.
Keyword:
computer arithmetic
elementary function approximation
field programmable gate arrays
finite wordlength effects
minimax approximation and algorithms
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
暂无机构信息
引用论文
.png){kind=icon}
Case Report: Whole exome sequencing reveals a novel frameshift deletion mutation p.G2254fs in COL7A1 associated with autosomal recessive dystrophic epidermolysis bullosa病例报告：全外显子组测序揭示COL7A1基因中与常染色体隐性营养不良性大疱性表皮松解症相关的p.G2254fs新型移码缺失突变。
OAAI
OAAI分享收藏 没有更多内容
没有更多内容