English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

1 answers

This would apply to logic circuits which are expressed in a Boolean equation, F = F(x), where x is the boolean variable (=0 or =1). The Shannon expansion states that F can be simplified to

F(x) = x*F(1) + x'*F(0). The resulting circuit will often be simpler than the original F(x). This site has very good examples http://everything2.com/index.pl?node_id=1384174

2007-02-05 19:57:53 · answer #1 · answered by gp4rts 7 · 0 0

fedest.com, questions and answers