0% found this document useful (0 votes)
38 views

Chapter 2

This chapter discusses number systems such as binary, decimal, and hexadecimal. It covers how to convert between these number systems as well as binary coded decimal. The chapter also discusses error detection methods like parity checking and describes codes such as ASCII.

Uploaded by

songhyeonnoh5566
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
38 views

Chapter 2

This chapter discusses number systems such as binary, decimal, and hexadecimal. It covers how to convert between these number systems as well as binary coded decimal. The chapter also discusses error detection methods like parity checking and describes codes such as ASCII.

Uploaded by

songhyeonnoh5566
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 46

Digital Systems

Principles and Applications


TWELFTH EDITION, GLOBAL EDITION

CHAPTER 2
Number Systems
and Codes
Chapter 2 Objectives

• Convert a number from one number


system (decimal, binary, hexadecimal)
to its equivalent in one of the other
number systems.
• Cite the advantages of the hexadecimal
number system.
• Count in hexadecimal.
Chapter 2 Objectives

• Represent decimal numbers using the


BCD code; cite the pros and cons of
using BCD.
• Explain the difference between BCD
and straight binary.
• Explain the purpose of alphanumeric
codes such as the ASCII code.
• Explain the parity method for error
detection.
Chapter 2 Objectives

• Determine the parity bit to be attached


to a digital data string.
2-1 Binary to Decimal Conversion
• Convert binary to decimal by summing
the positions that contain a 1:

• An example with a greater number of bits:

Ronald Tocci/Neal Widmer/Gregory Moss


Digital Systems: Principles and Applications, 10e
2-1 Binary to Decimal Conversion

• The double-dabble method avoids


addition of large numbers:
 Write down the left-most 1 in the binary
number.
 Double it and add the next bit to the
right.
 Write down the result under the next
bit.
 Continue with steps 2 and 3 until
finished with the binary number.
2-1 Binary to Decimal Conversion
• Binary numbers verify the double-dabble
method:

Ronald Tocci/Neal Widmer/Gregory Moss


Digital Systems: Principles and Applications, 10e
2-2 Decimal to Binary Conversion

• Reverse process described in 2-1.


 Note that all positions must be accounted for.

• Another example:
2-2 Decimal to Binary Conversion

Repeated Division
• Divide the decimal
number by 2.
• Write the remainder
after each division
until a quotient of
zero is obtained.
• The first remainder
is the LSB.
• The last is the MSB.
2-2 Decimal to Binary Conversion

Repeated Division
• This flowchart
describes the
process and can
be used to convert
from decimal to
any other number
system.
2-2 Decimal to Binary Conversion
2-2 Decimal to Binary Conversion

• Convert 3710 to binary:


2-3 Hexadecimal Number System

• Hexadecimal allows convenient handling


of long binary strings, using groups of 4
bits—Base 16
 16 possible symbols: 0-9 and A-F
2-3 Hexadecimal Number System

Relationships
between
hexadecimal,
decimal, and binary
numbers.
2-3 Hexadecimal Number System
– Hex to Decimal
• Convert from hex to decimal by
multiplying each hex digit by its
positional weight.
• In a 2nd example, the value 10 was substituted
for A and 15 substituted for F.

For practice, verify that 1BC216 is equal to 710610


2-3 Hexadecimal Number System
– Decimal to Hex
• Convert from decimal to hex by using
the repeated division method used for
decimal to binary conversion.
• Divide the decimal number by 16
 The first remainder is the LSB—the last
is the MSB.
2-3 Hexadecimal Number System
– Decimal to Hex
• Convert 42310 to hex:
2-3 Hexadecimal Number System
– Decimal to Hex
• Convert 21410 to hex:
2-3 Hexadecimal Number System
– Hex to Binary
• Leading zeros can be added to the left
of the MSB to fill out the last group.

For practice, verify that BA616 = 1011101001102


2-3 Hexadecimal Number System
– Binary to Hex
• Convert from binary to hex by grouping
bits in four starting with the LSB.
 Each group is then converted to the hex
equivalent
 The binary number is grouped into
groups of four bits & each is converted
to its equivalent hex digit.

For practice, verify that 101011111 2 = 15F16


2-3 Hexadecimal Number System
– Decimal to Hex to Binary
• Convert decimal 378 to a 16-bit binary
number by first converting to
hexadecimal.

 Thus, 37810 = 0001 0111 10102


2-3 Hexadecimal Number System
– Counting in Hex
• When counting in hex, each digit
position can be incremented (increased
by 1) from 0 to F.
 On reaching value F, it is reset to 0, and
the next digit position is incremented.
 For example, .., 38, 39, 3A, 3B, 3C, 3D,
