Difference between revisions of "Digital Electronics"

From ACSL Category Descriptions
Jump to navigation Jump to search
Line 168: Line 168:
Find all ordered 4-tuples (A, B, C, D), which make the following circuit FALSE:
Find all ordered 4-tuples (A, B, C, D), which make the following circuit FALSE:


[["f:\ACSl Category Descriptions\Pictures\de s1.png]]
[[File:f:\ACSL Category Descriptions\Pictures\de s1.png]]


Solution:  This circuit diagram translates to:  <math>(\overline{C+D}+B) \oplus (\overline{A}B) \oplus (\overline{C+D})</math>.
Solution:  This circuit diagram translates to:  <math>(\overline{C+D}+B) \oplus (\overline{A}B) \oplus (\overline{C+D})</math>.

Revision as of 21:32, 20 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

NAME GRAPHICAL SYMBOL ALGEBRAIC EXPRESSION TRUTH TABLE
BUFFER Buffer-gate-en.svg X = A
INPUT OUPUT
0 0
1 1
NOT Not-gate-en.svg X = [math]\overline{A}[/math]
INPUT OUPUT
A X
0 1
1 0
AND And-gate.png X = [math]AB[/math] or [math]A \cdot B[/math]
INPUT OUPUT
A B X
0 0 0
0 1 0
1 0 0
1 1 1
NAND Nand-gate-en.svg X = [math]\overline{AB}[/math] or [math]\overline{A\cdot B}[/math]
INPUT OUPUT
A B X
0 0 1
0 1 1
1 0 1
1 1 0
OR Or-gate-en.svg X = [math]A+B[/math]
INPUT OUPUT
A B X
0 0 0
0 1 1
1 0 1
1 1 1
NOR Nor-gate-en.svg X = [math]\overline{A+B}[/math]
INPUT OUPUT
A B X
0 0 1
0 1 0
1 0 0
1 1 0
XOR Xor-gate-en.svg X = [math]A \oplus B[/math]
INPUT OUPUT
A B X
0 0 0
0 1 1
1 0 1
1 1 0
XNOR Xnor-gate-en.svg X = [math]\overline{A \oplus B} \text{ or } A \odot B[/math]
INPUT OUPUT
A B X
0 0 1
0 1 0
1 0 0
1 1 1

Sample Problems

Sample Problem 1

Find all ordered 4-tuples (A, B, C, D), which make the following circuit FALSE:

File:F:\ACSL Category Descriptions\Pictures\de s1.png

Solution: This circuit diagram translates to: [math](\overline{C+D}+B) \oplus (\overline{A}B) \oplus (\overline{C+D})[/math]. The table has the following headings: 1=[math]\overline{C+D}[/math], 2=[math]1+\overline{B}[/math], 3=[math]\overline{A}B[/math], 4=[math]A \oplus B[/math], and 5=[math]4 \oplus 1[/math]. Thus, the 4-tuples (0,0,0,0), (1,0,0,0), (1,1,0,0), (1,1,0,1), (1,1,1,0), and (1,1,1,1) all make the circuit FALSE.

[math]A[/math] [math]B[/math] [math]C[/math] [math]D[/math] [math]1[/math] [math]2[/math] [math]3[/math] [math]4[/math] [math]5[/math]
0 0 0 0 1 1 0 1 0
0 0 0 1 0 1 0 1 1
0 0 1 0 0 1 0 1 1
0 0 1 1 0 1 0 1 1
0 1 0 0 1 1 1 0 1
0 1 0 1 0 0 1 1 1
0 1 1 0 0 1 1 1 1
0 1 1 1 0 0 1 1 1
1 0 0 0 1 1 0 1 0
1 0 0 1 0 1 0 1 1
1 0 1 0 0 1 0 1 1
1 0 1 1 0 1 0 1 1
1 1 0 0 1 1 0 1 0
1 1 0 1 0 0 0 0 0
1 1 1 0 0 0 0 0 0
1 1 1 1 0 0 0 0 0

Sample Problem 2

Find all ordered triplets (A, B, C) which make the following circuit FALSE:

Solution: The circuit translates to the Boolean expression [math]\overline{AB}+C[/math]. To find when this is FALSE we can equivalently find when the [math]\overline{\overline{AB}+C}[/math] is TRUE. We can simplify this by applying DeMorgan’s Law and cancelling the double not over AB to yield [math]AB\overline{C}[/math] . This is TRUE when for (1,1,0) only.

Video Resources

The following YouTube videos show ACSL students and advisors working out some ACSL problems that have appeared in previous contests. Some of the videos contain ads; ACSL is not responsible for the ads and does not receive compensation in any form for those ads.





https://youtu.be/z9s8A8oBe7g Logic Gate Expressions Kevin Drumm

https://youtu.be/TLl4E3IV6Z0 Logic Gate Combinations Kevin Drumm