Difference between revisions of "Digital Electronics"
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
This topic is an extension of the topic of [[Boolean Algebra]] which includes a more thorough description of the category in terms of determining whether a circuit results in a TRUE or FALSE value using truth tables or how to simplify a circuit to as few gates as possible. Electrical engineers use the following symbols to design electrical circuits that are used inside the computer’s hardware. The following table illustrates the equivalent Boolean algebra expression and truth table for each gate. | This topic is an extension of the topic of [[Boolean Algebra]] which includes a more thorough description of the category in terms of determining whether a circuit results in a TRUE or FALSE value using truth tables or how to simplify a circuit to as few gates as possible. Electrical engineers use the following symbols to design electrical circuits that are used inside the computer’s hardware. The following table illustrates the equivalent Boolean algebra expression and truth table for each gate. | ||
= Definitions = | |||
::{| class="wikitable" style="text-align: center" | ::{| class="wikitable" style="text-align: center" | ||
| Line 13: | Line 15: | ||
| truth table | | truth table | ||
|- | |- | ||
!NOT | !NOT | ||
| Symbol | | Symbol | ||
| Line 77: | Line 78: | ||
|} | |} | ||
= Sample Problems = | |||
== Sample Problem 1 == | |||
== Sample Problem 2 == | |||
== Sample Problem 3 == | |||
Revision as of 16:26, 18 August 2018
This topic is an extension of the topic of Boolean Algebra which includes a more thorough description of the category in terms of determining whether a circuit results in a TRUE or FALSE value using truth tables or how to simplify a circuit to as few gates as possible. Electrical engineers use the following symbols to design electrical circuits that are used inside the computer’s hardware. The following table illustrates the equivalent Boolean algebra expression and truth table for each gate.
Definitions
[math]NAME[/math] [math]GRAPHICAL SYMBOL[/math] [math]ALGEBRAIC EXPRESSION[/math] [math]TRUTH TABLE[/math] BUFFER Symbol X = A truth table NOT Symbol X = ~A ! A X 0 1 1 0 AND Symbol X = AB or A*B A B X 0 0 0 0 1 0 1 0 0 1 1 1 NAND Symbol X = ~(AB) or ~(A*B) A B X 0 0 1 0 1 1 1 0 1 1 1 0 OR Symbol X = A+B A B X 0 0 0 0 1 1 1 0 1 1 1 1 NOR Symbol X = ~(A+B) A B X 0 0 1 0 1 0 1 0 0 1 1 0 XOR Symbol X = ~AB+A~B A B X 0 0 0 0 1 1 1 0 1 1 1 0 XNOR Symbol X = AB+~A~B A B X 0 0 1 0 1 0 1 0 0 1 1 1