0% found this document useful (0 votes)
59 views14 pages

Chap. 3 Data Representation

This document discusses how digital computers represent and store different types of data. It covers: - Data types include numbers, letters, and other symbols stored in computer registers for computations and processing. - Common number systems like binary, decimal, hexadecimal use different bases and symbols to represent values. Conversions between these systems are explained. - Complements like 1's and 2's complement are used to simplify subtraction and logical operations in binary systems. - Binary-coded decimal represents each decimal digit with 4 binary bits for efficient storage of numbers. - Alphanumeric characters like ASCII use binary codes to represent letters, numbers and other symbols.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
59 views14 pages

Chap. 3 Data Representation

This document discusses how digital computers represent and store different types of data. It covers: - Data types include numbers, letters, and other symbols stored in computer registers for computations and processing. - Common number systems like binary, decimal, hexadecimal use different bases and symbols to represent values. Conversions between these systems are explained. - Complements like 1's and 2's complement are used to simplify subtraction and logical operations in binary systems. - Binary-coded decimal represents each decimal digit with 4 binary bits for efficient storage of numbers. - Alphanumeric characters like ASCII use binary codes to represent letters, numbers and other symbols.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 14

Chap.

3 Data Representation 3-1

 3-1 Data Types


 Binary information is stored in memory or processor registers
 Registers contain either data or control information
 Data are numbers and other binary-coded information
 Control information is a bit or a group of bits used to specify the sequence
of command signals
 Data types found in the registers of digital computers
 Numbers used in arithmetic computations
 Letters of the alphabet used in data processing
 Other discrete symbols used for specific purpose
» 위의 Number 와 Letter 이외 모두 , 예 ) gray code, error detection code, …
 Number Systems
 Base or Radix r system : uses distinct symbols for r digits
 Most common number system :Decimal, Binary, Octal, Hexadecimal
 Positional-value(weight) System : r2 r 1r0.r-1 r-2 r-3
» Multiply each digit by an integer power of r and then form he sum of all weighted
digits

Computer System Architecture Chap. 3 Data Representation Dept. of Info. Of Computer


3-2

 Decimal System/Base-10 System


 Composed of 10 symbols or numerals(0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0)

 Binary System/Base-2 System


 Composed of 10 symbols or numerals(0, 1)
 Bit = Binary digit

 Hexadecimal System/Base-16 System : Tab. 3-2


 Composed of 16 symbols or numerals(0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D,
E, F)
 Binary-to-Decimal Conversions
1011.1012 = (1 x 23) + (0 x 22)+ (1 x 21) + (1 x 2o) + (1 x 2-1) + (0 x 2-2) + (1 x 2-3)
= 810+ 0 + 210 + 110 + 0.510 + 0 + 0.12510
= 11.62510
 Decimal-to-Binary Conversions 소수점 변환
0.375 x 2 = 0.750 integer 0 MSB
Repeated division(See p. 69, Fig. 3-1) 0.750 x 2 = 1.500 integer 1 .
37 / 2 = 18 remainder 1 (binary number will end with 1) : LSB 0.500 x 2 = 1.000 integer 1 LSB
18 / 2 = 9 remainder 0 Read the result downward .37510 = .0112
9 / 2 = 4 remainder 1
4 / 2 = 2 remainder 0
2 / 2 = 1 remainder 0
1 / 2 = 0 remainder 1 (binary number will start with 1) : MSB
Read the result upward to give an answer of 37 10 = 1001012

Computer System Architecture Chap. 3 Data Representation Dept. of Info. Of Computer


3-3

 Hex-to-Decimal Conversion Table 3-2


Hex Binary Decimal
2AF16 = (2 x 16 ) + (10 x 16 ) + (15 x 16 )
2 1 o 0 0000 0
1 0001 1
= 51210 + 16010 + 1510 2 0010 2
3 0011 3
= 68710 4 0100 4
5 0101 5
 Decimal-to-Hex Conversion 6
7
0110
0111
6
7
8 1000 8
42310 / 16 = 26 remainder 7 (Hex number will end with 7) : LSB 9 1001 9
2610 / 16 = 1 remainder 10 A 1010 10
B 1011 11
110 / 16 = 0 remainder 1 (Hex number will start with 1) : MSB C 1100 12
D 1101 13
Read the result upward to give an answer of 423 10 = 1A716 E 1110 14
F 1111 15

 Hex-to-Binary Conversion  Binary-to-Hex Conversion


