Fast detection of node mergers using logic implications

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD

Volumn , Issue , 2009, Pages 785-788

  Chen, Yung Chih ^a   Wang, Chun Yao ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Logic implication; Node merging; Observability don't care

Indexed keywords

COMPUTER AIDED DESIGN; MERGERS AND ACQUISITIONS; MERGING; OBSERVABILITY;

AREA OPTIMIZATION; COMPETITIVE CAPABILITIES; DON'T-CARES; FAST DETECTIONS; IDENTIFICATION ALGORITHMS; LOGIC IMPLICATION; MERGING ALGORITHMS; TARGET NODES;

COMPUTER CIRCUITS;

EID: 76349096003     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1687399.1687545     Document Type: Conference Paper

References (17)

1. M. S. Abadir, J. Ferguson, and T. E. Kirkland, "Logic Design Verification via Test Generation," IEEE Trans. Computer-Aided Design, vol. 7, pp. 138-148, Jan. 1988.
2. Berkeley Logic Synthesis and Verification Group, "ABC: A System for Sequential Synthesis and Verification," http://www.eecs.berkeley.edu/ alanmi/abc/.
3. P. Bjesse and A. Boralv, "DAG-Aware Circuit Compression for Formal Verification", in Proc. Int. Conf. on Computer-Aided Design, 2004, pp. 42-49.
4. M. Case, V. Kravets, A. Mishchenko, and R. Brayton, "Merging Nodes Under Sequential Observability," in Proc. Design Automation Conf., 2008, pp. 540-545.
5. C. W. Jim Chang, M. F. Hsiao, and M. M. Sadowska, "A New Reasoning Scheme for Efficient Redundancy Addition and Removal," IEEE Trans. Computer-Aided Design, vol. 22, pp. 945-952, July 2003.
6. T. Kirkland and M. R. Mercer, "A Topological Search Algorithm for ATPG," in Proc. Design Automation Conf., 1987, pp. 502-508.
7. A. Kuehlmann, "Dynamic Transition Relation Simplification for Bounded Propery Checking," in Proc. Int. Conf. on Computer-Aided Design, 2004, pp. 50-57.
8. W. Kunz and D. K. Pradhan, "Recursive Learning: An Attractive Alternative to the Decision Tree for Test Generation for Digital Circuits," in Proc. Int. Test Conf., 1992, pp. 816-825.
9. A. Mishchenko, S. Chatterjee, and R. Brayton, "DAG-Aware AIG Rewriting: A Fresh Look at Combinational Logic Synthesis," in Proc. Design Automation Conf., 2006, pp. 532-536.
10. A. Mishchenko, S. Chatterjee, R. Brayton, and N. Een, "Improvements to Combinational Equivalence Checking, " in Proc. Int. Conf. on Computer-Aided Design, 2006, pp. 836-843.
11. S. Plaza, K. H. Chang, I. Markov, and V. Bertacco, "Node Mergers in the Presence of Don't Cares," in Proc. Asia South Pacific Design Automation Conf., 2007, pp. 414-419.
12. I. Pomeranz and S. M. Reddy, "On Correction of Multiple Design Errors," IEEE Trans. Computer-Aided Design, vol. 14, pp. 255-264, Feb. 1995.
13. M. H. Schulz amd E. Auth, "Advanced Automatic Test Pattern Generation and Redundancy Identification Techniques," in Proc. Int. Fault-Tolerant Computing Symp., 1988, pp. 30-35.
14. A. Veneris and I. N. Hajj, "Design Error Diagnosis and Correction via Test Vector Simulation," IEEE Trans. Computer-Aided Design, vol. 18, pp. 1803-1816, Dec. 1999.
15. A. Veneris, J. B. Liu, M. Amiri, and M. S. Abadir, "Incremental Diagnosis and Correction of Multiple Faults and Errors," in Proc. Design, Automation and Test in Europe Conf., 2002, pp. 716-721.
16. Q. Zhu, N. Kitchen, A. Kuehlmann, and A. Sangiovanni-Vincentelli, "SAT Sweeping with Local Observability Don't Cares," in Proc. Design Automation Conf., 2006, pp. 229-234.
17. http://iwls.org/iwls2005/benchmarks.html.