Exact Minimization of FPRMs Using Multi-Terminal Exor TDDs
暂无分享,去创建一个
[1] Tsutomu Sasao. EXMIN2: a simplification algorithm for exclusive-OR-sum-of-products expressions for multiple-valued-input two-valued-output functions , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[2] Dhiraj K. Pradhan,et al. Universal Test Sets for Multiple Fault Detection in AND-EXOR Arrays , 1978, IEEE Transactions on Computers.
[3] Rolf Drechsler,et al. A Genetic Algorithm for Minimization of Fixed Polarity Reed-Muller Expressions , 1995, ICANNGA.
[4] Marek A. Perkowski,et al. Fast exact and quasi-minimal minimization of highly testable fixed-polarity AND/XOR canonical networks , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.
[5] Amar Mukhopadhyay,et al. Minimization of Exclusive or and Logical Equivalence Switching Circuits , 1970, IEEE Transactions on Computers.
[6] P. Besslich. Efficient computer method for ExOR logic design , 1983 .
[7] J. C. Muzio,et al. Boolean matrix transforms for the parity spectrum and minimisation of modulo-2 canonical expansions , 1991 .
[8] Robert K. Brayton,et al. Logic Minimization Algorithms for VLSI Synthesis , 1984, The Kluwer International Series in Engineering and Computer Science.
[9] Masahiro Fujita,et al. Spectral Transforms for Large Boolean Functions with Applications to Technology Mapping , 1993, 30th ACM/IEEE Design Automation Conference.
[10] Wolfgang Rosenstiel,et al. Efficient graph-based computation and manipulation of functional decision diagrams , 1993, 1993 European Conference on Design Automation with the European Event in ASIC Design.
[11] Tsutomu Sasao,et al. Logic Synthesis and Optimization , 1997 .
[12] Tsutomu Sasao. A transformation of multiple-valued input two-valued output functions and its application to simplification of exclusive-or sum-of-products expressions , 1991, [1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic.
[13] David H. Green,et al. Modern logic design , 1986 .
[14] Sudhakar M. Reddy,et al. Fault Detecting Test Sets for Reed-Muller Canonic Networks , 1975, IEEE Transactions on Computers.
[15] G. Bioul. Minimization of ring-sum expansion of Boolean functions , 1973 .
[16] Tsutomu Sasao,et al. On the complexity of mod-2l sum PLA's , 1990 .
[17] Hideo Fujiwara,et al. Logic Testing and Design for Testability , 1985 .
[18] Jean-Pierre Deschamps,et al. Discrete and switching functions , 1978 .
[19] Bernd Becker,et al. Fast OFDD based minimization of fixed polarity Reed-Muller expressions , 1994, EURO-DAC '94.
[20] SUDHAKAR M. REDDY,et al. Easily Testable Realizations ror Logic Functions , 1972, IEEE Transactions on Computers.
[21] Marek A. Perkowski,et al. Fast minimization of mixed-polarity AND/XOR canonical networks , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.
[22] Kewal K. Saluja,et al. Minimization of Reed–Muller Canonic Expansion , 1979, IEEE Transactions on Computers.
[23] D. Green. Reed-Muller canonical forms with mixed polarity and their manipulations , 1990 .
[24] Masahiro Fujita,et al. Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation , 1997, Formal Methods Syst. Des..
[25] Malgorzata Marek-Sadowska,et al. Efficient minimization algorithms for fixed polarity AND/XOR canonical networks , 1993, [1993] Proceedings Third Great Lakes Symposium on VLSI-Design Automation of High Performance VLSI Systems.
[26] Tsutomu Sasao. And-Exor Expressions and their Optimization , 1993 .