EE-142: Digital Logic Design

Lecture 1

Introduction

Digital Logic Design Ch1-1

 Course Information
Textbook
M. Morris Mano, Digital Design, Fifth Edition, Pearson Education Inc.

Reference
M. Morris Mano and Charles R. Kime, Logic and Computer Design Fundamentals,
Pearson Education Inc.

Exams & Quizzes

There would be a mid-term and a final exam. All exams are closed book and closed
notes.  
There will be multiple quizzes. Like exams, quizzes are also closed book and closed
notes and will be conducted during the regular class.

Project
There will be a FPGA based design group project (3 person/group)

Homework
Homework will be assigned on regular basis.

Digital Logic Design

Digital Logic Design Ch1-2
 Instructor Profile
 Engr. Irsa Abid
 MS (Electrical Engineering)
» CIIT Islamabad.

 BS Electrical Engineering
» CIIT Lahore

 Contact Information
» Email: [email protected]

Digital Logic Design

Digital Logic Design Ch1-3
 Tentative Grading Criteria

 Quizzes, Assignments        10%

 Midterm Exam               30%
 Semester Project 10%
 Final Exam                        50%

Digital Logic Design

Digital Logic Design Ch1-4
 Objective: Digital design principle
A broad view of course content
 Foundation
 The Digital World
 Number systems
 Boolean algebra
 Combinational logic
 Logic gates
 Building blocks: de/mux, de/encoder, shifters, adder/subtractor, multiplier
 Logic minimization
 Mixed logic
 Sequential logic
 Latches, Flip-flops
 Counters
 State machine: Mealy/Moore machines

Digital Logic Design

Digital Logic Design Ch1-5
 The Digital World

PCs
Laptop computer

smartcards

Mainframe/supercomputer

Router
CRT projector
Router

printer

Router
Television

Scanner

Data

PDA
Telephone
Fax

Digital Logic Design

Digital Logic Design Ch1-6
 The Digital World
 Digital Systems, especially computers, are driving the world
economy.
 The Internet is changing the way we communicate, shop, learn, invest,
and entertain ourselves.
 This is an amazingly fast moving business!!
 Processors used to double in speed every 18 months
» Now it saturated since the first decade 2000s

 Computers are the most amazing and complex things ever built
by mankind
 The Intel Core i7 based on Haswell micro-architecture (4th Generation)
has 1.4 billion transistors (as of Sep, 2013)
 It runs at 3.5 GHz (billion cycles per second)

Digital Logic Design

Digital Logic Design Ch1-7
 Analog vs. Digital
V V
+5 +5
1 0 1

Time Time
–5 –5

Analog: values vary Digital: only discrete

over a broad range values
continuously

Digital Logic Design

Digital Logic Design Ch1-8
 Analog Signal vs. Digital

Digital Logic Design

Digital Logic Design Ch1-9
 Numerical Representations
 Analog representation: a quantity that can vary over a
continuous range of values.

 Digital representation: a quantity that changes in discrete steps.

 Analog == Continuous
 Digital == discrete

Digital Logic Design

Digital Logic Design Ch1-10
 Analog vs. Digital
• Analog devices process signal that can assume any value across a
continuous range and produce results that are also in continuous
form.
• Digital devices process signals that take on only two discrete
values, 0 and 1 and produce output that can be represented by 0
and 1.
• Examples
 Analog Devices: solid-state devices TV (except for digital TV),
Audio amplifier etc.
 Digital Devices: Computer, CD player, digital TV, digital
cellular phone, electronic calculator, and digital camera.

Digital Logic Design

Digital Logic Design Ch1-11
 Analog vs. Digital Systems
Analog systems:
• Limited precision, errors accumulate.
• Interface circuits (i.e., sensors & actuators) often
analog

Digital systems:
• More accurate and reliable
• Readily available as self-contained, easy to cascade
building blocks
• Computers use digital circuits internally
Digital Logic Design
Digital Logic Design Ch1-12
 Advantages of Digital Techniques
• Digital systems are generally easier to design.

• Information storage is easy.

• Accuracy and precision are greater.

• Operation can be programmed.

• Digital circuits are less effected by noise.

• More digital circuitry can be fabricated on IC chips.

Digital Logic Design

Digital Logic Design Ch1-13
 Limitations of Digital Techniques

• The real world is mainly analog.

• To deal with analog inputs, three steps must be followed:

- Convert the real-world analog inputs to digital form
(analog-to-digital converter, ADC).

-Process (operate on) the digital information.

- Convert the digital output back to real-world analog form

(digital-to-analog converter,DAC).

Digital Logic Design

Digital Logic Design Ch1-14
 Digital Circuits

•Digital circuits are designed to produce output voltages that fall

within the prescribed 0 and 1 voltage ranges.

• A digital circuit responds to an input’s binary level (0 or 1) and

not to its actual voltage.

• The manner in which a digital circuit responds to an input is

referred to as the circuit’s logic.

• Each type of digital circuit obeys a certain set of logic rules.

• For this reason, digital circuits are also called logic circuits.

Digital Logic Design

Digital Logic Design Ch1-15
 Digital Integrated Circuits

•Almost all of the digital circuits used in modern digital

systems are integrated circuits (ICs).

• Several fabrication technologies are used:

TTL
CMOS
NMOS
ECL

• Will learn about these IC families in Chapter 8.

Digital Logic Design

Digital Logic Design Ch1-16
 Parallel and Serial Transmission
 Parallel Transmission

Circuit A Circuit B

 Serial Transmission:

A B

Digital Logic Design Ch1-17

 Binary Signals

Digital Logic Design

Digital Logic Design Ch1-18
 Voltage Range of Binary Signals

5.0 Volts

HIGH (1)
HIGH (1) 4.0 Volts

3.0 Volts

2.0 Volts

LOW (0) 1.0 Volts

LOW (0)
0.0 Volts
INPUT OUTPUT
Digital Logic Design
Digital Logic Design Ch1-19
 Zoom-in a System Component

Digital Logic Design

Digital Logic Design Ch1-20
 Digital Logic Design

Chapter 1
Digital Systems and Binary Numbers

Digital Logic Design Ch1-21

 Outline of Chapter 1
 1.1 Digital Systems
 1.2 Binary Numbers
 1.3 Number-base Conversions
 1.4 Octal and Hexadecimal Numbers
 1.5 Complements
 1.6 Signed Binary Numbers
 1.7 Binary Codes
 1.8 Binary Storage and Registers
 1.9 Binary Logic

Digital Logic Design Ch1-22

 Analog and Digital Signal

 Analog system
 The physical quantities or signals may vary continuously over a specified
range.
 Digital system
 The physical quantities or signals can assume only discrete values.
 Greater accuracy
X(t) X(t)

t t
Analog signal Digital signal Digital Logic Design Ch1-23
 Binary Digital Signal
 An information variable represented by physical quantity.
 For digital systems, the variable takes on discrete values.
 Two level, or binary values are the most prevalent values.
 Binary values are represented abstractly by:
 Digits 0 and 1
 Words (symbols) False (F) and True (T) V(t)
 Words (symbols) Low (L) and High (H)
 And words On and Off Logic 1
 Binary values are represented by values
or ranges of values of physical quantities. undefine

Logic 0
t
Binary digital signal

Digital Logic Design Ch1-24

 Binary Logic
 Binary logic consists of binary variables and logical
operations.
 The variables are designated by letters of the alphabet (A, B, C, x,
y, z, etc.).
 There are three basic logical operations: AND OR NOT

Digital Logic Design Ch1-25

 Logical Operations

 AND is represented by a dot or the absence of an

operator.
 x.y = z or xy = z
 Read as “x and y is equal to z”
 Means that z=1 if and only if x=1 and y=1
 OR is represented by a plus sign.
 x+y = z
 Read as “x or y is equal to z”
 Means that z=1 if x=1 or y=1 or both x=1 and y=1
 NOT is represented by a prime or an overbar.
 x’=z or x = z
 Read as not x is equal to z
 Means that if x=1 then z=0 and if x=0 then z=1

Digital Logic Design Ch1-26

 Truth Tables

 Since each binary variable consists of value of 0 or 1,

each combination of values for the variables involved in
a binary operation has a specific result value.

 A truth table is a method of visualizing all possible

combinations of the input values and the respective
output values that occur due to the operation on the
specified combination.

Digital Logic Design Ch1-27

AND Truth Table

Digital Logic Design Ch1-28

 OR Truth Table

NOT Truth Table

Digital Logic Design Ch1-29

 Logic Gates
 Logic gates are electronic circuits that operate on one or
more input signals to produce an output signal.
 The state (high-low, on-off) of electricity on a line represents each
