Digital Logic Design: An Embedded Systems Approach Using VHDL. Chapter 3 Numeric Basics

Size: px
Start display at page:

Download "Digital Logic Design: An Embedded Systems Approach Using VHDL. Chapter 3 Numeric Basics"

Transcription

1 Dgtal Logc Desgn. Chapter 3 6 March 7 Dgtal Logc Desgn: An Embedded Systems Approach Usng VHDL Chapter 3 Numerc Bascs Portons of ths work are from the book, Dgtal Logc Desgn: An Embedded Systems Approach Usng VHDL, by Peter J. Ashenden, publshed by Morgan Kaufmann Publshers, Copyrght 7 Elsever Inc. All rghts reserved. Numerc Bascs Representng and processng numerc data s a common requrement unsgned ntegers sgned ntegers fxed-pont real numbers floatng-pont real numbers complex numbers Dgtal Logc Desgn. Chapter 3 KU EECS 4/4

2 Dgtal Logc Desgn. Chapter 3 6 March 7 Unsgned Integers Non-negatve numbers (ncludng ) Represent real-world data e.g., temperature, poston, tme, Also used n controllng operaton of a dgtal system e.g., countng teratons, table ndces Coded usng unsgned bnary (base ) representaton analogous to decmal representaton Dgtal Logc Desgn. Chapter 3 3 Bnary Representaton Decmal: base 4 = Bnary: base 4 = = In general, a number x s represented usng n bts as x n, x n,, x, where x = x n n n + xn + + x Dgtal Logc Desgn. Chapter 3 4 KU EECS 4/4

3 Dgtal Logc Desgn. Chapter 3 6 March 7 Bnary Representaton Unsgned bnary s a code for numbers n bts: represent numbers from to n : ; n : To represent x: x N, need log N bts Computers use 8-bt bytes:,, 55 3-bt words:,, ~4 bllon Dgtal crcuts can use what ever sze s approprate Dgtal Logc Desgn. Chapter 3 5 Unsgned Integers n VHDL Package numerc_std provdes unsgned vector type and arthmetc operatons lbrary eee; use eee.std_logc_64.all, eee.numerc_std.all; entty multplexer_6bt_4_to_ s port ( a, a, a, a3 : n unsgned (5 downto ); sel : n std_logc_vector ( downto ); z : out unsgned (5 downto ) ); end entty multplexer_6bt_4_to_; archtecture eqn of multplexer_6bt_4_to_ s begn wth sel select z <= a when "", a when "", a when "", a3 when others; end archtecture eqn; Dgtal Logc Desgn. Chapter 3 6 KU EECS 4/4 3

4 Dgtal Logc Desgn. Chapter 3 6 March 7 Octal and Hexadecmal Short-hand notatons for vectors of bts Octal (base 8) Each group of 3 bts represented by a dgt :, :, :,, 7: 53 8 = = 33 8 Hex (base 6) Each group of 4 bts represented by a dgt :,, 9:, A:,, F: 3CE 6 = = CB 6 Dgtal Logc Desgn. Chapter 3 7 Extendng Unsgned Numbers To extend an n-bt number to m bts Add leadng bts e.g., 7 = = x() x() x(n ) y() y) y(n ) y(n) y(m ) y(m ) sgnal x : unsgned(3 downto ); sgnal y : unsgned(7 downto ); y <= "" & x; y <= resze(x, 8); Dgtal Logc Desgn. Chapter 3 8 KU EECS 4/4 4

5 Dgtal Logc Desgn. Chapter 3 6 March 7 Truncatng Unsgned Numbers To truncate from m bts to n bts Dscard leftmost bts Value s preserved f dscarded bts are Result s x mod n y() y) x() x() x <= y(3 downto ); y(n ) y(n) y(m ) y(m ) x(n ) x <= resze(y, 4); Dgtal Logc Desgn. Chapter 3 9 Unsgned Addton Performed n the same way as decmal carry bts overflow Dgtal Logc Desgn. Chapter 3 KU EECS 4/4 5

6 Dgtal Logc Desgn. Chapter 3 6 March 7 Addton Crcuts Half adder for least-sgnfcant bts s = x y = x y c Full adder c for remanng bts s = = x ( x y ) c y + ( x y ) c x y c s c + + Dgtal Logc Desgn. Chapter 3 Rpple-Carry Adder Full adder for each bt, c = x n y n x y x y x y c n full adder c n c + full adder c c full adder c full adder c s n s n s s s overflow Worst-case delay from x, y to s n carry must rpple through ntervenng stages, affectng sum bts Dgtal Logc Desgn. Chapter 3 KU EECS 4/4 6

7 Dgtal Logc Desgn. Chapter 3 6 March 7 Improvng Adder Performance Carry kll: Carry propagate: Carry generate: Adder equatons k p g = x y = x y = x y x y c s c + s = p c c+ = g + p c Dgtal Logc Desgn. Chapter 3 3 Fast-Carry-Chan Adder Also called Manchester adder x y x y +V p g p k c + c c + c Xlnx FPGAs nclude ths structure s s Dgtal Logc Desgn. Chapter 3 4 KU EECS 4/4 7

8 Dgtal Logc Desgn. Chapter 3 6 March 7 Carry Lookahead c + = g + p c c = g + p c c ( g + p c ) = g + p g + p p = g + p c c 3 = g + p g + p p g + p p p c c 4 = g 3 + p 3 + p p 3 g + p p g 3 p + p 3 g p p p c Dgtal Logc Desgn. Chapter 3 5 Carry-Lookahead Adder Avods chaned carry crcut x 3 y 3 x y x y x y g 3 p 3 g p g p g p c 4 carry-lookahead generator c p 3 c 3 p c p c p s 3 s s s Use multlevel lookahead for wder numbers Dgtal Logc Desgn. Chapter 3 6 KU EECS 4/4 8

9 Dgtal Logc Desgn. Chapter 3 6 March 7 Other Optmzed Adders Other adders are based on other reformulatons of adder equatons Choce of adder depends on constrants e.g., rpple-carry has low area, so s ok for low performance crcuts e.g., Manchester adder ok n FPGAs that nclude carry-chan crcuts Dgtal Logc Desgn. Chapter 3 7 Adders n VHDL Use operatons from numerc_std lbrary eee; use eee.numerc_std.all;... sgnal x, y, s: unsgned(7 downto );... s <= a + b; sgnal tmp_result : unsgned(8 downto ); sgnal c : std_logc;... tmp_result <= ('' & a) + ('' & b); c <= tmp_result(8); s <= tmp_result(7 downto ); Dgtal Logc Desgn. Chapter 3 8 KU EECS 4/4 9

10 Dgtal Logc Desgn. Chapter 3 6 March 7 Unsgned Subtracton As n decmal borrow bts Dgtal Logc Desgn. Chapter 3 9 Subtracton Crcuts For least-sgnfcant bts d = x y b = x y For remanng bts b + d = ( x y ) b = x y + ( x y ) b x y b s b + Dgtal Logc Desgn. Chapter 3 KU EECS 4/4

