ECE 106

DIGITAL ELECTRONICS 1:
LOGIC CIRCUIT AND
SWITCHING THEORY
LECTURE 1
 CHAPTER 1

DIGITAL SYSTEMS AND

BINARY NUMBERS
 CONTENT

Digital Computers and Digital Systems

Number System

Number Base Conversions

SIGNED Binary Numbers

 Why is it called DIGITAL ELECTRONICS

• DIGIT: from Latin ‘digitus’ = finger.

• any of the Arabic numerals 0 to 9
• DIGITAL: relating to the use of calculation by
numerical methods or by discrete units
• DIGITAL SYSTEMS: manipulate discrete elements
of information (finite sets)
• E.g. the 10 decimal digits, the 26 letters of the
alphabet, 64 squares of chess board)
Why is it called DIGITAL ELECTRONICS
 Digital Computers and Digital Systems
• Characteristic of a Digital system is its manipulation of discrete
elements of information.
• Such discrete elements maybe:
electric impulses, decimal digits, letters of an alphabet, arithmetic
operations, punctuation marks, or any set of meaningful meanings.
• Discrete elements of information are represented in a digital system by
physical quantities called SIGNALS.

➢Voltages and currents are the most common electrical

signals.
➢Signals in the present day of electronic digital systems have
only two discrete values and are said to be BINARY.
 Digital Computers and Digital Systems
Why Digital Circuits?

• Digital devices are programmable – by simply changing the

program the same hardware can be used for different
applications

• Advances in digital integrated circuits technology – accuracy,

reliability (DVD)

• Digital systems are interconnections of digital modules

NUMBER SYSTEM
 Numbers System
• Decimal
• Decimal number 7392 is represented by:
7 x 103 + 3 x 102 + 9 x 101 + 2 x 100
7000 + 300 + 90 + 2

• Represented in series of coefficients:

a5a4a3a2a1a0.a-1a-2a-3

• The aj coefficients are one of the ten digits

(0, 1, 2,…,9):
 Numbers System
• The decimal number system is said to be of base, or radix, 10
because it uses ten digits and the coefficients are multiplied by
powers of 10.
 Numbers System
• The binary system is different with the decimal system having
only two possible values: 0 and 1.

• Each coefficient aj is multiplied by 2j.

• For example: 11010.11 is 26.75 in decimals, shown from the

multiplication of the coefficients by powers of 2:
1x24 + 1x23 + 0x22 + 1x21 + 0x20 + 1x2-1 + 1x2-2
1x16 +1x8 + 0x4 + 1x2 + 0x1 + 1x0.5+1x0.25 = 26.75
 Numbers System
• The coefficients aj range in value from 0 to r - 1.

• Example: (4021.2)5
= 4x53 + 0x52 +2x51 + 1x50 +2x5-1 = (511.4)10

• Note that coefficients for base 5 can be only 0, 1, 2, 3, and 4.

 Numbers System
• For hexadecimal, the letters of the alphabet are use to
supplement the ten decimal digits when the base of the number
is greater than 10.

• Letters A, B, C, D, E and F are used for digits 10, 11, 12, 13, 14
and 15 respectively.

As an example:
(B65F)16 = 11 x 163 + 6 x 162 + 5 x 16 + 15
 Numbers System
• Arithmetic operations with numbers in base r follow the same
rules as for decimal numbers.
• When other than the familiar base 10 is used, one must be
careful to use only the r allowable digits.
•Addition:
1 111
Augend: 101101 45
Addend: 100111 39
Sum: 1010100 84
 Numbers System
Subtraction:
0 10 10

Minuend: 101101 45
Subtrahend: 100111 39
Difference: 000110 6
 Numbers System
Multiplication:
Multiplicand: 1011
Multiplier: x 101
1

1011
0000
1011
110111
Number Base Conversions
 Number Base Conversions
• A binary number can be converted to a decimal by forming the
sum of the powers of 2 of those coefficients whose value is 1.
Example:
(1010.011)2 = 23 + 21 + 2-2 + 2-3
= 8 + 2 + 0.25 + 0.125

= (10.375)10
• The binary number has four 1’s and the decimal equivalent is
found from the sum of four powers of 2.
 Number Base Conversions
• The following is an example of Octal-to-decimal conversion:
(630.4)8 = 6 x 82 + 3 x 81 + 0x80 +4 x 8-1
= 384 + 24 + 0 + 0.5
= (408.5)
10

• The conversion from decimal to binary or to any other base-r

