Algorithm for the generation of disjoint cubes for completely and incompletely specified boolean functions
暂无分享,去创建一个
[1] Stanley L. Hurst,et al. Spectral techniques in digital logic , 1985 .
[2] J. Paul Roth,et al. Computer Logic Testing And Verification , 1980 .
[3] D. M. Miller,et al. A spectral characterization of the self-dualized classification of boolean functions , 1986 .
[4] Marek A. Perkowski,et al. A fast algorithm to minimize multi-output mixed-polarity generalized Reed-Muller forms , 1988, DAC '88.
[5] L. B. Nguyen,et al. PALMINI-Fast Boolean Minimizer for Personal Computer , 1987, 24th ACM/IEEE Design Automation Conference.
[6] J. M. Sánchez,et al. Study of the complexity of an algorithm to derive the complement of a binary function , 1989 .
[7] Robert K. Brayton,et al. Logic Minimization Algorithms for VLSI Synthesis , 1984, The Kluwer International Series in Engineering and Computer Science.
[8] M. Perkowski,et al. Minimization of multiple-valued input multi-output mixed-radix exclusive sums of products for incompletely specified Boolean functions , 1989, Proceedings. The Nineteenth International Symposium on Multiple-Valued Logic.
[9] Donald Leo Dietmeyer,et al. Logic design of digital systems , 1971 .
[10] Marek Perkowski,et al. One more way to calculate the Hadamard-Walsh spectrum for completely and incompletely specified boolean functions , 1990 .
[11] S. Hurst. The relationship between the self-dualized classification of boolean functions and spectral coefficient classification , 1984 .
[12] Maciej Ciesielski,et al. Multiple-valued Boolean minimization based on graph coloring , 1989, Proceedings 1989 IEEE International Conference on Computer Design: VLSI in Computers and Processors.