of the two states for binary representation (1 or 0).

Digital Logic Design Ch1-30

Logic Gate Notation

Multi-Input Circuits

31
Digital Logic Design Ch1-31
 Decimal Number System
 Base (also called radix) = 10
 10 digits { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 }
 Digit Position
 Integer & fraction 2 1 0 -1 -2
 Digit Weight 5 1 2 7 4
 Weight = (Base) Position
 Magnitude 100 10 1 0.1 0.01
 Sum of “Digit x Weight”
 Formal Notation
500 10 2 0.7 0.04

d2*B2+d1*B1+d0*B0+d-1*B-1+d-2*B-2

(512.74)10
Digital Logic Design Ch1-32
 Octal Number System
 Base = 8
 8 digits { 0, 1, 2, 3, 4, 5, 6, 7 }
 Weights
 Weight = (Base) Position 64 8 1 1/8 1/64
 Magnitude 5 1 2 7 4
 Sum of “Digit x Weight” 2 1 0 -1 -2
 Formal Notation
5 *82+1 *81+2 *80+7 *8-1+4 *8-2

=(330.9375)10
(512.74)8

Digital Logic Design Ch1-33

 Binary Number System
 Base = 2
 2 digits { 0, 1 }, called binary digits or “bits”
 Weights
4 2 1 1/2 1/4
 Weight = (Base) Position
 Magnitude 1 0 1 0 1
 Sum of “Bit x Weight” 2 1 0 -1 -2
 Formal Notation
1 *22+0 *21+1 *20+0 *2-1+1 *2-2
 Groups of bits 4 bits = Nibble
=(5.25)10
8 bits = Byte
(101.01)2
1011

11000101
Digital Logic Design Ch1-34
 Hexadecimal Number System
 Base = 16
 16 digits { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F }
 Weights
 Weight = (Base) Position 256 16 1 1/16 1/256

 Magnitude 1 E 5 7 A
 Sum of “Digit x Weight” 2 1 0 -1 -2
 Formal Notation
1 *162+14 *161+5 *160+7 *16-1+10 *16-2

=(485.4765625)10
(1E5.7A)16

Digital Logic Design Ch1-35

 The Power of 2

n 2n n 2n
0 20=1 8 28=256
1 21=2 9 29=512
2 22=4 10 210=1024 Kilo

3 23=8 11 211=2048
4 24=16 12 212=4096
5 25=32 20 220=1M Mega

6 26=64 30 230=1G Giga

7 27=128 40 240=1T Tera

Digital Logic Design Ch1-36

 Addition
 Decimal Addition

1 1 Carry
5 5
+ 5 5

1 1 0

Digital Logic Design Ch1-37

 Binary Addition
 Column Addition

1 1 1 1 1 1
1 1 1 1 0 1 = 61
+ 1 0 1 1 1 = 23

1 0 1 0 1 0 0 = 84

Digital Logic Design Ch1-38

 Binary Subtraction
 Borrow a “Base” when needed

1 2 = (10)2
0 2 2 0 0 2
1 0 0 1 1 0 1 = 77
− 1 0 1 1 1 = 23

0 1 1 0 1 1 0 = 54

Digital Logic Design Ch1-39

 Binary Multiplication
 Bit by bit

1 0 1 1 1
x 1 0 1 0
0 0 0 0 0
1 0 1 1 1
0 0 0 0 0
1 0 1 1 1

1 1 1 0 0 1 1 0

Digital Logic Design Ch1-40

Number Base Conversions
Evaluate
Magnitude
Octal
(Base 8)

Evaluate
Magnitude
Decimal Binary
(Base 10) (Base 2)

Hexadecimal
(Base 16)
Evaluate
Magnitude
Digital Logic Design Ch1-41
 Decimal (Integer) to Binary Conversion
 Divide the number by the ‘Base’ (=2)
 Take the remainder (either 0 or 1) as a coefficient
 Take the quotient and repeat the division

Example: (13)10
Quotient Remainder Coefficient
13/ 2 = 6 1 a0 = 1
6 /2= 3 0 a1 = 0
3 /2= 1 1 a2 = 1
1 /2= 0 1 a3 = 1
Answer: (13)10 = (a3 a2 a1 a0)2 = (1101)2

MSB LSB
Digital Logic Design Ch1-42
 Decimal (Fraction) to Binary Conversion
 Multiply the number by the ‘Base’ (=2)
 Take the integer (either 0 or 1) as a coefficient
 Take the resultant fraction and repeat the division

Example: (0.625)10
Integer Fraction Coefficient
0.625 * 2 = 1 . 25 a-1 = 1
0.25 * 2 = 0 . 5 a-2 = 0
0.5 *2= 1 . 0 a-3 = 1
Answer: (0.625)10 = (0.a-1 a-2 a-3)2 = (0.101)2

MSB LSB

Digital Logic Design Ch1-43

 Decimal to Octal Conversion
Example: (175)10
Quotient Remainder Coefficient
175 / 8 = 21 7 a0 = 7
21 / 8 = 2 5 a1 = 5
2 /8= 0 2 a2 = 2
Answer: (175)10 = (a2 a1 a0)8 = (257)8

Example: (0.3125)10
Integer Fraction Coefficient
0.3125 * 8 = 2 . 5 a-1 = 2
0.5 *8= 4 . 0 a-2 = 4
Answer: (0.3125)10 = (0.a-1 a-2 a-3)8 = (0.24)8

Digital Logic Design Ch1-44

 Binary − Octal Conversion
 8 = 23 Octal Binary

 Each group of 3 bits represents an octal 0 000

digit 1 001

2 010
Assume Zeros
Example: 3 011

( 1 0 1 1 0 . 0 1 )2 4 100
5 101
6 110
( 2 6 . 2 )8 7 111

Works both ways (Binary to Octal & Octal to Binary)

Digital Logic Design Ch1-45
 Binary − Hexadecimal Conversion
Hex Binary
 16 = 24 0 0000
1 0001
 Each group of 4 bits represents a
2 0010
hexadecimal digit 3 0011
4 0100
5 0101
Assume Zeros 6 0110
Example: 7 0111
8 1000
( 1 0 1 1 0 . 0 1 )2 9 1001
A 1010
B 1011
C 1100
D 1101
(1 6 . 4 )16 E 1110
F 1111

Works both ways (Binary to Hex & Hex to Binary)

Digital Logic Design Ch1-46
 Octal − Hexadecimal Conversion
 Convert to Binary as an intermediate step

Example:
( 2 6 . 2 )8

Assume Zeros Assume Zeros

( 0 1 0 1 1 0 . 0 1 0 )2

(1 6 . 4 )16

Works both ways (Octal to Hex & Hex to Octal)

Digital Logic Design Ch1-47
Decimal, Binary, Octal and Hexadecimal
Decimal Binary Octal Hex
00 0000 00 0
01 0001 01 1
02 0010 02 2
03 0011 03 3
04 0100 04 4
05 0101 05 5
06 0110 06 6
07 0111 07 7
08 1000 10 8
09 1001 11 9
10 1010 12 A
11 1011 13 B
12 1100 14 C
13 1101 15 D
14 1110 16 E
15 1111 17 F

Digital Logic Design Ch1-48

 1.5 Complements
 There are two types of complements for each base-r system: the
radix complement and diminished radix complement.
 Diminished Radix Complement - (r-1)’s Complement
 Given a number N in base r having n digits, the (r–1)’s
complement of N is defined as:
(rn –1) – N
 Example for 6-digit decimal numbers:
 9’s complement is (rn – 1)–N = (106–1)–N = 999999–N
 9’s complement of 546700 is 999999–546700 = 453299
 Example for 7-digit binary numbers:
 1’s complement is (rn – 1) – N = (27–1)–N = 1111111–N
 1’s complement of 1011000 is 1111111–1011000 = 0100111

Digital Logic Design Ch1-49

 Complements
 1’s Complement (Diminished Radix Complement)
 All ‘0’s become ‘1’s
 All ‘1’s become ‘0’s

Example (10110000)2
 (01001111)2
If you add a number and its 1’s complement …

10110000
+ 01001111
11111111

Digital Logic Design Ch1-50

 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 as 0 for N = 0. Comparing with the (r  1) 's
complement, we note that the r's complement is obtained by adding 1
to the (r  1) 's complement, since rn – N = [(rn  1) – N] + 1.

 Example: Base-10

The 10's complement of 012398 is 987602

The 10's complement of 246700 is 753300

 Example: Base-2

The 2's complement of 1101100 is 0010100

The 2's complement of 0110111 is 1001001

Digital Logic Design Ch1-51

 Complements
 2’s Complement (Radix Complement)
