Titel dieser Folie SMU该箔SMU的标题.pptVIP

CSE 8351Computer ArithmeticFall 2005Instructors: Peter-Michael Seidel II. Simple Algorithms for Arithmetic Unit Design in Hardware Addition/Multiplication/ SRT Division/Square Root /Reciprocal Approximation Arithmetic Unit Design in Hardware Input Interface: n-bit operands A, B Output Interface: n-bit result C Arithmetic Function: f: Bn x Bn ? Bn What is different from other (“non-arithmetic”) Hardware Units Arithmetic Unit Design in Hardware Specification Truth tables not feasible (22n x n entries) for n=64 more than a Gogool Complexity there are 2^(22n x n) different functions for n=64 more than a Gogoolplex Only a handful Interesting/Used out of a Gogoolplex !!! Other forms of specification possible Arithmetic functions supported Functions interesting because of specific properties that arise at operand level: - use mathematic formalism to specify functionality, e.g. For defined values A, B, C in N: C = f(A,B) = A + B - does not directly help in implementing or testing - use tools from the (well established) science of mathematics to transform equation and extract local properties - help use oflimited global influence, local computation, reuse, recurrence … Notations, Representations, Values Bit strings: sequences of bits (concatenation also by (..,..,..) ) a = 0011010 = (001,10,10) For bit and natural numbers n : : string consisting of n copies of x Bits of strings are indexed from right (0) to left (n-1): or Binary representation Natural number with binary representation : Range of numbers which have a binary representation of length n : n -bit binary representation of a natural number : with Two’s complement representation Natural number with two’s complement representation : Range of numbers with two’s complement representation of leng