Difference between revisions of "Digital Electronics"
(Created page with "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...") |
|||
| 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. | ||
::{| class="wikitable" style="text-align: center" | |||
X = A | |- | ||
!<math>NAME</math> | |||
0 | !<math>GRAPHICAL SYMBOL</math> | ||
1 | !<math>ALGEBRAIC EXPRESSION</math> | ||
!<math>TRUTH TABLE</math> | |||
NOT | |- | ||
!BUFFER | |||
X = | | Symbol | ||
| X = A | |||
0 | |{| class="wikitable" style="text-align: center" | ||
1 | !<math>A</math> | ||
!<math>X</math> | |||
AND | | 0 0 | ||
X = | | 1 1 | ||
|- | |||
0 | |} | ||
!NOT | |||
1 | | Symbol | ||
| X = ~A | |||
| A X | |||
| 0 1 | |||
| 1 0 | |||
X | |- | ||
!AND | |||
0 | | Symbol | ||
| X = ~A | |||
| A X | |||
| 0 1 | |||
| 1 0 | |||
|- | |||
!AND | |||
X = A | | Symbol | ||
| X = ~A | |||
0 | | A X | ||
| 0 1 | |||
1 | | 1 0 | ||
|- | |||
!AND | |||
| Symbol | |||
| X = ~A | |||
X = | | A X | ||
| 0 1 | |||
0 | | 1 0 | ||
|- | |||
!AND | |||
| Symbol | |||
| X = ~A | |||
| A X | |||
| 0 1 | |||
| 1 0 | |||
X = | |- | ||
0 | !AND | ||
| Symbol | |||
1 | | X = ~A | ||
| A X | |||
| 0 1 | |||
| 1 0 | |||
|- | |||
!AND | |||
X = | | Symbol | ||
| X = ~A | |||
0 | | A X | ||
| 0 1 | |||
| 1 0 | |||
|- | |||
|} | |||
Revision as of 16:01, 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.
[math]NAME[/math] [math]GRAPHICAL SYMBOL[/math] [math]ALGEBRAIC EXPRESSION[/math] [math]TRUTH TABLE[/math] BUFFER Symbol X = A class="wikitable" style="text-align: center" [math]A[/math] [math]X[/math] 0 0 1 1
!NOT | Symbol | X = ~A | A X | 0 1 | 1 0 |- !AND | Symbol | X = ~A | A X | 0 1 | 1 0 |- !AND | Symbol | X = ~A | A X | 0 1 | 1 0 |- !AND | Symbol | X = ~A | A X | 0 1 | 1 0 |- !AND | Symbol | X = ~A | A X | 0 1 | 1 0 |- !AND | Symbol | X = ~A | A X | 0 1 | 1 0 |- !AND | Symbol | X = ~A | A X | 0 1 | 1 0 |- |}