9F216 = 9 F 2 1 1 1 0 1 0 0 1 1 02 = 0 0 1 1 1 0 1 0 0 1 1 0

= 1001 1111 0010 3 A 6


= 1001111100102 = 3A616

Computer System Architecture Chap. 3 Data Representation Dept. of Info. Of Computer


3-4

 Binary-Coded-Decimal Code
 Each digit of a decimal number is represented by its binary equivalent

8 7 4 (Decimal)

1000 0111 0100 (BCD)


 Only the four bit binary numbers from 0000 through 1001 are used
 Comparison of BCD and Binary
13710 = 100010012 (Binary) - require only 8 bits
13710 = 0001 0011 0111BCD (BCD) - require 12 bits
 Alphanumeric Representation
 Alphanumeric character set(Tab. 3-4)
» 10 decimal digits, 26 letters, special character($, +, =,….)
» A complete list of ASCII : p. 384, Tab. 11-1
 ASCII(American Standard Code for Information Interchange)
» Standard alphanumeric binary code uses seven bits to code 128 characters

Computer System Architecture Chap. 3 Data Representation Dept. of Info. Of Computer


3-5

 3-2 Complements
 Complements are used in digital computers for simplifying the
subtraction operation and for logical manipulation
 There are two types of complements for base r system
 1) r’s complement 2) (r-1)’s complement
» Binary number : 2’s or 1’s complement
» Decimal number : 10’s or 9’s complement
N : given number
 (r-1)’s Complement r : base
 (r-1)’s Complement of N = (rn-1)-N n : digit number
» 9’s complement of N=546700
(106-1)-546700= (1000000-1)-546700= 999999-546700
= 453299 546700(N) + 453299(9’s com)
=999999
» 1’s complement of N=101101
(26-1)-101101= (1000000-1)-101101= 111111-101101
= 010010 101101(N) + 010010(1’s com)
=111111
 r’s Complement
 r’s Complement of N = rn-N
* r’s Complement
(r-1)’s Complement +1 =(rn-1)-N+1= rn-N
» 10’s complement of 2389= 7610+1= 7611
» 2’s complement of 1101100= 0010011+1= 0010100

Computer System Architecture Chap. 3 Data Representation Dept. of Info. Of Computer


3-6

 Subtraction of Unsigned Numbers (M-N), N0


 1) M + (rn-N)
 2) M  N : Discard end carry, Result = M-N
 3) M  N : No end carry, Result = - r’s complement of (N-M)

» Decimal Example)
M  N 72532(M) - 13250(N) = 59282 MN 13250(M) - 72532(N) = -59282
72532 13250
Discard + 86750 (10’s complement of 13250) + 27468 (10’s complement of 72532)
End Carry 1 59282 0 40718
No End Carry
Result = 59282 Result = -(10’s complement of 40718)
= -(59281+1) = -59282
» Binary Example)
X  Y 1010100(X) - 1000011(Y) = 0010001 XY 1000011(X) - 1010100(Y) = -0010001
1010100 1000011
+ 0111101 (2’s complement of 1000011) + 0101100 (2’s complement of 1010100)
1 0010001 0 1101111
Result = 0010001 Result = -(2’s complement of 1101111)
= -(0010000+1) = -0010001

Computer System Architecture Chap. 3 Data Representation Dept. of Info. Of Computer


3-7

*Numeric Data
1) Fixed Point
 3-3 Fixed-Point Representation 2) Floating Point

 Computers must represent everything with 1’s and 0’s, including the
sign of a number and fixed/floating point number
* 32.25
 Binary/Decimal Point 1) 0.25, 2) 32.0, 3) 32.25
 The position of the binary/decimal point is needed to represent fractions,
integers, or mixed integer-fraction number
 Two ways of specifying the position of the binary point in a register
 1) Fixed Point : the binary point is always fixed in one position
» A binary point in the extreme left of the register(Fraction : 0.xxxxx)
» A binary point in the extreme right of the register(Integer : xxxxx.0)
 The binary point is not actually present, but the number stored in the register is treated
