...
首页> 外文期刊>Journal of circuits, systems and computers >DESIGNING OPTIMIZED IMPRECISE FIXED-POINT ARITHMETIC CIRCUITS SPECIFIED BY POLYNOMIALS WITH VARIOUS CONSTRAINTS
【24h】

DESIGNING OPTIMIZED IMPRECISE FIXED-POINT ARITHMETIC CIRCUITS SPECIFIED BY POLYNOMIALS WITH VARIOUS CONSTRAINTS

机译:设计具有多种约束的多项式所指定的优化的精确不动点算术电路

获取原文
获取原文并翻译 | 示例
           

摘要

Arithmetic circuits in general do not exactly match specifications, leading to different implementations within allowed imprecision. Starting from real-valued representation, such as Taylor series, we propose a new technique based on arithmetic transform (AT) to analyze simultaneous selection of multiple word lengths and even the function approximation schemes, and then derive a verification algorithm to check whether an implementation fits the error bound. To find optimized implementations which both satisfy a given error bound and constraints included interface input, delay and area. An optimization algorithm is derived to explore multiple precision parameters and get the optimized implementations by various constraints.
机译:通常,算术电路与规格不完全匹配,从而在允许的不精确度内导致不同的实现。从泰勒级数等实值表示开始,我们提出了一种基于算术变换(AT)的新技术来分析多个单词长度的同时选择甚至函数逼近方案,然后推导验证算法以检查是否实现符合错误界限。为了找到既满足给定错误界限又满足约束的优化实现,包括接口输入,延迟和面积。推导了一种优化算法,以探索多个精度参数并在各种约束条件下获得优化的实现。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号