skip to main content
article

Optimizing designs containing black boxes

Published:01 October 2001Publication History
Skip Abstract Section

Abstract

We are concerned with optimizing gate-level netlists containing “black boxes,” that is, components whose functionality is not available to the optimization tool. We establish a notion of equivalence for gate-level netlists containing black boxes, and prove that it is sound and complete. We show that conventional approaches to optimizing such netlists fail to fully exploit the don't care flexibility available for synthesis. Based on our new notion of equivalence, we introduce a procedure that computes the complete don't care set. Experiments indicate that our procedure can achieve more minimization than conventional synthesis.

References

  1. ALLIANCE, V. 1996. Virtual Socket Interface Proposal 1.0. http://www.vsi.org/.Google ScholarGoogle Scholar
  2. AZIZ, A. 2000. http://www.ece.utexas.edu/~adnan/publications/www-core-seq.ps.Google ScholarGoogle Scholar
  3. BARTLETT, K. A., BRAYTON, R. K., HACHTEL,G.D.,JACOBY, R. M., MORRISON, C. R., RUDELL,R.L., SANGIOVANNI-VINCENTELLI,A.L.,AND WANG, A. R. 1988. Multilevel logic minimization using implicit don't cares. IEEE Trans. Comput.-Aided Des. Integ. Circ. Syst. 7, 6 (June), 723-740.Google ScholarGoogle Scholar
  4. BRYANT, R. 1986. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C-35, (Aug.), pp. 677-691. Google ScholarGoogle Scholar
  5. LIU, T., SAJID, K., AZIZ, A., AND SINGHAL, V. 1997. Optimizing designs containing black boxes. In Proceedings of the Design Automation Conference (June). IEEE Computer Society Press, Los Alamitos, Calif., pp. 113-116. Google ScholarGoogle Scholar
  6. SAVOJ, H., AND BRAYTON, R. K. 1991. Observability relations and observability don't cares. In Proceedings of the International Conference on Computer-Aided Design (Nov.). IEEE Computer Society Press, Los Alamitos, Calif., pp. 518-521.Google ScholarGoogle Scholar
  7. SAVOJ, H., BRAYTON,R.K.,AND TOUATI, H. 1991. Extracting local don't cares for network optimization. In Proceedings of the International Conference on Computer-Aided Design (Nov.). IEEE Computer Society Press, Los Alamitos, Calif., pp. 514-517.Google ScholarGoogle Scholar
  8. SENTOVICH, E. M., SINGH,K.J.,MOON, C., SAVOJ, H., BRAYTON,R.K.,AND SANGIOVANNI-VINCENTELLI, A. L. 1992. Sequential circuit design using synthesis and optimization. In Proceedings of the International Conference on Computer Design (Oct.). IEEE Computer Society Press, Los Alamitos, Calif., pp. 328-333. Google ScholarGoogle Scholar
  9. STOK, L. 1996. BooleDozer: Logic synthesis for ASICs. IBM J. Res. Devep. (July), 407-430. Google ScholarGoogle Scholar
  10. WATANABE,Y.,AND BRAYTON, R. K. 1993. The maximum set of permissible behaviors for FSM networks. In Proceedings of the International Conference on Computer-Aided Design. 316-320. Google ScholarGoogle Scholar
  11. WATANABE, Y., GUERRA, L., AND BRAYTON, R. K. 1993. Logic optimization with multi-output gates. In Proceedings of the International Conference on Computer Design (Boston, Mass., Oct.). IEEE Computer Society Press, Los Alamitos, Calif., pp. 416-420.Google ScholarGoogle Scholar

Index Terms

  1. Optimizing designs containing black boxes

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader