M o D U L e 0 5 - 0 5 A Digital Techniques-Electronic Instrument Systems

AeroGATES: PART 66 courseware 05 – Digital techniques
Category  A  B1  B2  B3 05a – Logic circuits

Level  1  2  3
Module 05-05a
Digital Techniques-Electronic Instrument Systems
Logic Circuits
05 – 05a - 1
Level  1  2  3
Table of contents
DESCRIPTION AND OPERATION OF LOGIC CIRCUITS AND LINEAR CIRCUITS .................................................................................................................. 3

1. LOGIC GATES: ....................................................................................................................................................................................................................... 3
1.1. Inverter or NOT logic gate:................................................................................................................................................................................................ 4
1.2. AND logic gate: ................................................................................................................................................................................................................. 5
1.3. NAND logic gate: .............................................................................................................................................................................................................. 8
1.4. OR logic gate: ................................................................................................................................................................................................................. 12
1.5. NOR logic gate: ............................................................................................................................................................................................................... 16
2. LOGIC LINEAR CIRCUITS:.................................................................................................................................................................................................. 19
2.1. Boolean identities: ........................................................................................................................................................................................................... 19
2.2. DeMorgan’s theorem: ..................................................................................................................................................................................................... 20
2.3. Breaking bars: ................................................................................................................................................................................................................. 22
2.4. Exercise - Simplification of a gate linear circuit: ............................................................................................................................................................. 23
3. FUNDAMENTAL LAWS: ...................................................................................................................................................................................................... 24
3.1. Commutativity: ................................................................................................................................................................................................................ 24
b) OR logic gate is commutative: ........................................................................................................................................................................................... 25
3.2. Associativity: ................................................................................................................................................................................................................... 27
3.3. Distributivity: .................................................................................................................................................................................................................... 32
3.4. Idempotence: .................................................................................................................................................................................................................. 34
5. LOGIC LINEAR CIRCUITS:.................................................................................................................................................................................................. 36
5.1. Boolean identities: ........................................................................................................................................................................................................... 36
5.2. De Morgan’s theorem: .................................................................................................................................................................................................... 37
5.3. Breaking bars: ................................................................................................................................................................................................................. 38
5.4. Exercise - Simplification of a gate linear circuit: ............................................................................................................................................................. 39
6. AIRCRAFT APPLICATIONS: ............................................................................................................................................................................................... 41
6.1. Automatic pilot engagement: .......................................................................................................................................................................................... 41
6.2. Automatic pilot disengagement: ...................................................................................................................................................................................... 42
05 – 05a - 2
Level  1  2  3
DESCRIPTION AND OPERATION OF LOGIC CIRCUITS AND LINEAR CIRCUITS

They are used to create digital circuits and even complex integrated circuits. For example, complex integrated circuits may bring already a complete
circuit ready to be used – microprocessors and micro-controllers are the best example – but inside them they were projected using several logic gates.
A good example of a digital electronic system is a mobile phone. As you speak into the phone, the digital electronic circuit converts your voice into a
series of electronic pulses (or 1s and 0s).
These are transmitted and the receiving mobile phone then converts the digital pulses back into your voice. Digital circuits are used because they are
efficient and work well, also, digital signals are easier to transmit than a persons voice.
1. LOGIC GATES:
Logic gates are the basic components in digital electronics. Logic Gates are circuits made up of diodes of transistors and resistors.
Terms used for the true and false states are shown in the table.
Logic gates are the basic components in digital electronics. Logic Gates are circuits made up of diodes of transistors and resistors.
LOGIC STATES
1 0
+ Vs 0
True False
On Off
Yes No
05 – 05a - 3
Level  1  2  3
Note: We have seen three ways of describing a Boolean function: logic circuits, truth tables, and Boolean expressions. Moreover, we have
seen systematic ways to convert between the three techniques, diagrammed below.
The five common logic gates used in wiring diagrams are the: NOT, AND, NAND, OR and NOR gates. Gates have two or more inputs, except a NOT
gate which has only one input.
1.1. Inverter or NOT logic gate:
As the name implies, inverter will invert the number entered. If you enter “0”, you will get a “1” on its output, and if you enter a “1”, you will get a “0” on
its output.
All gates have only one output. Usually the letters A, B, C and so on are used to label inputs, and Q is used to label the output.
The traditional symbols have distinctive shapes making them easy to recognise so they are widely used in industry and education.
05 – 05a - 4
Level  1  2  3
INVERTER LOGIC TRUTH TABLE

