首页> 外文会议>International Conference on VLSI Design;International Conference on Embedded Systems >A Practical Methodology to Compress Technology Libraries Using Recursive Polynomial Representation
【24h】

A Practical Methodology to Compress Technology Libraries Using Recursive Polynomial Representation

机译:递归多项式表示法压缩技术库的实用方法

获取原文

摘要

With the advancement in technology, the libraries used for storing timing, power and other related information of cells have become voluminous. As a result, run-time of loading libraries, that is often governed by I/O or network bottlenecks, has become unacceptably high. Traditionally, this problem is tackled by compressing technology libraries using gzip or other lossless compression technique. In this paper, we propose a practical methodology to compress technology library with a high compression ratio and tolerable errors. The compressed representation is based on representing the discrete functions of the library as suitable polynomials defined recursively with respect to all the independent variables of that function. Our implementation of the proposed methodology shows that the compression ratio of 8-10× can be achieved for realistic error measures.
机译:随着技术的进步,用于存储小区的定时,功率和其他相关信息的库变得越来越庞大。结果,通常由I / O或网络瓶颈控制的加载库的运行时变得越来越高。传统上,此问题是通过使用gzip或其他无损压缩技术压缩技术库来解决的。在本文中,我们提出了一种实用的方法来压缩具有高压缩比和可容忍错误的技术库。压缩表示基于将库的离散函数表示为针对该函数的所有自变量递归定义的合适多项式。我们对提出的方法的实施表明,对于实际的误差度量,可以实现8-10倍的压缩率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号