Digital Logic & Computer Architecture: (Lesson 2)

Digital Logic & Computer
Architecture
(Lesson 2)
Floyd, Digital Fundamentals, 10th ed © 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
Lesson 2
Decimal Numbers
The position of each digit in a number system is assigned a

weight based on the base or radix of the system. The radix
of decimal numbers is ten, because only ten symbols (0
through 9) are used to represent any number.
The column weights of decimal numbers are powers
of ten that increase from right to left beginning with 100 =1:
…105 104 103 102 101 100.
For fractional decimal numbers, the column weights
are negative powers of ten that decrease from left to right:
102 101 100. 10-1 10-2 10-3 10-4 …
Lesson 2
Decimal Numbers
Decimal numbers can be expressed as the sum of the

products of each digit times the column value for that digit.
Thus, the number 9240 can be expressed as
(9 x 103) + (2 x 102) + (4 x 101) + (0 x 100)
or
9 x 1,000 + 2 x 100 + 4 x 10 + 0 x 1
Express the number 480.52 as the sum of values of each
digit.
480.52 = (4 x 102) + (8 x 101) + (0 x 100) + (5 x 10-1) +(2 x 10-2)
Lesson 2
Binary Numbers
For digital systems, the binary number system is used.

Binary has a radix of two and uses the digits 0 and 1 to
represent quantities.
The column weights of binary numbers are powers of
two that increase from right to left beginning with 20 =1:
…25 24 23 22 21 20.
For fractional binary numbers, the column weights
are negative powers of two that decrease from left to right:
22 21 20. 2-1 2-2 2-3 2-4 …
Lesson 2 Decimal Binary
Number Number
Binary Numbers 0 000

0
A binary counting sequence for numbers 1 000
from zero to fifteen is shown. 1
2 001
Notice the pattern of zeros and ones 0
in each column. 3 001
Digital counters frequently have this 1
4 010
same pattern of digits: 0
Counter 0 1 0 1 0 1 0 1 0 1 Decoder
5 010
0 0 1 1 0 0 1 1 0 0
1
0 0 0 0 1 1 1 1 0 0
6 011
0
0 0 0 0 0 0 0 0 1 1
7 011
1
8 100
Floyd, Digital Fundamentals, 10 ed
th
0 Reserved
© 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights
Lesson 2
Binary Conversions
The decimal equivalent of a binary number can be

determined by adding the column values of all of the bits
that are 1 and discarding all of the bits that are 0.
Convert the binary number 100101.01 to decimal.
Start by writing the column weights; then add the
weights that correspond to each 1 in the number.
25 24 23 22 21 20. 2-1 2-2
32 16 8 4 2 1 . ½ ¼
1 0 0 1 0 1. 0 1
32 +4 +1 +¼ = 37¼
Lesson 2
Binary Conversions
You can convert a decimal whole number to binary by

reversing the procedure. Write the decimal weight of each
column and place 1’s in the columns that sum to the decimal
number.
Convert the decimal number 49 to binary.
The column weights double in each position to the
right. Write down column weights until the last
number is larger than the one you want to convert.
26 25 24 23 22 21 20.
64 32 16 8 4 2 1.
0 1 1 0 0 0 1.
Lesson 2
Binary Conversions
You can convert decimal to any other base by repeatedly

dividing by the base. For binary, repeatedly divide by 2:
Convert the decimal number 49 to binary by
repeatedly dividing by 2.
You can do this by “reverse division” and the
answer will read from left to right. Put quotients to
the left and remainders on top.
Answer: remainder
1 1 0 0 0 1
0 1 3 6 12 24 49 2
Continue until the Decimal
Quotient base
last quotient is 0 number
Lesson 2
Binary Addition
The rules for binary addition are

0+0=0 Sum = 0, carry = 0
0+1=1 Sum = 1, carry = 0
1+0=1 Sum = 1, carry = 0
1 + 1 = 10 Sum = 0, carry = 1
When an input carry = 1 due to a previous result, the rules
are
1+0+0=1 Sum = 1, carry = 0
1 + 0 + 1 = 10 Sum = 0, carry = 1
1 + 1 + 0 = 10 Sum = 0, carry = 1
1 + 1 + 1 = 11 Sum = 1, carry = 1
Lesson 2
Binary Addition
Add the binary numbers 00111 and 10101 and show

