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

L3-DLD-Introduction To Number Systems 2

The document discusses digital logic design and provides examples of arithmetic operations using signed numbers in 2's complement form, floating point number representation, hexadecimal number representation, and conversions between binary, decimal, and hexadecimal number systems. Key topics covered include addition and subtraction of signed numbers, overflow in arithmetic operations, grouping binary digits to convert to hexadecimal, and using column weights to convert between hexadecimal and decimal.

Uploaded by

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

L3-DLD-Introduction To Number Systems 2

The document discusses digital logic design and provides examples of arithmetic operations using signed numbers in 2's complement form, floating point number representation, hexadecimal number representation, and conversions between binary, decimal, and hexadecimal number systems. Key topics covered include addition and subtraction of signed numbers, overflow in arithmetic operations, grouping binary digits to convert to hexadecimal, and using column weights to convert between hexadecimal and decimal.

Uploaded by

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

DIGITAL LOGIC DESIGN (CEN-120) (3+1)

Faculty:
Shaista Ashraf
Computer Sciences Department,
Bahria University (Karachi Campus)
Summary
Floating Point Numbers

Floating point notation is capable of representing very


large or small numbers by using a form of scientific
notation. A 32-bit single precision number is illustrated.
S E (8 bits) F (23 bits)
Sign bit Biased exponent (+127) Magnitude with MSB dropped
Express the speed of light, c, in single precision floating point
notation. (c = 0.2998 x 109)
In binary, c = 0001 0001 1101 1110 1001 0101 1100 00002.
In scientific notation, c = 1.0001 1101 1110 1001 0101 1100 0000 x 228.
S = 0 because the number is positive. E = 28 + 127 = 15510 = 1001 10112.
F is the next 23 bits after the first 1 is dropped.
In floating point notation, c = 0 10011011 0001 1101 1110 1001 0101 110

Floyd, Digital
Floyd, Digital Fundamentals,
Fundamentals,1010 eded
th th
© 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
Summary
Arithmetic Operations with Signed Numbers

Using the signed number notation with negative


numbers in 2’s complement form simplifies addition
and subtraction of signed numbers.
Rules for addition: Add the two signed numbers. Discard
any final carries. The result is in signed form.
Examples:
00011110 = +30 00001110 = +14 11111111 = -1
00001111 = +15 11101111 = -17 11111000 = -8
00101101 = +45 11111101 = -3 1 11110111 = -9
Discard carry

Floyd, Digital
Floyd, Digital Fundamentals,
Fundamentals,1010 eded
th th
© 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
Summary
Arithmetic Operations with Signed Numbers

Note that if the number of bits required for the answer is


exceeded, overflow will occur. This occurs only if both
numbers have the same sign. The overflow will be
indicated by an incorrect sign bit.
Two examples are:
01000000 = +128 10000001 = -127
01000001 = +129 10000001 = -127
10000001 = -126 Discard carry 100000010 = +2

Wrong! The answer is incorrect


and the sign bit has changed.

Floyd, Digital
Floyd, Digital Fundamentals,
Fundamentals,1010 eded
th th
© 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
Summary
Arithmetic Operations with Signed Numbers

Rules for subtraction: 2’s complement the subtrahend and


add the numbers. Discard any final carries. The result is in
signed form.
Repeat the examples done previously, but subtract:
00011110 (+30) 00001110 (+14) 11111111 (-1)
- 00001111 –(+15) - 11101111 –(-17) - 11111000 –(-8)
2’s complement subtrahend and add:
00011110 = +30 00001110 = +14 11111111 = -1
11110001 = -15 00010001 = +17 00001000 = +8
1 00001111 = +15 00011111 = +31 1 00000111 = +7
Discard carry Discard carry

Floyd, Digital
Floyd, Digital Fundamentals,
Fundamentals,1010 eded
th th
© 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
Summary
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

Floyd, Digital
Floyd, Digital Fundamentals,
Fundamentals,1010 eded
th th
© 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
Summary
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