11 Dgtal Logc Desgn. Chapter 3 6 March 7 Adder/Subtracter Crcuts Many systems add and subtract Trck: use complemented borrows c + s = = x ( x y ) c y + ( x y ) c Addton b + d = = x Subtracton ( x y ) b y + ( x y ) b Same hardware can perform both For subtracton: complement y, set b = Dgtal Logc Desgn. Chapter 3 Adder/Subtracter Crcuts x n x x y n y y add/sub ovf/und x n x x y n y c n adder y c s n s s s n /d n s /d s /d Adder can be any of those we have seen depends on constrants Dgtal Logc Desgn. Chapter 3 KU EECS 4/4

12 Dgtal Logc Desgn. Chapter 3 6 March 7 Subtracton n VHDL lbrary eee; use eee.std_logc_64.all, eee.numerc_std.all; entty adder_subtracter s port ( x, y : n unsgned( downto ); s : out unsgned( downto ); mode : n std_logc; error : out std_logc ); end entty adder_subtracter; archtecture behavor of adder_subtracter s sgnal s_tmp : unsgned( downto ); begn s_tmp <= ('' & x) + ('' & y) when mode = '' else ('' & x) - ('' & y); s <= s_tmp( downto ); error <= s_tmp(); end archtecture behavor; Dgtal Logc Desgn. Chapter 3 3 Increment and Decrement Addng : set y = and c = s = x c c+ = x c These are equatons for a half adder x n c n x c x c x +V c n half adder c + half adder c half adder half adder s n s n s s s Smlarly for decrementng: subtractng Dgtal Logc Desgn. Chapter 3 4 KU EECS 4/4

13 Dgtal Logc Desgn. Chapter 3 6 March 7 Increment/Decrement n VHDL Just add or subtract sgnal x, s: unsgned(5 downto );... s <= x + ; -- ncrement x s <= x ; -- decrement x Note: (nteger), not '' (bt) Dgtal Logc Desgn. Chapter 3 5 Equalty Comparson XNOR gate: equalty of two bts Apply btwse to two unsgned numbers x y x y x n y n eq In VHDL, x = y gves a boolean result false or true can't assgn to a std_logc sgnal eq <= '' when x = y else ''; Dgtal Logc Desgn. Chapter 3 6 KU EECS 4/4 3

14 Dgtal Logc Desgn. Chapter 3 6 March 7 Inequalty Comparson Magntude comparator for x > y x n y n x n > y n x n = y n gt x n y n x n > y n x n = y n x n > y n x y x > y x > y x = y x y x > y Dgtal Logc Desgn. Chapter 3 7 Comparson Example n VHDL Thermostat wth target termperature Heater or cooler on when actual temperature s more than 5 from target entty thermostat s port ( target, actual : n unsgned(7 downto ); heater_on, cooler_on : out std_logc ); end entty thermostat; archtecture rtl of thermostat s begn heater_on <= '' when actual < target - 5 else ''; cooler_on <= '' when actual > target + 5 else ''; end archtecture rtl; Dgtal Logc Desgn. Chapter 3 8 KU EECS 4/4 4

15 Dgtal Logc Desgn. Chapter 3 6 March 7 Scalng by Power of x = x n n n + xn + + x Ths s x shfted left k places, wth k bts of added on the rght logcal shft left by k places e.g., 3 = Truncate f result must ft n n bts overflow f any truncated bt s not k ( ) + () k x = x + k + n k + n k n + xn + + x + Dgtal Logc Desgn. Chapter 3 9 x Scalng by Power of x = x n n n + xn + + x k n k n k / xn + xn + + xk + xk + + x = Ths s x shfted rght k places, wth k bts truncated on the rght logcal shft rght by k places e.g., / 3 = Fll on the left wth k bts of f result must ft n n bts k Dgtal Logc Desgn. Chapter 3 3 KU EECS 4/4 5

16 Dgtal Logc Desgn. Chapter 3 6 March 7 Scalng n VHDL shft_left and shft_rght operatons result s same sze as operand s = = 9 s = = 9 y <= shft_left(s, ); y <= shft_rght(s, ); y = = 76 y = = 4 Dgtal Logc Desgn. Chapter 3 3 Unsgned Multplcaton xy = x = y n n ( y + y + + y ) n n x n + y n n x n y x s called a partal product f y =, then y x = f y =, then y x s x shfted left by Combnatonal array multpler AND gates form partal products adders form full product + + y x Dgtal Logc Desgn. Chapter 3 3 KU EECS 4/4 6

17 Dgtal Logc Desgn. Chapter 3 6 March 7 Unsgned Multplcaton Adders can be any of those we have seen Optmzed multplers combne parts of adjacent adders y x n x n x x y n y n c n adder y c s n s s s x n x n x x y y x n x n x x y n y n c n adder s n s s x n x n y c s x x y x n x n x x y n y n y c n adder y c s n s s s x n x n x x y x n x n x x y n y x n x n x x y n y n c n adder s s y c s n s p n p n p n+ p n p n p p p Dgtal Logc Desgn. Chapter 3 33 Product Sze Greatest result for n-bt operands: ( n )( n ) = n n n + = n n+ ( ) Requres n bts to avod overflow Addng n-bt and m-bt operands requres n + m bts sgnal x : unsgned(7 downto ); sgnal y : unsgned(3 downto ); sgnal p : unsgned( downto );... p <= x * y; Dgtal Logc Desgn. Chapter 3 34 KU EECS 4/4 7

18 Dgtal Logc Desgn. Chapter 3 6 March 7 Other Unsgned Operatons Dvson, remander More complcated than multplcaton Large crcut area, power Complcated operatons are often performed sequentally n a sequence of steps, one per clock cycle cost/performance/power trade-off Dgtal Logc Desgn. Chapter 3 35 Gray Codes Important for poston encoders Only one bt changes at a tme Segment Code Segment Code See book for n-bt Gray code Dgtal Logc Desgn. Chapter 3 36 KU EECS 4/4 8

19 Dgtal Logc Desgn. Chapter 3 6 March 7 Sgned Integers Postve and negatve numbers (and ) n-bt sgned magntude code bt for sgn: +, n bts for magntude Sgned-magntude rarely used for ntegers now crcuts are too complex Use s-complement bnary code Dgtal Logc Desgn. Chapter 3 37 s-complement Representaton x = x n n n + xn + + x Most-negatve number = n Most-postve number = + n x n = negatve, x n = non-negatve n + + = n Snce Dgtal Logc Desgn. Chapter 3 38 KU EECS 4/4 9

20 Dgtal Logc Desgn. Chapter 3 6 March 7 s-complement Examples = = 53 = = = 75 = = = 8 = +7 Dgtal Logc Desgn. Chapter 3 39 Sgned Integers n VHDL Type sgned from numerc_std lbrary eee; use eee.numerc_std.all;... s : sgned(5 downto ); Types sgned and unsgned are dstnct sgnal s : unsgned( downto ); sgnal s : sgned( downto );... s <= s; -- llegal s <= unsgned(s); -- s s known to be non-negatve... s <= sgned(s); -- s s known to be less than ** Dgtal Logc Desgn. Chapter 3 4 KU EECS 4/4

21 Dgtal Logc Desgn. Chapter 3 6 March 7 Octal and Hex Sgned Integers Don t thnk of sgned octal or hex Just treat octal or hex as shorthand for a vector of bts E.g., 844 s In hex: 34C E.g., 4 s In octal: 76 ( bts) Dgtal Logc Desgn. Chapter 3 4 Reszng Sgned Integers To extend a non-negatve number Add leadng bts e.g., 53 = = To truncate a non-negatve number Dscard leftmost bts, provded dscarded bts are all sgn bt of result s E.g., 4 s Truncatng to 6 bts: error! Dgtal Logc Desgn. Chapter 3 4 KU EECS 4/4

22 Dgtal Logc Desgn. Chapter 3 6 March 7 Reszng Sgned Integers To extend a negatve number Add leadng bts See textbook for proof e.g., 75 = = To truncate a negatve number Dscard leftmost bts, provded dscarded bts are all sgn bt of result s Dgtal Logc Desgn. Chapter 3 43 Reszng Sgned Integers In general, for s-complement ntegers Extend by replcatng sgn bt sgn extenson Truncate by dscardng leadng bts Dscarded bts must all be the same, and the same as the sgn bt of the result x() x() x(n ) y() y) y(n ) y(n) y(m ) y(m ) sgnal x : sgned (7 downto ); sgnal y : sgned (5 downto );... y <= resze(x, y'length);... x <= resze(y, x'length); Dgtal Logc Desgn. Chapter 3 44 KU EECS 4/4

23 Dgtal Logc Desgn. Chapter 3 6 March 7 Sgned Negaton Complement and add x = x + = ( x = Note that n = ( x n = x n + x n n ) n n + ( n + x n + n n + ( x + n x n n + + = x n x ) n n ) + n + + x + + ( x ) + + E.g., 43 s so 43 s + = ) + + Dgtal Logc Desgn. Chapter 3 45 x Sgned Negaton What about negatng n? + = Result s n! Recall range of n-bt numbers s not symmetrc Ether check for overflow, extend by one bt, or ensure ths case can t arse In VHDL: use operator E.g., y <= x; Dgtal Logc Desgn. Chapter 3 46 KU EECS 4/4 3

24 Dgtal Logc Desgn. Chapter 3 6 March 7 Sgned Addton = n n x x n + xn y = y n + yn x n + y = ( xn + yn ) + xn + yn yelds c n Perform addton as for unsgned Overflow f c n dffers from c n See textbook for case analyss Can use the same crcut for sgned and unsgned addton Dgtal Logc Desgn. Chapter 3 47 Sgned Addton Examples 7: 49: 63: 3: 4: 8: : 95: 34: no overflow no overflow no overflow 7: 5: 63: 96: 4: 8: 34: postve overflow negatve overflow no overflow Dgtal Logc Desgn. Chapter 3 48 KU EECS 4/4 4

25 Dgtal Logc Desgn. Chapter 3 6 March 7 Sgned Addton n VHDL Result of + s same sze as operands sgnal v, v : sgned( downto ); sgnal sum : sgned( downto );... sum <= resze(v, sum'length) + resze(v sum'length); To check overflow, compare sgns sgnal x, y, z: sgned(7 downto ); sgnal ovf : std_logc;... z <= x + y; ovf <= (not x(7) and not y(7) and z(7)) or (x(7) and y(7) and not z(7)); Dgtal Logc Desgn. Chapter 3 49 Sgned Subtracton x y = x + ( y) = x + y + Use a s-complement adder Complement y and set c = x n x x y n y y add/sub unsgned ovf/und x n x x y n y c n adder y c sgned ovf c n s n s s s n /d n s /d s /d Dgtal Logc Desgn. Chapter 3 5 KU EECS 4/4 5

26 Dgtal Logc Desgn. Chapter 3 6 March 7 Other Sgned Operatons Increment, decrement same as unsgned Comparson =, same as unsgned >, compare sgn bts usng Multplcaton x n yn Complcated by the need to sgn extend partal products Refer to Further Readng Dgtal Logc Desgn. Chapter 3 5 Scalng Sgned Integers Multplyng by k logcal left shft (as for unsgned) truncate result usng s-complement rules Dvdng by k arthmetc rght shft dscard k bts from the rght, and replcate sgn bt k tmes on the left e.g., s = "" -- 3 shft_rght(s, ) = "" -- 3 / Dgtal Logc Desgn. Chapter 3 5 KU EECS 4/4 6

27 Dgtal Logc Desgn. Chapter 3 6 March 7 Fxed-Pont Numbers Many applcatons use non-ntegers especally sgnal-processng apps Fxed-pont numbers allow for fractonal parts represented as ntegers that are mplctly scaled by a power of can be unsgned or sgned Dgtal Logc Desgn. Chapter 3 53 Postonal Notaton In decmal.4 In bnary = = = Represent as a bt vector: bnary pont s mplct Dgtal Logc Desgn. Chapter 3 54 KU EECS 4/4 7

28 Dgtal Logc Desgn. Chapter 3 6 March 7 Unsgned Fxed-Pont n-bt unsgned fxed-pont m bts before and f bts after bnary pont x = x x m m + + x + x + + Range: to m f Precson: f m may be, gvng fractons only e.g., m= :. f f Dgtal Logc Desgn. Chapter 3 55 Sgned Fxed-Pont n-bt sgned s-complement fxed-pont m bts before and f bts after bnary pont x = x x m m + + x + x + + Range: m to m f Precson: f E.g.,, sgned fxed-pont, m =. = =.875 f f Dgtal Logc Desgn. Chapter 3 56 KU EECS 4/4 8

29 Dgtal Logc Desgn. Chapter 3 6 March 7 Choosng Range and Precson Choce depends on applcaton Need to understand the numercal behavor of computatons performed some operatons can magnfy quantzaton errors In DSP fxed-pont range affects dynamc range precson affects sgnal-to-nose rato Perform smulatons to evaluate effects Dgtal Logc Desgn. Chapter 3 57 Fxed-Pont n VHDL Use numerc_bt wth mpled scalng Use proposed fxed_pkg package Currently beng standardzed by IEEE Types ufxed and sfxed Arthmetc operatons, reszng, converson lbrary eee_proposed; use eee_proposed.fxed_pkg.all; entty fxed_converter s port ( nput : n ufxed(5 downto -7); output : out sfxed(7 downto -7) ); end entty fxed_converter; Dgtal Logc Desgn. Chapter 3 58 KU EECS 4/4 9

30 Dgtal Logc Desgn. Chapter 3 6 March 7 Fxed-Pont Operatons Just use nteger hardware e.g., addton: f f f x + y = ( x + y ) / a 7 a 6 a 5 a 4 x -bt adder Ensure bnary ponts are algned a 3 x 7 x 8 x 9 b 4 b 3 y y 7 s s 7 s 8 s 9 c 4 c 3 c 4 c 5 b 4 b 5 y 8 y 9 Dgtal Logc Desgn. Chapter 3 59 Floatng-Pont Numbers Smlar to scentfc notaton for decmal e.g., , Allow for larger range, wth same relatve precson throughout the range mantssa radx exponent Dgtal Logc Desgn. Chapter 3 6 KU EECS 4/4 3

31 Dgtal Logc Desgn. Chapter 3 6 March 7 IEEE Floatng-Pont Format e bts m bts s exponent mantssa x = M E = ( s). mantssa exponent e + s: sgn bt ( non-negatve, negatve) Normalze:. M <. M always has a leadng pre-bnary-pont bt, so no need to represent t explctly (hdden bt) Exponent: excess representaton: E + e Dgtal Logc Desgn. Chapter 3 6 Floatng-Pont Range Exponents... and... reserved Smallest value exponent:... E = e + mantssa:... M =. Largest value exponent:... E = e mantssa:... M. Range: e + x < e Dgtal Logc Desgn. Chapter 3 6 KU EECS 4/4 3

32 Dgtal Logc Desgn. Chapter 3 6 March 7 Floatng-Pont Precson Relatve precson approxmately m all mantssa bts are sgnfcant m bts of precson m log m.3 decmal dgts Dgtal Logc Desgn. Chapter 3 63 Example Formats IEEE sngle precson, 3 bts e = 8, m = 3 range ±. 38 to ±.7 38 precson 7 decmal dgts Applcaton-specfc, bts e = 5, m = 6 range ±6. 5 to ±6.6 4 precson 5 decmal dgts Dgtal Logc Desgn. Chapter 3 64 KU EECS 4/4 3

33 Dgtal Logc Desgn. Chapter 3 6 March 7 Denormal Numbers Exponent =... hdden bt s x = M E = ( s). mantssa Smaller than normal numbers allow for gradual underflow, wth dmnshng precson Mantssa =... x = M E = ( s). e + = ± e +. Dgtal Logc Desgn. Chapter 3 65 Infntes and NaNs Exponent =..., mantssa =... ±Infnty Can be used n subsequent calculatons, avodng need for overflow check Exponent =..., mantssa... Not-a-Number (NaN) Indcates llegal or undefned result e.g.,. /. Can be used n subsequent calculatons Dgtal Logc Desgn. Chapter 3 66 KU EECS 4/4 33

34 Dgtal Logc Desgn. Chapter 3 6 March 7 Floatng-Pont Operatons Consderably more complcated than nteger operatons E.g., addton unpack, algn bnary ponts, adjust exponents add mantssas, check for exceptons round and normalze result, adjust exponent Combnatonal crcuts not feasble Ppelned sequental crcuts Dgtal Logc Desgn. Chapter 3 67 Floatng-Pont n VHDL Use proposed float_pkg package Currently beng standardzed by IEEE Types float, float3, float64, float8 Arthmetc operatons, reszng, converson Not lkely to be syntheszable Rather, use to verfy results of handoptmzed crcuts Dgtal Logc Desgn. Chapter 3 68 KU EECS 4/4 34

35 Dgtal Logc Desgn. Chapter 3 6 March 7 Summary Unsgned: Sgned: x = x = x Octal and Hex short-hand n n xn + xn + + x n n n + xn + + x Operatons: resze, arthmetc, compare Arthmetc crcuts trade off speed/area/power Fxed- and floatng-pont non-ntegers Gray codes for poston encodng Dgtal Logc Desgn. Chapter 3 69 KU EECS 4/4 35

Quantization Effects in Digital Filters

Quantization Effects in Digital Filters Quantzaton Effects n Dgtal Flters Dstrbuton of Truncaton Errors In two's complement representaton an exact number would have nfntely many bts (n general). When we lmt the number of bts to some fnte value

More information

Multiplication Algorithms for Radix-2 RN-Codings and Two s Complement Numbers

Multiplication Algorithms for Radix-2 RN-Codings and Two s Complement Numbers Multplcaton Algorthms for Radx- RN-Codngs and Two s Complement Numbers Jean-Luc Beuchat Projet Arénare, LIP, ENS Lyon 46, Allée d Itale F 69364 Lyon Cedex 07 jean-luc.beuchat@ens-lyon.fr Jean-Mchel Muller

More information

Implementation of Deutsch's Algorithm Using Mathcad

Implementation of Deutsch's Algorithm Using Mathcad Implementaton of Deutsch's Algorthm Usng Mathcad Frank Roux The followng s a Mathcad mplementaton of Davd Deutsch's quantum computer prototype as presented on pages - n "Machnes, Logc and Quantum Physcs"

More information

Lecture 2: Single Layer Perceptrons Kevin Swingler

Lecture 2: Single Layer Perceptrons Kevin Swingler Lecture 2: Sngle Layer Perceptrons Kevn Sngler kms@cs.str.ac.uk Recap: McCulloch-Ptts Neuron Ths vastly smplfed model of real neurons s also knon as a Threshold Logc Unt: W 2 A Y 3 n W n. A set of synapses

More information

Texas Instruments 30X IIS Calculator

Texas Instruments 30X IIS Calculator Texas Instruments 30X IIS Calculator Keystrokes for the TI-30X IIS are shown for a few topcs n whch keystrokes are unque. Start by readng the Quk Start secton. Then, before begnnng a specfc unt of the

More information

What is Candidate Sampling

What is Candidate Sampling What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble

More information

A Crossplatform ECG Compression Library for Mobile HealthCare Services

A Crossplatform ECG Compression Library for Mobile HealthCare Services A Crossplatform ECG Compresson Lbrary for Moble HealthCare Servces Alexander Borodn, Yulya Zavyalova Department of Computer Scence Petrozavodsk State Unversty Petrozavodsk, Russa {aborod, yzavyalo}@cs.petrsu.ru

More information

where the coordinates are related to those in the old frame as follows.

where the coordinates are related to those in the old frame as follows. Chapter 2 - Cartesan Vectors and Tensors: Ther Algebra Defnton of a vector Examples of vectors Scalar multplcaton Addton of vectors coplanar vectors Unt vectors A bass of non-coplanar vectors Scalar product

More information

Logistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification

Logistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification Lecture 4: More classfers and classes C4B Machne Learnng Hlary 20 A. Zsserman Logstc regresson Loss functons revsted Adaboost Loss functons revsted Optmzaton Multple class classfcaton Logstc Regresson

More information

NPAR TESTS. One-Sample Chi-Square Test. Cell Specification. Observed Frequencies 1O i 6. Expected Frequencies 1EXP i 6

NPAR TESTS. One-Sample Chi-Square Test. Cell Specification. Observed Frequencies 1O i 6. Expected Frequencies 1EXP i 6 PAR TESTS If a WEIGHT varable s specfed, t s used to replcate a case as many tmes as ndcated by the weght value rounded to the nearest nteger. If the workspace requrements are exceeded and samplng has

More information

21 Vectors: The Cross Product & Torque

