Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Canonical normal form
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Application in digital circuit design== One application of Boolean algebra is digital circuit design, with one goal to minimize the number of gates and another to minimize the settling time. There are sixteen possible functions of two variables, but in digital logic hardware, the simplest gate circuits implement only four of them: ''[[logical conjunction|conjunction]]'' (AND), ''[[logical disjunction|disjunction]]'' (inclusive OR), and the respective complements of those (NAND and NOR). Most gate circuits accept more than 2 input variables; for example, the spaceborne [[Apollo Guidance Computer]], which pioneered the application of integrated circuits in the 1960s, was built with only one type of gate, a 3-input NOR, whose output is true only when all 3 inputs are false.<ref>{{cite book |first= Eldon C. |last= Hall |title= Journey to the Moon: The History of the Apollo Guidance Computer |publisher= AIAA |date= 1996 |isbn= 1-56347-185-X }}</ref>{{page needed|date=December 2019}}<ref>{{cite web|url=http://klabs.org/history/ech/agc_schematics/index.htm|title=APOLLO GUIDANCE COMPUTER (AGC) Schematics|website=klabs.org|publisher=Rich Katz|access-date=2021-06-19|quote=To see how NOR gate logic was used in the Apollo Guidance Computer's ALU, select any of the 4-BIT MODULE entries in the Index to Drawings, and expand images as desired.}}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)