as a fraction or as an integer
 2) Floating Point : the second register is used to designate the position of the
binary point in the first register(refer to 3-4) * MSB for Sign
 Integer Representation +14 -14 “0” is plus +
“1” is minus -
Most
 Signed-magnitude representation 0 0001110 1 0001110
Common  Signed-1’s complement representation 0 0001110 1 1110001
 Signed-2’s complement representation
0 0001110 1 1110010

Computer System Architecture Chap. 3 Data Representation Dept. of Info. Of Computer


3-8

 Arithmetic Addition (-12) + (-13) = -25


 Addition Rules of Ordinary Arithmetic (+12) + (+13) = +25
» The signs are same : sign= common sign, result= add (+25) + (-37)
» The signs are different : sign= larger sign, result= larger-smaller = 37 - 25 = -12
 Addition Rules of the signed 2’s complement *Addition Exam)
» Add the two numbers including their sign bits + 6 00000110 - 6 11111010
» Discard any carry out of the sign bit position + 13 00001101 + 13 00001101
+ 19 00010011 + 7 00000111
 Arithmetic Subtraction
 Subtraction is changed to an Addition + 6 00000110 - 6 11111010
» (± A) - (+ B) = (± A) + (- B) - 13 11110011 - 13 11110011
- 7 11111001 - 19 11101101
» (± A) - ( - B) = (± A) + (+ B)
* Subtraction Exam) (- 6) - ( - 13) = +7
11111010 - 11110011 = 11111010 + 2’s comp of 11110011
Discard = 11111010 + 00001101
End Carry = 1 00000111 = +7

 Overflow
 Two numbers of n digits each are added and the sum occupies n+1 digits
 n + 1 bit cannot be accommodated in a register with a standard length of n
bits(many computer detect the occurrence of an overflow, and a
corresponding F/F is set)
Computer System Architecture Chap. 3 Data Representation Dept. of Info. Of Computer
3-9

 Overflow
 An overflow may occur if the two numbers added are both positive or both
negative
» When two unsigned numbers are added
 an overflow is detected from the end carry out of the MSB position
» When two signed numbers are added * Overflow Exam)
out in out in
 the MSB always represents the sign
carries 0 1 carries 1 0
- the sign bit is treated as part of the number
+ 70 0 1000110 - 70 1 0111010
- the end carry does not indicate an overflow
+ 80 0 1010000 - 80 1 0110000
 Overflow Detection
+ 150 1 0010110 - 150 0 1101010
 Detected by observing the carry into the sign bit position and the carry out of
the sign bit position
 If these two carries are not equal, an overflow
*Decimal Exam) (+375) + (-240)
condition is produced(Exclusive-OR gate = 1) 375 + (10’s comp of 240)= 375 + 760
 Decimal Fixed-Point Representation
0 375 (0000 0011 0111 0101)
 A 4 bit decimal code requires four F/Fs +9 760 (1001 0111 0110 0000)
* Advantage * for each decimal digit 0 135 (0000 0001 0011 0101)
Computer I/O data  The representation of 4385 in BCD requires 16 F/Fs (0100 0011 1000 0101)
are generated by
people who use  The representation in decimal is wasting a considerable amount of storage
the decimal space and the circuits required to perform decimal arithmetic are more complex
system

Computer System Architecture Chap. 3 Data Representation Dept. of Info. Of Computer


3-10

 3-4 Floating-Point Representation


 The floating-point representation of a number has two parts
 1) Mantissa : signed, fixed-point number * Decimal + 6132.789
 2) Exponent : position of binary(decimal) point
Fraction Exponent
+0.6132789 +4
 Scientific notation : m x re (+0.6132789 x 10+4)
 m : mantissa, r : radix, e : exponent
Fraction Exponent
 Example : m x 2e = +(.1001110)2 x 2+4 01001110 000100
 Normalization
 Most significant digit of mantissa is nonzero

 3-5 Other Binary Codes


 Gray Code
 Gray code changes by only one bit (Tab. 3-5 4-bit Gray Code )
 용도 :
» The data must be converted into digital form before they can be used by a digital
computer(Analog to Digital Converter)
» The analog data are represented by the continuous change of a shaft
position(Rotary Encoder of Motor)

