A recursive paradigm to solve Boolean relations

Proceedings - Design Automation Conference

Volumn , Issue , 2004, Pages 416-421

  Bañeres, David ^a   Cortadella, Jordi ^a   Kishinevsky, Mike ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b INTEL CORPORATION   (United States)

Author keywords

Boolean relations; Decomposition; Logic design

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; MULTIPLEXING; OPTIMIZATION; RECURSIVE FUNCTIONS;

BOOLEAN RELATIONS; COST FUNCTION; INCOMPLETELY SPECIFIED FUNCTIONS (ISF); MULTI-OUTPUT FUNCTION;

PROBLEM SOLVING;

EID: 4444283876     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/996566.996687     Document Type: Conference Paper

References (16)

1. L. Benini and G. D. Micheli. A survey of boolean matching techniques for library binding. ACM Transactions on Design Automation of Electronic Systems, 2(3):193-226, July 1997.
2. R. Brayton and F. Somenzi. An exact minimizer for boolean relations. In Proc. Int. Conf. Computer-Aided Design (ICCAD), pages 315-319, Nov. 1989.
3. F. Brown. Boolean Reasoning: The Logic of Boolear Equations. Kluwer Academic Publishers, 1990.
4. O. Coudert, C. Berthet, and J. Madre. Verification of synchronous sequential machines using boolean functional vectors. In Proc. IFIP International Workshop on Applied Formal Methods for Correct VLSI Design, pages 111-128, Nov. 1989.
5. O. Coudert and J. Madre. A unified framework for the formal verification of circuits. In Proc. Int. Conf. Computer-Aided Design (ICCAD), pages 126-129, Nov. 1990.
6. M. Damiani, J. Yang, and G. D. Micheli. Optimization of combinational logic circuits based on compatible gates. IEEE Transactions on Computer-Aided Design, 14(11): 1316-1327, Nov. 1995.
7. A. Ghosh, S. Devadas, and A. Newton. Heuristic minimization of boolean relations using testing techniques. In Proc. International Conf. Computer Design (ICCD), Sept. 1990.
8. P. Hofstee and F. Alam. Design of high end processors for the consumer space, Nov. 2003. Talk at Sunday Workshop ICCAD.
9. S. Jeong and F. Somenzi. A new algorithm for the binate covering problem and its application to the minimization of Boolean relations. In Proc. Int. Conf. Computer-Aided Design (ICCAD), pages 417-420, Nov. 1992.
10. B. un and F. Somenzi. Minimization of symbolic relations. In Proc. Int. Conf. Computer-Aided Design (ICCAD), pages 88-91, Nov. 1990.
11. G. D. Micheli. Synthesis and Optimization of Digital Circuits. McGraw Hill, 1994.
12. S. Minato. Fast generation of prime-irredundant covers from binary decision diagrams. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, E76-A(6);967-973, June 1993.
13. H. Partovi. Clocked storage elements. In A. Chandrakasan, W. Bowhill, and F. Fox, editors, Design of High-Performance Microprocessor Circuits, chapter 11, pages 207-234. IEEE Press, 2001.
14. E. Sentovich and D. Brand. Flexibility in logic. In S. Hassoun and T. Sasao, editors, Logic Synthesis and Verification, chapter 3, pages 65-88. Kluwer Academic Publishers, 2002.
15. M. Stone. The theory of representations for Boolean algebras. Trans. Amer. Math. Soc., 40:37-111, 1936.
16. V. Watanabe and R. Brayton. Heuristic minimization of multiple-valued relations. IEEE Transactions on Computer-Aided Design, 12(10): 1458-1472, Oct. 1993.