Take 1’s complement then add 1
OR Toggle all bits to the left of the first ‘1’ from the right


Example:
Number:
1’s Comp.:
10110000 10110000
01001111
+ 1
01010000 01010000

Digital Logic Design Ch1-52

 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 N.

2. Inspect the result obtained in step 1 for an end carry:

(a) If an end carry occurs, discard it.

(b) If an end carry does not occur, take the r’s complement of
the number obtained in step 1 and place a negative sign in front.

Digital Logic Design Ch1-53

 Complements
 Example 1.5
 Using 10's complement, subtract 72532 – 3250.

 Example 1.6
 Using 10's complement, subtract 3250 – 72532.

There is no end
carry.

Therefore, the answer is – (10's complement of 30718) =  69282.

Digital Logic Design Ch1-54
 Complements
 Example 1.7
 Given the two binary numbers X = 1010100 and Y = 1000011, perform the
subtraction (a) X – Y ; and (b) Y  X, by using 2's complement.

There is no end carry.

Therefore, the answer is Y
– X =  (2's complement of
1101111) =  0010001.

Digital Logic Design Ch1-55

 Complements
 Subtraction of unsigned numbers can also be done by means of the (r  1)'s
complement. Remember that the (r  1) 's complement is one less then the r's
complement.
 Example 1.8
 Repeat Example 1.7, but this time using 1's complement.

There is no end carry,

Therefore, the answer is Y –
X =  (1's complement of
1101110) =  0010001.
Digital Logic Design Ch1-56
 1.6 Signed Binary Numbers
 To represent negative integers, we need a notation for negative
values.
 It is customary to represent the sign with a bit placed in the leftmost
position of the number since binary digits.
 The convention is to make the sign bit 0 for positive and 1 for
negative.
 Example:

 Table 1.3 lists all possible four-bit signed binary numbers in the three
representations.
Digital Logic Design Ch1-57
Signed Binary Numbers

Digital Logic Design Ch1-58

 1.7 Binary Codes
 BCD Code
 A number with k decimal digits will
require 4k bits in BCD.
 Decimal 396 is represented in BCD
with 12bits as 0011 1001 0110, with
each group of 4 bits representing one
decimal digit.
 A decimal number in BCD is the
same as its equivalent binary number
only when the number is between 0
and 9.
 The binary combinations 1010
through 1111 are not used and have
no meaning in BCD.

Digital Logic Design Ch1-59

 Binary Code
 Example:
 Consider decimal 185 and its corresponding value in BCD and binary:

 BCD addition

Digital Logic Design Ch1-60

 Binary Code
 Example:
 Consider the addition of 184 + 576 = 760 in BCD:

Digital Logic Design Ch1-61

 Binary Codes
 Other Decimal Codes

Digital Logic Design Ch1-62

 Binary Codes)
 Gray Code
 The advantage is that only bit in the
code group changes in going from
one number to the next.
» Error detection.
» Representation of analog data.
» Low power design.

000 001

010 011
100 101

110 111

1-1 and onto!! Digital Logic Design Ch1-63

 Binary Codes
 American Standard Code for Information Interchange (ASCII) Character Code

Digital Logic Design Ch1-64

 Binary Codes
 ASCII Character Code

Digital Logic Design Ch1-65

 ASCII Character Codes
 American Standard Code for Information Interchange (Refer to
Table 1.7)
 A popular code used to represent information sent as character-
based data.
 It uses 7-bits to represent:
 94 Graphic printing characters.
 34 Non-printing characters.
 Some non-printing characters are used for text format (e.g. BS =
Backspace, CR = carriage return).
 Other non-printing characters are used for record marking and
flow control (e.g. STX and ETX start and end text areas).

Digital Logic Design Ch1-66

 ASCII Properties
 ASCII has some interesting properties:
 Digits 0 to 9 span Hexadecimal values 3016 to 3916
 Upper case A-Z span 4116 to 5A16
 Lower case a-z span 6116 to 7A16
» Lower to upper case translation (and vice versa) occurs by flipping bit 6.

Digital Logic Design Ch1-67

 Binary Codes
 Error-Detecting Code
 To detect errors in data communication and processing, an eighth bit is
sometimes added to the ASCII character to indicate its parity.
 A parity bit is an extra bit included with a message to make the total
number of 1's either even or odd.
 Example:
 Consider the following two characters and their even and odd parity:

