Chapter - 1 - Digital Systems and Binary Numbers - WS
Chapter - 1 - Digital Systems and Binary Numbers - WS
Chapter - 1 - Digital Systems and Binary Numbers - WS
Chapter 1
Digital Systems and Binary Numbers
For example, an analog clock that has hour, minute, and second hands gives information in a continuous
form; the movements of the hands are continuous.
On the other hand, a digital clock that reports the hours and the minutes will change suddenly from 8:05 to
8:06.
Analog and Digital Data
Analog data, such as the sounds made by a human voice, take on continuous
values.
Digital data take on discrete values. For example, data are stored in
computer memory in the form of 0s and 1s.
An analog signal has infinitely many levels of intensity over a period of time.
As the wave moves from value A to value B, it passes through and includes an
infinite number of values along its path.
A digital signal, on the other hand, can have only a limited number of defined
values.
The Figure illustrates an analog signal and a digital signal. The curve representing
the analog signal passes through an infinite number of points.
The vertical lines of the digital signal, however, demonstrate the sudden jump that
the signal makes from value to value.
Analog and Digital Signals
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
Representing continuous signal in the form of discrete
values
This is a continuous signal.
Representing continuous signal in the form of discrete
values
A continuous signal can be represented digitally by taking samples at regular and fixed intervals.
Representing continuous signal in the form of discrete
values
Digital Representation.
Representing continuous signal in the form of discrete
values
The digital representation of the continuous signal only approximates the original signal.
and cannot truly represent the original signal as can be seen by plotting the values.
The reconstructed continuous signal does not give the exact replica of the original signal.
The reconstructed signal has sharp edges and corners in contrast to the original signal
which has smooth curves.
Representing continuous signal in the form of discrete
values
If the number of samples collected are reduced by half, the resulting reconstructed signal is very different
from reconstructed signal.
Representing continuous signal in the form of discrete
values
If the number of samples collected are reduced by half, the resulting reconstructed
signal is very different from reconstructed signal.
The peak in the continuous signal at 38 and the depth at -22 are all together missing
from the reconstructed signal.
A better approximation of the original signals can be obtained by increasing the number
of samples.
An infinite number of samples very accurately represents the original continuous signal.
Representing digital values
We saw a continuous signal and its digital representation. These digital values have to be
processed electronically by a digital system.
Generally there are two type of electronic systems : analog systems and digital systems.
Analog systems : process continuous signals. So a continuous quantity has to be converted into
electrical voltage terms. For example, a continuous signal of 42 deg C would be represented by
perhaps 42 mV, a continuous temperature signal of 35.73 deg C will be represented by 35.73
mV.
Digital systems: as mentioned before, use digital or discrete values. So are we going to be
representing these discrete values in terms of voltages? Let us see.
Representing digital values
Consider a calculator which is an example of digital system. Let us assume that the calculator has
been internally calibrated to represent the number 1 by 1 mV.
6.25 x 10 ^15 volts which is a very large voltage value and cannot be practically represented by any
circuit.
Representing digital values
We saw that it is not practical to represent discrete digital values in terms of voltages in the
digital system.
Basically digital systems are based in two voltage values, they work with two voltage values.
Using these two voltage values or these two states, we can represent any quantity or value
which has two states. For example numbers 0 and 1, the color black and white, the
temperature hot and cold, an object might be moving or stationary, so just two values.
Representing digital values
Now how can we represent multiple values or more than 2 values in a digital system?
Digital systems are based on binary number systems. A single digit or a bit of binary number
system can represent only 2 values, a zero and a one.
To represent large values, we combine these bits. So a combination of 2 bits would allow us to
use four different values or four quantities.
Normally we have been doing this in decimal number system. A single digit in decimal number
system can represent up to 10 values, from 0 to 9. Now how do u represent more than 10 values.
Well u use a combination of 2 decimal digits.so 2 digits would allow u to use 100 values, from 0
to 99.
Representing digital values
As mentioned before, in a digital system, the binary numbers are represented in terms of
voltages.
Efficient Processing & Data Storage. ( Computers for example are very efficient at processing information
that is in digital binary form, infact computers work with digital information. Another example a CD can
store a large number of digitized audio and video clips storing the same number of audio and video clips in
an analog form would require a large number of audio or video cassettes.)
Detection and Correction of Errors. (and less prone to errors. Even if error occurs detection and correction
of errors in digital data is easier. We will be looking at the simple example of detecting error using the
parity bit method).
Merits of a digital system
Precise & Accurate Reproduction.( For example, the picture quality and sound quality of digitized video or
audio stored on CDs can be reproduced with a far superior quality as compared to the analog audio and
video)
Occupy minimum space. ( Digital circuits in the form of IC occupy a very small space. For Example, the
PC has a motherboard which has an area less than one square foot. This mother board has all the important
circuitry of the computer. Digital memory on the hand is implemented as an integrated circuit. It is small
enough to fit in the palm of your hand but it can store an entire collection of books. )
Binary Digital Signal
Logic 0
t
Binary digital signal
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
Position
◆ Weight = (Base)
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
Octal Number System
Base = 8
◆ 8 digits { 0, 1, 2, 3, 4, 5, 6, 7 }
Weights
Position
64 8 1 1/8 1/64
◆ Weight = (Base)
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
Binary Number System
Base = 2
◆ 2 digits { 0, 1 }, called binary digits or “bits”
Weights
◆ Weight = (Base) Position 4 2 1 1/2 1/4
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
=(5.25)10
◆ 4 bits = Nibble 1011
(101.01)2
◆ 8 bits = Byte 11000101
Hexadecimal Number System
Base = 16
◆ 16 digits { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F }
Weights
256 16 1 1/16 1/256
◆ Weight = (Base) Position
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
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
Decimal Addition
1 1 Carry
5 5
+ 5 5
1 1 0
= Ten ≥ Base
➔ Subtract a Base
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
≥ (2)10
Binary Subtraction
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
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
Number Base Conversions
Evaluate
Magnitude
Octal
(Base 8)
Evaluate
Magnitude
Decimal Binary
(Base 10) (Base 2)
Hexadecimal
(Base 16)
Evaluate
Magnitude
Decimal (Integer) to Binary Conversion
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
Decimal (Fraction) to Binary Conversion
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
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
Binary − Octal Conversion
Octal Binary
8 = 23
Each group of 3 bits represents an octal digit 0 000
1 001
( 2 6 . 2 )8
( 0 1 0 1 1 0 . 0 1 0 )2
(1 6 . 4 )16
Example (10110000)2
(01001111)2
If you add a number and its 1’s complement …
10110000
+ 01001111
11111111
Complements
Radix Complement
Example: Base-10
Example: Base-2
Example 1.5 M N
◆ Using 10's complement, subtract 72532 – 3250.
Example 1.6 M N
◆ Using 10's complement, subtract 3250 – 72532.
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.
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.
Table 1.3 lists all possible four-bit signed binary numbers in the three representations.
Signed Binary 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 difference the sign
of the larger magnitude.
◆ 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.
Example:
Signed Binary Numbers
Arithmetic Subtraction
◆ In 2’s-complement form:
1. Take the 2’s complement of the subtrahend (including the sign bit)
and add it to the minuend (including sign bit).
2. A carry out of sign-bit position is discarded.
( A) − ( + B) = ( A) + ( − B)
( A) − ( − B) = ( A) + ( + B)
Example:
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.
Binary Code
Example:
◆ Consider decimal 185 and its corresponding value in BCD and binary:
Binary Codes
American Standard Code for Information Interchange (ASCII) Character Code
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:
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.
◆ Example:
A binary cell
◆ Two stable state
◆ Store one bit of information
◆ Examples: flip-flop circuits, ferrite cores, 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.
A Digital Computer Example
Memory
Control
CPU unit Datapath
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
Switching Circuits
AND OR
Binary Logic
Logic gates
◆ Example of binary signals
3
Logic 1
2
Un-define
1
Logic 0
0
Logic gates
◆ Graphic Symbols and Input-Output Signals for Logic gates:
Logic gates
◆ Graphic Symbols and Input-Output Signals for Logic gates: