從邏輯階層匹配到實體階層映射之功能工程修改命令引擎

A Functional Engineering Change Engine: from Gate-Level Matching to Physical-Level Mapping

黃紹倫(Shao-Lun Huang)

指導教授 ： 黃鐘揚

國立臺灣大學/電機資訊學院/電機工程學研究所/博士(2012年)

https://doi.org/10.6342/NTU.2012.02768

摘要

無資料

關鍵字

工程修改命令 ； 布林比對 ； 等價性驗證 ； 技術映射

並列摘要

Functional engineering change, or engineering change order (ECO), is a popular technique for rectifying design errors after late design stages. This dissertation proposes a complete functional ECO flow from gate-level functional rectification to physical-level patch circuit realization.

First, we present a new approach to multi-error circuit rectification. In this dissertation, we propose a two-phase approach: 1) discovering the functional matches in two circuits followed by 2) determining the final patch circuits from the derived matches. Our approach discovers functional matches by coordinating SAT-sweeping, cut-matching and single-fix rectification algorithms. Then, we conduct two approaches, which are pattern-guided patch selection and redundant patch removal algorithms, to determine the final patch circuit. The experimental results on public benchmark and industrial circuits demonstrate that our approach outperforms state-of-the-art engineering change engines.

After generating the patch circuits, an ECO re-mapping flow is proposed to realize the patches. ECO re-mapping is a key step to realize patch functions on a layout database. It implements a given patch function with limited spare cells.
Our ECO re-mapping flow includes a resource-constraint-aware technology mapper and a fast incremental router for wire-length optimization. To effectively utilize the constrained resources, we adopt the pseudo-Boolean techniques to search for feasible solutions when the spare cells are sparse. The experimental results show that our ECO re-mapping engine can outperform the previous tool in both runtime and routing costs.

並列關鍵字

Engineering Change Order ； Boolean Matching ； Equivalence Checking ； Technology Mapping

參考文獻

[3] J. L. Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9):509–517, Sept. 1975.

[8] R. K. Brayton and A. Mishchenko. Abc: An academic industrial-strength verification tool. In CAV, pages 24–40, 2010.

[10] P.-Y. Chung and I. Hajj. Accord : Automatic catching and correction of logic design errors in combinational circuits. In Test Conference (ITC), 1992 International, pages 742–751, Sep. 1992.

[11] J. Cong and Y.-Y. Hwang. Boolean matching for LUT-based logic blocks with applications to architecture evaluation and technology mapping. Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on, 20(9):1077–1090, Sep. 2001.

[12] M. Fahim Ali, A. Veneris, A. Smith, S. Safarpour, R. Drechsler, and M. Abadir. Debugging sequential circuits using Boolean satisfiability. In Computer Aided Design, 2004. ICCAD-2004. IEEE/ACM International Conference on, pages 204–209, Nov. 2004.