the equivalent decimal addition.
0111
00111 7
10101 21
11100 = 28
Lesson 2
Binary Subtraction
The rules for binary subtraction are

00=0
11=0
10=1
10  1 = 1 with a borrow of 1
Subtract the binary number 00111 from 10101 and
show the equivalent decimal subtraction.
111
10101
/ / / 21
00111 7
01110 = 14
Lesson 2
1’s Complement
The 1’s complement of a binary number is just the inverse

of the digits. To form the 1’s complement, change all 0’s
to 1’s and all 1’s to 0’s.
For example, the 1’s complement of 11001010 is
00110101
In digital circuits, the 1’s complement is formed by using
inverters:
1 1 0 0 1 0 1 0
0 0 1 1 0 1 0 1
Lesson 2
2’s Complement
The 2’s complement of a binary number is found by

adding 1 to the LSB of the 1’s complement.
Recall that the 1’s complement of 11001010 is
00110101 (1’s complement)
To form the 2’s complement, add 1: +1
1 1 0 0 1 0 1 0 00110110 (2’s complement)
1
0 0 1 1 0 1 0 1
Input bits
Carry
Adder
in (add 1)
Output bits (sum)
0 0 1 1 0 1 1 0
Lesson 2
Decimal Hexadecimal Binary
Hexadecimal Numbers 0 0 0000
1 1 0001
Hexadecimal uses sixteen characters to 2 2 0010
represent numbers: the numbers 0 3 3 0011
through 9 and the alphabetic characters 4 4 0100
A through F. 5 5 0101
6 6 0110
Large binary number can easily 7 7 0111
be converted to hexadecimal by 8 8 1000
grouping bits 4 at a time and writing 9 9 1001
the equivalent hexadecimal character. 10 A 1010
11 B 1011
Express 1001 0110 0000 11102 in 12 C 1100
hexadecimal: 13 D 1101
Group the binary number by 4-bits 14 E 1110
starting from the right. Thus, 960E 15 F 1111
Lesson 2
Decimal Hexadecimal Binary
Hexadecimal Numbers 0 0 0000
1 1 0001
Hexadecimal is a weighted number 2 2 0010
system. The column weights are 3 3 0011
powers of 16, which increase from 4 4 0100
5 5 0101
right to left. 6 6 0110
Column weights 4096{
163 162 161 160.
256 16 1 .
7
8
7
8
0111
1000
9 9 1001
Express 1A2F16 in decimal. 10 A 1010
11 B 1011
Start by writing the column weights:
12 C 1100
4096 256 16 1
13 D 1101
1 A 2 F16
14 E 1110
1(4096) + 10(256) +2(16) +15(1) = 670310 15 F 1111
Lesson 2
Decimal Octal Binary
Octal Numbers 0 0 0000
1 1 0001
Octal uses eight characters the numbers 2 2 0010
0 through 7 to represent numbers. 3 3 0011
There is no 8 or 9 character in octal. 4 4 0100
5 5 0101
Binary number can easily be
6 6 0110
converted to octal by grouping bits 3 at 7 7 0111
a time and writing the equivalent octal 8 10 1000
character for each group. 9 11 1001
10 12 1010
Express 1 001 011 000 001 1102 in
11 13 1011
octal: 12 14 1100
Group the binary number by 3-bits 13 15 1101
starting from the right. Thus, 1130168 14 16 1110
15 17 1111
Lesson 2
Decimal Octal Binary
Octal Numbers 0 0 0000
1 1 0001
Octal is also a weighted number 2 2 0010
system. The column weights are 3 3 0011
powers of 8, which increase from right 4 4 0100
5 5 0101
to left. 6 6 0110
Column weights 512 {
8 3 82 81 80 .
64 8 1 .
7
8
7
10
0111
1000
9 11 1001
Express 37028 in decimal. 10 12 1010
11 13 1011
Start by writing the column weights:
12 14 1100
512 64 8 1
13 15 1101
3 7 0 28
14 16 1110
3(512) + 7(64) +0(8) +2(1) = 198610 15 17 1111
Lesson 2
Decimal Binary BCD
BCD 0 0000 0000
1 0001 0001
Binary coded decimal (BCD) is a 2 0010 0010
weighted code that is commonly used in 3 0011 0011
digital systems when it is necessary to 4 0100 0100
show decimal numbers in a binary code 5 0101 0101
such as in clock displays. 6 0110 0110
7 0111 0111
The table illustrates the
8 1000 1000
difference between straight binary and
9 1001 1001
BCD. BCD represents each decimal
10 1010 0001 0000
digit with a 4-bit code. Notice that the
11 1011 0001 0001
codes 1010 through 1111 are not used in
12 1100 0001 0010
BCD.
13 1101 0001 0011
14 1110 0001 0100
15 1111 0001 0101
Lesson 2
BCD Addition
Step 1: Add the two binary numbers.
Step 2: If a 4-bit sum is equal to or less than 9, it is a valid BCD number.
Step 3: If its greater than 9 or if a carry is generated, its an invalid result. Add
6 (0110) to the 4-bit sum.
Add the following BCD numbers.

0010 0011 23 0100 0101 0000 450
+0001 0101 +15 +0100 0001 0111 +417
0011 1000 38 1000 0110 0111 867
In these cases,
a) 1001 9
+ 0100 +4
1101 13 Invalid BCD number (>9)
+ 0110 (Add 6)
0001 0011 Valid BCD number
1 3
b) 1001 9
+ 1001 +9
1 0010 18 Invalid BCD number (>9, because of carry)
+ 0110 (Add 6)
0001 1000 Valid BCD number
1 8
Lesson 2
ASCII
ASCII is a code for alphanumeric characters and control