system is more convenient if the number is separated into an
integer part and a fraction part and the conversion of each part
done separately.
 Number Base Conversions
• Convert decimal 41 to binary.
• Follow these simple steps:
• To do this, divide 41 by 2 to give an integer quotient of 20
and a remainder of ½.
• The quotient is again divided by 2 to give a new quotient
and remainder.
• This process is continued until the integer quotient
becomes 0.
(The process should be shown on the board)
Number Base Conversions
 Number Base Conversions
• Convert decimal 153 to octal.
• Follow these simple steps:
• The required base r is 8.
• First, divide 153 by 8 to give an integer
quotient of 19 and a remainder of 1.
• Then divide 19 by 8 to give a quotient of
2 and a remainder of 3.
• Finally, 2 is divided by 8 to give a
quotient of 0 and a remainder of 2.
(Process continued on the board)
 Number Base Conversions
• Convert (0.513) to octal.
• 0.513 x 8 = 4.104
• 0.104 x 8 = 0.832
• 0.832 x 8 = 6.656
• 0.656 x 8 = 5.248
• 0.248 x 8 = 1.984
• 0.984 x 8 = 7.872
• The answer, to seven significant figures, is obtained from
the integer part of the products: (0.513)10 = (0.406517…)8
 1-3 Number Base Conversions
• Convert (0.6875)10 to binary.

INTEGER FRACTION COEFFICIENTS

• 0.6875 x 2 = 1 + 0.3750 a-1 = 1
• 0.3750 x 2 = 0 + 0.7500 a-2 = 0
• 0.7500 x 2 = 1 + 0.5000 a-3 = 1
• 0.5000 x 2 = 1 + 0.0000 a-4 = 1
Answer: (0.6875)10 = (0.a-1a-2a-3a-4)2 = (0.1011)2
 Number Base Conversions
• Conversion of binary to octal:
10110001101011.111100000110)2

10 110 001 101 011 . 111 100 000 110 =

(26153.7460)8
•Conversion of binary to octal:
10110001101011.111100000110)2
10 1100 0110 1011 . 1111 0010 =

(2C6B.F2)16
COMPLEMENTS
 COMPLEMENTS
• Complements are used in digital computers for simplifying the
subtraction operation and for logical manipulation. There are
two types of complements for each base-r system:
• RADIX COMPLEMENT (or R’s Complement)
• DIMINISHED RADIX COMPLEMENT (or (R-1)’s complement).

• Also, it could be the 2’s and 1’s complement for the binary system.
• And, 10’s and 9’s complement for decimal numbers.
 COMPLEMENTS
• DIMINISHED RADIX Complement for DECIMAL
• Given a number N in base r having n digits, the (r-1)’s complement of
N is defined as (rn – 1) – N.

• For decimal numbers, r = 10 and r – 1 = 9, so the 9’s complement of N

is (10n – 1) – N.

• 10n represents a number that consists of a single 1 followed by n 0’s.

• 10n – 1 is a number represented by n 9’s.

• For example, if n=4, we have 104 = 10,000 and 104 -1 = 9999
 COMPLEMENTS

• It follows that the 9’s complement of a decimal

number is obtained by subtracting each digit
from 9.
• Example:
• The 9’s complement of 546700 is 999999 – 546700 =
453299
• The 9’s complement of 012398 is 999999 – 012398 =
987601
 COMPLEMENTS

• For binary numbers, r = 2 and r – 1 = 1, so the

1’s complement of N is (2n – 1) – N.
• 2n is represented by a binary number that
consists of a 1 followed by n 0’s.
• 2n – 1 is a binary number represented by n 1’s.
COMPLEMENTS

• For example, if n = 4, we have 24 = (10,000)2 and

24 – 1 = (1111)2.
• Thus the 1’s complement of a binary number is
obtained by subtracting each digit from 1.
• But when subtracting binary digits from 1, we can
have either 1 – 0 = 1 of 1 – 1 = 0, which causes
the bit to change from 0 to 1of from 1 to 0.
• Therefore, the 1’s complement of a binary number
is formed by changing 1’s to 0’s and 0’s to 1’s.
COMPLEMENTS

• Example
• The 1’s complement of 1011000 is
0100111.
• The 1’s complement of 0101101 is
1010010.

The (r – 1)’s complement of octal or hexadecimal

numbers is obtained by subtracting each digit from 7
or F (decimal 15), respectively.
 COMPLEMENTS
•RADIX Complement
• The r’s complement of an n-digit number N
in base r is defined as rn – N for N = 0 and 0
for N=0.

• The r’s complement is obtained by adding 1

to the (r – 1)’s complement since rn – N =
[(rn – 1) – N] + 1.
 COMPLEMENTS

•Example (Decimal)
•10’s complement of 012398 is 987602.
•10’s complement of 246700 is 753300.
 COMPLEMENTS
• Radix Complements
• Example for BINARY:
• The 2’s complement of 1101100 is 0010100.
• The 2’s complement of 0110111 is 1001001.
 COMPLEMENTS
• Subtraction with complements
• Similar to the subtraction done in
elementary, in this method, we borrow a 1
from a higher significant position when the
minuend digit is smaller than the
subtrahend digit.
 COMPLEMENTS
• Subtraction with complements
• The subtraction of two n-digit unsigned numbers M
– N in base r can be done as follows:
1. Add the minuend M to the r’s complement of the
subtrahend. This performs M + (rn – N) = M – N + rn.
2. If M > N, the sum will produce an end carry, rn, which is
discarded; what is left is the result M – N.
 COMPLEMENTS
• Subtraction with complements
3. If M < N, the sum does not produce an end
carry and is equal to rn – (N – M), which is
the r’s complement of (N – M). To obtain the
answer in familiar form, take the r’s
complement of the sum and place a
negative sign in front.
 COMPLEMENTS
Example 1: Using 10’s complement, subtract 72532 –
3250.
M= 72532
10’s complement of N = + 96750
Sum = 169282

Discard the end carry 105 = -100000

ANSWER = 69282
 COMPLEMENTS
Example 1: Using 10’s complement, subtract 3250 - 72532.

M= 03250
10’s complement of N = + 27468
Sum = 30718
There is no end carry.
Answer: -(10’s complement of 30718) = -69282
NOTE that since 3250 < 72532, the result is negative.
 COMPLEMENTS
Example 1: Given the two binary numbers X = 1010100 and Y =
1000011, perform the subtraction (a) X – Y and (b) Y – X using 2’s
complements.
(a) X = 1010100
2’s complement of Y = + 0111101
Sum = 10010001
Discard the end carry 27 = -10000000

Answer: X – Y = 0010001
 COMPLEMENTS
(b) Y = 1000011
2’s complement of X = + 0101100
Sum = 1101111
There is no end carry.

Answer: Y- X = -(2’s complement of 1101111) = -0010001

Subtraction of unsigned numbers can be done also by means of the (r-

1)’s complement.
 COMPLEMENTS
Example 1-8: Repeat example 1-7 using 1’s
complement.
(a) X – Y = 1010100 – 1000011
X = 1010100
1’s complement of Y = + 0111100
Sum = 10010000
End-around carry +1
Answer: X – Y = 0010001
 COMPLEMENTS
Example 1-8: Repeat example 1-7 using 1’s
complement.
(b) Y – X = 1000011 – 1010100
Y = 1000011
1’s complement of X = + 0101011
Sum = 1101110
There is no end carry.
Answer: Y – X = -(1’s complement of 1101110) = -
0010001
LABORATORY
• Soldering IRON (60watts) and Desoldering Pump
• Deadline oct 22, 2021
• Cutter Plier (6in), Combinational Plier (6in),Long nose Plier (6.5in),
• Dead line oct 29, 2021
• ACTIVITY 1
• Wire Soldering ART
• Deadline November 3, 2021
• Multimeter
• Deadline November 5, 2021
• Screw driver
• Deadline nov 12
SIGNED Binary Numbers
 SIGNED Binary Numbers
• Positive integers including zero can be represented as unsigned
numbers. But to represent negative integers, we need a
notation for negative values.

• In ordinary arithmetic,
• a negative number is indicated by a minus sign
• A positive number is indicated with a plus sign
 SIGNED Binary Numbers
• Due to hardware limitations, computers must represent
everything with binary digits, commonly referred to as BITS.

• It is customary to represent the sign with a bit placed in the

leftmost position of the number for binary numbers.
• The convention is to make the sign bit 0 for positive
• And 1 for negative
 SIGNED Binary Numbers
• We should realize that both signed and unsigned binary
numbers consist of a string of bits when represented in a
computer.

• The user determines whether the number is signed or

unsigned.

• If the binary number is signed, then the leftmost bit

represents the sign and the rest of bits represent the number
 SIGNED Binary Numbers
• Example the string of bits 01001
• Can be considered as 9 for unsigned binary
• Or a +9 for signed binary

• Another example, 11001

• Can be interpreted as 25 when unsigned, or
• As - 9 when considered as a signed number.
There should be no confusion in identifying the bits if the type of
representation for the number is known in advance.
 SIGNED Binary Numbers
• The representation of the signed numbers is referred as the SIGNED –
MAGNITUDE Convention.

• In this notation, the number consists of a Magnitude and Symbol ( +

or - ) or a BIT (0 or 1) indicating the sign.

• When arithmetic operations are implemented in a computer, it is more

convenient to use a different system for representing negative
numbers, referred to as the SIGNED COMPLEMENT System.
 SIGNED Binary Numbers
• SIGNED COMPLEMENT System
• In this system, a negative number is indicated by its
complement

• The signed complement system can either use the

1’s or 2’s complement, but the 2’s complement is the
most common.
 SIGNED Binary Numbers
• Example:
➢Consider the number 9 represented in binary with
eight bits

➢+ 9 is represented with a sign bit of 0 in the leftmost

position followed by the binary equivalent of 9 to give
00001001.
 SIGNED Binary Numbers
• Example:
➢ While there is only one way to represent + 9, there
are three different ways to represent – 9 with eight
bits:

In signed-magnitude representation: 10001001

In signed-1’s complement representation: 11110110
In signed-2’s complement representation: 11110111
SIGNED Binary Numbers

• In signed-magnitude, - 9 is obtained from + 9 by

changing the sign bit in the leftmost position from
0 to 1.
• In signed - 1’s complement, - 9 is obtained by
complementing all the bits of +9, including the
sign bit.
• In signed - 2’s complement, -9 is obtained by
taking the 2’s complement of the positive
number, including the sign bit.
 SIGNED Binary Numbers
• The signed-magnitude system is used in ordinary arithmetic, but is
awkward when employed in computer arithmetic.

• Therefore, the signed-complement is normally used.

• The 1’s complement presents some difficulties and is seldom used for
arithmetic operations and the signed binary arithmetic deals more
with the 2’s complement in representing negative numbers.
 SIGNED Binary Numbers

• ARITHMETIC ADDITION
• The addition of two numbers in the signed-magnitude system follows the
rules of ordinary arithmetic.

• If the signs are the same, we add the two magnitudes and give the sum
the common sign.

• If the signs are different, we subtract the smaller magnitude from the
larger and give the result the sign of the larger magnitude.
 SIGNED Binary Numbers

• ARITHMETIC ADDITION
• Example: (+25) + (-37) = - (37 – 25) = -12

• This is done by subtracting the smaller magnitude 25 from the

larger magnitude 37 and using the sign of 37 for the sign of the
result.

• The same procedure applies to binary numbers in signed-

complement system does not require a comparison or
subtraction, but only addition
 SIGNED Binary Numbers

• ARITHMETIC ADDITION
• The procedure can be stated as follows for binary:

• The addition of two signed binary numbers with negative

numbers represented in signed 2’s complement form is
obtained from the addition of the two numbers, including their
sign bits. A carry out of the sign-bit position is discarded.
SIGNED Binary Numbers

• ARITHMETIC ADDITION
• Numerical examples:
+6 00000110 - 6 11111010
+13 00001101 +13 00001101
+19 00010011 +7 00000111

Note that negative numbers must be initially in 2’s

complement and that the sum obtained after the
addition is in 2’s complement form.
SIGNED Binary Numbers

• ARITHMETIC ADDITION
• Numerical examples:
+6 00000110 - 6 11111010
-13 11110011 -13 11110011
-7 11111001 -19 11101101

Note that negative numbers must be initially in 2’s

complement and that the sum obtained after the
addition is in 2’s complement form.
SIGNED Binary Numbers

• ARITHMETIC ADDITION
• In each of the four cases, the operation
performed is addition with the sign bit
included.

• Any carry out of the sign-bit position is

discarded, and negative results are
automatically in 2’s complement form.
SIGNED Binary Numbers

