Scribd
Upload
55 views

Circuits Boolean Logic

Boolean logic uses binary numbers (1s and 0s) to represent electronic circuits and computer functions precisely. George Boole first developed Boolean algebra in the 1850s to represent logical operations, laying the foundation for digital electronics. Basic logic gates like AND, OR, and NOT combine binary inputs to produce outputs according to truth tables. More complex circuits can be designed by combining multiple logic gates to perform functions like triggering a burglar alarm if any door or window sensors detect entry and the alarm is enabled.

Uploaded by

mike simson
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
55 views

Circuits Boolean Logic

Boolean logic uses binary numbers (1s and 0s) to represent electronic circuits and computer functions precisely. George Boole first developed Boolean algebra in the 1850s to represent logical operations, laying the foundation for digital electronics. Basic logic gates like AND, OR, and NOT combine binary inputs to produce outputs according to truth tables. More complex circuits can be designed by combining multiple logic gates to perform functions like triggering a burglar alarm if any door or window sensors detect entry and the alarm is enabled.

Uploaded by

mike simson
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 26

Boolean Logic

TEJ2O
Mr. McBrien
Introduction
 We have seen that we needed an electronic switch
to enable sophisticated devices.
 How do we go from on/off to:
 Burglar alarms
 Collision detection/prevention systems
 Super Mario Kart?
Boolean Logic
 In the 1850s George Boole developed a new form
of algebra, now called Boolean algebra in his
honour.
 This isn’t a typo; it was before the days of
computers or even electricity as we view it today.
 In 1937 an MIT student named Claude Shannon
demonstrated the correlation between BL and
electronics circuits.
 Boolean equations today use the binary number
system to provide a very precise way of
illustrating the logic of computer chips.
Boolean Logic and Populations - AND
The Parking Lot

Black Made in
Cars Canada
The shaded group is comprised of cars
that are black AND made in Canada
Boolean Logic and Populations - OR
The Parking Lot
Boolean Logic and Populations - OR
The Parking Lot

Black Made in
Cars Canada
The shaded group is comprised of cars
that are black OR made in Canada
Boolean Logic and Populations -
NOR
The Parking Lot

Black Made in
Cars Canada
The shaded group is comprised of cars
that are Not black OR made in Canada
Remember that…
 1 in the Binary System represents
 ON or YES

 0 in the Binary System represents


 OFF or NO

 Boolean logic is a part of almost every aspect of


COMPUTER ELETRONICS
Examining Logic Gates
 A gate is where data (or electricity) flows
through. The gate takes the input (usually A
and/or B) and gives an output (Y and/or X)
 In binary logic, we have 0 for “no”, and 1 for
“yes”.
 In a positive logic circuit:
 0 V is low, or “no”.
 5V is high, or “yes”.
The Gates
Schematic Gate Boolean Equation

AND Y=AB
OR Y=A+B
NOT Y=Ā
NOR Y=A+B
XOR Y=A+B

Y
NAND Y=AB
XNOR Y=A+B
TRUTH TABLES

 Understanding the logic behind the gates


will help us determine the output
 We use truth tables to determine the
outputs based on different inputs.
Demonstration – an AND Gate

A B Y (Output)
0 0 0

0 1 0

1 0 0
1 1 1

Both inputs must be 1(YES) to get a 1(YES)


as output.
OR

A B Y (Output)
0 0 0

0 1 1

1 0 1
1 1 1

If either input is 1 (YES) the output is 1 (YES).


NOT

A Y (Output)
0 1

1 0

Output is opposite of input.


NOR

A B Y (Output)
0 0 1

0 1 0

1 0 0
1 1 0

For a value of 1(YES) – both inputs need


to be 0(NO). (OPPOSITE OF OR!!!)
XOR

A B Y (Output)
0 0 0

0 1 1

1 0 1
1 1 0

Only one input can be 1(YES) to have a 1(YES) output.


NAND

A B Y (Output)
0 0 1

0 1 1
1 0 1
1 1 0

If both inputs are 1(YES) output is 0(NO).


OPPOSITE OF AND!!
XNOR

A B Y (Output)
0 0 1

0 1 0
1 0 0
1 1 1

If both inputs are 1(YES) or both inputs are 0(NO),


output is 1(YES). OPPOSITE OF XOR!!
Activity

 Let’s pause for a second.


 On your note template, please sketch the Venn
diagrams associated with the other gates:
 XNOR, NAND, XOR, NOT
 Please don’t simply look them up; you’ll
benefit from thinking about it!
Logic Gates Aren’t that Interesting
on Their Own…
 We use them in combination in circuits to
accomplish things.
 When logic for a given situation is simple
enough, we don’t need a computer to
control devices…
Combining Gates Example
Combining OR Gates
 We’re designing a burglar alarm system and want to
trigger the alarm if any of the sensors indicate entry
 We can imagine a series of OR gates to give a positive
signal if a window or door is penetrated.
 In words: “If any entrance sensor is triggered, produce a
high voltage.”
 In Boolean Logic: Y = W1+W2+W3+W4+W5+W6+D1+D2
 Schematic on next page
Burglar Alarm Schematic
Y = W1+W2+W3+W4+W5+W6+D1+D2
W1
W2
W3
W4
Y
W5
W6
D1
D2

But there’s a small problem with our alarm system…


Burglar Alarm Schematic
“Is the alarm enabled?”
A sensor must trigger AND the system must be enabled.

W1
W2
W3
W4
W5 Y
W6
D1 E
D2

Our new expression is


Y = (W1+W2+W3+W4+W5+W6+D1+D2)●E
Summary
 Logic Gates are the basis of modern
electronic logic
 They’re based on Boolean algebra
 Logic Gates can be combined with other
gates to create circuits that produce the
outputs that we want from given inputs
 We can represent the behaviour of the gates
(or combinations) using Truth Tables.
Complete the Activity

 When it’s done, you can start to design


one of the gate circuits…
References
 http://www.neuroproductions.be/logic-lab/

You might also like