Efficient SAT-based Combinational ATPG using Multi-level Don't-Cares. Nikhil Saluja Department of ECE, University of Colorado Boulder, CO Sunil P Khatri Department of ECE, Texas A&M University College Station, TX. Outline. Motivation and Introduction Boolean SATisfiability (SAT)
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Efficient SAT-based Combinational ATPG using Multi-level Don't-Cares
Department of ECE, University of ColoradoBoulder, CO
Sunil P KhatriDepartment of ECE, Texas A&M UniversityCollege Station, TX
where f is some primary output of the multi-level Boolean circuit.
(!z + x).(!z + y).(z + !x + !y)
Pj-active => !(CODCp)