Computer System Architecture Chap. 3 Data Representation Dept. of Info. Of Computer


3-11

 Other Decimal Codes


 Binary codes for decimal digits require four bits. A few possibilities are shown
in Tab. 3-6
 Excess-3 Gray Code
» Gray code 로 BCD 표현 시 , 9 에서 0 으로 변하면 1101 에서 0000 으로 되어 3
비트가 동시에 변경되어 Tab. 3-5 에서 3 부터 12 까지 사용하면 0010 에서 101
0 되어 1 비트가 바뀜 .
 Self-Complementing : excess-3 code
» 9’s complement of a decimal number is easily obtained by 1’s
complement(=changing 1’s to 0’s and 0’s to 1’s) * Self-Complement Exam)
 Weighted Code : 2421 code 410 = 0111 (3-excess)
» The bits are multiplied by the weights, and the sum = 1000 ( 1’s comp)
of the weighted bits gives the decimal digit = 510 (3-excess in Tab. 3-6)
= 510( 9’s comp of 4)
 Other Alphanumeric Codes
 ASCII Code 에서 Tab. 3-4 이외 : p. 384, Tab. 11-1
» Format effector : Functional characters for controlling the layout of printing or
display devices(carriage return-CR, line feed-LF, horizontal tab-HT,…)
» Data communication flow control(acknowledge-ACK, escape-ESC, synchronous-
SYN,…)
 EBCDIC(Extended BCD Interchange Code)
» Used in IBM equipment( 제어 문자만 약간 다름 )

Computer System Architecture Chap. 3 Data Representation Dept. of Info. Of Computer


3-12

 3-6 Error Detection Codes


 Binary information transmitted through some form of communication
medium is subject to external noise


Transmitter Receiver

~
 Parity Bit
 An extra bit included with a binary message to make the total number of 1’s
either odd or even(Tab. 3-7)
 Even-parity method
 The value of the parity bit is chosen so that the total number of 1s (including
the parity bit) is an even number
1 1 0 0 0 0 1 1
Added parity bit
 Odd-parity method
 Exactly the same way except that the total number of 1s is an odd number

1 1 0 0 0 0 0 1
Added parity bit

Computer System Architecture Chap. 3 Data Representation Dept. of Info. Of Computer


3-13

 Parity Generator/Checker
 At the sending end, the message is applied to a parity generator
 At the receiving end, all the incoming bits are applied to a parity checker

1 1 0 0 0 0 1 1 “C” 1 1 0 0 0 0 1 0 ”B”
(Even-parity Generator) (Even-parity Checker)

 Can not tell which bit in error


 Can detect only single bit error(odd number of errors)
 3 bit data line example : Fig. 3-3
 4 bit data line example :

Next Page

Computer System Architecture Chap. 3 Data Representation Dept. of Info. Of Computer


3-14

 Odd Parity Generator/Checker


 Truth Table  K-Map(Odd Parity)
A B C D E O C
0 0 0 0 0 1
0 0 0 1 1 0 0 1 3 2
0 0 1 0 1 0 4 5 7 6
0 0 1 1 0 1 B
0 1 0 0 1 0 12 13 15 14
A
0 1 0 1 0 1 8 9 11 10
0 1 1 0 0 1
0 1 1 1 1 0 D
1 0 0 0 1 0  Expression
1 0 0 1 0 1
1 0 1 0 0 1 A B C D  A B CD  A BC D  A BCD  ABC D  ABCD  AB C D  AB CD
1 0 1 1 1 0  A B (C D  CD)  A B (C D  CD )  AB(C D  CD)  AB (C D  CD )
1 1 0 0 0 1  A B (C  D )  A B(C  D )  AB(C  D )  AB (C  D )  : XOR
1 1 0 1 1 0  (C  D )( A B  AB)  (C  D )( A B  AB )  : XNOR
1 1 1 0 1 0  (C  D )( A  B )  (C  D )( A  B )
1 1 1 1 0 1 xCD
 (C  D )( A  B )  (C  D )( A  B )
y  A B
 x y  xy
 x y
 x y
 (C  D )  ( A  B )
 C  D  A B

Computer System Architecture Chap. 3 Data Representation Dept. of Info. Of Computer

You might also like