Digital Logic Design Ch1-68

 Binary Codes
 Error-Detecting Code
 Redundancy (e.g. extra information), in the form of extra bits, can be
incorporated into binary code words to detect and correct errors.
 A simple form of redundancy is parity, an extra bit appended onto the
code word to make the number of 1’s odd or even. Parity can detect all
single-bit errors and some multiple-bit errors.
 A code word has even parity if the number of 1’s in the code word is even.
 A code word has odd parity if the number of 1’s in the code word is odd.

Digital Logic Design Ch1-69

 1.8 Binary Storage and Registers
 Registers
 A binary cell is a device that possesses two stable states and is capable of storing
one of the two states.
 A register is a group of binary cells. A register with n cells can store any discrete
quantity of information that contains n bits.

n cells 2n possible states

 A binary cell
 Two stable state
 Store one bit of information
 Examples: flip-flop circuits, capacitor
 A register
 A group of binary cells
 AX in x86 CPU
 Register Transfer
 A transfer of the information stored in one register to another.
 One of the major operations in digital system.
 An example in next slides.
Digital Logic Design Ch1-70
 A Digital Computer Example

Memory

Control
CPU unit Datapath

Inputs: Keyboard, Outputs: CRT,

mouse, modem, LCD, modem,
Input/Output
microphone speakers

Synchronous or
Asynchronous?
Digital Logic Design Ch1-71
Transfer of information

Figure 1.1 Transfer of information among register Digital Logic Design Ch1-72
 Transfer of information
 The other major component
of a digital system
 Circuit elements to
manipulate individual bits of
information
 Load-store machine
LD R1;
LD R2;
ADD R3, R2, R1;
SD R3;

Figure 1.2 Example of binary information processing Digital Logic Design Ch1-73
 1.9 Binary Logic
 Definition of Binary Logic
 Binary logic consists of binary variables and a set of logical operations.
 The variables are designated by letters of the alphabet, such as A, B, C, x, y, z, etc,
with each variable having two and only two distinct possible values: 1 and 0,
 Three basic logical operations: AND, OR, and NOT.

Digital Logic Design Ch1-74

 Binary Logic
 Truth Tables, Boolean Expressions, and Logic Gates

AND OR NOT
x y z x y z x z
0 0 0 0 0 0 0 1
0 1 0 0 1 1 1 0
1 0 0 1 0 1
1 1 1 1 1 1

z=x•y=xy z=x+y z = x = x’

x x x
y z y z z
Digital Logic Design Ch1-75
 Switching Circuits

AND OR

Digital Logic Design Ch1-76

 Binary Logic
 Logic gates
 Example of binary signals

3
Logic 1
2
Un-define
1
Logic 0
0

Figure 1.3 Example of binary signals Digital Logic Design Ch1-77

 Binary Logic
 Logic gates
 Graphic Symbols and Input-Output Signals for Logic gates:

Fig. 1.4 Symbols for digital logic circuits

Fig. 1.5 Input-Output signals for gates Digital Logic Design Ch1-78
 Binary Logic
 Logic gates
 Graphic Symbols and Input-Output Signals for Logic gates:

Fig. 1.6 Gates with multiple inputs

Digital Logic Design Ch1-79

 Examples
 Example 1:
 Convert the following decimal numbers into binary using 2’s
complement representation and perform the required arithmetic
operations:
(+286) + (-81)
(-286) + (-81)
 Convert the same numbers into BCD using 10’s complement
representation and re perform the required arithmetic operations.

Digital Logic Design Ch1-80

a) Arithmetic operations in binary
+286=0100011110 +81= 0001010001
-286 =1011100010 -81= 1110101111

(+286) + (-81) (-286) + (-81)

0100011110 1011100010

+
+ 1110101111
1110101111 _________________

_________________ 1010010001
0011001101
Digital Logic Design Ch1-81
a) Arithmetic operations in BCD
+286=0286=0000 0010 1000 0110
-286 =9714=1001 0111 0001 0100
+81 = 0081=0000 0000 0100 0001
-81 = 9919=1001 1001 0001 1001
(+286) + (-81) (-286) + (-81)

0000 0010 1000 0110 1001 0111 0001 0100

+ +
1001 1001 0001 1001 1001 1001 0001 1001
_______________________________
_______________________________
0000 0010 0000 0101 1001 0110 0011 0011
Digital Logic Design Ch1-82
Assignment

Digital Logic Design Ch1-83