DocumentCode
2427638
Title
Optimal design by resolving Boolean equations
Author
Steinbach, Bernd ; Posthoff, Christian
Author_Institution
Inst. of Comput. Sci., Freiberg Univ. of Min. & Technol., Germany
fYear
2003
fDate
18-22 Feb. 2003
Firstpage
454
Lastpage
457
Abstract
The optimal design of a non-deterministic finite state machine by solving and resolving Boolean equations is shown, taking advantage of the relationships between single Boolean functions, sets of Boolean functions, Boolean equations, and their solutions. The Boolean differential calculus is used to point out the key ideas of the applied resolvability theory.
Keywords
Boolean functions; combinational circuits; computability; finite state machines; logic CAD; sequential circuits; Boolean differential calculus; Boolean equations; Boolean function sets; combinatorial circuit; digital circuit; logic design; nondeterministic finite state machine; optimal design; resolvability theory; sequential circuits; single Boolean functions; ternary vectors; Automata; Boolean functions; Calculus; Computer science; Digital circuits; Equations; Input variables; Logic design; Sequential circuits; Switches;
fLanguage
English
Publisher
ieee
Conference_Titel
CAD Systems in Microelectronics, 2003. CADSM 2003. Proceedings of the 7th International Conference. The Experience of Designing and Application of
Print_ISBN
966-553-278-2
Type
conf
DOI
10.1109/CADSM.2003.1255119
Filename
1255119
Link To Document