characters. In its original form, ASCII encoded 128
characters and symbols using 7-bits. The first 32 characters
are control characters, that are based on obsolete teletype
requirements, so these characters are generally assigned to
other functions in modern usage.
Lesson 2
Parity Method
The parity method is a method of error detection for simple
transmission errors involving one bit. A parity bit is an “extra” bit
attached to a group of bits to force the number of 1’s to be either
even (even parity) or odd (odd parity). Total number of 1’s
including the parity bit is always even for even parity and odd for
odd parity.
Assign even parity to the following code groups:

a) 1010 b)111000 c) 101101 d) 100011100101
Parity bit is the left most bit. Make the parity bit either 1 or 0 to
make total number of 1’s even.
a) 01010 b) 1111000 c) 0101101 d) 0100011100101
Lesson 2
Cyclic Redundancy Check
The cyclic redundancy check (CRC) is an error

detection method in digital transmission in
larger blocks of data, but not for making
corrections. At the sending end, a checksum is
appended to a block of data. At the receiving
end, the checksum is generated and compared to
the sent checksum. If the check sums are the
same, no error is detected.
Selected Key Terms
Alphanumeric Consisting of numerals, letters, and other

characters
ASCII American Standard Code for Information
Interchange; the most widely used alphanumeric
code.
Parity In relation to binary codes, the condition of
evenness or oddness in the number of 1s in a code
group.
Selected Key Terms
Byte A group of eight bits

Hexadecimal A number system with a base of 16.
Octal A number system with a base of 8.
BCD Binary coded decimal; a digital code in which each
of the decimal digits, 0 through 9, is represented by
a group of four bits.

Digital Logic & Computer Architecture: (Lesson 2)

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Digital Logic & Computer Architecture: (Lesson 2)

Uploaded by

Copyright:

Available Formats

Digital Logic & Computer

The position of each digit in a number system is assigned a

Decimal numbers can be expressed as the sum of the

480.52 = (4 x 102) + (8 x 101) + (0 x 100) + (5 x 10-1) +(2 x 10-2)

For digital systems, the binary number system is used.

Binary Numbers 0 000

The decimal equivalent of a binary number can be

You can convert a decimal whole number to binary by

You can convert decimal to any other base by repeatedly

The rules for binary addition are

Add the binary numbers 00111 and 10101 and show

The rules for binary subtraction are

The 1’s complement of a binary number is just the inverse

The 2’s complement of a binary number is found by

Add the following BCD numbers.

ASCII is a code for alphanumeric characters and control

Assign even parity to the following code groups:

The cyclic redundancy check (CRC) is an error

Alphanumeric Consisting of numerals, letters, and other

Byte A group of eight bits

You might also like