Module #6: Combinational Logic Design with VHDL Part 2 (Arithmetic)
|
|
- Grant Barrett
- 6 years ago
- Views:
Transcription
1 ECOM4311 Dgtal Systems Desgn : Combnatonal Logc Desgn wth VHDL Part 2 (Arthmetc) - A crcut that compares dgtal values (.e., Equal, Greater Than, Less Than) Agenda Adders (Rpple Carry, Carry-Look-Ahead) 3. Subtracton 4. Multplcaton 5. Fxed Pont, Floatng Pont numbers Assgnment Read Chapter 3 - We are consderng Dgtal (Analog comparators also exst) - Typcally there wll be 3-outputs, of whch only one s asserted - Whether a bt s EQ, GT, or LT s a Boolean expresson - A 2-Bt Dgtal Comparator would look lke: (A=B) (A>B) (A<B) A B EQ GT LT EQ = (AB)' GT = A LT = A' ECOM4311 Dgtal Systems Desgn Page 1 ECOM4311 Dgtal Systems Desgn Page 2 Non-Iteratve Non-Iteratve - "Iteratve" refers to a crcut made up of dentcal blocks. The frst block performs ts operaton whch produces a result used n the 2nd block and so on. - Ths can be thought of as a "Rpple" effect - Iteratve crcuts tend to be slower due to the rpple, but take less area "Greater Than" - We can start at the MSB (n) and check whether A n >B n. - If t s, we are done and can gnore the rest of the LSB's. - If t s NOT, but they are equal, we need to check the next MSB bt (n-1) - Non-Iteratve crcuts consst of combnatonal logc executng at the same tme " - Snce each bt n a vector must be equal, the outputs of each bt's compare can be AND'd - To ensure the prevous bt was equal, we nclude t n the next LSB's logc expresson. - For a 4-bt comparator: EQ = (A3B3)' (A2B2)' (A1B1)' (A0B0)' ECOM4311 Dgtal Systems Desgn Page 3 ECOM4311 Dgtal Systems Desgn Page 4 Non-Iteratve Non-Iteratve - Steps - GT = A n n ' (ths s ONLY true f A n >B n ) - If t s NOT GT, we go to the n-1 bt assumng that A n = B n : (A n B n - We consder A n-1 >B n-1 only when A n = B n [.e., (A n B n A n-1 n-1 ') ] - We contnue ths process through all of the bts "Less - Snce we assume that f the vectors are ether EQ, GT, or LT, we can create LT usng: LT = EQ' - Ex. 4-bt comparator GT = (A3B3') + (A3B3)' (A2B2') + (A3B3)' (A2B2)' (A1B1') + (A3B3)' (A2B2)' (A1B1)' (A0B0') ECOM4311 Dgtal Systems Desgn Page 5 ECOM4311 Dgtal Systems Desgn Page 6
2 Iteratve n VHDL - We can buld an teratve comparator by passng sgnals between dentcal modules from MSB to LSB ex) module for 1-bt comparator EQ out = (AB)' EQ n - EQ out s fed nto the EQ n port of the next LSB module - Structural Model entty comparator_4bt s port (In1, In2 : n STD_LOGIC_VECTOR (3 downto 0); EQ, LT, GT : out STD_LOGIC); end entty comparator_4bt; archtecture comparator_4bt_arch of comparator_4bt s - The frst teratve module has EQ n set to '1' sgnal Bt_Equal : STD_LOGIC_VECTOR (3 downto 0); sgnal Bt_GT : STD_LOGIC_VECTOR (3 downto 0); sgnal In2_n : STD_LOGIC_VECTOR (3 downto 0); sgnal In1_and_In2_n : STD_LOGIC_VECTOR (3 downto 0); sgnal EQ_temp, GT_temp : STD_LOGIC; ECOM4311 Dgtal Systems Desgn Page 7 ECOM4311 Dgtal Systems Desgn Page 8 n VHDL n VHDL - Structural Model - Structural Model component xnor2 port (In1,In2: n STD_LOGIC; Out1: out STD_LOGIC); component or4 port (In1,In2,In3,In4: n STD_LOGIC; Out1: out STD_LOGIC); component nor2 port (In1,In2: n STD_LOGIC; Out1: out STD_LOGIC); component and2 port (In1,In2: n STD_LOGIC; Out1: out STD_LOGIC); component and3 port (In1,In2,In3: n STD_LOGIC; Out1: out STD_LOGIC); component and4 port (In1,In2,In3,In4: n STD_LOGIC; Out1: out STD_LOGIC); component nv1 port (In1: n STD_LOGIC; Out1: out STD_LOGIC); begn -- "Equal" Crcutry XN0 : xnor2 port map (In1(0), In2(0), Bt_Equal(0)); XN1 : xnor2 port map (In1(1), In2(1), Bt_Equal(1)); XN2 : xnor2 port map (In1(2), In2(2), Bt_Equal(2)); XN3 : xnor2 port map (In1(3), In2(3), Bt_Equal(3)); AN0 : and4 port map (Bt_Equal(0), Bt_Equal(1), Bt_Equal(2), Bt_Equal(3), Eq); AN1 : and4 port map (Bt_Equal(0), Bt_Equal(1), Bt_Equal(2), Bt_Equal(3), Eq_temp); -- 1st level of XNOR tree -- 2nd level of "Equal" Tree ECOM4311 Dgtal Systems Desgn Page 9 ECOM4311 Dgtal Systems Desgn Page 10 n VHDL n VHDL - Structural Model - Structural Model -- "Greater Than" Crcutry IV0 : nv1 port map (In2(0), In2_n(0)); IV1 : nv1 port map (In2(1), In2_n(1)); IV2 : nv1 port map (In2(2), In2_n(2)); IV3 : nv1 port map (In2(3), In2_n(3)); -- creatng In2' OR0 : or4 OR1 : or4 port map (In1_and_In2_n(3), Bt_GT(2), Bt_GT(1), Bt_GT(0), GT); port map (In1_and_In2_n(3), Bt_GT(2), Bt_GT(1), Bt_GT(0), GT_temp); AN2 : and2 port map (In1(3), In2_n(3), In1_and_In2_n(3)); -- creatng In1 & In2' AN3 : and2 port map (In1(2), In2_n(2), In1_and_In2_n(2)); AN4 : and2 port map (In1(1), In2_n(1), In1_and_In2_n(1)); AN5 : and2 port map (In1(0), In2_n(0), In1_and_In2_n(0)); AN6 : and2 port map (Bt_Equal(3), In1_and_In2_n(2), Bt_GT(2)); AN7 : and3 port map (Bt_Equal(3), Bt_Equal(2), In1_and_In2_n(1), Bt_GT(1)); AN8 : and4 port map (Bt_Equal(3), Bt_Equal(2), Bt_Equal(1), In1_and_In2_n(0), Bt_GT(0)); -- "Less Than" Crcutry ND0 : nor2 port map (EQ_temp, GT_temp, LT); end archtecture comparator_4bt_arch; ECOM4311 Dgtal Systems Desgn Page 11 ECOM4311 Dgtal Systems Desgn Page 12
3 Comparator Sgned - We dscussed Structural (Unsgned) - We can also descrbe behavorally - Sgned Comparator. - Unsgned Comparator. ECOM4311 Dgtal Systems Desgn Page 13 ECOM4311 Dgtal Systems Desgn Page 14 Carry Rpple Adder Comparator Unsgned Addton Half Adder - One bt addton can be accomplshed wth an XOR gate (modulo sum 2) Notce - The - Ths - It ECOM4311 Dgtal Systems Desgn Page 15 ECOM4311 Dgtal Systems Desgn Page 16 Carry Rpple Adder Carry Rpple Adder Addton Full Adder Addton Carry Rpple Adder - To Cn A B Cout Sum Sum = A B Cn Cout = Cn + ACn Cascadng Full Adders together wll allow the to propagate (or Rpple) through the crcut - Ths confguraton s called a Carry Rpple Adder - You could also use two "Half Adders" to accomplsh the same thng ECOM4311 Dgtal Systems Desgn Page 17 ECOM4311 Dgtal Systems Desgn Page 18
4 Carry Rpple Adder Carry Rpple Adder Addton Carry Rpple Adder Addton Carry Rpple Adder - What s the delay through the Full Adder? - What s the delay through the entre teratve crcut? - Each Full Adder has the followng logc: Sum = A B Cn Cout = Cn + ACn - t Full-Adder wll be the longest combnatonal logc delay path n the adder - The delay of the whole Carry Rpple Adder s t RCA = n Full-Adder - the delay ncreases lnearly wth the number of bts - dfferent topologes wthn the full-adder to reduce delay (t) wll have a (nt) effect ECOM4311 Dgtal Systems Desgn Page 19 ECOM4311 Dgtal Systems Desgn Page 20 Improvng Adder Performance Carry Rpple Adder VHDL Code Carry kll: Carry propagate: Carry generate: Adder equatons k x y p x y g x y x y c s c s p c c 1 g p c ECOM4311 Dgtal Systems Desgn Page 21 ECOM4311 Dgtal Systems Desgn Page 22 Addton Carry Look Ahead Adder Addton Carry Look Ahead Adder - To avod the rpple, we can buld a Carry Look-Ahead Adder (CLA) - Ths crcut calculates the carry for all Full-Adders at the same tme Propagate "p", an adder () wll propagate (or pass through) a carry n (C ) dependng on nput condtons A and B, : - We defne the followng ntermedate stages of a CLA: Generate "g", an adder () generates a carry out (C +1 ) under nput condtons A and B ndependent of A -1, B -1, or Carry In (C ) A B C we can say that: g = A remember, g does NOT consder carry n (C ) C A B C p s defned when there s a carry n, so we gnore the row entres where C = f we only look at the C =1 rows we can say that: p = (A +B C ECOM4311 Dgtal Systems Desgn Page 23 ECOM4311 Dgtal Systems Desgn Page 24
5 Addton Carry Look Ahead Adder Addton Carry Look Ahead Adder - Sad another way, Adder() wll "Generate" a Carry Out (C +1 ) f: g = A and t wll "Propagate" a Carry In (C ) when p = (A +B C - We can elmnate ths dependence by recursvely expandng each Carry Equaton ex) 4 bt Carry Look Ahead Logc C 1 = g 0 +p 0 0 (2-Level Product-of-Sums) - A full expresson for the Carry Out (C +1 ) n terms of p and g s gven by: C 2 = g 1 +p 1 1 C 2 = g 1 +p 1 g 0 +p 0 0 ) C 2 = g 1 +p 1 g 0 +p (2-Level Product-of-Sums) C +1 = g +p - Ths s good, but we stll generate Carry's dependant on prevous stages (-1) of the teratve crcut C 3 = g 2 +p 2 2 C 3 = g 2 +p 2 g 1 +p 1 g 0 +p ) C 3 = g 2 +p 2 g 1 +p 2 1 g 0 +p (2-Level Product-of-Sums) ECOM4311 Dgtal Systems Desgn Page 25 ECOM4311 Dgtal Systems Desgn Page 26 Addton Carry Look Ahead Adder Addton Carry Look Ahead Adder ex) 4 bt Carry Look Ahead Logc C 4 = g 3 +p 3 3 C 4 = g 3 +p 3 g 2 +p 2 g 1 +p 2 1 g 0 +p ) C 4 = g 3 +p 3 g 2 +p 3 2 g 1 +p g 0 +p (2-Level Product-of-Sums) - Ths gves us logc expressons that can generate a next stage carry based upon ONLY the nputs to the adder and the orgnal carry n (C 0 ) - The Carry Look Ahead logc has 3 levels 1) g and p logc 2) product terms n the C equatons 3) sum terms n the C equatons - The Sum bts requre 2 levels of Logc 1) A B C NOTE: A Full Adder made up of 2 Half Adders has 3 levels. But the 3rd level s used n the creaton of the Carry Out bt. Snce we do not use t n a CLA, we can gnore that level. - So a CLA wll have a total of 5 levels of Logc ECOM4311 Dgtal Systems Desgn Page 27 ECOM4311 Dgtal Systems Desgn Page 28 Addton Carry Look Ahead Adder Addton Carry Look Ahead Adder - The 5 levels of logc are fxed no matter how many bts the adder s (really?) - In realty, the most sgnfcant Carry equaton wll have +1 nputs nto ts largest sum/product term - Ths means that Fan-In becomes a problem snce real gates tend to have less than 4-6 nputs - In the worst case, the logc Fan-In would be 2. Even n ths case, the delay assocated wth the Carry Look Ahead logc would be proportonal to log 2 (n) - Area and Power are also concerns wth CLA's. Typcally CLA's are used n computatonally ntense applcatons where performance outweghs Power and Area. - When the number of nputs gets larger than the Fan-In, the logc needs to be broken nto another level ex) A+B+C+D+E = (A+B+C+D)+E ECOM4311 Dgtal Systems Desgn Page 29 ECOM4311 Dgtal Systems Desgn Page 30
6 Fast-Carry-Chan Adder Also called Manchester adder Desgn: Carry Look Ahead Adder VHDL x y x y +V p g p k c c c +1 c Xlnx FPGAs nclude ths structure s s ECOM4311 Dgtal Systems Desgn Page 31 ECOM4311 Dgtal Systems Desgn Page 32 Carry Look Ahead Adder VHDL Carry Look Ahead Adder VHDL ECOM4311 Dgtal Systems Desgn Page 33 ECOM DIGITAL SYSTEMS DESIGN Lecture #22 Page 34 Adders n VHDL Consderatons - (+) and (-) are not defned for STD_LOGIC_VECTOR - The Package STD_LOGIC_ARITH gves two data types: UNSIGNED (3 downto 0) := "1111"; SIGNED (3 downto 0) := "1111"; these are stll resolved types (STD_LOGIC), but the equalty and arthmetc operatons are slghtly dfferent dependng on whether you are usng Sgned vs. Unsgned - when addng sgned and unsgned numbers, the type of the result wll dctate how the operands are handled/converted - f assgnng to an n-bt, SIGNED result, an n-1 UNSIGNED operand wll automatcally be converted to sgned by extendng ts vector length by 1 and fllng t wth a sgn bt (0) ECOM4311 Dgtal Systems Desgn Page 35 ECOM4311 Dgtal Systems Desgn Page 36
7 Adders n VHDL Adders n VHDL ex) A,B : n UNSIGNED (7 downto 0); C : n SIGNED (7 downto 0); D : n STD_LOGIC_VECTOR (7 downto 0); S : out UNSIGNED (8 downto 0); T : out SIGNED (8 downto 0); U : out SIGNED (7 downto 0); S(7 downto 0) <= A + B; -- 8-bt UNSIGNED addton, not consderng Carry S <= ('0' & A) + ('0' & B); -- manually ncreasng sze of A and B to nclude Carry. Carry wll be kept n S(9) T <= A + C; -- T s SIGNED, so A's UNSIGNED vector sze s ncreased by 1 and flled wth '0' as a sgn bt U <= C + SIGNED(D); U <= C + UNSIGNED(D); -- D s converted (consdered) to SIGNED, -- not ncreased n sze -- D s converted (consdered) to UNSIGNED, -- not ncreased n sze ECOM4311 Dgtal Systems Desgn Page 37 ECOM4311 Dgtal Systems Desgn Page 38 Multplers Multplers Multplers "Shft and Add" Multplers - bnary multplcaton of an ndvdual bt can be performed usng combnatonal logc: A * B P we can say that: P = A example of Bnary Multplcaton usng our "by hand" method multplcand x 13 x multpler these are the ndvdual multplcands _ the fnal product s the sum of all multplcands - for mult-bt multplcaton, we can mmc the algorthm that we use when dong multplcaton by hand. - ths s called the "Shft and Add" algorthm S - Ths s smple and straght forward. BUT, the addton of the ndvdual multplcand products requres as many as n-nputs. - We would really lke to re-use our Full Adder crcuts, whch only have 3 nputs. ECOM4311 Dgtal Systems Desgn Page 39 ECOM4311 Dgtal Systems Desgn Page 40 Multplers Multplers "Shft and Add" Multplers "Shft and Add" Multplers - We can perform the addtons of each multplcand after t s created - Ths s called a "Partal Product" - Graphcal vew of product terms and summaton - To keep the algorthm consstent, we use "0000" as the frst Partal Product Orgnal multplcand x Orgnal multpler Partal Product for 1st multply Shfted Multplcand for 1st multply Partal Product for 2nd multply Shfted Multplcand for 2nd multply Partal Product for 3rd multply Shfted Multplcand for 3rd multply Partal Product for 4th multply Shfted Multplcand for 4th multply the fnal product s the sum of all multplcands ECOM4311 Dgtal Systems Desgn Page 41 ECOM4311 Dgtal Systems Desgn Page 42
8 Multplers Multplers "Shft and Add" Multplers "Sequental" Multplers - Graphcal Vew of nterconnect for an 8x8 multpler. Note the Full Adders - The man speed lmtaton of the Combnatonal "Shft and Add" multpler s the delay through the adder chan. - In the worst case, the number of delay paths through the adders would be [n + 2(n-2)] ex) 4-bt = 8 Full Adders 8-bt = 20 Full Adders - We can decrease ths delay by usng a regster to accumulate the ncremental addtons as they take place. - Ths would reduce the number of operaton states to [n-1] ECOM4311 Dgtal Systems Desgn Page 43 ECOM4311 Dgtal Systems Desgn Page 44 Multplers Multplers "Carry Save" Multplers "Carry Save" Multplers - Another trck to speed up the multplcaton s to break the carry chan - We can run the 0th carry from the frst row of adders nto adder for the 2nd row - A fnal stage of adders s needed to recombne the carres. But ths reduces the delay to [n+(n-2)] ECOM4311 Dgtal Systems Desgn Page 45 ECOM4311 Dgtal Systems Desgn Page 46 Sgned Multplers Sgned Multplers Multplers Convert to Postve - We leaned the "Shft and Add" algorthm for constructng a combnatonal multpler - One of the smplest ways s to frst convert any negatve numbers to postve, then use the unsgned multpler - But ths only worked for unsgned numbers - The sgn bt s added after the multplcaton followng: - We can create a sgned multpler usng a smlar algorthm pos x pos = pos pos x neg = neg neg x pos = neg neg x neg = pos Remember 0=pos and 1=neg n 2's comp so ths s an XOR ECOM4311 Dgtal Systems Desgn Page 47 ECOM4311 Dgtal Systems Desgn Page 48
9 Sgned Multplers Sgned Multplers 2's Comp Multpler 2's Comp Shft and Add Multplers - Remember that n a "Shft and Add', we created a shfted multplcand - The shfted multplcand corresponded to the weght of the multpler bt - We can use ths same technque for 2's comp rememberng that - the MSB of a 2's comp # s -2 (n-1) - We can perform the addtons of each multplcand after t s created - Ths s called a "Partal Product" - To keep the algorthm consstent, we use "0000" as the frst Partal Product - We also must remember that 2's comp addton must - be on same-szed vectors - the carry s gnored - We can make partal products the same sze as shfted multplcands by dong a "2's comp sgn ex) 1011 = = Snce the MSB has a negatve weght, we NEGATE the shfted multplcand for that bt pror to the last addton Orgnal multplcand x Orgnal multpler Partal Product for 1st multply w/ Sgn Extenson Shfted Multplcand for 1st multply w/ Sgn Extenson Partal Product for 2nd multply w/ Sgn Extenson Shfted Multplcand for 2nd multply w/ Sgn Extenson Partal Product for 3rd multply w/ Sgn Extenson Shfted Multplcand for 3rd multply w/ Sgn Extenson Partal Product for 4th multply w/ Sgn Extenson NEGATED Shfted Multplcand for 4th multply w/ Sgn Ext the fnal product s the sum of all multplcands gnore Carry Out ECOM4311 Dgtal Systems Desgn Page 49 ECOM4311 Dgtal Systems Desgn Page 50 Dvson Dvson Dvson - "Repeated Subtracton" Dvson - "Shft and Subtract" - \ - We need to develop an algorthm to perform a dvson. - Dvson s smlar to multplcaton, but nstead of "Shft and Add", we "Shft and Subtract" - A smple algorthm to dvde s to count the number of tmes you can subtract the dvsor from the dvdend - Ths s slow, but smple - The number of tmes t can be subtracted wthout gong negatve s the "Quotent" - If the subtracted value results n a zero/negatve number, whatever was left pror to the subtracton s the "Remander" ECOM4311 Dgtal Systems Desgn Page 51 ECOM4311 Dgtal Systems Desgn Page 52 Fxed-Pont Numbers Postonal Notaton 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 2 can be unsgned or sgned In decmal In bnary Represent as a bt vector: bnary pont s mplct ECOM4311 Dgtal Systems Desgn Page 53 ECOM4311 Dgtal Systems Desgn Page 54
10 Unsgned Fxed-Pont Sgned Fxed-Pont n-bt unsgned fxed-pont m bts before and f bts after bnary pont n-bt sgned 2s-complement fxed-pont m bts before and f bts after bnary pont x m1 0 1 f xm 12 x0 2 x 12 x f 2 x m1 0 1 f xm 12 x0 2 x 12 x f 2 Range: 0 to 2 m 2 f Precson: 2 f m 0, gvng fractons only e.g., m = 2: Range: 2 m1 to 2 m1 2 f Precson: 2 f E.g., , sgned fxed-pont, m = = = ECOM4311 Dgtal Systems Desgn Page 55 ECOM4311 Dgtal Systems Desgn Page 56 Choosng Range and Precson Fxed-Pont n VHDL Choce depends on applcaton Use std_logc lbrares wth mpled scalng 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 Use proposed fxed_pkg package Currently beng standardzed by IEEE Types ufxed and sfxed Arthmetc operatons, reszng, converson Perform smulatons to evaluate effects 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; ECOM4311 Dgtal Systems Desgn Page 57 ECOM4311 Dgtal Systems Desgn Page 58 Fxed-Pont Operatons Floatng-Pont Numbers Just use nteger hardware e.g., addton: Smlar to scentfc notaton for decmal f f f x y ( x2 y2 ) / 2 a a a a x 0 10-bt adder e.g., , Allow for larger range, wth same relatve precson throughout the range a 3 x 7 x 8 s 0 c Ensure bnary ponts are algned b b 3 x 9 y 0 y 7 s 7 s 8 s 9 c 3 c 4 c b 4 b 5 y 8 y 9 mantssa radx exponent ECOM4311 Dgtal Systems Desgn Page 59 ECOM4311 Dgtal Systems Desgn Page 60
11 IEEE Floatng-Pont Format s: sgn bt (0 non-negatve, 1 negatve) Normalze: 1.0 M < 2.0 M always has a leadng pre-bnary-pont 1 bt, so no need to represent t explctly (hdden bt) e bts s exponent x M 2 E m bts mantssa ( 1 s) 1. mantssa2 Exponent: excess representaton: E + 2 e1 1 e exponent Floatng-Pont Range Exponents and reserved Smallest value exponent: E = 2 e1 + 2 mantssa: M = 1.0 Largest value exponent: E = 2 e1 1 mantssa: M 2.0 Range: 2 e1 2 2 x 2 e1 2 ECOM4311 Dgtal Systems Desgn Page 61 ECOM4311 Dgtal Systems Desgn Page 62 Example Formats Denormal Numbers IEEE sngle precson, 32 bts e = 8, m = 23 7 decmal dgts Applcaton-specfc, 22 bts e = 5, m = 16 5 decmal dgts Exponent = hdden bt s 0 x M 2 E Smaller than normal numbers allow for gradual underflow, wth dmnshng precson Mantssa = ( 1 s) 0. mantssa2 e x M 2 E ( 1 s) e ECOM4311 Dgtal Systems Desgn Page 63 ECOM4311 Dgtal Systems Desgn Page 64 Infntes and NaNs Floatng-Pont Operatons Exponent = , mantssa = Infnty Can be used n subsequent calculatons, avodng need for overflow check Exponent = Not-a-Number (NaN) Indcates llegal or undefned result e.g., 0.0 / 0.0 Can be used n subsequent calculatons 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 ECOM4311 Dgtal Systems Desgn Page 65 ECOM4311 Dgtal Systems Desgn Page 66
12 Floatng-Pont n VHDL Use proposed float_pkg package Currently beng standardzed by IEEE Types float, float32, float64, float128 Arthmetc operatons, reszng, converson Not lkely to be syntheszable Rather, use to verfy results of hand-optmzed crcuts ECOM4311 Dgtal Systems Desgn Page 67
Numbers. Principles Of Digital Design. Number Representations
Prncples Of Dgtal Desgn Numbers Number Representatons Decmal, Bnary Number System Complement Number System Fxed Pont and Floatng Pont Numbers Postonal Number System Each number s represented by a strng
More informationTOPICS MULTIPLIERLESS FILTER DESIGN ELEMENTARY SCHOOL ALGORITHM MULTIPLICATION
1 2 MULTIPLIERLESS FILTER DESIGN Realzaton of flters wthout full-fledged multplers Some sldes based on support materal by W. Wolf for hs book Modern VLSI Desgn, 3 rd edton. Partly based on followng papers:
More informationBit Juggling. Representing Information. representations. - Some other bits. - Representing information using bits - Number. Chapter
Representng Informaton 1 1 1 1 Bt Jugglng - Representng nformaton usng bts - Number representatons - Some other bts Chapter 3.1-3.3 REMINDER: Problem Set #1 s now posted and s due next Wednesday L3 Encodng
More informationCSE4210 Architecture and Hardware for DSP
4210 Archtecture and Hardware for DSP Lecture 1 Introducton & Number systems Admnstratve Stuff 4210 Archtecture and Hardware for DSP Text: VLSI Dgtal Sgnal Processng Systems: Desgn and Implementaton. K.
More informationContinued..& Multiplier
CS222: Computer Arthmetc : Adder Contnued..& Multpler Dr. A. Sahu Dept of Comp. Sc. & Engg. Indan Insttute of Technology Guwahat 1 Outlne Adder Unversal Use (N bt addton) RppleCarry Adder, Full Adder,
More informationDepartment of Electrical & Electronic Engineeing Imperial College London. E4.20 Digital IC Design. Median Filter Project Specification
Desgn Project Specfcaton Medan Flter Department of Electrcal & Electronc Engneeng Imperal College London E4.20 Dgtal IC Desgn Medan Flter Project Specfcaton A medan flter s used to remove nose from a sampled
More informationExample: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,
The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson
More informationA New Design of Multiplier using Modified Booth Algorithm and Reversible Gate Logic
Internatonal Journal of Computer Applcatons Technology and Research A New Desgn of Multpler usng Modfed Booth Algorthm and Reversble Gate Logc K.Nagarjun Department of ECE Vardhaman College of Engneerng,
More information9 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations
Physcs 171/271 - Chapter 9R -Davd Klenfeld - Fall 2005 9 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys a set
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationOutline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique
Outlne and Readng Dynamc Programmng The General Technque ( 5.3.2) -1 Knapsac Problem ( 5.3.3) Matrx Chan-Product ( 5.3.1) Dynamc Programmng verson 1.4 1 Dynamc Programmng verson 1.4 2 Dynamc Programmng
More informationUnit 2: Binary Numbering Systems
Unt 2: Bnary Numberng Systems Defntons Number bases Numercal representatons. Integer fxed pont. Bnary 2 s complement BCD Addton-subtracton Alphanumercal representatons Basc Bblography Any book on dgtal
More informationComplex Numbers. x = B B 2 4AC 2A. or x = x = 2 ± 4 4 (1) (5) 2 (1)
Complex Numbers If you have not yet encountered complex numbers, you wll soon do so n the process of solvng quadratc equatons. The general quadratc equaton Ax + Bx + C 0 has solutons x B + B 4AC A For
More information8.6 The Complex Number System
8.6 The Complex Number System Earler n the chapter, we mentoned that we cannot have a negatve under a square root, snce the square of any postve or negatve number s always postve. In ths secton we want
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationCombinational Circuit Design
Combnatonal Crcut Desgn Part I: Desgn Procedure and Examles Part II : Arthmetc Crcuts Part III : Multlexer, Decoder, Encoder, Hammng Code Combnatonal Crcuts n nuts Combnatonal Crcuts m oututs A combnatonal
More informationA Low Error and High Performance Multiplexer-Based Truncated Multiplier
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 18, NO. 1, DECEMBER 010 1767 A Low Error and Hgh Performance Multplexer-Based Truncated Multpler Chp-Hong Chang and Rav Kumar Satzoda
More informationNote on EM-training of IBM-model 1
Note on EM-tranng of IBM-model INF58 Language Technologcal Applcatons, Fall The sldes on ths subject (nf58 6.pdf) ncludng the example seem nsuffcent to gve a good grasp of what s gong on. Hence here are
More informationA Novel, Low-Power Array Multiplier Architecture
A Noel, Low-Power Array Multpler Archtecture by Ronak Bajaj, Saransh Chhabra, Sreehar Veeramachanen, MB Srnas n 9th Internatonal Symposum on Communcaton and Informaton Technology 29 (ISCIT 29) Songdo -
More informationTHE SUMMATION NOTATION Ʃ
Sngle Subscrpt otaton THE SUMMATIO OTATIO Ʃ Most of the calculatons we perform n statstcs are repettve operatons on lsts of numbers. For example, we compute the sum of a set of numbers, or the sum of the
More informationLecture 4: Adders. Computer Systems Laboratory Stanford University
Lecture 4: Adders Computer Systems Laboratory Stanford Unversty horowtz@stanford.edu Copyrght 2004 by Mark Horowtz (w/ Fgures from Hgh-Performance Mcroprocessor Desgn IEEE And Fgures from Bora Nkolc 1
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More information1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations
Physcs 171/271 -Davd Klenfeld - Fall 2005 (revsed Wnter 2011) 1 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys
More information8 Derivation of Network Rate Equations from Single- Cell Conductance Equations
Physcs 178/278 - Davd Klenfeld - Wnter 2015 8 Dervaton of Network Rate Equatons from Sngle- Cell Conductance Equatons We consder a network of many neurons, each of whch obeys a set of conductancebased,
More informationPulse Coded Modulation
Pulse Coded Modulaton PCM (Pulse Coded Modulaton) s a voce codng technque defned by the ITU-T G.711 standard and t s used n dgtal telephony to encode the voce sgnal. The frst step n the analog to dgtal
More informationWeek 5: Neural Networks
Week 5: Neural Networks Instructor: Sergey Levne Neural Networks Summary In the prevous lecture, we saw how we can construct neural networks by extendng logstc regresson. Neural networks consst of multple
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationIntroduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:
CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and
More informationPower Efficient Design and Implementation of a Novel Constant Correction Truncated Multiplier
APSIPA ASC 11 X an Power Effcent Desgn and Implementaton of a Novel Constant Correcton Truncated Multpler Yu Ren, Dong Wang, Lebo Lu, Shouy Yn and Shaojun We Tsnghua Unversty, Bejng E-mal: reneereny@gmal.com
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationHigh Performance Rotation Architectures Based on the Radix-4 CORDIC Algorithm
IEEE TRANSACTIONS ON COMPUTERS, VOL. 46, NO. 8, AUGUST 997 855 Hgh Performance Rotaton Archtectures Based on the Radx-4 CORDIC Algorthm Elsardo Antelo, Julo Vllalba, Javer D. Bruguera, and Emlo L. Zapata
More informationDesign and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm
Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:
More informationDynamic Programming. Preview. Dynamic Programming. Dynamic Programming. Dynamic Programming (Example: Fibonacci Sequence)
/24/27 Prevew Fbonacc Sequence Longest Common Subsequence Dynamc programmng s a method for solvng complex problems by breakng them down nto smpler sub-problems. It s applcable to problems exhbtng the propertes
More informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More information8 Derivation of Network Rate Equations from Single- Cell Conductance Equations
Physcs 178/278 - Davd Klenfeld - Wnter 2019 8 Dervaton of Network Rate Equatons from Sngle- Cell Conductance Equatons Our goal to derve the form of the abstract quanttes n rate equatons, such as synaptc
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationHomework Assignment 3 Due in class, Thursday October 15
Homework Assgnment 3 Due n class, Thursday October 15 SDS 383C Statstcal Modelng I 1 Rdge regresson and Lasso 1. Get the Prostrate cancer data from http://statweb.stanford.edu/~tbs/elemstatlearn/ datasets/prostate.data.
More informationHashing. Alexandra Stefan
Hashng Alexandra Stefan 1 Hash tables Tables Drect access table (or key-ndex table): key => ndex Hash table: key => hash value => ndex Man components Hash functon Collson resoluton Dfferent keys mapped
More informationEstimating Delays. Gate Delay Model. Gate Delay. Effort Delay. Computing Logical Effort. Logical Effort
Estmatng Delas Would be nce to have a back of the envelope method for szng gates for speed Logcal Effort ook b Sutherland, Sproull, Harrs Chapter s on our web page Gate Dela Model Frst, normalze a model
More informationAppendix B: Resampling Algorithms
407 Appendx B: Resamplng Algorthms A common problem of all partcle flters s the degeneracy of weghts, whch conssts of the unbounded ncrease of the varance of the mportance weghts ω [ ] of the partcles
More informationRepresentations of Elementary Functions Using Binary Moment Diagrams
Representatons of Elementary Functons Usng Bnary Moment Dagrams Tsutomu Sasao Department of Computer Scence and Electroncs, Kyushu Insttute of Technology Izua 82-852, Japan Shnobu Nagayama Department of
More informationAdvanced Algebraic Algorithms on Integers and Polynomials
Advanced Algebrac Algorthms on Integers and Polynomals Analyss of Algorthms Prepared by John Ref, Ph.D. Integer and Polynomal Computatons a) Newton Iteraton: applcaton to dvson b) Evaluaton and Interpolaton
More informationWeek3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity
Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle
More informationELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM
ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM An elastc wave s a deformaton of the body that travels throughout the body n all drectons. We can examne the deformaton over a perod of tme by fxng our look
More informationHMMT February 2016 February 20, 2016
HMMT February 016 February 0, 016 Combnatorcs 1. For postve ntegers n, let S n be the set of ntegers x such that n dstnct lnes, no three concurrent, can dvde a plane nto x regons (for example, S = {3,
More informationOne-sided finite-difference approximations suitable for use with Richardson extrapolation
Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,
More informationPHYS 705: Classical Mechanics. Calculus of Variations II
1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More informationExercises. 18 Algorithms
18 Algorthms Exercses 0.1. In each of the followng stuatons, ndcate whether f = O(g), or f = Ω(g), or both (n whch case f = Θ(g)). f(n) g(n) (a) n 100 n 200 (b) n 1/2 n 2/3 (c) 100n + log n n + (log n)
More informationImplementation of Parallel Multiplier Accumulator based on Radix-2 Modified Booth Algorithm Shashi Prabha Singh 1 Uma Sharma 2
IJSRD - Internatonal Journal for Scentfc Research & Development Vol. 3, Issue 05, 2015 ISSN (onlne): 2321-0613 Implementaton of Parallel Multpler Accumulator based on Radx-2 Modfed Booth Algorthm Shash
More informationSome Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)
Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationMA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials
MA 323 Geometrc Modellng Course Notes: Day 13 Bezer Curves & Bernsten Polynomals Davd L. Fnn Over the past few days, we have looked at de Casteljau s algorthm for generatng a polynomal curve, and we have
More informationA High-Performance and Energy-Efficient FIR Adaptive Filter using Approximate Distributed Arithmetic Circuits
SUBMITTED FOR REVIEW 1 A Hgh-Performance and Energy-Effcent FIR Adaptve Flter usng Approxmate Dstrbuted Arthmetc Crcuts Honglan Jang, Lebo Lu, Peter Jonker, Duncan Ellott, Fabrzo Lombard, Fellow, IEEE
More informationTemperature. Chapter Heat Engine
Chapter 3 Temperature In prevous chapters of these notes we ntroduced the Prncple of Maxmum ntropy as a technque for estmatng probablty dstrbutons consstent wth constrants. In Chapter 9 we dscussed the
More informationC/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1
C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned
More informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More informationPhysics 5153 Classical Mechanics. Principle of Virtual Work-1
P. Guterrez 1 Introducton Physcs 5153 Classcal Mechancs Prncple of Vrtual Work The frst varatonal prncple we encounter n mechancs s the prncple of vrtual work. It establshes the equlbrum condton of a mechancal
More informationWhat would be a reasonable choice of the quantization step Δ?
CE 108 HOMEWORK 4 EXERCISE 1. Suppose you are samplng the output of a sensor at 10 KHz and quantze t wth a unform quantzer at 10 ts per sample. Assume that the margnal pdf of the sgnal s Gaussan wth mean
More informationJournal of Universal Computer Science, vol. 1, no. 7 (1995), submitted: 15/12/94, accepted: 26/6/95, appeared: 28/7/95 Springer Pub. Co.
Journal of Unversal Computer Scence, vol. 1, no. 7 (1995), 469-483 submtted: 15/12/94, accepted: 26/6/95, appeared: 28/7/95 Sprnger Pub. Co. Round-o error propagaton n the soluton of the heat equaton by
More informationLecture 3. Ax x i a i. i i
18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest
More informationTutorial 2. COMP4134 Biometrics Authentication. February 9, Jun Xu, Teaching Asistant
Tutoral 2 COMP434 ometrcs uthentcaton Jun Xu, Teachng sstant csjunxu@comp.polyu.edu.hk February 9, 207 Table of Contents Problems Problem : nswer the questons Problem 2: Power law functon Problem 3: Convoluton
More informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationProblem Solving in Math (Math 43900) Fall 2013
Problem Solvng n Math (Math 43900) Fall 2013 Week four (September 17) solutons Instructor: Davd Galvn 1. Let a and b be two nteger for whch a b s dvsble by 3. Prove that a 3 b 3 s dvsble by 9. Soluton:
More informationMeasurement and Uncertainties
Phs L-L Introducton Measurement and Uncertantes An measurement s uncertan to some degree. No measurng nstrument s calbrated to nfnte precson, nor are an two measurements ever performed under eactl the
More informationAdvanced Circuits Topics - Part 1 by Dr. Colton (Fall 2017)
Advanced rcuts Topcs - Part by Dr. olton (Fall 07) Part : Some thngs you should already know from Physcs 0 and 45 These are all thngs that you should have learned n Physcs 0 and/or 45. Ths secton s organzed
More informationa b a In case b 0, a being divisible by b is the same as to say that
Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :
More information( ) 1/ 2. ( P SO2 )( P O2 ) 1/ 2.
Chemstry 360 Dr. Jean M. Standard Problem Set 9 Solutons. The followng chemcal reacton converts sulfur doxde to sulfur troxde. SO ( g) + O ( g) SO 3 ( l). (a.) Wrte the expresson for K eq for ths reacton.
More informationLearning Theory: Lecture Notes
Learnng Theory: Lecture Notes Lecturer: Kamalka Chaudhur Scrbe: Qush Wang October 27, 2012 1 The Agnostc PAC Model Recall that one of the constrants of the PAC model s that the data dstrbuton has to be
More informationOn the correction of the h-index for career length
1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat
More informationSome Consequences. Example of Extended Euclidean Algorithm. The Fundamental Theorem of Arithmetic, II. Characterizing the GCD and LCM
Example of Extended Eucldean Algorthm Recall that gcd(84, 33) = gcd(33, 18) = gcd(18, 15) = gcd(15, 3) = gcd(3, 0) = 3 We work backwards to wrte 3 as a lnear combnaton of 84 and 33: 3 = 18 15 [Now 3 s
More informationNotes on Frequency Estimation in Data Streams
Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to
More informationCanonical transformations
Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,
More informationThe Geometry of Logit and Probit
The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationCase A. P k = Ni ( 2L i k 1 ) + (# big cells) 10d 2 P k.
THE CELLULAR METHOD In ths lecture, we ntroduce the cellular method as an approach to ncdence geometry theorems lke the Szemeréd-Trotter theorem. The method was ntroduced n the paper Combnatoral complexty
More information1 GSW Iterative Techniques for y = Ax
1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn
More informationLossy Compression. Compromise accuracy of reconstruction for increased compression.
Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationNumerical Properties of the LLL Algorithm
Numercal Propertes of the LLL Algorthm Frankln T. Luk a and Sanzheng Qao b a Department of Mathematcs, Hong Kong Baptst Unversty, Kowloon Tong, Hong Kong b Dept. of Computng and Software, McMaster Unv.,
More informationChapter 6. Supplemental Text Material
Chapter 6. Supplemental Text Materal S6-. actor Effect Estmates are Least Squares Estmates We have gven heurstc or ntutve explanatons of how the estmates of the factor effects are obtaned n the textboo.
More informationDigital Signal Processing
Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over
More informationSpeeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem
H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence
More informationAn efficient algorithm for multivariate Maclaurin Newton transformation
Annales UMCS Informatca AI VIII, 2 2008) 5 14 DOI: 10.2478/v10065-008-0020-6 An effcent algorthm for multvarate Maclaurn Newton transformaton Joanna Kapusta Insttute of Mathematcs and Computer Scence,
More informationFTCS Solution to the Heat Equation
FTCS Soluton to the Heat Equaton ME 448/548 Notes Gerald Recktenwald Portland State Unversty Department of Mechancal Engneerng gerry@pdx.edu ME 448/548: FTCS Soluton to the Heat Equaton Overvew 1. Use
More informationLogical Effort of Higher Valency Adders
Logcal Effort of gher Valency Adders Davd arrs arvey Mudd College E. Twelfth St. Claremont, CA Davd_arrs@hmc.edu Abstract gher valency parallel prefx adders reduce the number of logc levels at the expense
More informationExperience with Automatic Generation Control (AGC) Dynamic Simulation in PSS E
Semens Industry, Inc. Power Technology Issue 113 Experence wth Automatc Generaton Control (AGC) Dynamc Smulaton n PSS E Lu Wang, Ph.D. Staff Software Engneer lu_wang@semens.com Dngguo Chen, Ph.D. Staff
More informationPolynomials. 1 What is a polynomial? John Stalker
Polynomals John Stalker What s a polynomal? If you thnk you already know what a polynomal s then skp ths secton. Just be aware that I consstently wrte thngs lke p = c z j =0 nstead of p(z) = c z. =0 You
More informationModel of Neurons. CS 416 Artificial Intelligence. Early History of Neural Nets. Cybernetics. McCulloch-Pitts Neurons. Hebbian Modification.
Page 1 Model of Neurons CS 416 Artfcal Intellgence Lecture 18 Neural Nets Chapter 20 Multple nputs/dendrtes (~10,000!!!) Cell body/soma performs computaton Sngle output/axon Computaton s typcally modeled
More information