INPUT OUTPUT
1 0
0 1
1.2. AND logic gate:

As its name implies, an AND logic gate performs an “AND” logic operation, which is a multiplication. It has at least two inputs. So, if A and B are its
inputs, at the output we will find Q = A x B.
So, AND logic gate can be summarized by the formula:
Q=A×B
Another way to understand AND logic gate: its output will only be at “1” when all its inputs are also at “1”. Otherwise its output will be “0”.
You can see its symbol on figure and its truth table below.
AND LOGIC TRUTH TABLE

A input B input Q output
0 0 0
1 0 0
0 1 0
1 1 1
05 – 05a - 5
Level  1  2  3
If you need more than two inputs, the same idea applies.
If you are projecting a circuit and need an AND logic gate with more inputs, you can go ahead and simple draw an AND logic gate like the one on
Figure.
LOGIC TRUTH TABLE

A input B input C input Q output
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 0
1 0 0 0
1 1 0 0
1 0 1 0
1 1 1 1
05 – 05a - 6
Level  1  2  3
The 7408 IC contains four independent positive logic AND GATES. Pins 14 and 7 provide power for all four logic gates.
05 – 05a - 7
Level  1  2  3
Example:
Outputs of one gate can be connected to inputs of another within the same chip or to another chip as long as they share the same ground. The figure
illustrates a basic circuit showing how to wire inputs and using LEDs to display outputs.
AND gate logic rules: the output is HIGH when both inputs are HIGH, otherwise output is LOW.
1.3. NAND logic gate:

The “N” letter on NAND stands for NOT, meaning that NAND logic gate is an AND gate with an inverter attached.
So, its output is the opposite from AND.
If you need more inputs, just draw them on the symbol shown on figure below.
Its symbol is the same of AND but with a “o” on its output, meaning that the output is inverted. You can build yourself a NAND gate by connecting an
AND gate to an inverter.
05 – 05a - 8
Level  1  2  3
Q=A×B
Another way to understand NAND logic gate: its output will only be at “0” when all its inputs are also at “1”. Otherwise its output will be “1”.
NAND LOGIC TRUTH TABLE

0 0 1
0 1 1
1 0 1
1 1 0
Exercise:
However, if you want to create more inputs using gates with fewer inputs, you cannot connect them using the same idea shown on Figure.
05 – 05a - 9
Level  1  2  3
LOGIC TRUTH TABLE

0 0 0 1
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 0
Example:
The 7400 IC contains four independent positive logic NAND GATES. Pins 14 and 7 provide power for all four logic gates. Outputs of one gate can be
connected to inputs of another within the same chip or to another chip as long as they share the same ground.
The figure illustrates a basic circuit showing how to wire inputs and using LEDs to display outputs.
NAND gate logic rules: If one input is LOW then the output will be HIGH, otherwise output will be LOW.
05 – 05a - 10
Level  1  2  3
05 – 05a - 11
Level  1  2  3
1.4. OR logic gate:
As its name implies, an OR logic gate performs an “OR” logic operation, which is an addition. It has at least two inputs. So, if A and B are its inputs, at
the output we will find A + B. So, OR logic gate can be summarized by the formula Q = A + B.
Q=A+B
You can see its symbol on Figure and its truth table right below it.
OR LOGIC TRUTH TABLE

1 1 1
1 0 1
0 1 1
0 0 0
Exercise:
05 – 05a - 12
Level  1  2  3
LOGIC TRUTH TABLE

0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 1
If you need more than two inputs, the same idea applies. If you are projecting a circuit and need an OR logic gate with more inputs, you can
go ahead and simple draw an OR logic gate like the one on figure and put more inputs on it.
05 – 05a - 13
Level  1  2  3
The 7432 IC contains four independent positive logic OR GATES. Pins 14 and 7 provide power for all four logic gates.
05 – 05a - 14
Level  1  2  3
Example:
OR gate logic rules: If one or both inputs are HIGH, then the output will be HIGH. Otherwise, output will be LOW.
Note - Exclusive OR - gate (EX-OR)

This gate has always only 2 inputs. Its output will be 1 if one and only one of the inputs is 1. The exclusive OR logical operator (EX-OR) is
represented by a  sign (the addition sign is circled).
(It is said that Q is equal to A exclusive OR B.
EX-NOR LOGIC TRUTH TABLE

1 1 0
1 0 1
0 1 1
0 0 0
05 – 05a - 15
Level  1  2  3
1.5. NOR logic gate:
The “N” letter on NOR stands for NOT, meaning that NOR logic gate is an OR gate with an inverter attached. So, its output is the opposite from OR. Its
symbol is the same of OR but with a “o” on its output, meaning that the output is inverted.
Q=A+B
You can build yourself a NOR gate by connecting an OR gate to an inverter.
Another way to understand NOR logic gate: its output will only be at “1” when all its inputs are at “0”. Otherwise its output will be “0”.
If you need more inputs, just draw them on the symbol shown on figure.
NOR LOGIC TRUTH TABLE

1 1 0
1 0 0
0 1 0
0 0 1
Exercise:
05 – 05a - 16
Level  1  2  3
LOGIC TRUTH TABLE

0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 0
NOR gate logic rules: If one or both inputs are HIGH, then the output will be LOW. Otherwise, output will be HIGH.
Example:
05 – 05a - 17
Level  1  2  3
05 – 05a - 18
Level  1  2  3
The 7402 IC contains four independent positive logic NOR GATES. Pins 14 and 7 provide power for all four logic gates.
Note - Exclusive NOR gate (EX-NOR):

This gate always consists of only 2 inputs. Its output will be 1 if both inputs have the same value and is represented by a circled addition sign,
the whole being complemented. In fact, the EX-NOR operation is an EX-OR operation followed by an inverter.
It is said that Q is equal to A exclusive OR B NOT.
EX-NOR LOGIC TRUTH TABLE

1 1 1
1 0 0
0 1 0
0 0 1
2. LOGIC LINEAR CIRCUITS:

2.1. Boolean identities:
05 – 05a - 19
Level  1  2  3
Boolean algebra has its own unique identities based on the bivalent states of Boolean variables.
Addition:
1 1 1
1 0 1
0 1 1
0 0 0

0 0 0
1 0 0
0 1 0
1 1 1
2.2. DeMorgan’s theorem:

A mathematician named DeMorgan has developed a pair of important rules regarding group complementation in Boolean algebra.
By group complementation, I'm referring to the complement of a group of terms, represented by a long bar over more than one variable.
DeMorgan's theorems state the same equivalence in "backward" form: that inverting the output of any gate results in the same function as the opposite
type of gate (AND vs. OR) with inverted inputs:
05 – 05a - 20
Level  1  2  3
A × B = A +B
See the results on the logic truth table.
LOGIC TRUTH TABLE

B A AB
A×B A +B
1 0 1 0 1 0 0
0 1 1 0 0 1 1
1 0 0 1 0 1 1
0 1 0 1 0 1 1
Two equivalent configurations
The second DeMorgan's theorems states that:
A+B=A B
05 – 05a - 21
Level  1  2  3
LOGIC TRUTH TABLE

B A A+B
A+B A  B
1 0 1 0 1 0 0
0 1 1 0 1 0 0
1 0 0 1 1 0 0
0 1 0 1 0 1 1
2.3. Breaking bars:

When multiple "layers" of bars exist in an expression, you may only break one bar at a time, and it is generally easier to begin simplification breaking
the longest (uppermost) bar first. To illustrate, let's take the expression A + BC and reduce it using DeMorgan's Theorems:
Following the advice of breaking the longest (uppermost) bar first, I'll begin by breaking the bar covering the entire expression as a first step:
05 – 05a - 22
Level  1  2  3
A + BC = A × BC = A × BC
As a result, the original circuit is reduced to a three-input AND gate with the A input inverted:
2.4. Exercise - Simplification of a gate linear circuit:

Let's apply the principles of DeMorgan's theorems to the simplification of a gate linear circuit:
05 – 05a - 23
Level  1  2  3
Applying De Morgan theorems, we can break the logic bars:
AB + A + BC  AB  A + BC  AB  (A + BC) = AAB  ABBC = AB

Because in Boolean algebra AA = A and BB = 0
The equivalent gate circuit for this much-simplified expression is as follows:
3. FUNDAMENTAL LAWS:
3.1. Commutativity:
Commutativity is the property of a binary operation or operator such that the result of one term operating on a second is equal to the result of the
second term operating on the first.
Example:
The operation * is commutative if:
A*B=B*A
Where: A and B are the two terms,
* is the operator
a) AND logic gate is commutative:
A×B=B×A
05 – 05a - 24
Level  1  2  3
Another way to understand AND logic gate: its output will only be at “1” when all its inputs are also at “1”. Otherwise its output will be “0”.
You can verify this property in the truth table below:
COMMUTATIVITY OF AND LOGIC GATE

