检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王冠军[1]
机构地区:[1]中国矿业大学计算机学院,江苏徐州221116
出 处:《北京邮电大学学报》2010年第1期97-101,共5页Journal of Beijing University of Posts and Telecommunications
基 金:国家自然科学基金项目(69973014);山东省高等学校科技计划项目(J09LG34);中国矿业大学青年科研基金项目(2009A051)
摘 要:针对电子设计自动化(EDA)高层次综合中功耗和面积的日益严峻挑战,进行非精确算术电路的自动综合和优化,并且基于有限域特性进行字长优化.非精确多项式电路优化基于算术变换方法,首先考虑电路的定点和浮点表示情况,给出电路在不同精度界限下的实现,进行误差和功耗、面积的权衡;然后应用分枝定界方法求解最小代价电路,决定满足误差要求的最小字长,同时利用自动综合优化方法得到最终的优化结构.实验结果显示,舍入误差只需增加0.5%~1%,即可分别得到35%的功耗降低和20%的面积缩减.Specifically for challenge to the power dissipation and area during high-level synthesis in electronic design automation(EDA) , An imprecise arithmetic automation synthesis and optimization approach is proposed, the word-length optimization are based on finite field characteristic. The imprecise polynomial circuit optimization is based on arithmetic transformation method, which considering the fixed point and floating point representation condition first, then a realization of circuits under different accuracy boundary is given, the power dissipation and area error is traded off, which applying branch and bound method to find the solution with minimal cost, to determine the minimal word length which satisfies the error bound, making use of the automation synthesis approach to get ultimate optimize structure at the same time. The experiment results demonstrate power dissipation and area got a 35% and 20% reduction respectively by increasing 0.5% - 1% round off error.
分 类 号:TP391.7[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145