A robust algorithm for approximate Compatible Observability Don't Care (CODC) computation

Proceedings - Design Automation Conference

Volumn , Issue , 2004, Pages 422-427

  Saluja, Nikhil ^a   Khatri, Sunil P ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

Compatible Observability Don't Cares (CODC); Logic Synthesis; Multi level Logic Optimization

Indexed keywords

COMPATIBLE OBSERVABILITY DON'T CARES (CODC); LOGIC SYNTHESIS; MULTI-LEVEL LOGIC OPTIMIZATION;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; FUNCTIONS; LOGIC DEVICES; OPTIMIZATION; ROBUSTNESS (CONTROL SYSTEMS);

LOGIC PROGRAMMING;

EID: 4444382696     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DAC.2004.240384     Document Type: Conference Paper

References (17)

1. R. Brayton. Compatible output don't cares revisited. In IEEE/ACM International Conference on Computer Aided Design, pages 618-623, Nov 2001.
2. R. Brayton, R. Rudell, A. Sangiovanni-Vincentelli, and A. Wang. Mis: A multiple-level logic optimization system. IEEE Trans. on CAD/ICAS, CAD-6(6):1062-1082, Nov 1987.
3. R. K. Brayton, G. D. Hachtel, C. T. McMullen, and A. L. Sangiovanni-Vincentelli. Logic Minimization Algorithms for VLSI Synthesis. Kluwer Academic Publishers, 1984.
4. R. E. Bryant. Graph based algorithms for Boolean function representation. IEEE Transactions on Computers, C-35:677-690, August 1986.
5. M. Damiani and G. D. Micheli. Observability don't care sets and boolean relations. In IEEE/ACM International Conference on Computer Aided Design, Nov 1990.
6. S. Dey, F. Brglez, and G. Kedem. Circuit partitioning and resynthesis. In Proceedings of the IEEE Custom Integrated Circuits Conference, pages 29.4/1 -29.4/5, May 1990.
7. S. Hassoun, editor. Logic Synthesis and Verification. Kluwer Academic Publishers, Nov 2001.
8. J. C. Limqueco and S. Muroga. SYLON-REDUCE: an MOS network optimization algorithms using permissible functions. In Proceedings, IEEE International Conference on Computer Design, pages 282-285, Sept 1990.
9. J. C. Limqueco and S. Muroga. Optimizing large networks by repeated local optimization using windowing scheme. In IEEE International Symposium on Circuits and Systems, ISCAS, volume 4, pages 1993-1996, May 1992.
10. S. Malik, A. R. Wang, R. K. Brayton, and A. Sangiovanni-Vincentelli. Logic verification using binary decision diagrams in a logic synthesis environment. In IEEE International Conference on Computer-Aided Design, pages 6-9, November 1998.
11. P. C. McGeer and R. K. Brayton. The observability don't care set and its approximations. In IEEE International Conference on Computer Design, Sept. 1990.
12. A. Mishchenko and R. Brayton. Simplification of non-deterministic multi-valued networks. In IEEE/ACM International Conference on Computer Aided Design, pages 557-562, Nov 2002.
13. H. Savoj and R. Brayton. The use of observability and external don't cares for the simplification of multi-level networks. In 27th ACM/IEEE Design Automation Conference, Orlando, June 1990.
14. H. Savoj, R. Brayton, and H. Touati. Extracting local don't cares for network optimization. In IEEE/ACM International Conference on Computer Aided Design, pages 514-517, Nov 1991.
15. E. M. Sentovich, K. J. Singh, L. Lavagno, C. Moon, R. Murgai, A. Saldanha, H. Savoj, P. R. Stephan, R. K. Brayton, and A. L. Sangiovanni-Vincentelli. SIS: A System for Sequential Circuit Synthesis. Technical Report UCB/ERL M92/41, Electronics Research Lab, Univ. of California, Berkeley, CA 94720, May 1992.
16. T. Stanion and C. Sechen. Maximum projections of don't care conditions in a boolean network. In IEEE/ACM International Conference on Computer Aided Design, pages 674-679, Nov 1993.
17. H. Touati, H. Savoj, B. Lin, R. Brayton, and A. Sangiovanni-Vincentelli. Implicit state enumeration of finite state machines using BDDs. In IEEE International Conference on Computer-Aided Design, November 1990.