3E, 3F, 40, 41, ….
2-4 BCD Code

• Binary Coded Decimal (BCD) is a widely


used way to present decimal numbers
in binary form.
 Combines features of both decimal and
binary systems.
• Each digit is converted to a binary
equivalent.
2-4 BCD Code

• BCD is not a number system.


 It is a decimal number with each digit
encoded to its binary equivalent.
• A BCD number is not the same as a
straight binary number.
 The primary advantage of BCD is the
relative ease of converting to and from
decimal.
2-4 BCD Code

• Convert the number 87410 to BCD:


 Each decimal digit is represented using
4 bits.
• Each 4-bit group can never be greater
than 9.
2-4 BCD Code

• Convert 0110100000111001 (BCD) to


its decimal equivalent.

Divide the BCD number into four-bit


groups and convert each to decimal.
2-4 BCD Code

• Convert BCD 011111000001 to its


decimal equivalent.

The forbidden group represents


an error in the BCD number.
2-4 BCD Code
2-5 The Gray Code

• The Gray code is used in applications


where numbers change rapidly.
 Only one bit changes from each value to
the next.

Three bit binary


and Gray code
equivalents.
2-5 The Gray Code

Binary to Gray Gray to Binary


2-5 The Gray Code
An eight-position,
three-bit shaft
encoder

These devices produce a binary


value that represents the position
of a rotating mechanical shaft.
2-6 Putting It All Together
Decimal numbers 1 – 15 in binary, hex, BCD,
Gray
2-7 The Byte, Nibble, and Word

• Most microcomputers handle and store


binary data and information in groups
of eight bits.
 8 bits = 1 byte.
• A byte can represent numerous types of
data/information.
• Binary numbers are often broken into
groups of four bits.
2-7 The Byte, Nibble, and Word

 Because a group of four bits is half as


big as a byte, it was named a nibble.
• A word is a group of bits that
represents a certain unit of information.
 Word size can be defined as the
number of bits in the binary word a
digital system operates on.
• PC word size is eight bytes (64 bits).
2-8 Alphanumeric Codes

• Represents characters and functions


found on a computer keyboard.
 26 lowercase & 26 uppercase letters, 10
digits, 7 punctuation marks, 20 to 40
other characters.
• ASCII – American Standard Code for
Information Interchange.
2-8 Alphanumeric Codes

 Seven bit code: 27 = 128 possible code


groups
 Examples of use: transfer information
between computers; computers &
printers; internal storage.
2-8 Alphanumeric Codes
ASCII – American Standard Code for Information
Interchange

See the entire table in your textbook.


2-9 Parity Method for Error
Detection
• Binary data and codes are frequently
moved between locations:
 Digitized voice over a microwave link.
 Storage/retrieval of data from
magnetic/optical disks.
 Communication between computer
systems over telephone lines, using a
modem.
2-9 Parity Method for Error
Detection
• Electrical noise can cause errors during
transmission.
 Spurious fluctuations in voltage or
current present in all electronic
systems.
2-9 Parity Method for Error
Detection
• Many digital systems employ methods
for error detection—and sometimes
correction.
 One of the simplest and most widely
used schemes for error detection is the
parity method.
• The parity method of error detection
requires the addition of an extra bit to
a code group.
2-9 Parity Method for Error
Detection
 Called the parity bit, it can be either a 0
or 1, depending on the number of 1s in
the code group.
• There are two parity methods, even
and odd.
 The transmitter and receiver must
“agree” on the type of parity checking
used.
• Even seems to be used more often.
2-9 Parity Method for Error
Detection
• Even parity method—the total number
of bits in a group including the parity
bit must add up to an even number.
 The binary group 1 0 1 1 would require
the addition of a parity bit 1, making
the group 1 1 0 1 1.
• The parity bit may be added at either
end of a group.
2-9 Parity Method for Error
Detection
• Odd parity method—the total number
of bits in a group including the parity
bit must add up to an odd number.
 The binary group 1 1 1 1 would require
the addition of a parity bit 1, making
the group 1 1 1 1 1.

The parity bit becomes a part of the code word.


Adding a parity bit to the seven-bit ASCII
code produces an eight-bit code.
2-10 Applications

• When ASCII characters are transmitted


there must be a way to tell the receiver
a new character is coming.
 There is often a need to detect errors in
the transmission as well.
• The method of transfer is called
asynchronous data communication.
• An ASCII character must be “framed”
so the receiver knows where the data
begins and ends.
2-10 Applications

 The first bit must always be a start bit


(logic 0).
• ASCII code is sent LSB first and MSB
last.
 After the MSB, a parity bit is appended
to check for transmission errors.
 Transmission is ended by sending a stop
bit (logic 1).
2-10 Applications

You might also like