A input B input AxB BxA
0 0 0 0
1 0 0 0
0 1 0 0
1 1 1 1
b) OR logic gate is commutative:
Q = A+B= B + A

COMMUTATIVITY OF 0R LOGIC GATE
A input B input A+B B+A
05 – 05a - 25
Level  1  2  3
0 0 0 0
1 0 1 1
0 1 1 1
1 1 1 1
c) NAND logic gate is commutative :
Q = A xB = B x A

COMMUTATIVITY OF NAND LOGIC GATE
A input B input A xB BxA
0 0 1 1
1 0 1 1
0 1 1 1
1 1 0 0
d) NOR logic gate is commutative.
Q= A+B=B+A
05 – 05a - 26
Level  1  2  3
COMMUTATIVITY OF NOR LOGIC GATE

A input B input A+B B+A
0 0 1 1
1 0 0 0
0 1 0 0
1 1 0 0
3.2. Associativity:
Formally, considering tree numbers A, B, C an a binary operation * , this operation is called associative if it satisfies the associative law:
(A * B) * C = A * (B * C) = A * B * C
a) AND logic gate is associative:
(A x B) x C = A x (B x C)
05 – 05a - 27
Level  1  2  3
ASSOCIATIVITY OF AND LOGIC GATE

A input B input C input (A x B) x C = A x (B x C)
0 0 0 1
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 0
b) OR logic gate is associative:
(A + B) + C = A + (B + C)
05 – 05a - 28
Level  1  2  3
ASSOCIATIVITY OF OR LOGIC GATE

A input B input C input (A + B) + C = A + (B + C)
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 1
c) NAND logic gate is associative:
05 – 05a - 29
Level  1  2  3
(A x B) x C = A x (B x C)
ASSOCIATIVITY OF NAND LOGIC GATE

A input B input C input (A x B) x C = A x (B x C)
0 0 0 1
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 0
c) NOR logic gate is associative:
05 – 05a - 30
Level  1  2  3
A+B +C= A +B+C
ASSOCIATIVITY NOR AND LOGIC GATE

A input B input C input A+B +C= A +B+C
0 0 0 1
0 0 1 0
0 1 0 0
0 1 1 0
1 0 0 0
1 0 1 0
1 1 0 0
1 1 1 0
05 – 05a - 31
Level  1  2  3
3.3. Distributivity:
Consider three numbers: A, B, C and two operations: *#. In symbols, it is stated: A * ( B # C) = A#B * A#C. The result of first adding several numbers
and then multiplying the sum by some number is the same as first multiplying each separately by the number and then adding the products.
a) AND operation is distributive on OR:
A  (B + C) = (A  B) + (A  C)
AND DISTRIBUTIVE ON OR
A input B input C input A  (B + C) = (A  B) + (A  C)
05 – 05a - 32
Level  1  2  3
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 1
b) OR operation is distributive on AND:

A + (B  C) = (A + C)  (B + C)
05 – 05a - 33
Level  1  2  3
AND DISTRIBUTIVE ON OR
A input B input C input A+(B  C) = (A+B)  (A+C)
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 1
3.4. Idempotence:
Idempotence is the property of certain operations that they can be applied multiple times without changing the result beyond the initial application.
a) AND is an idempotent operation:
A  A=A
05 – 05a - 34
Level  1  2  3

A input A input Q output
0 0 0
0 0 0
1 1 1
1 1 1
b) OR is an idempotent operation:
A  A=A

A input A input Q output
0 0 0
0 0 0
1 1 1
05 – 05a - 35
Level  1  2  3
1 1 1
5. LOGIC LINEAR CIRCUITS:

5.1. Boolean identities:
Boolean algebra has its own unique identities based on the bivalent states of Boolean variables.
Addition:
A 1 1
1 0 1
0 1 1
0 0 0

0 0 0
1 0 0
0 1 0
1 1 1
05 – 05a - 36
Level  1  2  3
5.2. De Morgan’s theorem:
A mathematician named De Morgan has developed a pair of important rules regarding group complementation in Boolean algebra.
By group complementation, I'm referring to the complement of a group of terms, represented by a long bar over more than one variable.
DeMorgan's theorems state the same equivalence in "backward" form: that inverting the output of any gate results in the same function as the opposite
type of gate (AND vs. OR) with inverted inputs:
A × B = A +B
LOGIC TRUTH TABLE

B A AB
A×B A +B
1 0 1 0 1 0 0
0 1 1 0 0 1 1
1 0 0 1 0 1 1
0 1 0 1 0 1 1
05 – 05a - 37
Level  1  2  3
Two equivalent configurations
The second DeMorgan's theorems states that:
A+B=A B
LOGIC TRUTH TABLE

B A A+B
A+B A  B
1 0 1 0 1 0 0
0 1 1 0 1 0 0
1 0 0 1 1 0 0
0 1 0 1 0 1 1
5.3. Breaking bars:

When multiple "layers" of bars exist in an expression, you may only break one bar at a time, and it is generally easier to begin simplification by
breaking the longest (uppermost) bar first. To illustrate, let's take the expression A + BC and reduce it using DeMorgan's Theorems:
05 – 05a - 38
Level  1  2  3
Following the advice of breaking the longest (uppermost) bar first, I'll begin by breaking the bar covering the entire expression as a first step:
A + BC = A  BC = A  BC
As a result, the original circuit is reduced to a three-input AND gate with the A input inverted:
v
5.4. Exercise - Simplification of a gate linear circuit:
Let's apply the principles of De Morgan's theorems to the simplification of a gate linear circuit:
05 – 05a - 39
Level  1  2  3
Applying De Morgan theorems, we can break the logic bars:
AB + A + BC  AB  A + BC
 AB  (A + BC)
= AAB  ABBC
= AB + AC = A B
Because in Boolean algebra A×A = A and B  B = 0

The equivalent gate circuit for this much-simplified expression is as follows:
05 – 05a - 40
Level  1  2  3
6. AIRCRAFT APPLICATIONS:
There are multiple systems using digital functions, for example an automatic pilot system that requires several conditions to be put into operation
(logical function AND) but only one is enough to disengage it (logical function OR):
6.1. Automatic pilot engagement:
 Conditions for autopilot engagement:

 Synchronization done, and
 Power supplies activated, and
 Hydraulic function activated, and
 Vertical gyroscope validated, and
 Aircraft slope less than the threshold, and
