论文部分内容阅读
面对 VLSI生产工艺的不断更新 ,利用已有的版图 ,迅速获得适应新工艺的新版图 ,已成为市场上实际的需求 .提出的基于约束图的压缩算法 ,是面向全芯片压缩的二维压缩算法 .它采用层次式压缩策略 ,“落叶池”等新的数据结构 ,在压缩过程中放松模块间的连线 ,具有自动加入拐弯的功能 .从两个例子的压缩结果 ,可以看出这是一个实用的新压缩算法
In the face of the continuous updating of the VLSI production process, it is an actual demand in the market to utilize the existing layout to quickly obtain a new layout adapted to the new process.The proposed compression algorithm based on the constraint graph is a two-dimensional compression for full chip compression Algorithm.It adopts the new data structure of the hierarchical compression strategy, “leaf pool”, relax the connection between modules in the compression process, with the function of automatically adding turns.From the two examples of the compression results, we can see that this is A practical new compression algorithm