ece 645 – computer arithmetic lecture 2: number representations (2) ece 645—computer arithmetic...
TRANSCRIPT
![Page 1: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/1.jpg)
ECE 645 – Computer Arithmetic
Lecture 2:Number Representations (2)
ECE 645—Computer Arithmetic1/29/08
![Page 2: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/2.jpg)
2
Lecture Roadmap
• Number systems (cont'd)• Floating point number system representations• Residue number number systems • Galois Field number systems
• Endian-ness• Big endian• Little endian
![Page 3: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/3.jpg)
3
Required Reading
• B. Parhami, Computer Arithmetic: Algorithms and Hardware Design• Chapter 17, Floating-Point Representations (17.1 – 17.4,
17.6)• Chapter 4, Residue Number Systems (4.1, 4.3)
• Note errata at:• http://www.ece.ucsb.edu/~parhami/text_comp_arit.htm#errors
![Page 4: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/4.jpg)
Floating Point Number Systems
ECE 645 – Computer Arithmetic
![Page 5: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/5.jpg)
5
Number Systems
• Modern number systems used in digital arithmetic can be broadly classified as:• Fixed-point number representation systems
• Integers I = {-N, …., N}• Rational numbers of the form x = a/2f, a is an integer, f is a positive integer
• Floating-point number representation systems• x * bE, where x is a rational number, b the integer base, and E the exponent
• There are also special number representation systems:• Residue number systems• Galois Field number systems
![Page 6: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/6.jpg)
6
Real Numbers
![Page 7: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/7.jpg)
7
Fixed Point Numbers
![Page 8: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/8.jpg)
8
Floating Point Numbers
• Floating point range of values is [-max,-min] and [min,max]• max = largest significand x blargest exponent
• min = smallest significand x bsmallest exponent
![Page 9: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/9.jpg)
9
Floating Point Format
![Page 10: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/10.jpg)
10
Spacing of Floating Point Numbers
![Page 11: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/11.jpg)
11
ANSI/IEEE Short and Double Precision
![Page 12: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/12.jpg)
12
Short (32-bit) format
Long (64-bit) format
Sign Exponent Significand
8 bits, bias = 127, –126 to 127
11 bits, bias = 1023, –1022 to 1023
52 bits for fractional part (plus hidden 1 in integer part)
23 bits for fractional part (plus hidden 1 in integer part)
IEEE 754 Standard(now being revised to yield IEEE 754R)
Fig. 17.3 The ANSI/IEEE Standard Floating-Point Number Representation Formats
![Page 13: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/13.jpg)
13
Table 17.1 ANSI/IEEE Standard Floating Point Number Representation Formats
![Page 14: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/14.jpg)
14
Exponent Encoding
00 01 7F FE FF7E 800 1 127 254 255126 128
–126 0 +127–1 +1
Decimal codeHex code
Exponent value
f = 0: Representation of 0f 0: Representation of denormals, 0.f 2–126
f = 0: Representation of f 0: Representation of NaNs
Exponent encoding in 8 bits for the single/short (32-bit) ANSI/IEEE format
Exponent encoding in 11 bits for the double/long (64-bit) format is similar
Denser Denser Sparser Sparser
Negative numbers FLP FLP 0 +
–
Overflow region
Overflow region
Underflow regions
Positive numbers
Underflow example
Overflow example
Midway example
Typical example
min max min max + + – – – +
1.f 2e
![Page 15: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/15.jpg)
15
Exceptions
![Page 16: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/16.jpg)
16
Special Operands
![Page 17: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/17.jpg)
17
Denormals in the IEEE Single-Precision Format
• Denormals defined as numbers without a hidden 1 and with the smallest possible exponent
• Provided to make the effect of underflow less abrupt• Requires extra hardware overhead
![Page 18: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/18.jpg)
18
Other Features of IEEE standard
![Page 19: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/19.jpg)
19
Floating-Point Rounding Modes
![Page 20: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/20.jpg)
20
Fixed-Point and Logarithmic Number Systems
• Fixed-point can be roughly viewed as case of floating-point with exponent equal to 0 (making exponent field unecessary)
• Logarithmic number systems is the other extreme (assuming the significant field is always 1)
![Page 21: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/21.jpg)
21
Logarithmic Number System
Sign-and-logarithm number system: Limiting case of FLP representation
x = ± be 1 e = logb |x|
We usually call b the logarithm base, not exponent base
Using an integer-valued e wouldn’t be very useful, so we consider e to be a fixed-point number
Sign
Implied radix point
e±
Fixed-point exponent
Fig. 17.13 Logarithmic number representation with sign and fixed-point exponent.
![Page 22: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/22.jpg)
Residue Number Systems
ECE 645 – Computer Arithmetic
![Page 23: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/23.jpg)
23
Divisibility Rulesand
Operations Modulo
![Page 24: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/24.jpg)
24
a | b iff c Z such that b = c a
a | b a divides b a is a divisor of b
a | b a does not divide b a is not a divisor of b
Divisibility
![Page 25: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/25.jpg)
25
-3 | 18 14 | 7 7 | 63 -13 | 65 14 | 21 14 | 14
0 | 63 7 | 0 -5 | 0 0 | 0
True or False?
![Page 26: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/26.jpg)
26
Given integers a and n, n>0
! q, r Z such that
a = q n + r and 0 r < n
q – quotient
r – remainder (of a divided by n)
q = an = a div n
r = a - q n = a – an
n =
= a mod n
Quotient and Remainder
![Page 27: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/27.jpg)
27
32 mod 5 =
-32 mod 5 =
Examples
![Page 28: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/28.jpg)
28
Two integers a and b are congruent modulo n
(equivalent modulo n)
written a b
iff
a mod n = b mod n
or
a = b + kn, k Z
or
n | a - b
Integers Congruent modulo n
![Page 29: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/29.jpg)
29
a + b mod n = ((a mod n) + (b mod n)) mod n
a - b mod n = ((a mod n) - (b mod n)) mod n
a b mod n = ((a mod n) (b mod n)) mod n
Addition, Subtraction, Multiplication modulo n
![Page 30: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/30.jpg)
30
9 · 13 mod 5 =
25 · 25 mod 26 =
Examples
![Page 31: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/31.jpg)
31
Chinese Remainder Theorem: Intro
![Page 32: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/32.jpg)
32
LetN = n1 n2 n3 . . . nM
andfor any i, j gcd(ni, nj) = 1
Then, any number 0 A N-1 RANGE OF NUMBER
can be represented uniquely by
A (a1 = A mod n1, a2 = A mod n2, …, aM = A mod nM)
A can be reconstructed from (a1, a2, …, aM) using equation
A = i=1
M
(ai Ni Ni-1 mod ni) mod N
where Ni = Nni
= n1 n2 ... ni-1 ni+1 ... nM
=
Chinese Remainder Theorem
![Page 33: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/33.jpg)
33
The multiplicative inverse of a modulo n is an integer [!!!]
x such that
a x 1 (mod n)
The multiplicative inverse of a modulo n is denoted by
a-1 mod n (in some books a or a*).
According to this notation:
a a-1 1 (mod n)
Multiplicative Inverse Modulo n
![Page 34: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/34.jpg)
34
3-1 mod 11 =
9-1 mod 26 =
5-1 mod 26 =
15-1 mod 13 =
Examples
![Page 35: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/35.jpg)
35
Residue Number System Arithmetic
• Range of number in RNS(8|7|5|3) is 0 to 8*7*5*3 = 840 or (-420 to +419) or any other interval of 840 consecutive integers
• (7|6|4|2) represents -1 or 839 or …
![Page 36: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/36.jpg)
36
RNS Hardware Arithmetic
![Page 37: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/37.jpg)
37
M C = f(M) = Me mod N C
M = f-1(C) = Cd mod N
PUBLIC KEY
PRIVATE KEY
N = P Q P, Q - large prime numbers
e d 1 mod ((P-1)(Q-1))
RSA as a trapdoor one way function
![Page 38: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/38.jpg)
38
N = P Q gcd(P, Q) = 1
M (Mp = M mod P, MQ = M mod Q)
M = MP NP
NP
-1mod P + N
Q N
Q
-1mod Q MQ mod N
= MP Q ((Q-1) mod P) + MQ P ((P-1) mod Q) mod N =
= MP RQ + MQ RP mod N
Chinese Remainder Theorem for N=P∙Q
greatest common divisor
![Page 39: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/39.jpg)
39
=MPCP P
dP
mod =MQCQ Q
dQ
mod
CP = C mod PdP = d mod (P-1)
CQ = C mod QdQ = d mod (Q-1)
= modCM
d
N
M = MP ·RQ + MQ ·RP mod Nwhere
RP = (P-1 mod Q) ·P = PQ-1 mod N
RQ = (Q-1 mod P) ·Q= QP-1 mod N
Fast Modular Exponentiation Using Chinese Remainder Theorem
![Page 40: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/40.jpg)
40
SOFTWARE
HARDWARE
Without CRT
With CRT
tEXP(k) = cs k3
tEXP-CRT(k) 2 cs ( )3 = tEXP(k)14
Without CRT
With CRT
tEXP(k) = ch k2
tEXP-CRT(k) ch ( )2 = tEXP(k)14
k2
k2
Time of Exponentiation without and with Chinese Remainder Theorem
![Page 41: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/41.jpg)
Galois Field Number Systems
ECE 645 – Computer Arithmetic
![Page 42: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/42.jpg)
42
Polynomial Representationof the Galois Field
Elements
![Page 43: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/43.jpg)
43
Evariste Galois (1811-1832)
![Page 44: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/44.jpg)
44
Studied the problem of finding algebraic solutions for the general
equations of the degree 5, e.g.,
f(x) = a5x5+ a4x4+ a3x3+ a2x2+ a1x+ a0 = 0
Answered definitely the question which specific equations of
a given degree have algebraic solutions
On the way, he developed group theory,
one of the most important branches of modern mathematics.
Evariste Galois (1811-1832)
![Page 45: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/45.jpg)
45
1829 Galois submits his results for the first time to the French Academy of Sciences
Reviewer 1 Augustin-Luis Cauchy forgot or lost the communication
1830 Galois submits the revised version of his manuscript,hoping to enter the competition for the Grand Prizein mathematics
Reviewer 2 Joseph Fourier – died shortly after receiving the manuscript
1831 Third submission to the French Academy of SciencesReviewer 3
Simeon-Denis Poisson – did not understand the manuscript and rejected it.
Evariste Galois (1811-1832)
![Page 46: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/46.jpg)
46
May 1832 Galois provoked into a duel
The night before the duel he writes a letter to his friend containing the summary of his discoveries.
The letter ends with a plea: “Eventually there will be, I hope, some people who
will find it profitable to decipher this mess.”
May 30, 1832 Galois is grievously wounded in the duel and dies in the hospital the following day.
1843 Galois manuscript rediscovered by Joseph Liouville
1846 Galois manuscript published forthe first time in a mathematical journal
Evariste Galois (1811-1832)
![Page 47: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/47.jpg)
47
![Page 48: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/48.jpg)
48
Set F, and two operations typically denoted by (but not necessarily equivalent to)
+ and *
Set F, and definitions of these two operations must fulfill special conditions.
Definition of Field
![Page 49: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/49.jpg)
49
{ set Zp={0, 1, 2, … , p-1}, + (mod p): addition modulo p, * (mod p): multiplication modulo p}
Infinite fields
Finite fields
{ R= set of real numbers, + addition of real numbers * multiplication of real numbers}
Examples of Fields
![Page 50: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/50.jpg)
50
GF(p) GF(2m)
Polynomial basisrepresentation
Normal basisrepresentation
Fast in hardware
Arithmetic operations
presentin many libraries
Fast squaring
GF(pm)p – primepm – number of elements in the field
Most significantspecial cases
Finite Fields = Galois Fields
![Page 51: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/51.jpg)
51
Binary representation (used for storing and processing in computer systems):
Polynomial representation(used for the definition of basic arithmetic operations):
A = (am-1, am-2, …, a2, a1, a0) ai {0, 1}
A(x) = aixi = am-1xm-1 + am-2xm-2 + …+ a2x2 + a1x+a0
multiplication+ addition modulo 2 (XOR)
i=0
m-1
Elements of the Galois Field GF(2m)
![Page 52: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/52.jpg)
52
Inputs
A = (am-1, am-2, …, a2, a1, a0)B = (bm-1, bm-2, …, b2, b1, b0)
ai , bi {0, 1}
Output
C = (cm-1, cm-2, …, c2, c1, c0) ci {0, 1}
Addition and Multiplication in the Galois Field GF(2m)
![Page 53: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/53.jpg)
53
Addition
A A(x)B B(x)C C(x) = A(x) + B(x) = = (am-1+bm-1)xm-1 + (am-2+bm-2)xm-2+ …+ + (a2+b2)x2 + (a1+b1)x + (a0+b0) = = cm-1xm-1 + cm-2xm-2 + …+ c2x2 + c1x+c0
multiplication+ addition modulo 2 (XOR)
ci = ai + bi = ai XOR bi
C = A XOR B
Addition in the Galois Field GF(2m)
![Page 54: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/54.jpg)
54
Multiplication
A A(x)B B(x)C C(x) = A(x) B(x) mod P(X) = cm-1xm-1 + cm-2xm-2 + …+ c2x2 + c1x+c0
P(x) - irreducible polynomial of the degree m
P(x) = pmxm + pm-1xm-1 + …+ p2x2 + p1x+p0
Multiplication in the Galois Field GF(2m)
![Page 55: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/55.jpg)
55
Applications
• Galois fields/finite fields used in cryptography and coding theory
![Page 56: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/56.jpg)
Little-Endian and Big-EndianRepresentation of Integers
ECE 645 – Computer Arithmetic
![Page 57: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/57.jpg)
57
A0 B1 C2 D3 E4 F5 67 8916
LSBMSB
MSB = A0
B1
C2D3
E4F5
67LSB = 89
Big-Endian Little-Endian
LSB = 89
0
MAX
67
F5E4
D3C2
B1MSB = A0
address
Little-Endian vs Big-Endian Representation
![Page 58: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/58.jpg)
58
Big-Endian Little-Endian
0
MAX
address
MSB
LSB
. . .
LSB
MSB
. . .
Motorola 68xx, 680x0 Intel
IBM
Hewlett-PackardDEC VAX
Internet TCP/IP
Sun SuperSPARC
Bi-Endian
Motorola Power PC
Silicon Graphics MIPS
RS 232
AMD
Little-Endian vs Big-Endian Camps
![Page 59: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/59.jpg)
59
Jonathan Swift, Gulliver’s Travels
• A law requiring all citizens of Lilliput to break their soft-eggs
at the little ends only
• A civil war breaking between the Little Endians and
the Big-Endians, resulting in the Big Endians taking refuge on
a nearby island, the kingdom of Blefuscu
• Satire over holy wars between Protestant Church of England
and the Catholic Church of France
Little Endian versus Big Endian: Origin
![Page 60: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/60.jpg)
60
![Page 61: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/61.jpg)
61
Big-Endian Little-Endian
• easier to determine a sign of the number
• easier to compare two numbers
• easier to divide two numbers
• easier to print
• easier addition and multiplication of multiprecision numbers
Comparing Little-Endian and Big-Endian
![Page 62: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/62.jpg)
62
89
67
F5E4
D3C2
B1
A0
Big-Endian Little-Endian
0
MAX
address
int * iptr;
(* iptr) = 8967; (* iptr) = 6789;
iptr+1
Pointers (1)
![Page 63: ECE 645 – Computer Arithmetic Lecture 2: Number Representations (2) ECE 645—Computer Arithmetic 1/29/08](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649f4c5503460f94c6cf6f/html5/thumbnails/63.jpg)
63
89
67
F5E4
D3C2
B1
A0
Big-Endian Little-Endian
0
MAX
address
long int * lptr;
(* lptr) = 8967F5E4; (* lptr) = E4F56789;
lptr + 1
Pointers (2)