05 – 05a - 41
Level  1  2  3
 Course selection knob to neutral, and
 Yaw damper operational.
We will see some examples where we use the logic operations in the flight navigation of an Airbus A 310. To engage the automatic pilot, there are
a certain number of conditions summarized on the previous indications.
6.2. Automatic pilot disengagement:

 Conditions for autopilot disengagement:
The automatic pilot is automatically disconnected if at least one of the following conditions occurs:
 Power supplies defective, or
 Hydraulic power defective, or
 Failure of the vertical gyroscope, or
05 – 05a - 42
Level  1  2  3
 Aircraft attitude higher than the threshold, or
 Load factor higher than the threshold, or
 Yaw damper inoperative.
05 – 05a - 43

M o D U L e 0 5 - 0 5 A Digital Techniques-Electronic Instrument Systems

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

M o D U L e 0 5 - 0 5 A Digital Techniques-Electronic Instrument Systems

Uploaded by

Copyright:

Available Formats

AeroGATES: PART 66 courseware 05 – Digital techniques

Category  A  B1  B2  B3 05a – Logic circuits

DESCRIPTION AND OPERATION OF LOGIC CIRCUITS AND LINEAR CIRCUITS .................................................................................................................. 3

DESCRIPTION AND OPERATION OF LOGIC CIRCUITS AND LINEAR CIRCUITS

1.1. Inverter or NOT logic gate:

INVERTER LOGIC TRUTH TABLE

1.2. AND logic gate:

AND LOGIC TRUTH TABLE

LOGIC TRUTH TABLE

1.3. NAND logic gate:

NAND LOGIC TRUTH TABLE

LOGIC TRUTH TABLE

OR LOGIC TRUTH TABLE

LOGIC TRUTH TABLE

Note - Exclusive OR - gate (EX-OR)

(It is said that Q is equal to A exclusive OR B.

EX-NOR LOGIC TRUTH TABLE

NOR LOGIC TRUTH TABLE

LOGIC TRUTH TABLE

Note - Exclusive NOR gate (EX-NOR):

It is said that Q is equal to A exclusive OR B NOT.

EX-NOR LOGIC TRUTH TABLE

2. LOGIC LINEAR CIRCUITS:

AND LOGIC TRUTH TABLE

2.2. DeMorgan’s theorem:

LOGIC TRUTH TABLE

Two equivalent configurations

The second DeMorgan's theorems states that:

LOGIC TRUTH TABLE

2.3. Breaking bars:

2.4. Exercise - Simplification of a gate linear circuit:

AB + A + BC  AB  A + BC  AB  (A + BC) = AAB  ABBC = AB

The equivalent gate circuit for this much-simplified expression is as follows:

COMMUTATIVITY OF AND LOGIC GATE

You can verify this property in the truth table below:

c) NAND logic gate is commutative :

You can verify this property in the truth table below:

You can verify this property in the truth table below:

COMMUTATIVITY OF NOR LOGIC GATE

ASSOCIATIVITY OF AND LOGIC GATE

b) OR logic gate is associative:

ASSOCIATIVITY OF OR LOGIC GATE

c) NAND logic gate is associative:

ASSOCIATIVITY OF NAND LOGIC GATE

c) NOR logic gate is associative:

A+B +C= A +B+C

ASSOCIATIVITY NOR AND LOGIC GATE

a) AND operation is distributive on OR:

b) OR operation is distributive on AND:

a) AND is an idempotent operation:

AND LOGIC TRUTH TABLE

OR LOGIC TRUTH TABLE

5. LOGIC LINEAR CIRCUITS:

AND LOGIC TRUTH TABLE

LOGIC TRUTH TABLE

Two equivalent configurations

The second DeMorgan's theorems states that:

LOGIC TRUTH TABLE

5.3. Breaking bars:

Applying De Morgan theorems, we can break the logic bars:

Because in Boolean algebra A×A = A and B  B = 0

 Conditions for autopilot engagement:

6.2. Automatic pilot disengagement: