Digital vs Analogue, Logic Devices, and Boolean Logic and Logic Gates Flashcards
What is the difference between analogue and digital signals?
- Analogue signals has a continuously varying voltage
- Digital signals represent things as distinct voltage values (HIGH and LOW) (1 or 0)
What are the advantages of digital systems?
- Known level of accuracy
- Reliable (immune from interference, temperature/humidity and aging)
- Can introduce intelligence
- Can change the design easily
What are the disadvantages of digital systems?
- Circuits are more complex (more wires0
- Increased cost of manufacture
What are the three basic logical operations?
OR, AND & NOT
What is a relay?
- Electromagnetic device
- Allows current through a coil to close one or more independent set of switch contacts
What are the 2 states of a relay?
NO (normally open)
NC (normally closed)
What are the disadvantages of a relay?
Bulky, slow, unreliable and power hungry
What are the benefits of transistors?
Fast, very small, very reliable
What are transistors?
- 3 terminal devices
- an input voltage is applied to the control terminal which causes a conducting path between the other 2 terminals to be opened or closed
What is a CMOS FET?
Type of transistor where current flows between two electrodes (the source and the drain) via a channel. Above the channel, there is a gate (another electrode)
Acts as a switch
What is the difference between a N channel FET or a P channel FET?
- N-channel FET uses the flow of electrons (output is HIGH when input is HIGH)
- P-channel FETs uses holes (OUTPUT is HIGH when INPUT is LOW)
What are the values of Boolean logic?
- 1 or TRUE (meaning HIGH or ON)
- 0 or FALSE (meaning LOW or OFF)
What are logic gates?
Logic gates are electronic circuits constructed from transistors with 1 or more input wire and 1 output wire
How does an OR gate function?
- OUTPUT is HIGH if either or both INPUTs are HIGH
- OUT = A + B
How does an AND gate function?
- OUTPUT is HIGH if both INPUTs are HIGH
- OUT = A.B
How does a NOT gate function?
- OUTPUT is HIGH if INPUT is LOW
- OUT = A\
How does XOR gate function?
- OUTPUT is HIGH if either INPUTs are HIGH but not both
- OUT = A+0B
How does NAND, NOR and XNOR function?
- AND, OR and XOR gate respectively without inversions
Which gates can be used to implement all other operations?
NAND and NOR
How do you make a NOT get from a NAND gate?
Split the input of the NAND gate into 2
How do you make an OR from a NAND?
Connect 2 NOT gates (made from NANDs) to a NAND gate
- Represented in De Morgan’s Theorem
What is De Morgan’s theorem?
A\ . B\ = (A+B)\
How many inputs can OR and AND gates have?
Any number of inputs
How many inputs can XOR and XNOR gates have?
2 inputs
How many inputs can NOT gates have?
1 input
What is the commutative law?
- Order of the variables makes no difference
- AB = BA
What is the associative law?
- Grouping of variables makes no difference
- A + (B + C) = ( A + B) + C = A + B + C
- A(BC) = (AB)C = ABC
What is the distributive law?
- The operator outside the bracket operates on all variables inside the bracket
- A(B + C) = AB + AC
- A + (BC) = (A+B)(A+C)
Solve A + 0
A
Solve A + 1
1
Solve A.0
0
Solve A.1
A
Solve A + A
A
Solve A + A\
A
Solve A.A
A
Solve A.A\
0
Solve A\
A
Solve A + AB
A
Solve A = A\B
A+B
What is the SOP form?
- Sum of Products form
- When two or more product terms are summed by Boolean addition
- eg. ABC + CDE + B\CD\
- Can be directly translated into gates but may not be the most efficient design
What is canonical form?
- Standard SOP Form
- All the variables in the domain appear in each product term in the expression
- eg. f(A,B,C,D) = ABC\D + AB\CD + AB\CD\
- each product term s known as a minterm
- not efficient but useful in analysis and design
How do you convert SOP to Canonical SOP?
- Multiply by (X + X) where X is the missing variable
What is an SOP equal to if any of the product terms is equal to 1?
1
What does f = SIGMA(3,6,7) mean?
The sum of the row numbers having TRUE minterms
Why would you want to simplify things?
- To minimize the cost of implementation (minimize the number of operations needed/number of gates)
- Increases the speed of operation
How can you minimize by Boolean Algebra?
- Grouping (adsorption rules)
- Multiplication by redundant variables (eg. (A+A)
- De Morgan’s theorem