Representation of Numbers and Arithmetic in Signal Processors

Size: px

Start display at page:

Download "Representation of Numbers and Arithmetic in Signal Processors"

Cathleen Cain
6 years ago
Views:

1 Representation of Numbers and Arithmetic in Signal Processors 1. General facts Without having any information regarding the used consensus for representing binary numbers in a computer, no exact value can be attributed to a binary number, the number being represented by a string of bits. For instance, what is the decimal value for B = X? Is it a positive or a negative value? It depends on the representation used. In choosing a Digital Signal Processor (DSP) for a certain application one of the important criteria in the decision process is the data (binary) representation by the processor. From this point of view the commercial market of DSPs can be classified as shown in figure 1. Fig. 1 Regular DSPs number representation The fixed point arithmetic was used by the first DSPs and is still used in most DSPs nowadays. Fixed point DSPs can represent numbers either by: integer (integer arithmetic) used by a DSP in control operations, computing of addresses and other operations that cannot concern signals, or fractional (fractional arithmetic) with values between -1 and +1, useful in signal computations The algorithms and the hard drive used in implementing the fractional arithmetic are virtually identical to the ones used by the integer arithmetic. The main difference between the two types of arithmetic is in the usage of the results of the multiplication operations. Most of the DSPs in fixed point accept both arithmetic. Because the numerical systems use a word of a certain length for numeral representation, arithmetical operations will thus be executed with a certain (limited) precision. Numbers will be 1

2 thus represented on a circle (ring) instead of the infinite real axis, a situation in which arithmetical overflow may occur. In the case of floating point DSPs, the values are represented by a mantissa and an exponent according to the relationship mantissa*2 exponent. The mantissa is generally a fractional number between -1.0 and +1.0, whereas the exponent is an integer that represents the number of positions that the binary point (term defined in analogy with the decimal point) must be moved leftward to obtain the represented value. Floating point processors are easier to program in comparison with those in fixed point, but are more expensive as well. This is due to the increased complexity of the circuit that determines a greater surface of the chip. The ease of programming for these processors is given by the fact that the programmer has no recurring need to manage the overflow cases of the buffer as with the case of the fixed point processors (this management represents periodical scaling of the result in different phases of development). Most of the low cost applications require the use of fixed point processors. In this case, programming requires usually no difficulties because the numerical simulation phase of the algorithm (the one phase that precedes development), easily detects all the situations in which a correction of the result in necessary to avoid saturation. For a better understanding of the overflow phenomena, we will present two instances which are to be met when dealing with DSPs or processors supporting the MMx technology. This are: wraparound (modulo 2 n ) and saturation. For example, we will present an image based application: having the original image on a grayscale (Fig.2a) we can obtain the wraparound effect (Fig. 2b) and the saturation effect (Fig. 2c) using the following processing steps: - if the addition result between pixels and the value produces overflow, the result is truncated, taking in consideration the least significant bits (the wraparound effect), due to the limitation to n bits; - if the addition result produces overflow, saturation occurs and the result is limited to the maximum value of the domain; Fig2. a) Grayscale original image; b) Modulo 2 n operation c) Saturation Small numbers represent areas with dark (black) grayscale, while large numbers represent lightly colored areas (white). By using 8 bits for representing the pixel values in the image, we will obtain the [0; 255] range, with 0 standing for black and 255 for white. In order to lighten the original image (Fig. 2a), we can add an integer positive number (e.g =40 h ) for each pixel in the image. 2

3 In the case of the wraparound effect (modulo 2 8 ), if there is any overflow (the value of a pixel overflows the maximum threshold of 255), the final result will be truncated such that only the least significant bits will be retained. For instance, if we add to (almost white), we will obtain: 250 decimal binary + 64 decimal binary = 314 decimal = binary -an overflow occurs = 58 decimal = binary -we keep only the least significant 8 bits The result is 58 10, creating a dark colored area (close to black) instead of a lighter colored one, as expected. A reversed effect to the desired one was obtained (shade inversion) because the light shade values have become dark shade areas. In case of saturation, by adding a value to every pixel in the original image, light colored areas will become purely white. Saturation threshold in this case is the maximum value that can be represented on 8 bits, that is 255. Fig. 3 a)obtaining the pixel values in case of modulo 2 8 b)obtaining pixel values in case of saturation 2. Integer representation On an n bit word we can represent 2 n numbers in the range of numbers equally spaced by the quantization step q=1. The unsigned binary representation, for an n bit word is: B 2 = b n-1 b n-2. b 1 b 0 with the decimal value: B 10 = b n-1 *2 n-1 + +b 1 *2+b 0 placed in the [0, 2 n -1] range. Figure 4 shows the wheel of numbers on which several properties of addition can be verified for values represented by a finite number of bits, in this case n=4. Fig. 4 The wheel of unsigned numbers represented on 4 bits 3

4 Example: By using the 4 bit unsigned representation we will increment the greatest representative number this way: = = = 0 10, the number is no longer a 4 bit number, overflow has occurred! Transport bit Binary unsigned numbers on n bits represent a modulo 2 n system! In order to represent binary negative numbers (with sign) we use the representation in two s complement. A two complement number on n bits is: B 2 = b n-1 b n-2 b 1 b 0, with the decimal value: B 10 = -b n-1 *2 n-1 + +b 1 *2 + b 0 placed in the [-2 n-1, 2 n-1-1] range. Fig. 5 The wheel of signed numbers represented on 4 bits Observation: In the decimal representation and are identical, but in the two s complement representation for numbers and we cannot assume the same thing. Why is that? In the decimal representation we use as a sign a special character (-), while in the binary representation the sign is given by the sign bit. This is why the decimal value of the number depends on the length on which it is represented. If on 5 bits the value is 10 10, whereas on 4 bits the value is Properties: The product of 2 integer binary numbers in fixed point represented on n bits will generate a result on 2n bits The addition of 2 numbers represented on n bits can gine a result on n+1 bits The multiplication of 2 integers in fixed point has a great probability of overflow. 4

5 On N successive additions log 2 (N) supplementary bits are needed to avoid overflow. Example: By using the fixed point representation on 4 bits is to be done the following multiplication: 3 10 with Observation: The result is an 8 bits number and not to be forgotten is the sign extension regarding the length of the resulting word = = = If we go back to the 4 bit representation the result will be = -6 10, so it is correct. Example: Compute the product in fixed point on 4 bits between the numbers and = = = If we go back to the 4 bit representation the result will be = -2 10, so it is not correct. Properties: For any sequence of operations in which the final result can be correctly represented in the given range we can calculate correctly the final result even if overflows appear on intermediate results. Example: By using the 4 bit signed representation ([-8, 7) range) calculate the expression: = (overflow) (correct) 5

6 3. Fractional representation In order to avoid the overflow issue, the fractional representation in fixed point limits or normalizes the numbers in the range [-1.0, 1.0] solving the problem. Exception: (-1)*(-1) = +1! which does not belong to the [-1, +1) range. Overflow is still possible when adding or subtracting! Observations: 1. The result of multiplication is truncated resulting in precision losses by removal of the least significant bits. 2. The fractional representation on n bits is obtained through shifting the point with n-1 positions to the left, meaning that the representation contains a sign bit, radix point and n- 1 fractional bits, so: B 2fractional = b 0 b 1..b n-2 b n-1, with the decimal value B10 = -b 0 * b 1 * b n-1 * 2 -(n-1). 3. The quantization step is q=2 -(n-1). The fractional representation is also known as the Qx representation, where x is the n bits fractional number. The total number of bits of the representation is x+1. This representation is usual for fixed point (16 bits) DSPs is Q15. The point location is not necessarily specified this being a programming instrument. Therefore by using the 16 bit representation, the range of numbers can be: [0, 65535] - on the unsigned integer representation [-32768, ] - on the signed integer representation [-1, ] - on the fractional representation All this variants are used on the DSP applications. Fig. 6 The wheel of numbers for 4 bits fractional representation 6

7 Observation: By adding two binary numbers they must be represented through the same convention. Examples: Represent in the following format: a) Q3, the numbers and 0.75 In fixed point DSPs the radix point (decimal) is not available, because it is the programmer s duty. In arithmetical operations with fractional data or signed we use the same logic and arithmetic unit (UAL). Fractional representation is obtained by scaling the value 2 x where x is the number of fractional bits. Therefore: = * 2 3 = = = * 2 3 = = 6 10 b) Q15, the number X 10 = E-003 We compute X*2 15 = (~ -295), which if written as a two s complement is X Q15 = 0FED9h. Multiply by using the fractional representation on 4 bits: c) with Observation: Pay attention to the sign extension. The result will have 6 fractional bits out of = = = Supplementary sign bit We go back to the 4 bits representation: = = which is a correct number. d) with * = = We go back to the 4 bits representation: 7

8 = = which is incorrect due to truncation. e) with in Q15 format * Q 30 format We pass on to the Q15 format by eliminating the supplementary sign bit and obtaining: = , correct. Advantage: Through the use of binary functions we obtain a higher speed in closed loop computations. Disadvantage: The result may not be exact. As from above the memory stores the value (-4/16). Bits stretched between 2-4 and 2-6 have been truncated. The correct result is (-3/16)! It is worth mentioning that the 4 bit multiplication is not done at a real capacity of C28x operating on 32 bits. In such case truncation will affect bits between 2-32 and In most cases only the noise is truncated. Despite of this, some reaction apps (such as IIR filters) can be affected by errors and lead to a certain level of instability. It is the programmer s duty to observe this potential source of failure in view of the use of binary functions. 4. Operations with numbers greater than 1 a) All coefficients in the algorithm are scaled so they belong to the [-1,1) range. The effect is an attenuated output signal that keeps the frequency response. b) The properties of integer multiplication with the unity are used: A*B=(A-1)*B+B Example: Multiply the sample X i =0.625 with the coefficient We assume the 4 bit representation * = ( ) * = * = * * We come back to the 4 bit representation (Q3): = rounding due to limited number of bits. c) Use of 2 s integer multiplication property: A*B=A/2 * B + A/2 * B 8

9 Example: * = , represent in Q3: 1.375/2 = = which in rounded Q3 is = * = = ~ * = = ~ (in Q3 format) 5. Floating point representation The core of a floating point processor is an arithmetical unit that supports floating point operations as stated in the IEEE 754/85 standard. A typical example for this class is the x86 family from Intel, starting with the 486 processor. Floating point processors are very efficient when operating with floating point data and allow a very large range of numerical computations. These processors are not that efficient in task control (bit manipulation, input/output control, interruption response) and besides they are pretty expensive. The IEEE 754/85 includes finite numbers of binary (2 base) or decimal (10 base) nature. The numerical value of the finite number will be given by the formula: (-1) s f b e, where b is the number base. Every number is described through 3 parameters: s-the sign (0 or 1), f-mantissa and e-exponent. For instance, if the sign is 1 (a negative number), the mantissa is 12345, the exponent is -3 and we consider base 10, then the number will be Every possible finite value can be represented by a certain format are determined by the: numeration base, the maximum number of digits in the mantissa (that define the precision p) and the maximum value of the exponent, emax. The mantissa needs to be an integer number in the [0; b p -1] domain. The exponent has to be an integer so that 1-emax q+p-1 emax. The IEEE 754/85 standard defines 5 basic forms: three binary forms (that can code numbers on 32, 64 or 128 bits) and two decimals (can code numbers on 64 or 128 bits). The binary format for 32 bits simple precision in floating point describes floating point numbers as: s e e e e e e e e f f f f f f f f f f f f f f f f f f f f f f f 1 sign bit, 8 bit exponent, 23 bit mantissa (fractional bits) S=sign bit e e=8 bits that represent the exponent f f=23 bits that represent the mantissa (fractional bits) Advantage: the exponent offers a wide dynamic range of representing numbers; Disadvantage: the precision of number representation depends on the exponent. 9

10 Floating point representation - Obtaining bits: Sign bit: Negative: bit 31 = 1 Positive : bit 30 = 0 Mantissa: M = 1+m m = Exponent: where 1 M<2 An 8 bit signed value, memorized with the offset +127 This way a value computation will be done this way: z = (-1) S M 2 E-OFFSET Examples: Write in a floating point format the next numbers: 1) 0x 3FE0 0000h = B S = 0 E = = 127 M = (1) = = 1.75 Z = (-1) 0 * 1.75 * = ) Z = -2.5 S = = 1.25 * = E OFFSET E = 128 M = 1.25 = (1).01 = Binar: B = 0x C h Floating point representation has also disadvantages: Example *: x = 10.0 (0x ) +y = (0x347F8CF1) z = Wrong! The value cannot be represented with floating point simple precision. 0x = <= it cannot be represented 0x = In this way, the number will be rounded to