21 Vectors: The Cross Product & Torque 21 Vectors: The Cross Product & Torque Do not use our left hand when applng ether the rght-hand rule for the cross product of two vectors dscussed n ths chapter or the rght-hand rule for somethng curl

More information

Multiple stage amplifiers

Multiple stage amplifiers Multple stage amplfers Ams: Examne a few common 2-transstor amplfers: -- Dfferental amplfers -- Cascode amplfers -- Darlngton pars -- current mrrors Introduce formal methods for exactly analysng multple

More information

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..

More information

Implementation of Boolean Functions through Multiplexers with the Help of Shannon Expansion Theorem

Implementation of Boolean Functions through Multiplexers with the Help of Shannon Expansion Theorem Internatonal Journal o Computer pplcatons (975 8887) Volume 62 No.6, January 23 Implementaton o Boolean Functons through Multplexers wth the Help o Shannon Expanson Theorem Saurabh Rawat Graphc Era Unversty.

More information

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel

More information

Level Annuities with Payments Less Frequent than Each Interest Period

Level Annuities with Payments Less Frequent than Each Interest Period Level Annutes wth Payments Less Frequent than Each Interest Perod 1 Annuty-mmedate 2 Annuty-due Level Annutes wth Payments Less Frequent than Each Interest Perod 1 Annuty-mmedate 2 Annuty-due Symoblc approach

More information

Loop Parallelization

Loop Parallelization - - Loop Parallelzaton C-52 Complaton steps: nested loops operatng on arrays, sequentell executon of teraton space DECLARE B[..,..+] FOR I :=.. FOR J :=.. I B[I,J] := B[I-,J]+B[I-,J-] ED FOR ED FOR analyze

More information

The Greedy Method. Introduction. 0/1 Knapsack Problem

The Greedy Method. Introduction. 0/1 Knapsack Problem The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton

More information

+ + + - - This circuit than can be reduced to a planar circuit

+ + + - - This circuit than can be reduced to a planar circuit MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to

More information

An Alternative Way to Measure Private Equity Performance

An Alternative Way to Measure Private Equity Performance An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate

More information

A Probabilistic Theory of Coherence

A Probabilistic Theory of Coherence A Probablstc Theory of Coherence BRANDEN FITELSON. The Coherence Measure C Let E be a set of n propostons E,..., E n. We seek a probablstc measure C(E) of the degree of coherence of E. Intutvely, we want

More information

NOTE: The Flatpak version has the same pinouts (Connection Diagram) as the Dual In-Line Package. *MR for LS160A and LS161A *SR for LS162A and LS163A

NOTE: The Flatpak version has the same pinouts (Connection Diagram) as the Dual In-Line Package. *MR for LS160A and LS161A *SR for LS162A and LS163A BCD DECADE COUNTERS/ 4-BIT BINARY COUNTERS The LS160A/ 161A/ 162A/ 163A are hgh-speed 4-bt synchronous counters. They are edge-trggered, synchronously presettable, and cascadable MSI buldng blocks for

More information

Fast Variants of RSA

Fast Variants of RSA Fast Varants of RSA Dan Boneh dabo@cs.stanford.edu Hovav Shacham hovav@cs.stanford.edu Abstract We survey three varants of RSA desgned to speed up RSA decrypton. These varants are backwards compatble n

More information

Professor Iordanis Karagiannidis. 2010 Iordanis Karagiannidis

Professor Iordanis Karagiannidis. 2010 Iordanis Karagiannidis Fnancal Modelng Notes Basc Excel Fnancal Functons Professor Iordans Karagannds Excel Functons Excel Functons are preformatted formulas that allow you to perform arthmetc and other operatons very quckly

More information

RSA Cryptography using Designed Processor and MicroBlaze Soft Processor in FPGAs

RSA Cryptography using Designed Processor and MicroBlaze Soft Processor in FPGAs RSA Cryptography usng Desgne Processor an McroBlaze Soft Processor n FPGAs M. Nazrul Islam Monal Dept. of CSE, Rajshah Unversty of Engneerng an Technology, Rajshah-6204, Banglaesh M. Al Mamun Dept. of

More information

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) 2127472, Fax: (370-5) 276 1380, Email: info@teltonika.

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) 2127472, Fax: (370-5) 276 1380, Email: info@teltonika. VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual

More information

A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression

A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy S-curve Regresson Cheng-Wu Chen, Morrs H. L. Wang and Tng-Ya Hseh Department of Cvl Engneerng, Natonal Central Unversty,

More information

Calculation of Sampling Weights

Calculation of Sampling Weights Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample

More information

Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting

Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting Causal, Explanatory Forecastng Assumes cause-and-effect relatonshp between system nputs and ts output Forecastng wth Regresson Analyss Rchard S. Barr Inputs System Cause + Effect Relatonshp The job of

More information

Section 5.4 Annuities, Present Value, and Amortization

Section 5.4 Annuities, Present Value, and Amortization Secton 5.4 Annutes, Present Value, and Amortzaton Present Value In Secton 5.2, we saw that the present value of A dollars at nterest rate per perod for n perods s the amount that must be deposted today

More information

1 Example 1: Axis-aligned rectangles

1 Example 1: Axis-aligned rectangles COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton

More information

Binary Division. Decimal Division. Hardware for Binary Division. Simple 16-bit Divider Circuit

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

More information

Using Series to Analyze Financial Situations: Present Value

Using Series to Analyze Financial Situations: Present Value 2.8 Usng Seres to Analyze Fnancal Stuatons: Present Value In the prevous secton, you learned how to calculate the amount, or future value, of an ordnary smple annuty. The amount s the sum of the accumulated

More information

Floating point package user s guide By David Bishop (dbishop@vhdl.org)

Floating point package user s guide By David Bishop (dbishop@vhdl.org) Floating point package user s guide By David Bishop (dbishop@vhdl.org) Floating-point numbers are the favorites of software people, and the least favorite of hardware people. The reason for this is because

More information

IMPACT ANALYSIS OF A CELLULAR PHONE

IMPACT ANALYSIS OF A CELLULAR PHONE 4 th ASA & μeta Internatonal Conference IMPACT AALYSIS OF A CELLULAR PHOE We Lu, 2 Hongy L Bejng FEAonlne Engneerng Co.,Ltd. Bejng, Chna ABSTRACT Drop test smulaton plays an mportant role n nvestgatng

More information

v a 1 b 1 i, a 2 b 2 i,..., a n b n i.

v a 1 b 1 i, a 2 b 2 i,..., a n b n i. SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are

More information

SCHEDULING OF CONSTRUCTION PROJECTS BY MEANS OF EVOLUTIONARY ALGORITHMS

SCHEDULING OF CONSTRUCTION PROJECTS BY MEANS OF EVOLUTIONARY ALGORITHMS SCHEDULING OF CONSTRUCTION PROJECTS BY MEANS OF EVOLUTIONARY ALGORITHMS Magdalena Rogalska 1, Wocech Bożeko 2,Zdzsław Heduck 3, 1 Lubln Unversty of Technology, 2- Lubln, Nadbystrzycka 4., Poland. E-mal:rogalska@akropols.pol.lubln.pl