• ARITHMETIC SUBTRACTION
• Subtraction of two signed binary numbers
when negative numbers are in 2’s
complement form is simple and is stated as
follows:
• Take the 2’s complement of the subtrahend
(including the sign bit) and add it to the minuend
(including the sign bit). A carry out of the sign-bit
position is discarded.
SIGNED Binary Numbers
• ARITHMETIC SUBTRACTION
• This procedure occurs because a subtraction
operation can be changed to an addition operation
if the sign of the subtrahend is changed.
• (+/- A) – (+B) = (+/-A) + (-B)
• (+/- A) – (-B) = (+/-A) + (+B)
• But changing a positive number to a negative
number is easily done by taking the 2’s
complement.
SIGNED Binary Numbers
• ARITHMETIC SUBTRACTION
• Consider the subtraction of (-6) – (-13) = +7.
• In binary with eight bits, this is written as
(11111010 – 11110011).
• The subtraction is changed to addition by taking
the 2’s complement of the subtrahend (-13) to give
(+13).
• In binary, this is 11111010 + 00001101 =
10000011. Removing the end carry, we obtain the
correct answer 00000111 (+7).
SHORT Quiz
Wednesday
1:00 to 2:00
 BINARY CODES
• A bit by definition is a binary digit and when used in conjunction
with a binary code, it is better to think of it as denoting a binary
quantity equal to 0 or 1.
• To represent a group of 2n distinct elements in a binary code requires a
minimum of n bits.
• This is because it is possible to arrange n bits in 2n distinct ways.
 BINARY CODES
• For example,
• A group of four distinct quantities can be represented by a two-bit code,
with each quantity assigned one of the following bit combinations: 00,
01, 10, 11.

• A group of eight elements requires a three-bit code, with each element

assigned to one and only one of the following: 000, 001, 010, 011, 100,
101, 110, 111.
 BINARY CODES
• Continuous or analog information is converted into digital form
by means of analog-to-digital converter.
• It is sometimes convenient to use Gray Code to represent the
digital data when it is converted from analog data.
• The advantage is that only one bit in the code group changes
when going from one number to the next.
 BINARY CODES
• The standard binary code for the alphanumeric characters is
ASCII (American Standard Code for Information Interchange).
• The data link escape character (DLE) was intended to be a
signal to the other end of a data link that the following character
is a control character such as STX or ETX. For example a
packet may be structured in the following way (DLE) <STX>
<PAYLOAD> (DLE) <ETX>.
 Other Alphanumeric Codes
• EBCDIC (Extended Binary Coded Decimal Interchange
Code)
• code used in IBM equipment, it uses 8 bits for each character. The
same character symbols as ASCII, but the bit assignment is different.
• Baudot (5-bit code)
• code developed in the early stages of teletype transmission.
• Hollerith code
• code developed when alphanumeric information is transferred to the
computer using punch cards.
 Error Correction Code
• Binary information can be transmitted from one location to
another by electric wires or other communication medium.
• Any external noise introduced into the physical communication
medium may change some of the bits from 0 to 1 or vice versa.
• The purpose of an error-detection code is to detect such bit-
reversal errors.
Binary Storage and Registers

• The discrete of information in a digital computer

must have a physical existence in some
information-storage medium.
• A register is a group of binary cells. Since a cell
stores one bit of information, it follows that a
register with n cells can store any information that
contains n bit.
 BINARY LOGIC
• Binary logic deals with variables that take on two
discrete values and with operations that
assumes logical meaning.
• The two values the variables take may be called by
different names (e.g., true and false, yes and no, etc.)
but it is more convenient to think in terms of bits and
assign the values of 1 and 0.
BINARY LOGIC
• Binary logic is used to describe, in mathematical way, the
manipulation and processing of binary information.

• It is suited for the analysis and design of digital

systems.

• For example, the digital logic circuits of figure

1-3 in your book that perform the binary
arithmetic are the circuits whose behavior is
conveniently expressed by means of binary
variables and logical operations.
BINARY LOGIC
• The binary logic to be introduced in this
section is equivalent to an algebra called
BOOLEAN ALGEBRA.
• The purpose of this section is to introduce
Boolean algebra and relate it to digital logic
circuits and binary signals.

• The formal discussion of a 2-valued Boolean

