Sympathy: Fast exact minimization of fixed polarity reed-muller expressions for symmetric functions

Proceedings of the 1995 European Conference on Design and Test, EDTC 1995

Volumn , Issue , 1995, Pages 91-97

  Drechsler, Rolf ^a   Becker, Bernd ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION DIAGRAM; EXACT MINIMIZATION; FIXED-POLARITY REED-MULLER EXPRESSIONS; POLYNOMIAL-TIME ALGORITHMS; REED-MULLER; SYMMETRIC FUNCTIONS; TOTALLY SYMMETRIC;

POLYNOMIAL APPROXIMATION;

EID: 85013939530     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/edtc.1995.470414     Document Type: Conference Paper

References (20)

1. B. Becker and R. Drechsler. Synthesis for testability: Circuits derived from ordered kronecker functional decision diagrams. In European Conf. on Design Automation, 1995.
2. S.D. Brown, R.J. Francis, J. Rose, and Z.G. Vranesic. Field-Programmable Gate Arrays. Kluwer Academic Publisher, 1992.
3. R.E. Bryant. Graph - based algorithms for Boolean function manipulation. IEEE Trans, on Comp., 8:677-691, 1986.
4. M. Davio. Taylor expansion of symmetric boolean functions. Philips Res. Repts, 28:466-474, 1973.
5. R. Drechsler, A. Sarabi, M. Theobald, B. Becker, and M.A. Perkowski. Efficient representation and manipulation of switching functions based on ordered kronecker functional decision diagrams. In Design Automation Conf., pages 415419, 1994.
6. R. Drechsler, M. Theobald, and B. Becker. Fast OFDD based minimization of fixed polarity reed- muller expressions. In European Design Automation Conf., pages 2-7, 1994.
7. U. Kebschull, E. Schubert, and W. Rosenstiel. Multilevel logic synthesis based on functional decision diagrams. In European Conf. on Design Automation, pages 43-47, 1992.
8. D. Moller, J. Mohnke, and M. Weber. Detection of symmetry of boolean functions represented as robdds. In Int'l Conf. on CAD, pages 680-684, 1993.
9. M.A. Perkowski, L. Csansky, A. Sarabi, and I. Schafer. Fast minimization of mixed-polarity and/xor canonical networks. In Int'l Conf. on Comp. Design, pages 33-36, 1992.
10. I. Pomeranz and S.M. Reddy. On determining symmetries in inputs of logic circuits. In VLSI Design Conf., pages 255-260, 1994.
11. S.M. Reddy. Easily testable realizations for logic functions. In IEEE Transaction on Computers, volume c-21, pages 1183-1188, 1972.
12. U. Rollwage. The complexity of mod-2 sum PLA's for symmetric functions. IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, Hamburg, pages 6-12, 1993.
13. A. Sarabi and M.A. Perkowski. Fast exact and quasi-minimal minimization of highly testable fixed-polarity and/xor canonical networks. In Design Automation Conf., pages 30-35, 1992.
14. A. Sarabi and M.A. Perkowski. Design for testability properties of and/xor networks. IFIP WG 10.5 Workshop on Applications of the Reed- Muller Expansion in Circuit Design, Hamburg, pages 147-153, 1993.
15. T. Sasao and Ph. Besslich. On the complexity of mod-2 sum PLAs. IEEE Trans, on Comp., 39:262-266, 1990.
16. J. Saul. Logic synthesis for arithmetic circuits using the reed-muller representation. In European Conf. on Design Automation, pages 109-113, 1992.
17. I. Schafer and M.A. Perkowski. Multiple-valued input generalized reed-muller forms. In Int'l Symp. on multi-valued Logic, pages 40-48, 1991.
18. C.C. Tsai and M. Marek-Sadowska. Efficient minimization algorithms for fixed polarity and/xor canonical networks. In Great Lakes Symp. VLSI, pages 76-79, 1993.
19. C.C. Tsai and M. Marek-Sadowska. Boolean matching using generalized Reed-Muller forms. In Design Automation Conf., pages 339-344, 1994.
20. C.C. Tsai and M. Marek-Sadowska. Detecting symmetric variables in boolean functions using generalized Reed-Muller forms. In Int'l Symp. Circ. and Systems, 1994.