首页> 外文会议>International Conference on Networked Computing and Advanced Information Management >A quick coding method based on dynamic table look-up for arbitrary bit length polynomial division in embedded system
【24h】

A quick coding method based on dynamic table look-up for arbitrary bit length polynomial division in embedded system

机译:基于动态表查找的快速编码方法在嵌入式系统中任意位长度多项式划分

获取原文

摘要

Aiming at the limitation and low effect in Model 2 Polynomial division's software realization of embedded system, this paper gives a complete solution to generate codes in condition of arbitrary bit length generator polynomial and source codes with arbitrary width. This solution contains algorithms for dynamic table set-up as well as a general modify logic to solve the any length problem. Test and Evaluation are given. The result shows that compared to the traditional hardware simulation method, we have got a huge progress in time consuming with just a little more space consumption.
机译:针对模型2多项式划分软件实现嵌入式系统的限制和低效果,本文提供了一种完整的解决方案,可以在任意宽度的任意比特长度发生器多项式和源代码的条件下生成代码。 此解决方案包含动态表设置的算法以及若干长度问题的常规修改逻辑。 给出了测试和评估。 结果表明,与传统的硬件仿真方法相比,我们在耗时的耗时进展情况下只有一点空间消耗。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号