algebra is covered in more detail in Chapter 2.
BINARY LOGIC
• DEFINITION of Binary Logic
• Binary Logic consists of binary variables and
logical operations.
• Variables are designated by letters of alphabet
such as A, B, C, x, y, z, etc. with each variable
having two and only two distinct possible
values: 1 and 0.
• There are three basic logical operations: AND,
OR and NOT.
BINARY LOGIC
•DEFINITION of Binary Logic
• AND: This operation is represented by a
dot or by the absence of an operator.
• For example, x.y = z or xy = z is read “ x
AND y is equal to z.”
• The logical operation AND is interpreted to
mean that z = 1 if and only if x = 1 and y =
1; otherwise z = 0.
BINARY LOGIC
•DEFINITION of Binary Logic
• OR: This operation is represented by
a plus sign.
• For example, x + y = z is read “x OR y
is equal to z,” meaning that z=1 if x=1
or if y=1 or if both x=1 and y=1.
• If both x=0 and y=0, then z = 0.
BINARY LOGIC
•DEFINITION of Binary Logic
• NOT: This operation is represented by
a prime (sometimes by a par).
• For example, x’ = z (or x = z) is read
“not x is equal to z,” meaning that z is
what x is not.
• In other words, if x=1, then z=0; but if
x=0, then z=1.
BINARY LOGIC
•DEFINITION of Binary Logic
• Binary Logic resembles binary arithmetic, and
the operations AND and OR have some
similarities to multiplication and addition.
• One should realize that an arithmetic variable
designates a number that may consist of many
digits.
• A logic variable is always either a 1 or 0.
BINARY LOGIC
•DEFINITION of Binary Logic
• For each combination of the values of x and y,
there is a value of z specified by the definition
of the logical operation.
• These definitions can be listed in a compact
form known as TRUTH Tables.
• A truth table is a table of all possible
combinations of the variables showing the
relation between the values that the variables
may take and the result of the operation.
 BINARY LOGIC
AND
Truth Tables of Logical Operations:
x y z
0 0 NOT0 OR
0 1 x 0x’ x y z
1 0 0 00 0 0 0
1 1 0 11 0 1 1
1 0 1
1 1 1
 1-9 BINARY LOGIC
Switching Circuits and Binary Signals
• The use of binary variables and the application of
binary logic are demonstrated by the simple switching
circuit in the figure.

A
A B
B

Voltage
Source

(a) Switches in series – logic AND (b) Switches in parallel – logic OR

 1-9 BINARY LOGIC
Switching Circuits and Binary Signals
A
A B B

Voltage
Source

• Manual switches A and B represent two binary variables with values

equal to 0 when the switches is open and 1 when the switch is
closed. Similarly, let the lamp L represent a third binary variable
equal to 1 when the light is on and 0 when off.
 1-9 BINARY LOGIC
Switching Circuits and Binary Signals
A
A B
B

Voltage
Source

• For the switches in series, the light turns on if A and B are closed.
• For the switches in parallel, the light turns on if A or B is closed.
L=A B L=A+B
First Lab Assignment
 1-9 BINARY LOGIC
Switching Circuits and Binary Signals
• Electronic digital circuits are sometimes called switching circuits
because they behave like a switch such as the transistor.
• Instead of changing the switch manually, an electronic switching circuit
uses binary signals to control the conduction or non-conduction state of
the active element.

• Electrical signals such as voltage and current exist throughout a

digital system in either one of two recognizable values (except during
transition).
1-9 BINARY LOGIC
• Voltage-operated circuits respond to two separate voltage levels,
which represent a binary variable equal to Logic – 1 or Logic – 0.

NOMINAL
3 TOLERANCE ALLOWED for LOGIC-1
LOGIC-1
2

TRANSITION OCCURS BETWEEN THESE LIMITS

1

NOMINAL 0.5
LOGIC-0 0 TOLERANCE ALLOWED for LOGIC-0
-0.5
 1-9 BINARY LOGIC

• Electronic digital circuits are also called LOGIC CIRCUITS

because, with the proper input, they establish logical
manipulation paths.

• Any desired information for computing or control can be

operated upon by passing binary signals through various
combinations of logic circuits, each signal representing a
variable and carrying one bit of information.
 1-9 BINARY LOGIC
• LOGIC CIRCUITS that perform the logical operations of
AND, OR, and NOT are shown below with their symbols.

X Z = X.Y
(a) Two – input AND gate
Y

Z=X+Y
X
(b) Two – input OR gate
Y

x x’ (c) NOT gate or inverter

 1-9 BINARY LOGIC
• LOGIC CIRCUITS that perform the logical operations of
AND, OR, and NOT are shown below with their symbols.

A F = ABC
B (d) Three – input AND gate
C

A
B G=A+B+C+D
C
D (e) Four-input OR gate
 1-9 BINARY LOGIC
• These circuits, called gates, are blocks of hardware that
produce a logic-1 or logic-0 output signal if input logic
requirements are satisfied
• Note that four different names have been used for the same
type of circuits:
• DIGITAL Circuits
• SWITCHING Circuits
• LOGIC Circuits, and
• GATES
 Thank You
and
See You Next Week