More information

PERRON FROBENIUS THEOREM

PERRON FROBENIUS THEOREM PERRON FROBENIUS THEOREM R. CLARK ROBINSON Defnton. A n n matrx M wth real entres m, s called a stochastc matrx provded () all the entres m satsfy 0 m, () each of the columns sum to one, m = for all, ()

More information

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.

More information

Brigid Mullany, Ph.D University of North Carolina, Charlotte

Brigid Mullany, Ph.D University of North Carolina, Charlotte Evaluaton And Comparson Of The Dfferent Standards Used To Defne The Postonal Accuracy And Repeatablty Of Numercally Controlled Machnng Center Axes Brgd Mullany, Ph.D Unversty of North Carolna, Charlotte

More information

Conversion between the vector and raster data structures using Fuzzy Geographical Entities

Conversion between the vector and raster data structures using Fuzzy Geographical Entities Converson between the vector and raster data structures usng Fuzzy Geographcal Enttes Cdála Fonte Department of Mathematcs Faculty of Scences and Technology Unversty of Combra, Apartado 38, 3 454 Combra,

More information

SPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background:

SPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background: SPEE Recommended Evaluaton Practce #6 efnton of eclne Curve Parameters Background: The producton hstores of ol and gas wells can be analyzed to estmate reserves and future ol and gas producton rates and

More information

Step : Create Dependency Graph for Data Path Step b: 8-way Addition? So, the data operations are: 8 multiplications one 8-way addition Balanced binary

Step : Create Dependency Graph for Data Path Step b: 8-way Addition? So, the data operations are: 8 multiplications one 8-way addition Balanced binary RTL Design RTL Overview Gate-level design is now rare! design automation is necessary to manage the complexity of modern circuits only library designers use gates automated RTL synthesis is now almost

More information

On-Line Fault Detection in Wind Turbine Transmission System using Adaptive Filter and Robust Statistical Features

On-Line Fault Detection in Wind Turbine Transmission System using Adaptive Filter and Robust Statistical Features On-Lne Fault Detecton n Wnd Turbne Transmsson System usng Adaptve Flter and Robust Statstcal Features Ruoyu L Remote Dagnostcs Center SKF USA Inc. 3443 N. Sam Houston Pkwy., Houston TX 77086 Emal: ruoyu.l@skf.com

More information

STANDING WAVE TUBE TECHNIQUES FOR MEASURING THE NORMAL INCIDENCE ABSORPTION COEFFICIENT: COMPARISON OF DIFFERENT EXPERIMENTAL SETUPS.

STANDING WAVE TUBE TECHNIQUES FOR MEASURING THE NORMAL INCIDENCE ABSORPTION COEFFICIENT: COMPARISON OF DIFFERENT EXPERIMENTAL SETUPS. STADIG WAVE TUBE TECHIQUES FOR MEASURIG THE ORMAL ICIDECE ABSORPTIO COEFFICIET: COMPARISO OF DIFFERET EXPERIMETAL SETUPS. Angelo Farna (*), Patrzo Faust (**) (*) Dpart. d Ing. Industrale, Unverstà d Parma,

More information

Laddered Multilevel DC/AC Inverters used in Solar Panel Energy Systems

Laddered Multilevel DC/AC Inverters used in Solar Panel Energy Systems Proceedngs of the nd Internatonal Conference on Computer Scence and Electroncs Engneerng (ICCSEE 03) Laddered Multlevel DC/AC Inverters used n Solar Panel Energy Systems Fang Ln Luo, Senor Member IEEE

More information

Solution: Let i = 10% and d = 5%. By definition, the respective forces of interest on funds A and B are. i 1 + it. S A (t) = d (1 dt) 2 1. = d 1 dt.

Solution: Let i = 10% and d = 5%. By definition, the respective forces of interest on funds A and B are. i 1 + it. S A (t) = d (1 dt) 2 1. = d 1 dt. Chapter 9 Revew problems 9.1 Interest rate measurement Example 9.1. Fund A accumulates at a smple nterest rate of 10%. Fund B accumulates at a smple dscount rate of 5%. Fnd the pont n tme at whch the forces

More information

1. Measuring association using correlation and regression

1. Measuring association using correlation and regression How to measure assocaton I: Correlaton. 1. Measurng assocaton usng correlaton and regresson We often would lke to know how one varable, such as a mother's weght, s related to another varable, such as a

More information

Linear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits

Linear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits Lnear Crcuts Analyss. Superposton, Theenn /Norton Equalent crcuts So far we hae explored tmendependent (resste) elements that are also lnear. A tmendependent elements s one for whch we can plot an / cure.

More information

CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol

CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK Sample Stablty Protocol Background The Cholesterol Reference Method Laboratory Network (CRMLN) developed certfcaton protocols for total cholesterol, HDL

More information

Formulating & Solving Integer Problems Chapter 11 289

Formulating & Solving Integer Problems Chapter 11 289 Formulatng & Solvng Integer Problems Chapter 11 289 The Optonal Stop TSP If we drop the requrement that every stop must be vsted, we then get the optonal stop TSP. Ths mght correspond to a ob sequencng

More information

An interactive system for structure-based ASCII art creation

An interactive system for structure-based ASCII art creation An nteractve system for structure-based ASCII art creaton Katsunor Myake Henry Johan Tomoyuk Nshta The Unversty of Tokyo Nanyang Technologcal Unversty Abstract Non-Photorealstc Renderng (NPR), whose am

More information

Frequency Selective IQ Phase and IQ Amplitude Imbalance Adjustments for OFDM Direct Conversion Transmitters

Frequency Selective IQ Phase and IQ Amplitude Imbalance Adjustments for OFDM Direct Conversion Transmitters Frequency Selectve IQ Phase and IQ Ampltude Imbalance Adjustments for OFDM Drect Converson ransmtters Edmund Coersmeer, Ernst Zelnsk Noka, Meesmannstrasse 103, 44807 Bochum, Germany edmund.coersmeer@noka.com,

More information

EE 261 Introduction to Logic Circuits. Module #2 Number Systems

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

More information

2010 NCSL International Workshop and Symposium

2010 NCSL International Workshop and Symposium Impact of Harmonc Current on Energy Meter Calbraton Speaker: Steven Wenzerl, Radan Research, Inc., 852 Fortune Drve, Lafayette, IN, 47905, USA, (765) 449-5548, stevew@radanresearch.com Authors: Shannon

More information

Project Networks With Mixed-Time Constraints

Project Networks With Mixed-Time Constraints Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa

More information

Descriptive Models. Cluster Analysis. Example. General Applications of Clustering. Examples of Clustering Applications

Descriptive Models. Cluster Analysis. Example. General Applications of Clustering. Examples of Clustering Applications CMSC828G Prncples of Data Mnng Lecture #9 Today s Readng: HMS, chapter 9 Today s Lecture: Descrptve Modelng Clusterng Algorthms Descrptve Models model presents the man features of the data, a global summary

More information

RESEARCH ON DUAL-SHAKER SINE VIBRATION CONTROL. Yaoqi FENG 1, Hanping QIU 1. China Academy of Space Technology (CAST) yaoqi.feng@yahoo.

RESEARCH ON DUAL-SHAKER SINE VIBRATION CONTROL. Yaoqi FENG 1, Hanping QIU 1. China Academy of Space Technology (CAST) yaoqi.feng@yahoo. ICSV4 Carns Australa 9- July, 007 RESEARCH ON DUAL-SHAKER SINE VIBRATION CONTROL Yaoq FENG, Hanpng QIU Dynamc Test Laboratory, BISEE Chna Academy of Space Technology (CAST) yaoq.feng@yahoo.com Abstract

More information

Forecasting the Direction and Strength of Stock Market Movement

Forecasting the Direction and Strength of Stock Market Movement Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract - Stock market s one of the most complcated systems

More information

Compiling for Parallelism & Locality. Dependence Testing in General. Algorithms for Solving the Dependence Problem. Dependence Testing

Compiling for Parallelism & Locality. Dependence Testing in General. Algorithms for Solving the Dependence Problem. Dependence Testing Complng for Parallelsm & Localty Dependence Testng n General Assgnments Deadlne for proect 4 extended to Dec 1 Last tme Data dependences and loops Today Fnsh data dependence analyss for loops General code

More information

Statistical algorithms in Review Manager 5

Statistical algorithms in Review Manager 5 Statstcal algorthms n Reve Manager 5 Jonathan J Deeks and Julan PT Hggns on behalf of the Statstcal Methods Group of The Cochrane Collaboraton August 00 Data structure Consder a meta-analyss of k studes

More information

CS 2750 Machine Learning. Lecture 3. Density estimation. CS 2750 Machine Learning. Announcements

