AN617. Fixed Point Routines FIXED POINT ARITHMETIC INTRODUCTION. Thi d t t d ith F M k Design Consultant
|
|
|
- Joel Henry
- 8 years ago
- Views:
Transcription
1 Thi d t t d ith F M k Fixed Point Routines AN617 Author: INTRODUCTION Frank J. Testa Design Consultant This application note presents an implementation of the following fixed point math routines for the PIC16/17 microcontroller families: Multiplication Division Routines for the PIC16/17 families are provided in a variety of fixed point formats, including both unsigned and signed two s complement arithmetic. FIXED POINT ARITHMETIC Unsigned fixed point binary numbers A, can be represented in the form n-1 A = a(k) 2 k-r = 2 -r a(k) 2k k=0 n-1 k=0 where n is the number of bits, a(k) is the kth bit with a(0) = LSb, and r indicates the location of the radix point. For example, in the case where A is an integer, r = 0 and when A is a fraction less than one, r = n. The value of r only affects the interpretation of the numbers in a fixed point calculation, with the actual binary representation of the numbers independent of the value of r. Factoring out of the above sum, it simply locates the radix point of the representation and is analogous to an exponent in a floating point system. Using the notation Qi.j to denote a fixed point binary number with i bits to the left of the radix point and j to the right, the above n-bit format is in Qn-r.r. With care, fixed point calculations can be performed on operands in different Q formats. Although the radix point must be aligned for addition or subtraction, multiplication provides an illustrative example of the simple interpretive nature of r. Consider the unsigned product of a Q20.4 number with a Q8.8. After calling the appropriate unsigned bit multiply for these fixed point arguments, the 40-bit fixed point result is in Q28.12, where the arguments of the Q notation are summed respectively. Similar arguments can be made for two s complement arithmetic, where the negative representation of a positive number is obtained by reversing the value of each bit and incrementing the result by one. Producing a unique representation of zero, and covering the range -2 n-1 to 2 n-1-1, this is more easily applied in addition and subtraction operations and is therefore the most commonly used method of representing positive and negative numbers in fixed point arithmetic. The above analysis in Q notation can be employed to build dedicated fixed point algorithms, leading to improved performance over floating point methods in cases where the size of the arguments required for the range and precision of the calculations is not large enough to destroy gains made by fixed point methods Microchip Technology Inc. DS00617A-page 1
2 FIXED POINT FORMATS The fixed point library routines supports 8-,16-, 24- and 32-bit formats in the following combinations: Division Library Names Format Multiplication Library Names Format PIC16C5X/PIC16CXX Routines FXD0808S, FXD0808U, FXD0807U, FXD0707U FXD1608S, FXD1608U, FXD1607U, FXD1507U FXD1616S, FXD1616U, FXD1515U FXD2416S, FXD2416U, FXD2315U FXD2424S, FXD2424U, FXD2323U FXD3216S, FXD3216U, FXD3115U FXD3224S, FXD3224U, FXD3123U FXD3232S, FXD3232U, FXD3131U PIC17CXX Functions FXD0808S, FXD0808U, FXD0807U, FXD0707U FXD1608S, FXD1608U, FXD1607U, FXD1507U FXD1616S, FXD1616U, FXD1615U, FXD1515U FXD2416S, FXD2416U, FXD2415U, FXD2315U FXD2424S, FXD2424U, FXD2423U, FXD2323U FXD3216S, FXD3216U, FXD3215U, FXD3115U FXD3224S, FXD3224U, FXD3223U, FXD3123U FXD3232S, FXD3232U, FXD3231U, FXD3131U 8/8 FXM0808S, FXM0808U, FXM0807U 16/8 FXM1608S, FXM1608U, FXM1607U, FXM1507U 16/16 FXM1616S, FXM1616U, FXM1515U 24/16 FXM2416S, FXM2416U, FXM2315U 24/24 FXM2424S, FXM2424U, FXM2323U 32/16 FXM3216S, FXM3216U, FXM3115U 32/24 FXM3224S, FXM3224U, FXM3123U 32/32 FXM3232S, FXM3232U, FXM3131U 8/8 FXM0808S, FXM0808U, FXM0807U 16/8 FXM1608S, FXM1608U, FXM1507U 16/16 FXM1616S, FXM1616U, FXM1515U 24/16 FXM2416S, FXM2416U, FXM2315U 24/24 FXM2424S, FXM2424U, FXM2323U 32/16 FXM3216S, FXM3216U, FXM3115U 32/24 FXM3224S, FXM3224U, FXM3123U 32/32 FXM3232S, FXM3232U, FXM3131U Note: U - unsigned math operation, S - signed math operation These general format combinations are implemented in both signed and unsigned versions. Additional unsigned routines are implemented with arguments reduced by one bit to accommodate the case of operations on signed numbers, with arguments known to be nonnegative, thereby, resulting in some performance improvement. DS00617A-page Microchip Technology Inc.
3 DATA RAM REQUIREMENTS The following contiguous data ram locations are used by the library: ACCB7 = REMB3 = AEXP = EXP AARG and ACC exponent ACCB6 = = BEXP BARG exponent ACCB5 = ACCB4 = remainder = AARGB3 = AARGB2 = AARGB1 = AARGB0 = ACC AARG and ACC SIGN sign in MSB FPFLAGS exception flags and option bits BARGB3 BARGB2 BARGB1 BARGB0 BARG B3 B2 B1 B0 temporary storage These definitions are identical with those used by the IEEE 754 compliant floating point library[6], AN575. USAGE Multiplication assumes the multiplicand in AARG, multiplier in BARG, and produces the result in ACC. Division assumes a dividend in AARG, divisor in BARG, and quotient in ACC with remainder in REM. ADDITION/SUBTRACTION Because of the generally trivial nature of addition and subtraction, the call and return overhead outweighs the need for explicit routines and so they are not included in the library. However, the PIC16C5X/PIC16CXX families do not have an add with carry or subtract with borrow instruction, leading to subtleties regarding production of a correct carry-out in a multiple byte add or subtract. In the case of a two byte add or subtract, the most elegant solution to these difficulties, requiring 6 cycles, appears to be given by the following code in Example 1. EXAMPLE 1: TWO BYTE ADDITION/SUBTRACTION ROUTINES ADD AARGB1,W BARGB1 AARGB0,W AARGB0,W BARGB0 SUB AARGB1,W BARGB1 AARGB0,W AARGB0,W BARGB0 The four instructions after the initial add/subtract, can be easily concatenated for operations involving more than two bytes. Because addition and subtraction are required in standard algorithms for multiplication and division, these issues permeate the implementation of both fixed and floating point algorithms for the PIC16C5X/PIC16CXX families. MULTIPLICATION The fixed point multiply routine FXPMxxyy, takes an xx-bit multiplicand in AARG, a yy-bit multiplier in BARG and returns the (xx+yy)-bit product in ACC. The implementation uses a standard sequential add-shift algorithm, negating both factors if BARG < 0, to produce the positive multiplier required by the method. Analogous to simple longhand binary multiplication, the multiplier bits are sequentially tested, with one indicating an add-shift and zero simply a shift. The shift 1995 Microchip Technology Inc. DS00617A-page 3
![identical with those used by the IEEE 754 compliant floating point library[6], AN575. USAGE Multiplication assumes the multiplicand in AARG, multiplier in BARG, and produces the result in ACC.](/docs-images/42/16564771/images/page_3.jpg "Division assumes a dividend in AARG, divisor in BARG, and quotient in ACC with remainder in REM.")
4 is required to align the partial product for the next possible add[1]. Several examples are shown in Example 2. EXAMPLE 2: MULTIPLICATION EXAMPLES FXM2416S(0xC11682,0x608B) = FXM2416S( ,24715) = 0xE84647F896 = FXM1616U(0x0458,0x822C) = FXM1616U(1112,33324) = 0x02356F20 = TABLE 1: PIC17CXX FIXED POINT MULTIPLY PERFORMANCE DATA: APPENDIX E Routine Max Cyc Min Cyc PM DM Page FXM0808S 50/ FXM0808U FXM0707U FXM1608S 74/ FXM1608U FXM1507U FXM1616S 168/ FXM1616U FXM1515U FXM2416S 213/ FXM2416U FXM2315U FXM2424S 334/ FXM2424U FXM2323U FXM3216S 258/ FXM3216U FXM3115U FXM3224S 403/ FXM3224U FXM3123U FXM3232S 556/ FXM3232U FXM3131U Legend: PM - Program memory, DM - Data Memory TABLE 2: PIC16C5X/PIC16CXX FIXED POINT MULTIPLY PERFORMANCE DATA: APPENDIX C Routine Max Cyc Min Cyc PM DM Page FXM0808S 79/ FXM0808U FXM0707U FXM1608S 122/ FXM1608U FXM1507U FXM1616S 260/ FXM1616U FXM1515U FXM2416S 334/ FXM2416U FXM2315U FXM2424S 520/ FXM2424U FXM2323U FXM3216S 408/ FXM3216U FXM3115U FXM3224S 634/ FXM3224U FXM3123U FXM3232S 868/ FXM3232U FXM3131U Legend: PM - Program memory, DM - Data Memory DS00617A-page Microchip Technology Inc.
5 DIVISION The fixed point divide routine FXPDxxyy, takes an xx-bit dividend in AARG, a yy-bit divisor in BARG and returns the xx-bit quotient in ACC and yy-bit remainder in REM. Unlike multiplication, division is not deterministic, requiring a trial-and-error sequential shift and subtract process. Binary division is less complicated than decimal division because the possible quotient digits are only zero or one. If the divisor is less than the partial remainder, the corresponding quotient bit is set to one followed by a shift and subtract. Otherwise, the divisor is greater than the partial remainder, the quotient bit is set to zero and only a shift is performed. The intermediate partial remainder may be restored at each stage as in restoring division, or corrected at the end as in nonrestoring division. Implementation dependent trade-offs between worst case versus average performance affect the choice between these two approaches, and therefore, macros for each method are provided. Note: The results of the division process for AARG/BARG, satisfy the relation AARG = BARG QUOTIENT + REMAINDER, where the remainder has the same sign as the quotient, and represents the fraction of the result in units of the denominator BARG. Some simple examples are given in Example 3. EXAMPLE 3: A test for divide by zero exception is not performed and must be explicitly provided by the user. DIVISION EXAMPLES FXD1608S(0xC116,0x60) = 0xFF59, 0xB6 FXD1616U(0x9543,0x4AA1) = 02, Microchip Technology Inc. DS00617A-page 5
6 TABLE 3: PIC17CXX FIXED POINT DIVIDE PERFORMANCE DATA: APPENDIX F TABLE 4: PIC16C5X/PIC16CXX FIXED POINT DIVIDE PERFORMANCE DATA: APPENDIX D Routine Max Cyc Min Cyc PM DM Page FXD0808S 71/77 71/ FXD0808U FXD0807U FXD0707U FXD1608S 135/ / FXD1608U FXD1607U FXD1507U FXD1616S 201/ / FXD1616U FXD1615U FXD1515U FXD2416S 297/ / FXD2416U FXD2415U FXD2315U FXD2424S 371/ / FXD2424U FXD2423U FXD2323U FXD3216S 393/ / FXD3216U FXD3215U FXD3115U FXD3224S 491/ / FXD3224U FXD3223U FXD3123U FXD3232S 589/ / FXD3232U FXD3231U FXD3131U Legend: PM - Program memory, DM - Data Memory Routine Max Cyc Min Cyc PM DM Page FXD0808S 90/96 90/ FXD0808U FXD0807U FXD0707U FXD1608S 176/ / FXD1608U FXD1607U FXD1507U FXD1616S 304/ / FXD1616U FXD1515U FXD2416S 417/ / FXD2416U FXD2315U FXD2424S 541/ / FXD2424U FXD2323U FXD3216S 551/ / FXD3216U FXD3115U FXD3224S 715/ / FXD3224U FXD3123U FXD3232S 879/ / FXD3232U FXD3131U Legend: PM - Program memory, DM - Data Memory REFERENCES 1. Cavanagh, J.J.F., Digital Computer Arithmetic, McGraw-Hill, Hwang, K., Computer Arithmetic, John Wiley & Sons, Scott, N.R., Computer Number Systems & Arithmetic, Prentice Hall, IEEE Standards Board, IEEE Standard for Floating-Point Arithmetic, ANSI/IEEE Std , IEEE, Knuth, D.E., The Art of Computer Programming, Volume 2, Addison-Wesley, F.J.Testa, IEEE 754 Compliant Floating Point Routines, AN575, Embedded Control Handbook, Microchip Technology Inc., DS00617A-page Microchip Technology Inc.
7 APPENDIX A: ALGORITHMS Several algorithms for decimal to binary conversion are given below. The integer and fractional conversion algorithms are useful in both native assembly as well as high level languages. A.1 Integer conversion algorithm[3]: Given an integer I, where d(k) are the bit values of its n bit binary representation with d(0) = LSB, n-1 I = d(k) 2 k k=0 k=0 I(k) = I while I(k) =! 0 d(k) = remainder of I(k)/2 I(k+1) = I(k)/2 k = k + 1 where denotes the greatest integer function (or ceiling function). A.2 Fractional conversion algorithm[3]: Given a fraction F, where d(k) are the bit values of its n bit binary representation with d(1)=msb, k=0 F(k) = F while k <= n d(k) = F(k) 2 n F = d(k) 2 -k k=1 F(k+1) = fractional part of F(k) 2 k = k Microchip Technology Inc. DS00617A-page 7
![1 Integer conversion algorithm[3]: Given an integer I, where d(k) are the bit values of its n bit binary representation with d(0) = LSB, n-1 I = d(k) 2 k k=0 k=0 I(k) = I while I(k) =!](/docs-images/42/16564771/images/page_7.jpg "0 d(k) = remainder of I(k)/2 I(k+1) = I(k)/2 k = k + 1 where denotes the greatest integer function (or ceiling function). A.")
8 APPENDIX B: FLOWCHARTS FIGURE B-1: MULTIPLICATION FLOWCHART FXPMxxU FXPMxxS i = 0 clear high order partial product i = 0 clear high order partial product multiplier bit i = 1? Yes multiplier < 0? Yes No add multiplicand to high order partial product No negate multiplier and multiplicand save sign of result right shift partial product i = i + 1 multiplier bit i = 1? No Yes add multiplicand to high order partial product Yes i < n? No right shift partial product with sign extension i = i + 1 Return 0 Yes i < n - 1? No Return 0 DS00617A-page Microchip Technology Inc.
9 FIGURE B-2: DIVISION FLOWCHART FXPDxxU FXPDxxS A i = 0 clear remainder partial quotient = dividend compute sign of quotient left shift (remainder, quotient) i < n? No divisor < 0? Yes subtract divisor from partial remainder Yes Return 0 No negate divisor result > 0? Yes left shift (remainder, quotient) subtract division from partial remainder dividend < 0? No Yes negate dividend No restore partial quotient, LSb = 0 partial quotient LSb = 1 result > 0? No Yes restore partial quotient, LSb = 0 i = 0 clear remainder partial quotient = dividend restore partial quotient, LSb = 0 i < n - 1? Yes A No Return Microchip Technology Inc. DS00617A-page 9
10 Thi d t t d ith F M k AN617 Please check the Microchip BBS for the latest version of the source code. For BBS access information, see Section 6, Microchip Bulletin Board Service information, page 6-3. APPENDIX C: MULTIPLY ROUTINES FOR THE PIC16C5X/PIC16CXX Table of Contents for Appendix C C.1 32x32 PIC16C5X/PIC16CXX Fixed Point Multiply Routines C.2 32x24 PIC16C5X/PIC16CXX Fixed Point Multiply Routines C.3 32x16 PIC16C5X/PIC16CXX Fixed Point Multiply Routines C.4 24x24 PIC16C5X/PIC16CXX Fixed Point Multiply Routines C.5 24x16 PIC16C5X/PIC16CXX Fixed Point Multiply Routines C.6 16x16 PIC16C5X/PIC16CXX Fixed Point Multiply Routines C.7 16x8 PIC16C5X/PIC16CXX Fixed Point Multiply Routines C.8 8x8 PIC16C5X/PIC16CXX Fixed Point Multiply Routines C.1 32x32 PIC16C5X/PIC16CXX Fixed Point Multiply Routines ; 32x32 PIC16 FIXED POINT MULTIPLY ROUTINES VERSION 1.2 ; Input: fixed point arguments in AARG and BARG ; Output: product AARGxBARG in AARG ; All timings are worst case cycle counts ; It is useful to note that the additional unsigned routines requiring a non-power of two ; argument can be called in a signed multiply application where it is known that the ; respective argument is nonnegative, thereby offering some improvement in performance. ; Routine Clocks Function ; FXM3232S x32 -> 64 bit signed fixed point multiply ; FXM3232U x32 -> 64 bit unsigned fixed point multiply ; FXM3131U x31 -> 62 bit unsigned fixed point multiply ; The above timings are based on the looped macros. If space permits, ; approximately clocks can be saved by using the unrolled macros. list r=dec,x=on,t=off include <PIC16.INC> ; general PIC16 definitions include <MATH16.INC> ; PIC16 math library definitions ; Test suite storage RANDHI equ 0x1A ; random number generator registers RANDLO equ 0x1B DATA equ 0x20 ; beginning of test data ; Test suite for 32x32 bit fixed point multiply algorithms org 05 MAIN MOVLW RAMSTART MEMLOOP MOVLW RAMSTOP,W _Z MEMLOOP MOVLW 0x45 ; seed for random numbers RANDLO MOVLW 0x30 RANDHI MOVLW DATA BCF _RP0 BCF _RP1 BCF _IRP CALL TFXM3232 SELF SELF RANDOM16 RANDHI,W ; random number generator XORWF RANDHI,W B0 SWAPF RANDHI SWAPF RANDLO,W DS00617A-page Microchip Technology Inc.
11 1995 Microchip Technology Inc. DS00617A-page 11 AN617 B1 B1,W B1 B1,W XORWF RANDHI,W SWAPF RANDHI ANDLW 0x01 B0 RANDLO XORWF RANDLO RANDHI RETEW 0 ; Test suite for FXM3232 TFXM3232 CALL RANDOM16 RANDHI,W BARGB0 BCF BARGB0,MSB RANDLO,W BARGB1 CALL RANDOM16 RANDHI,W BARGB2 RANDLO,W BARGB3 CALL RANDOM16 RANDHI,W AARGB0 BCF AARGB0,MSB AARGB0,W RANDLO,W AARGB1 CALL RANDOM16 RANDHI,W AARGB2 RANDLO,W AARGB3 CALL FXM3131U AARGB0,W AARGB1,W AARGB2,W AARGB4,W
12 AARGB5,W AARGB6,W AARGB7,W ; 32x32 Bit Multiplication Macros SMUL3232L macro ; Max Timing: * * * * = 851 clks ; Min Timing: 2+7* * * *6+5+6 = 192 clks ; PM: = 152 DM: 17 MOVLW 0x8 LOOPSM3232A BARGB3 ALSM3232NA LOOPSM3232A LOOPSM3232B BARGB2 BLSM3232NA LOOPSM3232B LOOPSM3232C BARGB1 CLSM3232NA LOOPSM3232C MOVLW 0x7 LOOPSM3232D BARGB0 DLSM3232NA LOOPSM3232D AARGB0 AARGB1 AARGB2 AARGB3 ALOOPSM3232 BARGB3 ALSM3232NA B3,W B2,W B2,W B1,W B1,W DS00617A-page Microchip Technology Inc.
13 1995 Microchip Technology Inc. DS00617A-page 13 AN617 B0,W B0,W ALSM3232NA B0,W ACCB4 ALOOPSM3232 MOVLW 0x8 BLOOPSM3232 BARGB2 BLSM3232NA B3,W B2,W B2,W B1,W B1,W B0,W B0,W BLSM3232NA B0,W ACCB4 ACCB5 BLOOPSM3232 MOVLW 0x8 CLOOPSM3232 BARGB1 CLSM3232NA B3,W B2,W B2,W B1,W B1,W B0,W B0,W CLSM3232NA B0,W
14 ACCB4 ACCB5 ACCB6 CLOOPSM3232 MOVLW 0x7 DLOOPSM3232 BARGB0 DLSM3232NA B3,W B2,W B2,W B1,W B1,W B0,W B0,W DLSM3232NA B0,W ACCB4 ACCB5 ACCB6 ACCB7 DLOOPSM3232 B0,W ACCB4 ACCB5 ACCB6 ACCB7 endm UMUL3232L macro ; Max Timing: * * * *28+27 = 842 clks ; Min Timing: 2+7* * * *6+5+6 = 197 clks ; PM: = 155 DM: 17 MOVLW 0x08 LOOPUM3232A BARGB3 ALUM3232NAP LOOPUM3232A LOOPUM3232B BARGB2 BLUM3232NAP LOOPUM3232B DS00617A-page Microchip Technology Inc.
15 LOOPUM3232C BARGB1 CLUM3232NAP LOOPUM3232C LOOPUM3232D BARGB0 DLUM3232NAP LOOPUM3232D AARGB0 AARGB1 AARGB2 AARGB3 ALUM3232NAP BCF ALUM3232NA BLUM3232NAP BCF BLUM3232NA CLUM3232NAP BCF CLUM3232NA DLUM3232NAP BCF DLUM3232NA ALOOPUM3232 BARGB3 ALUM3232NA B3,W B2,W B2,W B1,W B1,W B0,W B0,W ALUM3232NA ACCB4 ALOOPUM3232 MOVLW 0x08 BLOOPUM3232 BARGB2 BLUM3232NA B3,W B2,W B2,W B1,W 1995 Microchip Technology Inc. DS00617A-page 15
16 DS00617A-page Microchip Technology Inc. B1,W B0,W B0,W BLUM3232NA ACCB4 ACCB5 BLOOPUM3232 MOVLW 0x08 CLOOPUM3232 BARGB1 CLUM3232NA B3,W B2,W B2,W B1,W B1,W B0,W B0,W CLUM3232NA ACCB4 ACCB5 ACCB6 CLOOPUM3232 MOVLW 0x08 DLOOPUM3232 BARGB0 DLUM3232NA B3,W B2,W B2,W B1,W B1,W B0,W B0,W
17 DLUM3232NA ACCB4 ACCB5 ACCB6 ACCB7 DLOOPUM3232 endm UMUL3131L macro ; Max Timing: * * * * = 822 clks ; Min Timing: 2+7* * * *6+5+6 = 192 clks ; PM: = 155 DM: 17 MOVLW 0x8 LOOPUM3131A BARGB3 ALUM3131NAP LOOPUM3131A LOOPUM3131B BARGB2 BLUM3131NAP LOOPUM3131B LOOPUM3131C BARGB1 CLUM3131NAP LOOPUM3131C MOVLW 0x7 LOOPUM3131D BARGB0 DLUM3131NAP LOOPUM3131D AARGB0 AARGB1 AARGB2 AARGB3 ALUM3131NAP BCF ALUM3131NA BLUM3131NAP BCF BLUM3131NA CLUM3131NAP BCF CLUM3131NA DLUM3131NAP BCF DLUM3131NA ALOOPUM3131 BARGB Microchip Technology Inc. DS00617A-page 17
18 DS00617A-page Microchip Technology Inc. ALUM3131NA B3,W B2,W B2,W B1,W B1,W B0,W B0,W ALUM3131NA ACCB4 ALOOPUM3131 MOVLW 0x08 BLOOPUM3131 BARGB2 BLUM3131NA B3,W B2,W B2,W B1,W B1,W B0,W B0,W BLUM3131NA ACCB4 ACCB5 BLOOPUM3131 MOVLW 0x08 CLOOPUM3131 BARGB1 CLUM3131NA B3,W B2,W B2,W B1,W
19 CLUM3131NA DLOOPUM3131 DLUM3131NA MOVLW endm B1,W B0,W B0,W ACCB4 ACCB5 ACCB6 CLOOPUM3131 0x07 BARGB0 DLUM3131NA B3,W B2,W B2,W B1,W B1,W B0,W B0,W ACCB4 ACCB5 ACCB6 ACCB7 DLOOPUM3131 ACCB4 ACCB5 ACCB6 ACCB7 SMUL3232 macro ; Max Timing: 9+7*22+8*23+8*24+7*25+9 = 723 clks ; Min Timing: 62+6 = 68 clks ; PM: *22+8*23+8*24+7*25+9 = 788 DM: 16 variable i i = 0 while i < Microchip Technology Inc. DS00617A-page 19
20 i = i + 1 i = 8 BARGB3,i SM3232NA#v(i) while i < 16 i = i + 1 i = 16 BARGB2,i-8 SM3232NA#v(i) while i < 24 i = i + 1 i = 24 BARGB1,i-16 SM3232NA#v(i) while i < 31 BARGB0,i-24 SM3232NA#v(i) i = i + 1 ; if we get here, BARG = 0 RETEW 0 SM3232NA0 B0,W ACCB4 i = 1 while i < 8 BARGB3,i SM3232NA#v(i) SM3232A#v(i) B3,W B2,W B2,W B1,W B1,W B0,W B0,W SM3232NA#v(i) B0,W ACCB4 i = i + 1 i = 8 DS00617A-page Microchip Technology Inc.
21 while i < 16 BARGB2,i-8 SM3232NA#v(i) SM3232A#v(i) B3,W B2,W B2,W B1,W B1,W B0,W B0,W SM3232NA#v(i) B0,W ACCB4 ACCB5 i = i + 1 i = 16 while i < 24 BARGB1,i-16 SM3232NA#v(i) SM3232A#v(i) B3,W B2,W B2,W B1,W B1,W B0,W B0,W SM3232NA#v(i) B0,W ACCB4 ACCB5 ACCB6 i = i + 1 i = 24 while i < 31 BARGB0,i-24 SM3232NA#v(i) SM3232A#v(i) B3,W B2,W B2,W B1,W 1995 Microchip Technology Inc. DS00617A-page 21
22 B1,W B0,W B0,W SM3232NA#v(i) B0,W ACCB4 ACCB5 ACCB6 ACCB7 i = i + 1 B0,W ACCB4 ACCB5 ACCB6 ACCB7 endm UMUL3232 macro ; Max Timing: 9+8*21+8*22+8*23+8*24 = 729 clks ; Min Timing: 63+6 = 69 clks ; PM: *21+8*22+8*23+8*24 = 795 DM: 16 variable i i = 0 BCF ; clear carry for first right shift while i < 8 i = i + 1 i = 8 BARGB3,i UM3232NA#v(i) while i < 16 i = i + 1 i = 16 BARGB2,i-8 UM3232NA#v(i) while i < 24 i = i + 1 i = 24 BARGB1,i-16 UM3232NA#v(i) while i < 32 BARGB0,i-24 UM3232NA#v(i) i = i + 1 ; if we get here, BARG = 0 DS00617A-page Microchip Technology Inc.
23 RETEW 0 UM3232NA0 ACCB4 i = 1 while i < 8 BARGB3,i UM3232NA#v(i) UM3232A#v(i) B3,W B2,W B2,W B1,W B1,W B0,W B0,W UM3232NA#v(i) ACCB4 i = i + 1 i = 8 while i < 16 BARGB2,i-8 UM3232NA#v(i) UM3232A#v(i) B3,W B2,W B2,W B1,W B1,W B0,W B0,W UM3232NA#v(i) ACCB4 ACCB5 i = i + 1 i = 16 while i < 24 BARGB1,i-16 UM3232NA#v(i) UM3232A#v(i) B3,W 1995 Microchip Technology Inc. DS00617A-page 23
24 B2,W B2,W B1,W B1,W B0,W B0,W UM3232NA#v(i) ACCB4 ACCB5 ACCB6 i = i + 1 i = 24 while i < 32 BARGB0,i-24 UM3232NA#v(i) UM3232A#v(i) B3,W B2,W B2,W B1,W B1,W B0,W B0,W UM3232NA#v(i) ACCB4 ACCB5 ACCB6 ACCB7 i = i + 1 endm UMUL3131 macro ; Max Timing: 9+7*21+8*22+8*23+7*24+9 = 693 clks ; Min Timing: 62+6 = 68 clks ; PM: *22+8*23+8*24+7*25+9 = 788 DM: 16 variable i i = 0 BCF ; clear carry for first right shift while i < 8 i = i + 1 i = 8 while i < 16 BARGB3,i UM3131NA#v(i) DS00617A-page Microchip Technology Inc.
25 i = i + 1 i = 16 while i < 24 i = i + 1 i = 24 while i < 31 BARGB2,i-8 UM3131NA#v(i) BARGB1,i-16 UM3131NA#v(i) BARGB0,i-24 UM3131NA#v(i) i = i + 1 ; if we get here, BARG = 0 RETEW 0 UM3131NA0 ACCB4 i = 1 while i < 8 BARGB3,i UM3131NA#v(i) UM3131A#v(i) B3,W B2,W B2,W B1,W B1,W B0,W B0,W UM3131NA#v(i) ACCB4 i = i + 1 i = 8 while i < 16 BARGB2,i-8 UM3131NA#v(i) UM3131A#v(i) B3,W B2,W B2,W B1,W B1,W 1995 Microchip Technology Inc. DS00617A-page 25
26 B0,W B0,W UM3131NA#v(i) ACCB4 ACCB5 i = i + 1 i = 16 while i < 24 BARGB1,i-16 UM3131NA#v(i) UM3131A#v(i) B3,W B2,W B2,W B1,W B1,W B0,W B0,W UM3131NA#v(i) ACCB4 ACCB5 ACCB6 i = i + 1 i = 24 while i < 31 BARGB0,i-24 UM3131NA#v(i) UM3131A#v(i) B3,W B2,W B2,W B1,W B1,W B0,W B0,W UM3131NA#v(i) ACCB4 ACCB5 ACCB6 ACCB7 DS00617A-page Microchip Technology Inc.
27 i = i + 1 endm ACCB4 ACCB5 ACCB6 ACCB7 ; 32x32 Bit Signed Fixed Point Multiply 32x32 -> 64 ; Input: 32 bit signed fixed point multiplicand in AARGB0 ; 32 bit signed fixed point multiplier in BARGB0 ; Use: CALL FXM3232S ; Output: 64 bit signed fixed point product in AARGB0 ; Result: AARG <-- AARG x BARG ; Max Timing: = 868 clks B > 0 ; = 889 clks B < 0 ; Min Timing: = 207 clks ; PM: = 189 DM: 17 FXM3232S BARGB0,MSB M3232SOK BARGB3 ; make multiplier BARG > 0 BARGB3 _Z DECF BARGB2 BARGB2 _Z DECF BARGB1 BARGB1 _Z DECF BARGB0 BARGB0 AARGB3 AARGB3 _Z DECF AARGB2 AARGB2 _Z DECF AARGB1 AARGB1 _Z DECF AARGB0 AARGB0 M3232SOK ACCB4 ; clear partial product ACCB5 ACCB7 ACCB6 AARGB0,W B0 AARGB1,W B1 AARGB2,W B2 AARGB3,W B3 SMUL3232L ; 32x32 Bit Unsigned Fixed Point Multiply 32x32 -> 64 ; Input: 32 bit unsigned fixed point multiplicand in AARGB Microchip Technology Inc. DS00617A-page 27
28 ; 32 bit unsigned fixed point multiplier in BARGB0 ; Use: CALL FXM3232U ; Output: 64 bit unsigned fixed point product in AARGB0 ; Result: AARG <-- AARG x BARG ; Max Timing: = 856 clks ; Min Timing: = 209 clks ; PM: = 168 DM: 17 FXM3232U ACCB4 ; clear partial product ACCB5 ACCB7 ACCB6 AARGB0,W B0 AARGB1,W B1 AARGB2,W B2 AARGB3,W B3 UMUL3232L ; 31x31 Bit Unsigned Fixed Point Divide 31x31 -> 62 ; Input: 31 bit unsigned fixed point multiplicand in AARGB0 ; 31 bit unsigned fixed point multiplier in BARGB0 ; Use: CALL FXM3131U ; Output: 62 bit unsigned fixed point product in AARGB0 ; Result: AARG <-- AARG x BARG ; Max Timing: = 836 clks ; Min Timing: = 204 clks ; PM: = 168 DM: 17 FXM3131U ACCB4 ; clear partial product ACCB5 ACCB7 ACCB6 AARGB0,W B0 AARGB1,W B1 AARGB2,W B2 AARGB3,W B3 UMUL3131L END C.2 32x24 PIC16C5X/PIC16CXX Fixed Point Multiply Routines ; 32x24 PIC16 FIXED POINT MULTIPLY ROUTINES VERSION 1.2 ; Input: fixed point arguments in AARG and BARG ; Output: product AARGxBARG in AARG ; All timings are worst case cycle counts ; It is useful to note that the additional unsigned routines requiring a non-power of two ; argument can be called in a signed multiply application where it is known that the ; respective argument is nonnegative, thereby offering some improvement in ; performance. ; Routine Clocks Function ; FXM3224S x24 -> 56 bit signed fixed point multiply ; FXM3224U x24 -> 56 bit unsigned fixed point multiply ; FXM3123U x23 -> 54 bit unsigned fixed point multiply DS00617A-page Microchip Technology Inc.
29 ; The above timings are based on the looped macros. If space permits, ; approximately clocks can be saved by using the unrolled macros. list r=dec,x=on,t=off include <PIC16.INC> ; general PIC16 definitions include <MATH16.INC> ; PIC16 math library definitions ; Test suite storage RANDHI equ 0x1A ; random number generator registers RANDLO equ 0x1B DATA equ 0x20 ; beginning of test data ; Test suite for 32x24 bit fixed point multiply algorithms org 05 MAIN MOVLW RAMSTART MEMLOOP MOVLW RAMSTOP,W _Z MEMLOOP MOVLW 0x45 ; seed for random numbers RANDLO MOVLW 0x30 RANDHI MOVLW DATA BCF _RP0 BCF _RP1 BCF _IRP CALL TFXM3224 SELF SELF RANDOM16 RANDHI,W ; random number generator XORWF RANDHI,W B0 SWAPF RANDHI SWAPF RANDLO,W B1 B1,W B1 B1,W XORWF RANDHI,W SWAPF RANDHI ANDLW 0x01 B0 RANDLO XORWF RANDLO RANDHI RETEW 0 ; Test suite for FXM3224 TFXM3224 CALL RANDOM16 RANDHI,W BARGB0 ; BCF BARGB0,MSB ; RANDLO,W BARGB1 CALL RANDOM Microchip Technology Inc. DS00617A-page 29
30 RANDHI,W BARGB2 CALL RANDOM16 RANDHI,W AARGB0 ; BCF AARGB0,MSB ; AARGB0,W RANDLO,W AARGB1 CALL RANDOM16 RANDHI,W AARGB2 RANDLO,W AARGB3 CALL FXM3224S AARGB0,W AARGB1,W AARGB2,W AARGB3,W AARGB4,W AARGB5,W AARGB6,W ; 32x24 Bit Multiplication Macros SMUL3224L macro ; Max Timing: * * * = 618 clks ; Min Timing: 2+7* * *6+5+6 = 146 clks ; PM: = 115 DM: 15 MOVLW 0x8 LOOPSM3224A BARGB2 ALSM3224NA LOOPSM3224A LOOPSM3224B BARGB1 DS00617A-page Microchip Technology Inc.
31 1995 Microchip Technology Inc. DS00617A-page 31 AN617 BLSM3224NA LOOPSM3224B MOVLW 0x7 LOOPSM3224C BARGB0 CLSM3224NA LOOPSM3224C AARGB0 AARGB1 AARGB2 AARGB3 ALOOPSM3224 BARGB2 ALSM3224NA B3,W B2,W B2,W B1,W B1,W B0,W B0,W ALSM3224NA B0,W ACCB4 ALOOPSM3224 MOVLW 0x8 BLOOPSM3224 BARGB1 BLSM3224NA B3,W B2,W B2,W B1,W B1,W B0,W B0,W BLSM3224NA B0,W
32 ACCB4 ACCB5 BLOOPSM3224 MOVLW 0x7 CLOOPSM3224 BARGB0 CLSM3224NA B3,W B2,W B2,W B1,W B1,W B0,W B0,W CLSM3224NA B0,W ACCB4 ACCB5 ACCB6 CLOOPSM3224 B0,W ACCB4 ACCB5 ACCB6 endm UMUL3224L macro ; Max Timing: * * *27+26 = 617 clks ; Min Timing: 2+7* * *6+5+6 = 151 clks ; PM: = 139 DM: 15 MOVLW 0x08 LOOPUM3224A BARGB2 ALUM3224NAP LOOPUM3224A LOOPUM3224B BARGB1 BLUM3224NAP LOOPUM3224B LOOPUM3224C BARGB0 DS00617A-page Microchip Technology Inc.
33 1995 Microchip Technology Inc. DS00617A-page 33 AN617 CLUM3224NAP LOOPUM3224C AARGB0 AARGB1 AARGB2 AARGB3 ALUM3224NAP BCF ALUM3224NA BLUM3224NAP BCF BLUM3224NA CLUM3224NAP BCF CLUM3224NA ALOOPUM3224 BARGB2 ALUM3224NA B3,W B2,W B2,W B1,W B1,W B0,W B0,W ALUM3224NA ACCB4 ALOOPUM3224 MOVLW 0x08 BLOOPUM3224 BARGB1 BLUM3224NA B3,W B2,W B2,W B1,W B1,W B0,W B0,W BLUM3224NA
34 ACCB4 ACCB5 BLOOPUM3224 MOVLW 0x08 CLOOPUM3224 BARGB0 CLUM3224NA B3,W B2,W B2,W B1,W B1,W B0,W B0,W CLUM3224NA ACCB4 ACCB5 ACCB6 CLOOPUM3224 endm UMUL3123L macro ; Max Timing: * * * = 597 clks ; Min Timing: 2+7* * *6+5+6 = 146 clks ; PM: = 117 DM: 15 MOVLW 0x8 LOOPUM3123A BARGB2 ALUM3123NAP LOOPUM3123A LOOPUM3123B BARGB1 BLUM3123NAP LOOPUM3123B MOVLW 0x7 LOOPUM3123C BARGB0 CLUM3123NAP LOOPUM3123C AARGB0 DS00617A-page Microchip Technology Inc.
35 1995 Microchip Technology Inc. DS00617A-page 35 AN617 AARGB1 AARGB2 AARGB3 ALUM3123NAP BCF ALUM3123NA BLUM3123NAP BCF BLUM3123NA CLUM3123NAP BCF CLUM3123NA ALOOPUM3123 BARGB2 ALUM3123NA B3,W B2,W B2,W B1,W B1,W B0,W B0,W ALUM3123NA ACCB4 ALOOPUM3123 MOVLW 0x08 BLOOPUM3123 BARGB1 BLUM3123NA B3,W B2,W B2,W B1,W B1,W B0,W B0,W BLUM3123NA ACCB4 ACCB5
36 CLOOPUM3123 CLUM3123NA MOVLW endm BLOOPUM3123 0x07 BARGB0 CLUM3123NA B3,W B2,W B2,W B1,W B1,W B0,W B0,W ACCB4 ACCB5 ACCB6 CLOOPUM3123 ACCB4 ACCB5 ACCB6 SMUL3224 macro ; Max Timing: 9+7*22+8*23+7*24+8 = 523 clks ; Min Timing: 40+6 = 46 clks ; PM: *22+8*23+7*24+8 = 566 DM: 14 variable i i = 0 while i < 8 i = i + 1 i = 8 BARGB2,i SM3224NA#v(i) while i < 16 i = i + 1 i = 16 BARGB1,i-8 SM3224NA#v(i) while i < 23 DS00617A-page Microchip Technology Inc.
37 BARGB0,i-16 SM3224NA#v(i) i = i + 1 ; if we get here, BARG = 0 RETEW 0 SM3224NA0 B0,W ACCB4 i = 1 while i < 8 BARGB2,i SM3224NA#v(i) SM3224A#v(i) B3,W B2,W B2,W B1,W B1,W B0,W B0,W SM3224NA#v(i) B0,W ACCB4 i = i + 1 i = 8 while i < 16 BARGB1,i-8 SM3224NA#v(i) SM3224A#v(i) B3,W B2,W B2,W B1,W B1,W B0,W B0,W SM3224NA#v(i) B0,W ACCB4 ACCB Microchip Technology Inc. DS00617A-page 37
38 i = i + 1 i = 16 while i < 23 BARGB0,i-16 SM3224NA#v(i) SM3224A#v(i) B3,W B2,W B2,W B1,W B1,W B0,W B0,W SM3224NA#v(i) B0,W ACCB4 ACCB5 ACCB6 i = i + 1 B0,W ACCB4 ACCB5 ACCB6 endm UMUL3224 macro ; Max Timing: 9+8*21+8*22+8*23 = 537 clks ; Min Timing: 41+6 = 47 clks ; PM: *21+8*22+8*23 = 581 DM: 14 variable i i = 0 BCF ; clear carry for first right shift while i < 8 i = i + 1 i = 8 BARGB2,i UM3224NA#v(i) while i < 16 i = i + 1 i = 16 BARGB1,i-8 UM3224NA#v(i) while i < 24 BARGB0,i-16 DS00617A-page Microchip Technology Inc.
39 UM3224NA#v(i) i = i + 1 ; if we get here, BARG = 0 RETEW 0 UM3224NA0 ACCB4 i = 1 while i < 8 BARGB2,i UM3224NA#v(i) UM3224A#v(i) B3,W B2,W B2,W B1,W B1,W B0,W B0,W UM3224NA#v(i) ACCB4 i = i + 1 i = 8 while i < 16 BARGB1,i-8 UM3224NA#v(i) UM3224A#v(i) B3,W B2,W B2,W B1,W B1,W B0,W B0,W UM3224NA#v(i) ACCB4 ACCB5 i = i + 1 i = 16 while i < Microchip Technology Inc. DS00617A-page 39
40 BARGB0,i-16 UM3224NA#v(i) UM3224A#v(i) B3,W B2,W B2,W B1,W B1,W B0,W B0,W UM3224NA#v(i) ACCB4 ACCB5 ACCB6 i = i + 1 endm UMUL3123 macro ; Max Timing: 9+7*21+8*22+7*23+7 = 500 clks ; Min Timing: 41+6 = 47 clks ; PM: *22+8*23+7*24+7 = 565 DM: 14 variable i i = 0 BCF ; clear carry for first right shift while i < 8 i = i + 1 i = 8 while i < 16 i = i + 1 i = 16 while i < 23 BARGB2,i UM3123NA#v(i) BARGB1,i-8 UM3123NA#v(i) BARGB0,i-16 UM3123NA#v(i) i = i + 1 ; if we get here, BARG = 0 RETEW 0 UM3123NA0 ACCB4 i = 1 while i < 8 BARGB2,i DS00617A-page Microchip Technology Inc.
41 UM3123NA#v(i) UM3123A#v(i) B3,W B2,W B2,W B1,W B1,W B0,W B0,W UM3123NA#v(i) ACCB4 i = i + 1 i = 8 while i < 16 BARGB1,i-8 UM3123NA#v(i) UM3123A#v(i) B3,W B2,W B2,W B1,W B1,W B0,W B0,W UM3123NA#v(i) ACCB4 ACCB5 i = i + 1 i = 16 while i < 23 BARGB0,i-16 UM3123NA#v(i) UM3123A#v(i) B3,W B2,W B2,W B1,W B1,W B0,W B0,W 1995 Microchip Technology Inc. DS00617A-page 41
42 UM3123NA#v(i) ACCB4 ACCB5 ACCB6 i = i + 1 ACCB4 ACCB5 ACCB6 endm ; 32x24 Bit Signed Fixed Point Multiply 32x24 -> 56 ; Input: 32 bit signed fixed point multiplicand in AARGB0, AARGB1, ; AARGB2, AARGB3 ; 24 bit signed fixed point multiplier in BARGB0, BARGB1, ; BARGB2 ; Use: CALL FXM3224S ; Output: 56 bit signed fixed point product in AARGB0 ; Result: AARG <-- AARG x BARG ; Max Timing: = 634 clks B > 0 ; = 652 clks B < 0 ; Min Timing: = 160 clks ; PM: = 152 DM: 15 FXM3224S BARGB0,MSB M3224SOK BARGB2 ; make multiplier BARG > 0 BARGB2 _Z DECF BARGB1 BARGB1 _Z DECF BARGB0 BARGB0 AARGB3 AARGB3 _Z DECF AARGB2 AARGB2 _Z DECF AARGB1 AARGB1 _Z DECF AARGB0 AARGB0 M3224SOK ACCB4 ; clear partial product ACCB5 ACCB6 AARGB0,W B0 AARGB1,W B1 AARGB2,W B2 AARGB3,W B3 SMUL3224L DS00617A-page Microchip Technology Inc.
43 ; 32x24 Bit Unsigned Fixed Point Multiply 32x24 -> 56 ; Input: 32 bit unsigned fixed point multiplicand in AARGB0, AARGB1, ; AARGB2, AARGB3 ; 24 bit unsigned fixed point multiplier in BARGB0, BARGB1, ; BARGB2 ; Use: CALL FXM3224U ; Output: 56 bit unsigned fixed point product in AARGB0 ; Result: AARG <-- AARG x BARG ; Max Timing: = 630 clks ; Min Timing: = 162 clks ; PM: = 151 DM: 15 FXM3224U ACCB4 ; clear partial product ACCB5 ACCB6 AARGB0,W B0 AARGB1,W B1 AARGB2,W B2 AARGB3,W B3 UMUL3224L ; 31x23 Bit Unsigned Fixed Point Divide 31x23 -> 54 ; Input: 31 bit unsigned fixed point multiplicand in AARGB0, AARGB1, ; AARGB2, AARGB3 ; 23 bit unsigned fixed point multiplier in BARGB0, BARGB1, ; BARGB2 ; Use: CALL FXM3123U ; Output: 54 bit unsigned fixed point product in AARGB0 ; Result: AARG <-- AARG x BARG ; Max Timing: = 610 clks ; Min Timing: = 157 clks ; PM: = 129 DM: 15 FXM3123U ACCB4 ; clear partial product ACCB5 ACCB6 AARGB0,W B0 AARGB1,W B1 AARGB2,W B2 AARGB3,W B3 UMUL3123L END C.3 32x16 PIC16C5X/PIC16CXX Fixed Point Multiply Routines ; 32x16 PIC16 FIXED POINT MULTIPLY ROUTINES VERSION 1.2 ; Input: fixed point arguments in AARG and BARG ; Output: product AARGxBARG in AARG ; All timings are worst case cycle counts 1995 Microchip Technology Inc. DS00617A-page 43
44 ; It is useful to note that the additional unsigned routines requiring a non-power of two ; argument can be called in a signed multiply application where it is known that the ; respective argument is nonnegative, thereby offering some improvement in ; performance. ; Routine Clocks Function ; FXM3216S x16 -> 48 bit signed fixed point multiply ; FXM3216U x16 -> 48 bit unsigned fixed point multiply ; FXM3115U x15 -> 46 bit unsigned fixed point multiply ; The above timings are based on the looped macros. If space permits, ; approximately clocks can be saved by using the unrolled macros. list r=dec,x=on,t=off include <PIC16.INC> ; general PIC16 definitions include <MATH16.INC> ; PIC16 math library definitions ; Test suite storage RANDHI equ 0x1A ; random number generator registers RANDLO equ 0x1B TESTCOUNT equ 0x20 ; counter DATA equ 0x21 ; beginning of test data ; Test suite for 32x16 bit fixed point multiply algorithms org 05 MAIN MOVLW RAMSTART MEMLOOP MOVLW RAMSTOP,W _Z MEMLOOP MOVLW 0x45 ; seed for random numbers RANDLO MOVLW 0x30 RANDHI MOVLW DATA BCF _RP0 BCF _RP1 BCF _IRP CALL TFXM3216 SELF SELF RANDOM16 RANDHI,W ; random number generator XORWF RANDHI,W B0 SWAPF RANDHI SWAPF RANDLO,W B1 B1,W B1 B1,W XORWF RANDHI,W SWAPF RANDHI ANDLW 0x01 B0 RANDLO XORWF RANDLO RANDHI RETEW 0 ; Test suite for FXM3216 TFXM3216 MOVLW 1 TESTCOUNT M3216LOOP CALL RANDOM16 DS00617A-page Microchip Technology Inc.
45 RANDHI,W BARGB0 BCF BARGB0,MSB RANDLO,W BARGB1 CALL RANDOM16 RANDHI,W AARGB0 BCF AARGB0,MSB AARGB0,W RANDLO,W AARGB1 CALL RANDOM16 RANDHI,W AARGB2 RANDLO,W AARGB3 CALL FXM3115U AARGB0,W AARGB1,W AARGB2,W AARGB3,W AARGB4,W AARGB5,W TESTCOUNT M3216LOOP ; 32x16 Bit Multiplication Macros SMUL3216L macro ; Max Timing: * * = 393 clks ; Min Timing: 2+7* *6+5+6 = 98 clks ; PM: = 79 DM: 11 MOVLW 0x8 LOOPSM3216A BARGB1 ALSM3216NA 1995 Microchip Technology Inc. DS00617A-page 45
46 DS00617A-page Microchip Technology Inc. LOOPSM3216A MOVLW 0x7 LOOPSM3216B BARGB0 BLSM3216NA LOOPSM3216B AARGB0 AARGB1 AARGB2 AARGB3 ALOOPSM3216 BARGB1 ALSM3216NA B3,W B2,W B2,W B1,W B1,W B0,W B0,W ALSM3216NA B0,W ACCB4 ALOOPSM3216 MOVLW 0x7 BLOOPSM3216 BARGB0 BLSM3216NA B3,W B2,W B2,W B1,W B1,W B0,W B0,W BLSM3216NA B0,W ACCB4
47 ACCB5 BLOOPSM3216 B0,W ACCB4 ACCB5 endm UMUL3216L macro ; Max Timing: * *26+25 = 400 clks ; Min Timing: 2+7* *6+5+6 = 103 clks ; PM: 73 DM: 11 MOVLW 0x08 LOOPUM3216A BARGB1 ALUM3216NAP LOOPUM3216A LOOPUM3216B BARGB0 BLUM3216NAP LOOPUM3216B AARGB0 AARGB1 AARGB2 AARGB3 BLUM3216NAP BCF BLUM3216NA ALUM3216NAP BCF ALUM3216NA ALOOPUM3216 BARGB1 ALUM3216NA B3,W B2,W B2,W B1,W B1,W B0,W B0,W ALUM3216NA ACCB Microchip Technology Inc. DS00617A-page 47
48 ALOOPUM3216 MOVLW 0x08 BLOOPUM3216 BARGB0 BLUM3216NA B3,W B2,W B2,W B1,W B1,W B0,W B0,W BLUM3216NA ACCB4 ACCB5 BLOOPUM3216 endm UMUL3115L macro ; Max Timing: * * = 380 clks ; Min Timing: 2+7* *6+5+6 = 96 clks ; PM: 80 DM: 11 MOVLW 0x8 LOOPUM3115A BARGB1 ALUM3115NAP LOOPUM3115A MOVLW 0x7 LOOPUM3115B BARGB0 BLUM3115NAP LOOPUM3115B AARGB0 AARGB1 AARGB2 AARGB3 BLUM3115NAP BCF BLUM3115NA ALUM3115NAP BCF ALUM3115NA ALOOPUM3115 BARGB1 ALUM3115NA DS00617A-page Microchip Technology Inc.
49 ALUM3115NA BLOOPUM3115 BLUM3115NA MOVLW endm B3,W B2,W B2,W B1,W B1,W B0,W B0,W ACCB4 ALOOPUM3115 0x07 BARGB0 BLUM3115NA B3,W B2,W B2,W B1,W B1,W B0,W B0,W ACCB4 ACCB5 BLOOPUM3115 ACCB4 ACCB5 SMUL3216 macro ; Max Timing: 5+8+7*20+7*21+5 = 305 clks ; Min Timing: = 57 clks ; PM: *20+7*21+5 = 353 DM: 10 variable i i = 0 AARGB0,MSB 1995 Microchip Technology Inc. DS00617A-page 49
50 ACCB4 ACCB4,W ACCB5,W while i < 8 BCF i = i + 1 i = 8 BARGB1,i SM3216NA#v(i) ACCB4,7-i while i < 15 BARGB0,i-8 SM3216NA#v(i) BCF ACCB5,15-i i = i + 1 ; if we get here, BARG = 0 ACCB5 RETEW 0 SM3216NA0 ACCB4 i = 1 while i < 8 BARGB1,i SM3216NA#v(i) SM3216A#v(i) B3,W B2,W B2,W B1,W B1,W B0,W B0,W SM3216NA#v(i) ACCB4 i = i + 1 i = 8 while i < 15 BARGB0,i-8 SM3216NA#v(i) SM3216A#v(i) B3,W B2,W DS00617A-page Microchip Technology Inc.
51 B2,W B1,W B1,W B0,W B0,W SM3216NA#v(i) ACCB4 ACCB5 i = i + 1 ACCB4 ACCB5 endm UMUL3216 macro ; Max Timing: 1+8+7*21+8*22 = 332 clks ; Min Timing: 1+2*8+2*8+6 = 39 clks ; PM: 1+2*8+2*8+6+7*21+8*22 = 362 DM: 10 variable i i = 0 BCF ; clear carry for first right shift while i < 8 i = i + 1 i = 8 BARGB1,i UM3216NA#v(i) while i < 16 BARGB0,i-8 UM3216NA#v(i) i = i + 1 ; if we get here, BARG = 0 RETEW 0 UM3216NA0 ACCB4 i = 1 while i < 8 BARGB1,i UM3216NA#v(i) UM3216A#v(i) B3,W B2,W 1995 Microchip Technology Inc. DS00617A-page 51
52 B2,W B1,W B1,W B0,W B0,W UM3216NA#v(i) ACCB4 i = i + 1 i = 8 while i < 16 BARGB0,i-8 UM3216NA#v(i) UM3216A#v(i) B3,W B2,W B2,W B1,W B1,W B0,W B0,W UM3216NA#v(i) ACCB4 ACCB5 i = i + 1 endm UMUL3115 macro ; Max Timing: 9+7*21+7*22+6 = 316 clks ; Min Timing: = 37 clks ; PM: *21+7*22+6 = 348 DM: 10 variable i i = 0 BCF ; clear carry for first right shift while i < 8 i = i + 1 i = 8 while i < 15 BARGB1,i UM3115NA#v(i) BARGB0,i-8 UM3115NA#v(i) i = i + 1 ; if we get here, BARG = 0 DS00617A-page Microchip Technology Inc.
53 RETEW 0 UM3115NA0 ACCB4 i = 1 while i < 8 BARGB1,i UM3115NA#v(i) UM3115A#v(i) B3,W B2,W B2,W B1,W B1,W B0,W B0,W UM3115NA#v(i) ACCB4 i = i + 1 i = 8 while i < 15 BARGB0,i-8 UM3115NA#v(i) UM3115A#v(i) B3,W B2,W B2,W B1,W B1,W B0,W B0,W UM3115NA#v(i) ACCB4 ACCB5 i = i + 1 ACCB4 ACCB5 endm 1995 Microchip Technology Inc. DS00617A-page 53
54 ; 32x16 Bit Signed Fixed Point Multiply 32x16 -> 32 ; Input: 16 bit signed fixed point multiplicand in AARGB0 ; 16 bit signed fixed point multiplier in BARGB0 ; Use: CALL FXM3216S ; Output: 32 bit signed fixed point product in AARGB0 ; Result: AARG <-- AARG x BARG ; Max Timing: = 408 clks B > 0 ; = 423 clks B < 0 ; Min Timing: = 111 clks ; PM: = 98 DM: 9 FXM3216S BARGB0,MSB M3216SOK BARGB1 ; make multiplier BARG > 0 BARGB1 _Z DECF BARGB0 BARGB0 AARGB3 AARGB3 _Z DECF AARGB2 AARGB2 _Z DECF AARGB1 AARGB1 _Z DECF AARGB0 AARGB0 M3216SOK ACCB4 ; clear partial product ACCB5 AARGB0,W B0 AARGB1,W B1 AARGB2,W B2 AARGB3,W B3 SMUL3216L ; 32x16 Bit Unsigned Fixed Point Multiply 32x16 -> 32 ; Input: 16 bit unsigned fixed point multiplicand in AARGB0 ; 16 bit unsigned fixed point multiplier in BARGB0 ; Use: CALL FXM3216U ; Output: 32 bit unsigned fixed point product in AARGB0 ; Result: AARG <-- AARG x BARG ; Max Timing: = 412 clks ; Min Timing: = 114 clks ; PM: = 84 DM: 9 FXM3216U ACCB4 ; clear partial product ACCB5 AARGB0,W B0 AARGB1,W B1 AARGB2,W B2 DS00617A-page Microchip Technology Inc.
55 AARGB3,W B3 UMUL3216L ; 31x15 Bit Unsigned Fixed Point Divide 31x15 -> 30 ; Input: 15 bit unsigned fixed point multiplicand in AARGB0 ; 15 bit unsigned fixed point multiplier in BARGB0 ; Use: CALL FXM3115U ; Output: 30 bit unsigned fixed point product in AARGB0 ; Result: AARG <-- AARG x BARG ; Max Timing: = 392 clks ; Min Timing: = 106 clks ; PM: = 91 DM: 9 FXM3115U ACCB4 ; clear partial product ACCB5 AARGB0,W B0 AARGB1,W B1 AARGB2,W B2 AARGB3,W B3 UMUL3115L END C.4 24x24 PIC16C5X/PIC16CXX Fixed Point Multiply Routines ; 24x24 PIC16 FIXED POINT MULTIPLY ROUTINES VERSION 1.2 ; Input: fixed point arguments in AARG and BARG ; Output: product AARGxBARG in AARG ; All timings are worst case cycle counts ; It is useful to note that the additional unsigned routines requiring a non-power of two ; argument can be called in a signed multiply application where it is known that the ; respective argument is nonnegative, thereby offering some improvement in ; performance. ; Routine Clocks Function ; FXM2424S x24 -> 48 bit signed fixed point multiply ; FXM2424U x24 -> 48 bit unsigned fixed point multiply ; FXM2323U x23 -> 46 bit unsigned fixed point multiply ; The above timings are based on the looped macros. If space permits, ; approximately clocks can be saved by using the unrolled macros. list r=dec,x=on,t=off include <PIC16.INC> ; general PIC16 definitions include <MATH16.INC> ; PIC16 math library definitions ; Test suite storage RANDHI equ 0x1A ; random number generator registers RANDLO equ 0x1B DATA equ 0x20 ; beginning of test data ; Test suite for 24x24 bit fixed point multiply algorithms org 05 MAIN MOVLW RAMSTART MEMLOOP MOVLW RAMSTOP 1995 Microchip Technology Inc. DS00617A-page 55
56 ,W _Z MEMLOOP MOVLW 0x45 ; seed for random numbers RANDLO MOVLW 0x30 RANDHI MOVLW DATA BCF _RP0 BCF _RP1 BCF _IRP CALL TFXM2424 SELF SELF RANDOM16 RANDHI,W ; random number generator XORWF RANDHI,W B0 SWAPF RANDHI SWAPF RANDLO,W B1 B1,W B1 B1,W XORWF RANDHI,W SWAPF RANDHI ANDLW 0x01 B0 RANDLO XORWF RANDLO RANDHI RETEW 0 ; Test suite for FXM2424 TFXM2424 CALL RANDOM16 RANDHI,W BARGB0 BCF BARGB0,MSB RANDLO,W BARGB1 CALL RANDOM16 RANDHI,W BARGB2 CALL RANDOM16 RANDHI,W AARGB0 BCF AARGB0,MSB AARGB0,W RANDLO,W AARGB1 CALL RANDOM16 RANDHI,W AARGB2 DS00617A-page Microchip Technology Inc.
57 CALL FXM2323U AARGB0,W AARGB1,W AARGB2,W AARGB3,W AARGB4,W AARGB5,W ; 24x24 Bit Multiplication Macros SMUL2424L macro ; Max Timing: * * * = 506 clks ; Min Timing: 2+7* * *6+5+5 = 145 clks ; PM: = 98 DM: 13 MOVLW 0x8 LOOPSM2424A BARGB2 ALSM2424NA LOOPSM2424A LOOPSM2424B BARGB1 BLSM2424NA LOOPSM2424B MOVLW 0x7 LOOPSM2424C BARGB0 CLSM2424NA LOOPSM2424C AARGB0 AARGB1 AARGB2 ALOOPSM2424 BARGB2 ALSM2424NA B2,W B1,W B1,W B0,W 1995 Microchip Technology Inc. DS00617A-page 57
58 DS00617A-page Microchip Technology Inc. B0,W ALSM2424NA B0,W ALOOPSM2424 MOVLW 0x8 BLOOPSM2424 BARGB1 BLSM2424NA B2,W B1,W B1,W B0,W B0,W BLSM2424NA B0,W ACCB4 BLOOPSM2424 MOVLW 0x7 CLOOPSM2424 BARGB0 CLSM2424NA B2,W B1,W B1,W B0,W B0,W CLSM2424NA B0,W ACCB4 ACCB5 CLOOPSM2424 B0,W ACCB4 ACCB5 endm
59 UMUL2424L macro ; Max Timing: * * *22+21 = 501 clks ; Min Timing: 2+7* * *6+5+5 = 150 clks ; PM: = 88 DM: 13 MOVLW 0x08 LOOPUM2424A BARGB2 ALUM2424NAP LOOPUM2424A LOOPUM2424B BARGB1 BLUM2424NAP LOOPUM2424B LOOPUM2424C BARGB0 CLUM2424NAP LOOPUM2424C AARGB0 AARGB1 AARGB2 CLUM2424NAP BCF CLUM2424NA BLUM2424NAP BCF BLUM2424NA ALUM2424NAP BCF ALUM2424NA ALOOPUM2424 BARGB2 ALUM2424NA B2,W B1,W B1,W B0,W B0,W ALUM2424NA ALOOPUM2424 MOVLW 0x08 BLOOPUM2424 BARGB1 BLUM2424NA 1995 Microchip Technology Inc. DS00617A-page 59
60 B2,W B1,W B1,W B0,W B0,W BLUM2424NA ACCB4 BLOOPUM2424 MOVLW 0x08 CLOOPUM2424 BARGB0 CLUM2424NA B2,W B1,W B1,W B0,W B0,W CLUM2424NA ACCB4 ACCB5 CLOOPUM2424 endm UMUL2323L macro ; Max Timing: * * * = 486 clks ; Min Timing: 2+7* * *6+5+5 = 145 clks ; PM: = 97 DM: 13 MOVLW 0x8 LOOPUM2323A BARGB2 ALUM2323NAP LOOPUM2323A LOOPUM2323B BARGB1 BLUM2323NAP LOOPUM2323B MOVLW 0x7 LOOPUM2323C DS00617A-page Microchip Technology Inc.
61 1995 Microchip Technology Inc. DS00617A-page 61 AN617 BARGB0 CLUM2323NAP LOOPUM2323C AARGB0 AARGB1 AARGB2 CLUM2323NAP BCF CLUM2323NA BLUM2323NAP BCF BLUM2323NA ALUM2323NAP BCF ALUM2323NA ALOOPUM2323 BARGB2 ALUM2323NA B2,W B1,W B1,W B0,W B0,W ALUM2323NA ALOOPUM2323 MOVLW 0x08 BLOOPUM2323 BARGB1 BLUM2323NA B2,W B1,W B1,W B0,W B0,W BLUM2323NA ACCB4 BLOOPUM2323 MOVLW 0x07 CLOOPUM2323
62 CLUM2323NA endm BARGB0 CLUM2323NA B2,W B1,W B1,W B0,W B0,W ACCB4 ACCB5 CLOOPUM2323 ACCB4 ACCB5 SMUL2424 macro ; Max Timing: 8+7*17+8*18+7*19+7 = 411 clks ; Min Timing: 46+5 = 51 clks ; PM: *17+8*18+7*19+7 = 466 DM: 12 variable i i = 0 while i < 8 i = i + 1 i = 8 BARGB2,i SM2424NA#v(i) while i < 16 i = i + 1 i = 16 BARGB1,i-8 SM2424NA#v(i) while i < 23 BARGB0,i-16 SM2424NA#v(i) i = i + 1 ; if we get here, BARG = 0 RETEW 0 SM2424NA0 B0,W DS00617A-page Microchip Technology Inc.
63 i = 1 while i < 8 BARGB2,i SM2424NA#v(i) SM2424A#v(i) B2,W B1,W B1,W B0,W B0,W SM2424NA#v(i) B0,W i = i + 1 i = 8 while i < 16 BARGB1,i-8 SM2424NA#v(i) SM2424A#v(i) B2,W B1,W B1,W B0,W B0,W SM2424NA#v(i) B0,W ACCB4 i = i + 1 i = 16 while i < 23 BARGB0,i-16 SM2424NA#v(i) SM2424A#v(i) B2,W B1,W B1,W B0,W B0,W SM2424NA#v(i) B0,W ACCB4 ACCB Microchip Technology Inc. DS00617A-page 63
64 i = i + 1 B0,W ACCB4 ACCB5 endm UMUL2424 macro ; Max Timing: 8+8*17+8*18+8*19 = 440 clks ; Min Timing: 49+5 = 54 clks ; PM: *17+8*18+8*19 = 490 DM: 12 variable i i = 0 BCF ; clear carry for first right shift while i < 8 i = i + 1 i = 8 BARGB2,i UM2424NA#v(i) while i < 16 i = i + 1 i = 16 BARGB1,i-8 UM2424NA#v(i) while i < 24 BARGB0,i-16 UM2424NA#v(i) i = i + 1 ; if we get here, BARG = 0 RETEW 0 UM2424NA0 i = 1 while i < 8 BARGB2,i UM2424NA#v(i) UM2424A#v(i) B2,W B1,W B1,W B0,W B0,W UM2424NA#v(i) DS00617A-page Microchip Technology Inc.
65 i = i + 1 i = 8 while i < 16 BARGB1,i-8 UM2424NA#v(i) UM2424A#v(i) B2,W B1,W B1,W B0,W B0,W UM2424NA#v(i) ACCB4 i = i + 1 i = 16 while i < 24 BARGB0,i-16 UM2424NA#v(i) UM2424A#v(i) B2,W B1,W B1,W B0,W B0,W UM2424NA#v(i) ACCB4 ACCB5 i = i + 1 endm UMUL2323 macro ; Max Timing: 8+7*17+8*18+7*19+7 = 411 clks ; Min Timing: 46+5 = 51 clks ; PM: *17+8*18+7*19+7 = 466 DM: 12 variable i i = 0 BCF ; clear carry for first right shift while i < 8 i = i + 1 i = 8 while i < 16 i = i + 1 BARGB2,i UM2323NA#v(i) BARGB1,i-8 UM2323NA#v(i) 1995 Microchip Technology Inc. DS00617A-page 65
66 i = 16 while i < 23 BARGB0,i-16 UM2323NA#v(i) i = i + 1 ; if we get here, BARG = 0 RETEW 0 UM2323NA0 i = 1 while i < 8 BARGB2,i UM2323NA#v(i) UM2323A#v(i) B2,W B1,W B1,W B0,W B0,W UM2323NA#v(i) i = i + 1 i = 8 while i < 16 BARGB1,i-8 UM2323NA#v(i) UM2323A#v(i) B2,W B1,W B1,W B0,W B0,W UM2323NA#v(i) ACCB4 i = i + 1 i = 16 while i < 23 BARGB0,i-16 UM2323NA#v(i) UM2323A#v(i) B2,W B1,W B1,W DS00617A-page Microchip Technology Inc.
67 B0,W B0,W UM2323NA#v(i) ACCB4 ACCB5 i = i + 1 ACCB4 ACCB5 endm ; 24x24 Bit Signed Fixed Point Multiply 24x24 -> 48 ; Input: 24 bit signed fixed point multiplicand in AARGB0 ; 24 bit signed fixed point multiplier in BARGB0 ; Use: CALL FXM2424S ; Output: 48 bit signed fixed point product in AARGB0 ; Result: AARG <-- AARG x BARG ; Max Timing: = 520 clks B > 0 ; = 535 clks B < 0 ; Min Timing: = 157 clks ; PM: = 126 DM: 13 FXM2424S BARGB0,MSB M2424SOK BARGB2 ; make multiplier BARG > 0 BARGB2 _Z DECF BARGB1 BARGB1 _Z DECF BARGB0 BARGB0 AARGB2 AARGB2 _Z DECF AARGB1 AARGB1 _Z DECF AARGB0 AARGB0 M2424SOK ; clear partial product ACCB4 ACCB5 AARGB0,W B0 AARGB1,W B1 AARGB2,W B2 SMUL2424L 1995 Microchip Technology Inc. DS00617A-page 67
Divide: Paper & Pencil. Computer Architecture ALU Design : Division and Floating Point. Divide algorithm. DIVIDE HARDWARE Version 1
Divide: Paper & Pencil Computer Architecture ALU Design : Division and Floating Point 1001 Quotient Divisor 1000 1001010 Dividend 1000 10 101 1010 1000 10 (or Modulo result) See how big a number can be
Lecture 8: Binary Multiplication & Division
Lecture 8: Binary Multiplication & Division Today s topics: Addition/Subtraction Multiplication Division Reminder: get started early on assignment 3 1 2 s Complement Signed Numbers two = 0 ten 0001 two
CSI 333 Lecture 1 Number Systems
CSI 333 Lecture 1 Number Systems 1 1 / 23 Basics of Number Systems Ref: Appendix C of Deitel & Deitel. Weighted Positional Notation: 192 = 2 10 0 + 9 10 1 + 1 10 2 General: Digit sequence : d n 1 d n 2...
Binary Division. Decimal Division. Hardware for Binary Division. Simple 16-bit Divider Circuit
Decimal Division Remember 4th grade long division? 43 // quotient 12 521 // divisor dividend -480 41-36 5 // remainder Shift divisor left (multiply by 10) until MSB lines up with dividend s Repeat until
Oct: 50 8 = 6 (r = 2) 6 8 = 0 (r = 6) Writing the remainders in reverse order we get: (50) 10 = (62) 8
ECE Department Summer LECTURE #5: Number Systems EEL : Digital Logic and Computer Systems Based on lecture notes by Dr. Eric M. Schwartz Decimal Number System: -Our standard number system is base, also
Goals. Unary Numbers. Decimal Numbers. 3,148 is. 1000 s 100 s 10 s 1 s. Number Bases 1/12/2009. COMP370 Intro to Computer Architecture 1
Number Bases //9 Goals Numbers Understand binary and hexadecimal numbers Be able to convert between number bases Understand binary fractions COMP37 Introduction to Computer Architecture Unary Numbers Decimal
COMPSCI 210. Binary Fractions. Agenda & Reading
COMPSCI 21 Binary Fractions Agenda & Reading Topics: Fractions Binary Octal Hexadecimal Binary -> Octal, Hex Octal -> Binary, Hex Decimal -> Octal, Hex Hex -> Binary, Octal Animation: BinFrac.htm Example
CS201: Architecture and Assembly Language
CS201: Architecture and Assembly Language Lecture Three Brendan Burns CS201: Lecture Three p.1/27 Arithmetic for computers Previously we saw how we could represent unsigned numbers in binary and how binary
CDA 3200 Digital Systems. Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012
CDA 3200 Digital Systems Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012 Outline Data Representation Binary Codes Why 6-3-1-1 and Excess-3? Data Representation (1/2) Each numbering
EE 261 Introduction to Logic Circuits. Module #2 Number Systems
EE 261 Introduction to Logic Circuits Module #2 Number Systems Topics A. Number System Formation B. Base Conversions C. Binary Arithmetic D. Signed Numbers E. Signed Arithmetic F. Binary Codes Textbook
CPEN 214 - Digital Logic Design Binary Systems
CPEN 4 - Digital Logic Design Binary Systems C. Gerousis Digital Design 3 rd Ed., Mano Prentice Hall Digital vs. Analog An analog system has continuous range of values A mercury thermometer Vinyl records
Systems I: Computer Organization and Architecture
Systems I: Computer Organization and Architecture Lecture 2: Number Systems and Arithmetic Number Systems - Base The number system that we use is base : 734 = + 7 + 3 + 4 = x + 7x + 3x + 4x = x 3 + 7x
The string of digits 101101 in the binary number system represents the quantity
Data Representation Section 3.1 Data Types Registers contain either data or control information Control information is a bit or group of bits used to specify the sequence of command signals needed for
Section 29. Instruction Set
M Section 29. Instruction Set HIGHLIGHTS This section of the manual contains the following major topics: 29. Introduction...29-2 29.2 Instruction Formats...29-4 29.3 Special Function Registers as Source/Destination...29-6
This Unit: Floating Point Arithmetic. CIS 371 Computer Organization and Design. Readings. Floating Point (FP) Numbers
This Unit: Floating Point Arithmetic CIS 371 Computer Organization and Design Unit 7: Floating Point App App App System software Mem CPU I/O Formats Precision and range IEEE 754 standard Operations Addition
2010/9/19. Binary number system. Binary numbers. Outline. Binary to decimal
2/9/9 Binary number system Computer (electronic) systems prefer binary numbers Binary number: represent a number in base-2 Binary numbers 2 3 + 7 + 5 Some terminology Bit: a binary digit ( or ) Hexadecimal
Today. Binary addition Representing negative numbers. Andrew H. Fagg: Embedded Real- Time Systems: Binary Arithmetic
Today Binary addition Representing negative numbers 2 Binary Addition Consider the following binary numbers: 0 0 1 0 0 1 1 0 0 0 1 0 1 0 1 1 How do we add these numbers? 3 Binary Addition 0 0 1 0 0 1 1
Computer Science 281 Binary and Hexadecimal Review
Computer Science 281 Binary and Hexadecimal Review 1 The Binary Number System Computers store everything, both instructions and data, by using many, many transistors, each of which can be in one of two
LSN 2 Number Systems. ECT 224 Digital Computer Fundamentals. Department of Engineering Technology
LSN 2 Number Systems Department of Engineering Technology LSN 2 Decimal Number System Decimal number system has 10 digits (0-9) Base 10 weighting system... 10 5 10 4 10 3 10 2 10 1 10 0. 10-1 10-2 10-3
Useful Number Systems
Useful Number Systems Decimal Base = 10 Digit Set = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} Binary Base = 2 Digit Set = {0, 1} Octal Base = 8 = 2 3 Digit Set = {0, 1, 2, 3, 4, 5, 6, 7} Hexadecimal Base = 16 = 2
Paramedic Program Pre-Admission Mathematics Test Study Guide
Paramedic Program Pre-Admission Mathematics Test Study Guide 05/13 1 Table of Contents Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Page 8 Page 9 Page 10 Page 11 Page 12 Page 13 Page 14 Page 15 Page
Lecture 11: Number Systems
Lecture 11: Number Systems Numeric Data Fixed point Integers (12, 345, 20567 etc) Real fractions (23.45, 23., 0.145 etc.) Floating point such as 23. 45 e 12 Basically an exponent representation Any number
Number Representation
Number Representation CS10001: Programming & Data Structures Pallab Dasgupta Professor, Dept. of Computer Sc. & Engg., Indian Institute of Technology Kharagpur Topics to be Discussed How are numeric data
To convert an arbitrary power of 2 into its English equivalent, remember the rules of exponential arithmetic:
Binary Numbers In computer science we deal almost exclusively with binary numbers. it will be very helpful to memorize some binary constants and their decimal and English equivalents. By English equivalents
NUMBER SYSTEMS. 1.1 Introduction
NUMBER SYSTEMS 1.1 Introduction There are several number systems which we normally use, such as decimal, binary, octal, hexadecimal, etc. Amongst them we are most familiar with the decimal number system.
Informatica e Sistemi in Tempo Reale
Informatica e Sistemi in Tempo Reale Introduction to C programming Giuseppe Lipari http://retis.sssup.it/~lipari Scuola Superiore Sant Anna Pisa October 25, 2010 G. Lipari (Scuola Superiore Sant Anna)
Binary Representation
Binary Representation The basis of all digital data is binary representation. Binary - means two 1, 0 True, False Hot, Cold On, Off We must tbe able to handle more than just values for real world problems
Binary Number System. 16. Binary Numbers. Base 10 digits: 0 1 2 3 4 5 6 7 8 9. Base 2 digits: 0 1
Binary Number System 1 Base 10 digits: 0 1 2 3 4 5 6 7 8 9 Base 2 digits: 0 1 Recall that in base 10, the digits of a number are just coefficients of powers of the base (10): 417 = 4 * 10 2 + 1 * 10 1
Binary Numbering Systems
Binary Numbering Systems April 1997, ver. 1 Application Note 83 Introduction Binary numbering systems are used in virtually all digital systems, including digital signal processing (DSP), networking, and
Levent EREN levent.eren@ieu.edu.tr A-306 Office Phone:488-9882 INTRODUCTION TO DIGITAL LOGIC
Levent EREN levent.eren@ieu.edu.tr A-306 Office Phone:488-9882 1 Number Systems Representation Positive radix, positional number systems A number with radix r is represented by a string of digits: A n
Sequential Skills. Strands and Major Topics
Sequential Skills This set of charts lists, by strand, the skills that are assessed, taught, and practiced in the Skills Tutorial program. Each Strand ends with a Mastery Test. You can enter correlating
3. Convert a number from one number system to another
3. Convert a number from one number system to another Conversion between number bases: Hexa (16) Decimal (10) Binary (2) Octal (8) More Interest Way we need conversion? We need decimal system for real
ELEG3924 Microprocessor Ch.7 Programming In C
Department of Electrical Engineering University of Arkansas ELEG3924 Microprocessor Ch.7 Programming In C Dr. Jingxian Wu wuj@uark.edu OUTLINE 2 Data types and time delay I/O programming and Logic operations
M Floating Point Math Functions
M Floating Point Math Functions AN660 Author: Frank.J. Testa FJT Consulting INTRODUCTION This application note presents implementations of the following math routines for the Microchip PICmicro microcontroller
ECE 0142 Computer Organization. Lecture 3 Floating Point Representations
ECE 0142 Computer Organization Lecture 3 Floating Point Representations 1 Floating-point arithmetic We often incur floating-point programming. Floating point greatly simplifies working with large (e.g.,
Binary Representation. Number Systems. Base 10, Base 2, Base 16. Positional Notation. Conversion of Any Base to Decimal.
Binary Representation The basis of all digital data is binary representation. Binary - means two 1, 0 True, False Hot, Cold On, Off We must be able to handle more than just values for real world problems
Chapter 7D The Java Virtual Machine
This sub chapter discusses another architecture, that of the JVM (Java Virtual Machine). In general, a VM (Virtual Machine) is a hypothetical machine (implemented in either hardware or software) that directly
Recall the process used for adding decimal numbers. 1. Place the numbers to be added in vertical format, aligning the decimal points.
2 MODULE 4. DECIMALS 4a Decimal Arithmetic Adding Decimals Recall the process used for adding decimal numbers. Adding Decimals. To add decimal numbers, proceed as follows: 1. Place the numbers to be added
Digital Design. Assoc. Prof. Dr. Berna Örs Yalçın
Digital Design Assoc. Prof. Dr. Berna Örs Yalçın Istanbul Technical University Faculty of Electrical and Electronics Engineering Office Number: 2318 E-mail: siddika.ors@itu.edu.tr Grading 1st Midterm -
CS321. Introduction to Numerical Methods
CS3 Introduction to Numerical Methods Lecture Number Representations and Errors Professor Jun Zhang Department of Computer Science University of Kentucky Lexington, KY 40506-0633 August 7, 05 Number in
Numbering Systems. InThisAppendix...
G InThisAppendix... Introduction Binary Numbering System Hexadecimal Numbering System Octal Numbering System Binary Coded Decimal (BCD) Numbering System Real (Floating Point) Numbering System BCD/Binary/Decimal/Hex/Octal
Chapter 2. Binary Values and Number Systems
Chapter 2 Binary Values and Number Systems Numbers Natural numbers, a.k.a. positive integers Zero and any number obtained by repeatedly adding one to it. Examples: 100, 0, 45645, 32 Negative numbers A
Solution for Homework 2
Solution for Homework 2 Problem 1 a. What is the minimum number of bits that are required to uniquely represent the characters of English alphabet? (Consider upper case characters alone) The number of
Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any.
Algebra 2 - Chapter Prerequisites Vocabulary Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any. P1 p. 1 1. counting(natural) numbers - {1,2,3,4,...}
Microcontroller Basics A microcontroller is a small, low-cost computer-on-a-chip which usually includes:
Microcontroller Basics A microcontroller is a small, low-cost computer-on-a-chip which usually includes: An 8 or 16 bit microprocessor (CPU). A small amount of RAM. Programmable ROM and/or flash memory.
NUMBER SYSTEMS. William Stallings
NUMBER SYSTEMS William Stallings The Decimal System... The Binary System...3 Converting between Binary and Decimal...3 Integers...4 Fractions...5 Hexadecimal Notation...6 This document available at WilliamStallings.com/StudentSupport.html
Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.
Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole
Number Conversions Dr. Sarita Agarwal (Acharya Narendra Dev College,University of Delhi)
Conversions Dr. Sarita Agarwal (Acharya Narendra Dev College,University of Delhi) INTRODUCTION System- A number system defines a set of values to represent quantity. We talk about the number of people
The finite field with 2 elements The simplest finite field is
The finite field with 2 elements The simplest finite field is GF (2) = F 2 = {0, 1} = Z/2 It has addition and multiplication + and defined to be 0 + 0 = 0 0 + 1 = 1 1 + 0 = 1 1 + 1 = 0 0 0 = 0 0 1 = 0
Numeral Systems. The number twenty-five can be represented in many ways: Decimal system (base 10): 25 Roman numerals:
Numeral Systems Which number is larger? 25 8 We need to distinguish between numbers and the symbols that represent them, called numerals. The number 25 is larger than 8, but the numeral 8 above is larger
Students will benefit from pencils with erasers, if possible since revisions are part of learning.
Suggestions and/or Directions for Implementing Extended Concept (2) Activities Students will benefit from pencils with erasers, if possible since revisions are part of learning. Students should be allowed
Positional Numbering System
APPENDIX B Positional Numbering System A positional numbering system uses a set of symbols. The value that each symbol represents, however, depends on its face value and its place value, the value associated
MATH-0910 Review Concepts (Haugen)
Unit 1 Whole Numbers and Fractions MATH-0910 Review Concepts (Haugen) Exam 1 Sections 1.5, 1.6, 1.7, 1.8, 2.1, 2.2, 2.3, 2.4, and 2.5 Dividing Whole Numbers Equivalent ways of expressing division: a b,
U:\montages\dominique\servo\moteur_AV_AR\program\moteur_AV_AR.asm jeudi 28 avril 2011 10:32
Norton Junior Moteur PWM AV - AR pour SLE BRESSUIRE PORTA ------------------------------------------------------- 0 = Entrée Servo 1 = PWM moteur 2 = Strap mode 3 = 4 = 5 = Relay AV - AR $Include 'C:\pemicro\ics08qtqyz\qtqy_registers.inc'
1. Convert the following base 10 numbers into 8-bit 2 s complement notation 0, -1, -12
C5 Solutions 1. Convert the following base 10 numbers into 8-bit 2 s complement notation 0, -1, -12 To Compute 0 0 = 00000000 To Compute 1 Step 1. Convert 1 to binary 00000001 Step 2. Flip the bits 11111110
AVR223: Digital Filters with AVR. 8-bit Microcontrollers. Application Note. Features. 1 Introduction
AVR223: Digital Filters with AVR Features Implementation of Digital Filters Coefficient and Data scaling Fast Implementation of 4 th Order FIR Filter Fast Implementation of 2 nd Order IIR Filter Methods
YOU MUST BE ABLE TO DO THE FOLLOWING PROBLEMS WITHOUT A CALCULATOR!
DETAILED SOLUTIONS AND CONCEPTS - DECIMALS AND WHOLE NUMBERS Prepared by Ingrid Stewart, Ph.D., College of Southern Nevada Please Send Questions and Comments to ingrid.stewart@csn.edu. Thank you! YOU MUST
Data Storage 3.1. Foundations of Computer Science Cengage Learning
3 Data Storage 3.1 Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: List five different data types used in a computer. Describe how
RN-coding of Numbers: New Insights and Some Applications
RN-coding of Numbers: New Insights and Some Applications Peter Kornerup Dept. of Mathematics and Computer Science SDU, Odense, Denmark & Jean-Michel Muller LIP/Arénaire (CRNS-ENS Lyon-INRIA-UCBL) Lyon,
Implementation of Modified Booth Algorithm (Radix 4) and its Comparison with Booth Algorithm (Radix-2)
Advance in Electronic and Electric Engineering. ISSN 2231-1297, Volume 3, Number 6 (2013), pp. 683-690 Research India Publications http://www.ripublication.com/aeee.htm Implementation of Modified Booth
M6800. Assembly Language Programming
M6800 Assembly Language Programming 1 3. MC6802 MICROPROCESSOR MC6802 microprocessor runs in 1MHz clock cycle. It has 64 Kbyte memory address capacity using 16-bit addressing path (A0-A15). The 8-bit data
1 Classical Universal Computer 3
Chapter 6: Machine Language and Assembler Christian Jacob 1 Classical Universal Computer 3 1.1 Von Neumann Architecture 3 1.2 CPU and RAM 5 1.3 Arithmetic Logical Unit (ALU) 6 1.4 Arithmetic Logical Unit
ASCII and BCD Arithmetic. Chapter 11 S. Dandamudi
ASCII and BCD Arithmetic Chapter 11 S. Dandamudi Outline Representation of Numbers ASCII representation BCD representation» Unpacked BCD» Packed BCD Processing ASCII numbers» ASCII addition» ASCII subtraction»
2) Write in detail the issues in the design of code generator.
COMPUTER SCIENCE AND ENGINEERING VI SEM CSE Principles of Compiler Design Unit-IV Question and answers UNIT IV CODE GENERATION 9 Issues in the design of code generator The target machine Runtime Storage
Solution Guide Chapter 14 Mixing Fractions, Decimals, and Percents Together
Solution Guide Chapter 4 Mixing Fractions, Decimals, and Percents Together Doing the Math from p. 80 2. 0.72 9 =? 0.08 To change it to decimal, we can tip it over and divide: 9 0.72 To make 0.72 into a
How do you compare numbers? On a number line, larger numbers are to the right and smaller numbers are to the left.
The verbal answers to all of the following questions should be memorized before completion of pre-algebra. Answers that are not memorized will hinder your ability to succeed in algebra 1. Number Basics
Measures of Error: for exact x and approximation x Absolute error e = x x. Relative error r = (x x )/x.
ERRORS and COMPUTER ARITHMETIC Types of Error in Numerical Calculations Initial Data Errors: from experiment, modeling, computer representation; problem dependent but need to know at beginning of calculation.
Attention: This material is copyright 1995-1997 Chris Hecker. All rights reserved.
Attention: This material is copyright 1995-1997 Chris Hecker. All rights reserved. You have permission to read this article for your own education. You do not have permission to put it on your website
Math Review. for the Quantitative Reasoning Measure of the GRE revised General Test
Math Review for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important
Arithmetic in MIPS. Objectives. Instruction. Integer arithmetic. After completing this lab you will:
6 Objectives After completing this lab you will: know how to do integer arithmetic in MIPS know how to do floating point arithmetic in MIPS know about conversion from integer to floating point and from
Introduction to MIPS Assembly Programming
1 / 26 Introduction to MIPS Assembly Programming January 23 25, 2013 2 / 26 Outline Overview of assembly programming MARS tutorial MIPS assembly syntax Role of pseudocode Some simple instructions Integer
Lecture 2. Binary and Hexadecimal Numbers
Lecture 2 Binary and Hexadecimal Numbers Purpose: Review binary and hexadecimal number representations Convert directly from one base to another base Review addition and subtraction in binary representations
A NEW REPRESENTATION OF THE RATIONAL NUMBERS FOR FAST EASY ARITHMETIC. E. C. R. HEHNER and R. N. S. HORSPOOL
A NEW REPRESENTATION OF THE RATIONAL NUMBERS FOR FAST EASY ARITHMETIC E. C. R. HEHNER and R. N. S. HORSPOOL Abstract. A novel system for representing the rational numbers based on Hensel's p-adic arithmetic
CHAPTER 5 Round-off errors
CHAPTER 5 Round-off errors In the two previous chapters we have seen how numbers can be represented in the binary numeral system and how this is the basis for representing numbers in computers. Since any
Correctly Rounded Floating-point Binary-to-Decimal and Decimal-to-Binary Conversion Routines in Standard ML. By Prashanth Tilleti
Correctly Rounded Floating-point Binary-to-Decimal and Decimal-to-Binary Conversion Routines in Standard ML By Prashanth Tilleti Advisor Dr. Matthew Fluet Department of Computer Science B. Thomas Golisano
6 3 4 9 = 6 10 + 3 10 + 4 10 + 9 10
Lesson The Binary Number System. Why Binary? The number system that you are familiar with, that you use every day, is the decimal number system, also commonly referred to as the base- system. When you
PREPARATION FOR MATH TESTING at CityLab Academy
PREPARATION FOR MATH TESTING at CityLab Academy compiled by Gloria Vachino, M.S. Refresh your math skills with a MATH REVIEW and find out if you are ready for the math entrance test by taking a PRE-TEST
Chapter 4 -- Decimals
Chapter 4 -- Decimals $34.99 decimal notation ex. The cost of an object. ex. The balance of your bank account ex The amount owed ex. The tax on a purchase. Just like Whole Numbers Place Value - 1.23456789
PROBLEMS (Cap. 4 - Istruzioni macchina)
98 CHAPTER 2 MACHINE INSTRUCTIONS AND PROGRAMS PROBLEMS (Cap. 4 - Istruzioni macchina) 2.1 Represent the decimal values 5, 2, 14, 10, 26, 19, 51, and 43, as signed, 7-bit numbers in the following binary
CS101 Lecture 11: Number Systems and Binary Numbers. Aaron Stevens 14 February 2011
CS101 Lecture 11: Number Systems and Binary Numbers Aaron Stevens 14 February 2011 1 2 1 3!!! MATH WARNING!!! TODAY S LECTURE CONTAINS TRACE AMOUNTS OF ARITHMETIC AND ALGEBRA PLEASE BE ADVISED THAT CALCULTORS
2011, The McGraw-Hill Companies, Inc. Chapter 3
Chapter 3 3.1 Decimal System The radix or base of a number system determines the total number of different symbols or digits used by that system. The decimal system has a base of 10 with the digits 0 through
Integer Operations. Overview. Grade 7 Mathematics, Quarter 1, Unit 1.1. Number of Instructional Days: 15 (1 day = 45 minutes) Essential Questions
Grade 7 Mathematics, Quarter 1, Unit 1.1 Integer Operations Overview Number of Instructional Days: 15 (1 day = 45 minutes) Content to Be Learned Describe situations in which opposites combine to make zero.
An Efficient RNS to Binary Converter Using the Moduli Set {2n + 1, 2n, 2n 1}
An Efficient RNS to Binary Converter Using the oduli Set {n + 1, n, n 1} Kazeem Alagbe Gbolagade 1,, ember, IEEE and Sorin Dan Cotofana 1, Senior ember IEEE, 1. Computer Engineering Laboratory, Delft University
AN1229. Class B Safety Software Library for PIC MCUs and dspic DSCs OVERVIEW OF THE IEC 60730 STANDARD INTRODUCTION
Class B Safety Software Library for PIC MCUs and dspic DSCs AN1229 Authors: Veena Kudva & Adrian Aur Microchip Technology Inc. OVERVIEW OF THE IEC 60730 STANDARD INTRODUCTION This application note describes
Fixed-Point Arithmetic: An Introduction
Fixed-Point Arithmetic: An Introduction 1 (15) Fixed-Point Arithmetic: An Introduction Randy Yates January 2, 2013 s i g n a l p r o c e s s i n g s y s t e m s s http://www.digitalsignallabs.com Typeset
Caml Virtual Machine File & data formats Document version: 1.4 http://cadmium.x9c.fr
Caml Virtual Machine File & data formats Document version: 1.4 http://cadmium.x9c.fr Copyright c 2007-2010 Xavier Clerc cadmium@x9c.fr Released under the LGPL version 3 February 6, 2010 Abstract: This
Data Storage. Chapter 3. Objectives. 3-1 Data Types. Data Inside the Computer. After studying this chapter, students should be able to:
Chapter 3 Data Storage Objectives After studying this chapter, students should be able to: List five different data types used in a computer. Describe how integers are stored in a computer. Describe how
1. Give the 16 bit signed (twos complement) representation of the following decimal numbers, and convert to hexadecimal:
Exercises 1 - number representations Questions 1. Give the 16 bit signed (twos complement) representation of the following decimal numbers, and convert to hexadecimal: (a) 3012 (b) - 435 2. For each of
2000: 3100 pages ( Source: Volkswagen AG ) This chapter will start with a brief comparison between the two types of processor.
C28x IQ Math Library Introduction One of the most important estimations in embedded control is the calculation of computing time for a given task. Since embedded control has to cope with these tasks in
FPGA Implementation of an Extended Binary GCD Algorithm for Systolic Reduction of Rational Numbers
FPGA Implementation of an Extended Binary GCD Algorithm for Systolic Reduction of Rational Numbers Bogdan Mătăsaru and Tudor Jebelean RISC-Linz, A 4040 Linz, Austria email: bmatasar@risc.uni-linz.ac.at
Chapter 1: Digital Systems and Binary Numbers
Chapter 1: Digital Systems and Binary Numbers Digital age and information age Digital computers general purposes many scientific, industrial and commercial applications Digital systems telephone switching
Number and codes in digital systems
Number and codes in digital systems Decimal Numbers You are familiar with the decimal number system because you use them everyday. But their weighted structure is not understood. In the decimal number
AN727. Credit Card Reader Using a PIC12C509 DATA ENCODING INTRODUCTION FIGURE 1: POSITION OF ISO TRACKS 1, 2 AND 3. Andrew M Errington
Credit Using a PIC12C509 AN727 Author: INTRODUCTION Andrew M Errington Many people carry one or more magnetically encoded cards with them for accessing a range of services. Perhaps the most common example
Zuse's Z3 Square Root Algorithm Talk given at Fall meeting of the Ohio Section of the MAA October 1999 - College of Wooster
Zuse's Z3 Square Root Algorithm Talk given at Fall meeting of the Ohio Section of the MAA October 1999 - College of Wooster Abstract Brian J. Shelburne Dept of Math and Comp Sci Wittenberg University In
26 Integers: Multiplication, Division, and Order
26 Integers: Multiplication, Division, and Order Integer multiplication and division are extensions of whole number multiplication and division. In multiplying and dividing integers, the one new issue
Decimals Adding and Subtracting
1 Decimals Adding and Subtracting Decimals are a group of digits, which express numbers or measurements in units, tens, and multiples of 10. The digits for units and multiples of 10 are followed by a decimal
MS Access: Advanced Tables and Queries. Lesson Notes Author: Pamela Schmidt
Lesson Notes Author: Pamela Schmidt Tables Text Fields (Default) Text or combinations of text and numbers, as well as numbers that don't require calculations, such as phone numbers. or the length set by
Numerical Matrix Analysis
Numerical Matrix Analysis Lecture Notes #10 Conditioning and / Peter Blomgren, blomgren.peter@gmail.com Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research
COMP 250 Fall 2012 lecture 2 binary representations Sept. 11, 2012
Binary numbers The reason humans represent numbers using decimal (the ten digits from 0,1,... 9) is that we have ten fingers. There is no other reason than that. There is nothing special otherwise about