11 Properties: The addition of the represented numbers in floating point assumes their representation with the same exponent; the obtained result is then rounded and normalized if needed; The multiplication of two floating point numbers is done by the following rule: the result exponent will be written on a number of bits equal with the sum of bits of the exponents of numbers added, and the obtained result is then rounded and normalized. 6. The IQ format The trend until now was in representing fractional numbers in which the fractional point stands after the MSB. Generally, this point can be put anywhere in the binary representation. A higher resolution can thus be obtained. I -stands for the integer part (integer) Q -stands for fractional part (quotient) Advantage: the precision is the same for all numbers Disadvantage: the dynamic range is limited comparative to the floating point representation 31 0 s i i i i i i i i.qqqqqqqqqqqqqqqqqqqqqqq bit mantissa -2 I + 2 I Q Example 1: Format I1Q3 3 0 s.qqq Most negative decimal number: -1.0 = Most positive decimal number: = Lowest negative decimal IQ number: -1*2-3 = Lowest positive decimal IQ number: 2-3 = Range: Resolution: 2^-3 Example 2: Format I3Q1 3 0 sii.q Most negative decimal number: -4.0 =

12 Most positive decimal number: +3.5 = Lowest negative decimal IQ number: -1*2-1 = Lowest positive decimal IQ number: 2-1 = Domain: Resolution: 2-1 Example 3: Format I1Q31 s.qqq qqqq qqqq qqqq qqqq qqqq qqqq qqqq Most negative decimal number: -1.0 = B Most positive decimal number: 1-1/2 31 = B Lowest negative decimal IQ number: -1*2-31 = B Lowest positive decimal IQ number: 2-31 = B Domain: [ ) Resolution: 2-31 If we transpose Example * in IQ, we will have: x = 10.0 (0x0A000000) +y = (0x ) z = (0x0A000004), number that can be represented in IQ format By using the IQ format instead of the floating point representation we can obtain a higher precision in data representation. 7. Conclusions Integer versus fractional numbers: Range: integer numbers have a maximum range that is determined by the number of bits on which the number is represented; fractional numbers can be in the [-1;+1] range Precision: integer numbers have a maximum precision of 1; fractional numbers have a precision determined by the number of bits 12

13 Fixed point versus floating point arithmetic: Floating point arithmetic is more flexible than the fixed point type. The main advantage is in the access to a greater dynamic range for the represented data. Examples of processors: Floating point: Intel Pentium Series, Texas Instruments C67xxDSP Fixed point: Motorola HC68x, Infineon C166, Texas Instruments TMS430, TMS320C5000, C2000 Fixed point processors: Can represent: Integer numbers (integer arithmetic): for control, address computation (signals not implied) Fractional: for signal processing They are low priced. They are easy to program: the simulation step can detect any situation in which correction of the result is necessary to avoid overflow. Floating point processors: Numbers have a mantissasa and an exponent: mantissasa*2 exponent. It is a highly flexible technology. They have a large dynamic range for number representation. They are easy to program: the programmer need not account for the overflow cases of the accumulator. Disadvantage: They are costly. 8. Homework 8.1 There are given below the 15 coefficients of a high pass FIR filter. Convert the coefficients in Q15 format. (h1=h15= e-3; h2=h14= e-3; h3=h13= e-2; h4=h12= E-2; h5=h11= e-2; h6=h10= ; h7=h9= ; h8= ) 8.2 Following the 3 examples in IQ format, specify the values corresponding to I8Q24 format. 8.3 Write in floating point format the number: 0x BFB0 0000h on 32 bits. 8.4 More homework: Study the following examples for addition, substraction and multiplication of numbers in floating point: Example 1. Make the addition of the numbers: and = * = * 10 2 = *

14 Detailed: e = 5; z = ( ) + e = 2; z = ( ) e = 5; z = e = 5; z = (after shifting) e = 5; sum = (real sum is: ) If we go back to 7 digit representation, the result will be: e=5; sum= (meaning the final sum will be: ), so the result was rounded and normalized. The 3 digits 654 were lost, this beeing the rounding error. Example 2. Make the substraction of the numbers: and : = * = * 105 = * 105 Detailed: e = 5; z = ( ) -e = 5; z = ( ) e = 5; d = (the real difference is: ) If we go back to the 7 digit representation the result will be: e= -1; s= (meaning the final result will be: 0.4), that is the rounded and normalized result. The runding error in this case is approximately 20%. Example 3. Make the multiplication of the numbers: and : e = 3; z = ( ) e = 5; z = ( ) e = 8; z = e = 8; z = (after shifting) e = 8; prod = (the real result is: ) e = 8; prod = (after rounding) e = 9; prod = (after normalization) 14

Chapter 03: Computer Arithmetic. Lesson 09: Arithmetic using floating point numbers

Chapter 03: Computer Arithmetic Lesson 09: Arithmetic using floating point numbers Objective To understand arithmetic operations in case of floating point numbers 2 Multiplication of Floating Point Numbers