CS 2750 Machine Learning. Lecture 3. Density estimation. CS 2750 Machine Learning. Announcements Lecture 3 Densty estmaton Mlos Hauskrecht mlos@cs.ptt.edu 5329 Sennott Square Next lecture: Matlab tutoral Announcements Rules for attendng the class: Regstered for credt Regstered for audt (only f there

More information

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange

More information

A Master Time Value of Money Formula. Floyd Vest

A Master Time Value of Money Formula. Floyd Vest A Master Tme Value of Money Formula Floyd Vest For Fnancal Functons on a calculator or computer, Master Tme Value of Money (TVM) Formulas are usually used for the Compound Interest Formula and for Annutes.

More information

Extending Probabilistic Dynamic Epistemic Logic

Extending Probabilistic Dynamic Epistemic Logic Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set

More information

Little s Law & Bottleneck Law

Little s Law & Bottleneck Law Lttle s Law & Bottleneck Law Dec 20 I professonals have shunned performance modellng consderng t to be too complex and napplcable to real lfe. A lot has to do wth fear of mathematcs as well. hs tutoral

More information

Measures of Error: for exact x and approximation x Absolute error e = x x. Relative error r = (x x )/x.

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.

More information

An MILP model for planning of batch plants operating in a campaign-mode

An MILP model for planning of batch plants operating in a campaign-mode An MILP model for plannng of batch plants operatng n a campagn-mode Yanna Fumero Insttuto de Desarrollo y Dseño CONICET UTN yfumero@santafe-concet.gov.ar Gabrela Corsano Insttuto de Desarrollo y Dseño

More information

Section 5.3 Annuities, Future Value, and Sinking Funds

Section 5.3 Annuities, Future Value, and Sinking Funds Secton 5.3 Annutes, Future Value, and Snkng Funds Ordnary Annutes A sequence of equal payments made at equal perods of tme s called an annuty. The tme between payments s the payment perod, and the tme

More information

Matrix Multiplication I

Matrix Multiplication I Matrx Multplcaton I Yuval Flmus February 2, 2012 These notes are based on a lecture gven at the Toronto Student Semnar on February 2, 2012. The materal s taen mostly from the boo Algebrac Complexty Theory

More information

Logical Development Of Vogel s Approximation Method (LD-VAM): An Approach To Find Basic Feasible Solution Of Transportation Problem

Logical Development Of Vogel s Approximation Method (LD-VAM): An Approach To Find Basic Feasible Solution Of Transportation Problem INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME, ISSUE, FEBRUARY ISSN 77-866 Logcal Development Of Vogel s Approxmaton Method (LD- An Approach To Fnd Basc Feasble Soluton Of Transportaton

More information

Face Verification Problem. Face Recognition Problem. Application: Access Control. Biometric Authentication. Face Verification (1:1 matching)

Face Verification Problem. Face Recognition Problem. Application: Access Control. Biometric Authentication. Face Verification (1:1 matching) Face Recognton Problem Face Verfcaton Problem Face Verfcaton (1:1 matchng) Querymage face query Face Recognton (1:N matchng) database Applcaton: Access Control www.vsage.com www.vsoncs.com Bometrc Authentcaton

More information

DEFINING %COMPLETE IN MICROSOFT PROJECT

DEFINING %COMPLETE IN MICROSOFT PROJECT CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,

More information

CHAPTER 14 MORE ABOUT REGRESSION

CHAPTER 14 MORE ABOUT REGRESSION CHAPTER 14 MORE ABOUT REGRESSION We learned n Chapter 5 that often a straght lne descrbes the pattern of a relatonshp between two quanttatve varables. For nstance, n Example 5.1 we explored the relatonshp

More information

Can Auto Liability Insurance Purchases Signal Risk Attitude?

Can Auto Liability Insurance Purchases Signal Risk Attitude? Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159-164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? Chu-Shu L Department of Internatonal Busness, Asa Unversty, Tawan Sheng-Chang

More information

ECE 3401 Lecture 7. Concurrent Statements & Sequential Statements (Process)

ECE 3401 Lecture 7. Concurrent Statements & Sequential Statements (Process) ECE 3401 Lecture 7 Concurrent Statements & Sequential Statements (Process) Concurrent Statements VHDL provides four different types of concurrent statements namely: Signal Assignment Statement Simple Assignment

More information

The Full-Wave Rectifier

The Full-Wave Rectifier 9/3/2005 The Full Wae ectfer.doc /0 The Full-Wae ectfer Consder the followng juncton dode crcut: s (t) Power Lne s (t) 2 Note that we are usng a transformer n ths crcut. The job of ths transformer s to

More information

Parallel Numerical Simulation of Visual Neurons for Analysis of Optical Illusion

Parallel Numerical Simulation of Visual Neurons for Analysis of Optical Illusion 212 Thrd Internatonal Conference on Networkng and Computng Parallel Numercal Smulaton of Vsual Neurons for Analyss of Optcal Illuson Akra Egashra, Shunj Satoh, Hdetsugu Ire and Tsutomu Yoshnaga Graduate

More information

An RFID Distance Bounding Protocol

An RFID Distance Bounding Protocol An RFID Dstance Boundng Protocol Gerhard P. Hancke and Markus G. Kuhn May 22, 2006 An RFID Dstance Boundng Protocol p. 1 Dstance boundng Verfer d Prover Places an upper bound on physcal dstance Does not

More information

A machine vision approach for detecting and inspecting circular parts

A machine vision approach for detecting and inspecting circular parts A machne vson approach for detectng and nspectng crcular parts Du-Mng Tsa Machne Vson Lab. Department of Industral Engneerng and Management Yuan-Ze Unversty, Chung-L, Tawan, R.O.C. E-mal: edmtsa@saturn.yzu.edu.tw

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.

More information

total A A reag total A A r eag

total A A reag total A A r eag hapter 5 Standardzng nalytcal Methods hapter Overvew 5 nalytcal Standards 5B albratng the Sgnal (S total ) 5 Determnng the Senstvty (k ) 5D Lnear Regresson and albraton urves 5E ompensatng for the Reagent

More information

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. 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

More information

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. 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

More information

Credit Limit Optimization (CLO) for Credit Cards

Credit Limit Optimization (CLO) for Credit Cards Credt Lmt Optmzaton (CLO) for Credt Cards Vay S. Desa CSCC IX, Ednburgh September 8, 2005 Copyrght 2003, SAS Insttute Inc. All rghts reserved. SAS Propretary Agenda Background Tradtonal approaches to credt

More information

Implementation of Modified Booth Algorithm (Radix 4) and its Comparison with Booth Algorithm (Radix-2)

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

More information

The Network flow Motoring System based on Particle Swarm Optimized

The Network flow Motoring System based on Particle Swarm Optimized The Network flow Motorng System based on Partcle Swarm Optmzed Neural Network Adult Educaton College, Hebe Unversty of Archtecture, Zhangjakou Hebe 075000, Chna Abstract The compatblty of the commercal

More information

Simulation and optimization of supply chains: alternative or complementary approaches?

Simulation and optimization of supply chains: alternative or complementary approaches? Smulaton and optmzaton of supply chans: alternatve or complementary approaches? Chrstan Almeder Margaretha Preusser Rchard F. Hartl Orgnally publshed n: OR Spectrum (2009) 31:95 119 DOI 10.1007/s00291-007-0118-z

More information

Analysis of Reactivity Induced Accident for Control Rods Ejection with Loss of Cooling

Analysis of Reactivity Induced Accident for Control Rods Ejection with Loss of Cooling Analyss of Reactvty Induced Accdent for Control Rods Ejecton wth Loss of Coolng Hend Mohammed El Sayed Saad 1, Hesham Mohammed Mohammed Mansour 2 Wahab 1 1. Nuclear and Radologcal Regulatory Authorty,

More information

Section C2: BJT Structure and Operational Modes

Section C2: BJT Structure and Operational Modes Secton 2: JT Structure and Operatonal Modes Recall that the semconductor dode s smply a pn juncton. Dependng on how the juncton s based, current may easly flow between the dode termnals (forward bas, v

More information

Traffic-light a stress test for life insurance provisions

Traffic-light a stress test for life insurance provisions MEMORANDUM Date 006-09-7 Authors Bengt von Bahr, Göran Ronge Traffc-lght a stress test for lfe nsurance provsons Fnansnspetonen P.O. Box 6750 SE-113 85 Stocholm [Sveavägen 167] Tel +46 8 787 80 00 Fax

More information

Efficient Striping Techniques for Variable Bit Rate Continuous Media File Servers æ

Efficient Striping Techniques for Variable Bit Rate Continuous Media File Servers æ Effcent Strpng Technques for Varable Bt Rate Contnuous Meda Fle Servers æ Prashant J. Shenoy Harrck M. Vn Department of Computer Scence, Department of Computer Scences, Unversty of Massachusetts at Amherst

More information

IDENTIFICATION AND CORRECTION OF A COMMON ERROR IN GENERAL ANNUITY CALCULATIONS

IDENTIFICATION AND CORRECTION OF A COMMON ERROR IN GENERAL ANNUITY CALCULATIONS IDENTIFICATION AND CORRECTION OF A COMMON ERROR IN GENERAL ANNUITY CALCULATIONS Chrs Deeley* Last revsed: September 22, 200 * Chrs Deeley s a Senor Lecturer n the School of Accountng, Charles Sturt Unversty,

More information

Optical Signal-to-Noise Ratio and the Q-Factor in Fiber-Optic Communication Systems

Optical Signal-to-Noise Ratio and the Q-Factor in Fiber-Optic Communication Systems Applcaton ote: FA-9.0. Re.; 04/08 Optcal Sgnal-to-ose Rato and the Q-Factor n Fber-Optc Communcaton Systems Functonal Dagrams Pn Confguratons appear at end of data sheet. Functonal Dagrams contnued at

More information

Joe Pimbley, unpublished, 2005. Yield Curve Calculations

Joe Pimbley, unpublished, 2005. Yield Curve Calculations Joe Pmbley, unpublshed, 005. Yeld Curve Calculatons Background: Everythng s dscount factors Yeld curve calculatons nclude valuaton of forward rate agreements (FRAs), swaps, nterest rate optons, and forward

More information

SIMPLE LINEAR CORRELATION

SIMPLE LINEAR CORRELATION SIMPLE LINEAR CORRELATION Smple lnear correlaton s a measure of the degree to whch two varables vary together, or a measure of the ntensty of the assocaton between two varables. Correlaton often s abused.

More information

An Analysis of Central Processor Scheduling in Multiprogrammed Computer Systems

An Analysis of Central Processor Scheduling in Multiprogrammed Computer Systems STAN-CS-73-355 I SU-SE-73-013 An Analyss of Central Processor Schedulng n Multprogrammed Computer Systems (Dgest Edton) by Thomas G. Prce October 1972 Techncal Report No. 57 Reproducton n whole or n part

More information

Time Value of Money Module

Time Value of Money Module Tme Value of Money Module O BJECTIVES After readng ths Module, you wll be able to: Understand smple nterest and compound nterest. 2 Compute and use the future value of a sngle sum. 3 Compute and use the

More information

An ILP Formulation for Task Mapping and Scheduling on Multi-core Architectures

An ILP Formulation for Task Mapping and Scheduling on Multi-core Architectures An ILP Formulaton for Task Mappng and Schedulng on Mult-core Archtectures Yng Y, We Han, Xn Zhao, Ahmet T. Erdogan and Tughrul Arslan Unversty of Ednburgh, The Kng's Buldngs, Mayfeld Road, Ednburgh, EH9

More information

V. Chandrasekhar. National Instruments, Austin, TX, USA E-mail: Vikram.Chandrasekhar@ni.com

V. Chandrasekhar. National Instruments, Austin, TX, USA E-mail: Vikram.Chandrasekhar@ni.com 28 Int. J. Embedded Systems, Vol. 3, No. 3, 2008 Reducng dynamc power consumpton n next generaton DS-CDMA moble communcaton recevers V. Chandrasekhar Natonal Instruments, Austn, TX, USA E-mal: Vkram.Chandrasekhar@n.com

More information