Floyd, Digital
Floyd, Digital Fundamentals,
Fundamentals,1010 eded
th th
© 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
Summary
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

Floyd, Digital
Floyd, Digital Fundamentals,
Fundamentals,1010 eded
th th
© 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
Summary
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 {
83 8 2 8 1 8 0 .
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

Floyd, Digital
Floyd, Digital Fundamentals,
Fundamentals,1010 eded
th th
© 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
Summary
Decimal Binary BCD
BCD 0 0000 0000
1 0001 0001
Binary coded decimal (BCD) is a 2 0010 0010
weighted code that is commonly 3 0011 0011
used in digital systems when it is 4 0100 0100
5 0101 0101
necessary to show decimal 6 0110 0110
numbers such as in clock displays. 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. 11 1011 0001 0001
12 1100 0001 0010
Notice that the codes 1010 through 13 1101 0001 0011
1111 are not used in BCD. 14 1110 0001 0100
15 1111 0001 0101
Floyd, Digital
Floyd, Digital Fundamentals,
Fundamentals,1010 eded
th th
© 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
Summary
BCD

You can think of BCD in terms of column weights in


groups of four bits. For an 8-bit BCD number, the column
weights are: 80 40 20 10 8 4 2 1.
What are the column weights for the BCD number
1000 0011 0101 1001?

8000 4000 2000 1000 800 400 200 100 80 40 20 10 8 4 2 1


Note that you could add the column weights where there is
a 1 to obtain the decimal number. For this case:
8000 + 200 +100 + 40 + 10 + 8 +1 = 835910

Floyd, Digital
Floyd, Digital Fundamentals,
Fundamentals,1010 eded
th th
© 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
Summary
BCD

A lab experiment in which BCD


is converted to decimal is shown.

Floyd, Digital
Floyd, Digital Fundamentals,
Fundamentals,1010 eded
th th
© 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
Summary
Decimal Binary Gray code
Gray code 0 0000 0000
1 0001 0001
Gray code is an unweighted code 2 0010 0011
that has a single bit change between 3 0011 0010
one code word and the next in a 4 0100 0110
5 0101 0111
sequence. Gray code is used to 6 0110 0101
avoid problems in systems where an 7 0111 0100
error can occur if more than one bit 8 1000 1100
changes at a time. 9 1001 1101
10 1010 1111
11 1011 1110
12 1100 1010
13 1101 1011
14 1110 1001
15 1111 1000
Floyd, Digital
Floyd, Digital Fundamentals,
Fundamentals,1010 eded
th th
© 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
Summary
Gray code

A shaft encoder is a typical application. Three IR


emitter/detectors are used to encode the position of the shaft.
The encoder on the left uses binary and can have three bits
change together, creating a potential error. The encoder on the
right uses gray code and only 1-bit changes, eliminating
potential errors.

Binary sequence
Gray code sequence

Floyd, Digital
Floyd, Digital Fundamentals,
Fundamentals,1010 eded
th th
© 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
Summary
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.
In 1981, IBM introduced extended ASCII, which is an 8-
bit code and increased the character set to 256. Other
extended sets (such as Unicode) have been introduced to
handle characters in languages other than English.

Floyd, Digital
Floyd, Digital Fundamentals,
Fundamentals,1010 eded
th th
© 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
Summary
Parity Method

The parity method is a method of error detection for


simple transmission errors involving one bit (or an odd
number of bits). 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).
The ASCII character for “a” is 1100001 and for “A” is
1000001. What is the correct bit to append to make both of
these have odd parity?
The ASCII “a” has an odd number of bits that are equal to 1;
therefore the parity bit is 0. The ASCII “A” has an even
number of bits that are equal to 1; therefore the parity bit is 1.

Floyd, Digital
Floyd, Digital Fundamentals,
Fundamentals,1010 eded
th th
© 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
Selected Key Terms

Byte A group of eight bits


Floating-point A number representation based on scientific
number notation in which the number consists of an
exponent and a mantissa.
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.
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.
Cyclic A type of error detection code.
redundancy
check (CRC)

You might also like