Evolution of the Boolean function manipulation
Student Conference on Research and Development - Trang 72-75
Tóm tắt
Solving large systems of Boolean equations is a hard combinatorial problem. It can be greatly facilitated by preliminarily reducing the number of roots in separate equations which, in turn, leads to a reduction in the number of variables, equations and time complexity. This can have a significant effect upon the physical space and connectivity of electronic logic circuits when these are implemented using actual electronic devices or components. In this paper, we review various representation techniques, Boolean function manipulation issues and problems that are used in a practical design environment for digital systems design.
Từ khóa
#Boolean functions #Switching circuits #Input variables #Computer displays #Cells (biology) #Labeling #Boolean algebraTài liệu tham khảo
10.1109/TC.1986.1676819
10.1109/TC.1978.1675141
gajski, 1997, Principles of Digital Design
10.1109/ISMVL.1997.601404
10.2307/2308219
mccluskey, 0, 1956. Minimization of Boolean functions, The Bell Systems Technical Journal, 35, 1417, 10.1002/j.1538-7305.1956.tb03835.x