EE260: Digital Design, Spring n MUX Gate n Rudimentary functions n Binary Decoders. n Binary Encoders n Priority Encoders
|
|
- Madeleine Ross
- 6 years ago
- Views:
Transcription
1 EE260: Digital Desig, Sprig 2018 EE 260: Itroductio to Digital Desig MUXs, Ecoders, Decoders Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Overview of Ecoder ad Decoder MUX Gate Rudimetary fuctios Biary Decoders Expasio Circuit implemetatio Biary Ecoders Priority Ecoders Multiplexer Multiplexer (cot.) Selects biary iformatio from oe of may iput lies ad directs it to a sigle output lie. Also kow as the selector circuit, Selectio is cotrolled by a particular set of iputs lies whose # depeds o the # of the data iput lies. For a 2 -to-1 multiplexer, there are 2 data iput lies ad selectio lies whose bit combiatio determies which iput is selected. 2-to-1-Lie Multiplexer Example: 4-to-1 MUX usig Cell Library Based Desig Sice 2 = 2 1, = 1 The sigle selectio variable S has two values: S = 0 selects iput I 0 S = 1 selects iput I 1 The equatio: Y = S I 0 + SI 1 The circuit: Decoder Eablig Circuits S I 0 I 1 Y Chapter 6, 7: MUXs, Ecoders, Decoders 1
2 EE260: Digital Desig, Sprig to 1-Lie Multiplexer usig Trasmissio Gates MUX as a Uiversal Gate We ca costruct AND ad NOT gates usig 2- to-1 MUXs. Thus, 2-to-1 MUX is a uiversal gate. z = 0x + 1x = x z = x 1 x 0 + 0x 0 = x 1 x 0 Multiple Bit Selectio Util ow, we have examied sigle-bit data selected by a MUX. What if we wat to select m-bit data/words? à Combie MUX blocks i parallel with commo select ad eable sigals Example: Costruct a logic circuit that selects betwee 2 sets of 4-bit iputs (see ext slide for solutio). Example: Quad 2-to-1 MUX Uses four 4-to-1 MUXs with commo select (S) ad eable (E). Select lie chooses betwee A i s ad B i s. The selected four-wire digital sigal is set to the Y i s Eable lie turs MUX o ad off (E=1 is o). Implemetig Boolea fuctios with Multiplexers Ay Boolea fuctio of variables ca be implemeted usig a 2-1 -to-1 multiplexer. A MUX is basically a decoder with outputs ORed together, hece this is t surprisig. The SELECT sigals geerate the miterms of the fuctio. The data iputs idetify which miterms are to be combied with a OR. Example F(X,Y,Z) = X Y Z + X YZ + XYZ + XYZ = Σm(1,2,6,7) There are =3 iputs, thus we eed a 2 2 -to-1 MUX The first -1 (=2) iputs serve as the selectio lies Chapter 6, 7: MUXs, Ecoders, Decoders 2
3 EE260: Digital Desig, Sprig 2018 Efficiet Method for implemetig Boolea fuctios For a -variable fuctio (e.g., f(a,b,c,d)): Need a 2-1 lie MUX with -1 select lies. Eumerate fuctio as a truth table with cosistet orderig of variables (e.g., A,B,C,D) Attach the most sigificat -1 variables to the -1 select lies (e.g., A,B,C) Examie pairs of adjacet rows (oly the least sigificat variable differs, e.g., D=0 ad D=1). Determie whether the fuctio output for the (A,B,C,0) ad (A,B,C,1) combiatio is (0,0), (0,1), (1,0), or (1,1). Attach 0, D, D, or 1 to the data iput correspodig to (A,B,C) respectively. The Other Example Cosider F(A,B,C) = åm(1,3,5,6). We ca implemet this fuctio usig a 4-to-1 MUX as follows. The idex is ABC. Apply A ad B to the S 1 ad S 0 selectio iputs of the MUX (A is most sig, S 1 is most sig.) Eumerate fuctio i a truth table. MUX Example (cot.) Whe A=B=0, F=C Whe A=0, B=1, F=C Whe A=1, B=0, F=C Whe A=B=1, F=C A B C F MUX implemetatio of F(A,B,C) = åm(1,3,5,6) B A C C C C F A larger Example Rudimetary Fuctios Chapter 6, 7: MUXs, Ecoders, Decoders 3
4 EE260: Digital Desig, Sprig 2018 Selectio Eablig gatig? The Other Code Coverter BCD-to-Seve-Segmet Coverter Seve-segmet display: 7 LEDs (light emittig diodes), each oe cotrolled by a iput a 1 meas o, 0 meas off Display digit 3? Set a, b, c, d, g to 1 Set e, f to 0 f e d g c b BCD-to-Seve-Segmet Coverter Iput is a 4-bit BCD code à 4 iputs (w, x, y, z). Output is a 7-bit code (a,b,c,d,e,f,g) that allows for the decimal equivalet to be displayed. a Example: Iput: 0000 BCD f g b Output: (a=b=c=d=e=f=1, g=0) e c d BCD-to-Seve-Segmet (cot.) Truth Table Digit wxyz abcdefg X X0?? Digit wxyz abcdefg X XXXXXXX 1011 XXXXXXX 1100 XXXXXXX 1101 XXXXXXX 1110 XXXXXXX 1111 XXXXXXX Decoders A combiatioal circuit that coverts biary iformatio from coded iputs to a maximum 2 coded outputs à -to- 2 decoder -to-m decoder, m 2 Examples: BCD-to-7-segmet decoder, where =4 ad m=10 Chapter 6, 7: MUXs, Ecoders, Decoders 4
5 EE260: Digital Desig, Sprig 2018 Decoders (cot.) 1-2 Decoder 2-to-4 Decoder 2-to-4 Active Low Decoder 3-to-8 Decoder 3-to-8 Decoder (cot.) address data Three iputs, A 0, A 1, A 2, are decoded ito eight outputs, D 0 through D 7 Each output D i represets oe of the miterms of the 3 iput variables. D i = 1 whe the biary umber A 2 A 1 A 0 = i Shorthad: D i = m i The output variables are mutually exclusive; exactly oe output has the value 1 at ay time, ad the other seve are 0. Chapter 6, 7: MUXs, Ecoders, Decoders 5
6 EE260: Digital Desig, Sprig 2018 Decoder Expasio Decoder with eable Implemetig Boolea fuctios usig decoders Ay combiatioal circuit ca be costructed usig decoders ad OR gates! Why? Here is a example: Implemet a full adder circuit with a decoder ad two OR gates. Recall full adder equatios, ad let X, Y, ad Z be the iputs: S(X,Y,Z) = X+Y+Z = Sm(1,2,4,7) C (X,Y,Z) = Sm(3, 5, 6, 7). Sice there are 3 iputs ad a total of 8 miterms, we eed a 3-to-8 decoder. Implemetig a Biary Adder Usig a Decoder S(X,Y,Z) = SUM m(1,2,4,7) C(X,Y,Z) = SUM m(3,5,6,7) Ecoders Ecoders (cot.) A ecoder is a digital circuit that performs the iverse operatio of a decoder. A ecoder has 2 iput lies ad output lies. The output lies geerate the biary equivalet to the iput lie whose value is 1. Chapter 6, 7: MUXs, Ecoders, Decoders 6
7 EE260: Digital Desig, Sprig 2018 Ecoder Example Example: 8-to-3 biary ecoder (octal-to-biary) Ecoder Example (cot.) A 0 = D 1 + D 3 + D 5 + D 7 A 1 = D 2 + D 3 + D 6 + D 7 A 2 = D 4 + D 5 + D 6 + D 7 Ecoder Desig Issues There are two ambiguities associated with the desig of a simple ecoder: 1. Oly oe iput ca be active at ay give time. If two iputs are active simultaeously, the output produces a udefied combiatio (for example, if D 3 ad D 6 are 1 simultaeously, the output of the ecoder will be A output with all 0's ca be geerated whe all the iputs are 0's,or whe D 0 is equal to 1. Priority Ecoders Solves the ambiguities metioed above. Multiple asserted iputs are allowed; oe has priority over all others. Separate idicatio of o asserted iputs. Example: 4-to-2 Priority Ecoder Truth Table 4-to-2 Priority Ecoder (cot.) The operatio of the priority ecoder is such that: If two or more iputs are equal to 1 at the same time, the iput i the highestumbered positio will take precedece. A valid output idicator, desigated by V, is set to 1 oly whe oe or more iputs are equal to 1. V = D 3 + D 2 + D 1 + D 0 by ispectio. Chapter 6, 7: MUXs, Ecoders, Decoders 7
8 EE260: Digital Desig, Sprig 2018 Example: 4-to-2 Priority Ecoder K-Maps Example: 4-to-2 Priority Ecoder Logic Diagram 8-to-3 Priority Ecoder Uses of priority ecoders (cot.) Lik Betwee Multiplexer ad Decoder Note the regios of the multiplexer 1-to-2-lie Decoder 2 Eablig circuits 2-iput OR gate I geeral, for a 2 -to-1-lie multiplexer: -to-2 -lie decoder 2 AND gates S Decoder I 0 I 1 Eablig Circuits Y Summary of MUXs, Ecoders, Decoders MUX Gate Rudimetary fuctios Biary Decoders Expasio Circuit implemetatio Biary Ecoders Priority Ecoders Chapter 6, 7: MUXs, Ecoders, Decoders 8
EE260: Digital Design, Spring n Binary Addition. n Complement forms. n Subtraction. n Multiplication. n Inputs: A 0, B 0. n Boolean equations:
EE260: Digital Desig, Sprig 2018 EE 260: Itroductio to Digital Desig Arithmetic Biary Additio Complemet forms Subtractio Multiplicatio Overview Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi
More informationEE260: Digital Design, Spring n Binary logic and Gates n Boolean Algebra. n Basic Properties n Algebraic Manipulation
EE26: Digital Desig, Sprig 28 2-Ja-8 EE 26: Itroductio to Digital Desig Boolea lgebra: Logic Represetatios ad alysis Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Overview Biary
More informationChapter 9 Computer Design Basics
Logic ad Computer Desig Fudametals Chapter 9 Computer Desig Basics Part 1 Datapaths Overview Part 1 Datapaths Itroductio Datapath Example Arithmetic Logic Uit (ALU) Shifter Datapath Represetatio Cotrol
More informationChapter 9 Computer Design Basics
Logic ad Computer Desig Fudametals Chapter 9 Computer Desig asics Part Datapaths Charles Kime & Thomas Kamiski 008 Pearso Educatio, Ic. (Hyperliks are active i View Show mode) Overview Part Datapaths Itroductio
More informationCombinational Logic Design Combinational Functions and Circuits
Combinational Logic Design Combinational Functions and Circuits Overview Combinational Circuits Design Procedure Generic Example Example with don t cares: BCD-to-SevenSegment converter Binary Decoders
More informationAnnotations to the assignments and the solution sheet. Note the following points
WS 26/7 Trial Exam: Fudametals of Computer Egieerig Seite: Aotatios to the assigmets ad the solutio sheet This is a multiple choice examiatio, that meas: Solutio approaches are ot assessed. For each sub-task
More informationProblem 01 X Y. Logic Testbank. Problem. Problems. Problem 1:
This documet was created by me but that does t mea that I ow this cotet, so I m just sharig it like ayoe else would do, good luck - Sa'eed wad roblems roblem 01 roblem Logic Testbak roblem 1: 4-to-1 MUX,
More informationCHAPTER XI DATAPATH ELEMENTS
CHAPTER XI- CHAPTER XI CHAPTER XI READ REE-DOC ON COURSE WEBPAGE CHAPTER XI-2 INTRODUCTION -INTRODUCTION So far we have discussed may small compoets ad buildig blocks. Oe fial step i our buildig blocks
More informationChapter 4. Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. elements. Dr.
Chapter 4 Dr. Panos Nasiopoulos Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. Sequential: In addition, they include storage elements Combinational
More informationELE B7 Power Systems Engineering. Symmetrical Components
ELE B7 Power Systems Egieerig Symmetrical Compoets Aalysis of Ubalaced Systems Except for the balaced three-phase fault, faults result i a ubalaced system. The most commo types of faults are sigle liegroud
More information6.003 Homework #3 Solutions
6.00 Homework # Solutios Problems. Complex umbers a. Evaluate the real ad imagiary parts of j j. π/ Real part = Imagiary part = 0 e Euler s formula says that j = e jπ/, so jπ/ j π/ j j = e = e. Thus the
More informationInternal Information Representation and Processing
Iteral Iformatio Represetatio ad Processig CSCE 16 - Fudametals of Computer Sciece Dr. Awad Khalil Computer Sciece & Egieerig Departmet The America Uiversity i Cairo Decimal Number System We are used to
More informationModule 5 EMBEDDED WAVELET CODING. Version 2 ECE IIT, Kharagpur
Module 5 EMBEDDED WAVELET CODING Versio ECE IIT, Kharagpur Lesso 4 SPIHT algorithm Versio ECE IIT, Kharagpur Istructioal Objectives At the ed of this lesso, the studets should be able to:. State the limitatios
More informationNumber Representation
Number Represetatio 1 Number System :: The Basics We are accustomed to usig the so-called decimal umber system Te digits :: 0,1,2,3,4,5,6,7,8,9 Every digit positio has a weight which is a power of 10 Base
More informationProblem Set # 5 Solutions
MIT./8.4/6.898/8.435 Quatum Iformatio Sciece I Fall, 00 Sam Ocko October 5, 00 Problem Set # 5 Solutios. Most uitar trasforms are hard to approimate. (a) We are dealig with boolea fuctios that take bits
More informationDESCRIPTION OF THE SYSTEM
Sychroous-Serial Iterface for absolute Ecoders SSI 1060 BE 10 / 01 DESCRIPTION OF THE SYSTEM TWK-ELEKTRONIK GmbH D-001 Düsseldorf PB 1006 Heirichstr. Tel +9/11/6067 Fax +9/11/6770 e-mail: ifo@twk.de Page
More informationQuantum Computing Lecture 7. Quantum Factoring
Quatum Computig Lecture 7 Quatum Factorig Maris Ozols Quatum factorig A polyomial time quatum algorithm for factorig umbers was published by Peter Shor i 1994. Polyomial time meas that the umber of gates
More informationArithmetic Circuits. (Part I) Randy H. Katz University of California, Berkeley. Spring 2007
rithmetic Circuits (Part I) Rady H. Katz Uiversity of Califoria, erkeley prig 27 Lecture #23: rithmetic Circuits- Motivatio rithmetic circuits are excellet examples of comb. logic desig Time vs. pace Trade-offs
More informationOverview EECS Components and Design Techniques for Digital Systems. Lec 15 Addition, Subtraction, and Negative Numbers. Positional Notation
Overview EEC 5 Compoets ad Desig Techiques for Digital ystems Lec 5 dditio, ubtractio, ad Negative Numbers David Culler Electrical Egieerig ad Computer cieces Uiversity of Califoria, erkeley Recall basic
More informationQuantum Information & Quantum Computation
CS9A, Sprig 5: Quatum Iformatio & Quatum Computatio Wim va Dam Egieerig, Room 59 vadam@cs http://www.cs.ucsb.edu/~vadam/teachig/cs9/ Admiistrivia Do the exercises. Aswers will be posted at the ed of the
More informationFIR Filter Design: Part II
EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we cosider how we might go about desigig FIR filters with arbitrary frequecy resposes, through compositio of multiple sigle-peak
More informationRun-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE
Geeral e Image Coder Structure Motio Video (s 1,s 2,t) or (s 1,s 2 ) Natural Image Samplig A form of data compressio; usually lossless, but ca be lossy Redudacy Removal Lossless compressio: predictive
More informationCS161: Algorithm Design and Analysis Handout #10 Stanford University Wednesday, 10 February 2016
CS161: Algorithm Desig ad Aalysis Hadout #10 Staford Uiversity Wedesday, 10 February 2016 Lecture #11: Wedesday, 10 February 2016 Topics: Example midterm problems ad solutios from a log time ago Sprig
More informationLecture 16: Monotone Formula Lower Bounds via Graph Entropy. 2 Monotone Formula Lower Bounds via Graph Entropy
15-859: Iformatio Theory ad Applicatios i TCS CMU: Sprig 2013 Lecture 16: Mootoe Formula Lower Bouds via Graph Etropy March 26, 2013 Lecturer: Mahdi Cheraghchi Scribe: Shashak Sigh 1 Recap Graph Etropy:
More informationLast time, we talked about how Equation (1) can simulate Equation (2). We asserted that Equation (2) can also simulate Equation (1).
6896 Quatum Complexity Theory Sept 23, 2008 Lecturer: Scott Aaroso Lecture 6 Last Time: Quatum Error-Correctio Quatum Query Model Deutsch-Jozsa Algorithm (Computes x y i oe query) Today: Berstei-Vazirii
More informationHashing and Amortization
Lecture Hashig ad Amortizatio Supplemetal readig i CLRS: Chapter ; Chapter 7 itro; Sectio 7.. Arrays ad Hashig Arrays are very useful. The items i a array are statically addressed, so that isertig, deletig,
More informationLinear time invariant systems
Liear time ivariat systems Alejadro Ribeiro Dept. of Electrical ad Systems Egieerig Uiversity of Pesylvaia aribeiro@seas.upe.edu http://www.seas.upe.edu/users/~aribeiro/ February 25, 2016 Sigal ad Iformatio
More informationSection 5.1 The Basics of Counting
1 Sectio 5.1 The Basics of Coutig Combiatorics, the study of arragemets of objects, is a importat part of discrete mathematics. I this chapter, we will lear basic techiques of coutig which has a lot of
More information7. Modern Techniques. Data Encryption Standard (DES)
7. Moder Techiques. Data Ecryptio Stadard (DES) The objective of this chapter is to illustrate the priciples of moder covetioal ecryptio. For this purpose, we focus o the most widely used covetioal ecryptio
More informationCS284A: Representations and Algorithms in Molecular Biology
CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by
More informationLecture 3. Digital Signal Processing. Chapter 3. z-transforms. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. 2016
Lecture 3 Digital Sigal Processig Chapter 3 z-trasforms Mikael Swartlig Nedelko Grbic Begt Madersso rev. 06 Departmet of Electrical ad Iformatio Techology Lud Uiversity z-trasforms We defie the z-trasform
More informationSequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018
CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical
More informationMa 530 Introduction to Power Series
Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power
More informationECE 564/645 - Digital Communication Systems (Spring 2014) Final Exam Friday, May 2nd, 8:00-10:00am, Marston 220
ECE 564/645 - Digital Commuicatio Systems (Sprig 014) Fial Exam Friday, May d, 8:00-10:00am, Marsto 0 Overview The exam cosists of four (or five) problems for 100 (or 10) poits. The poits for each part
More informationCS537. Numerical Analysis and Computing
CS57 Numerical Aalysis ad Computig Lecture Locatig Roots o Equatios Proessor Ju Zhag Departmet o Computer Sciece Uiversity o Ketucky Leigto KY 456-6 Jauary 9 9 What is the Root May physical system ca be
More informationDiscrete-Time Systems, LTI Systems, and Discrete-Time Convolution
EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [
More informationarxiv: v1 [math.nt] 10 Dec 2014
A DIGITAL BINOMIAL THEOREM HIEU D. NGUYEN arxiv:42.38v [math.nt] 0 Dec 204 Abstract. We preset a triagle of coectios betwee the Sierpisi triagle, the sum-of-digits fuctio, ad the Biomial Theorem via a
More informationProblem Set 2 Solutions
CS271 Radomess & Computatio, Sprig 2018 Problem Set 2 Solutios Poit totals are i the margi; the maximum total umber of poits was 52. 1. Probabilistic method for domiatig sets 6pts Pick a radom subset S
More informationThe picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled
1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how
More informationA representation approach to the tower of Hanoi problem
Uiversity of Wollogog Research Olie Departmet of Computig Sciece Workig Paper Series Faculty of Egieerig ad Iformatio Scieces 98 A represetatio approach to the tower of Haoi problem M. C. Er Uiversity
More informationCSE 191, Class Note 05: Counting Methods Computer Sci & Eng Dept SUNY Buffalo
Coutig Methods CSE 191, Class Note 05: Coutig Methods Computer Sci & Eg Dept SUNY Buffalo c Xi He (Uiversity at Buffalo CSE 191 Discrete Structures 1 / 48 Need for Coutig The problem of coutig the umber
More informationSCALING OF NUMBERS IN RESIDUE ARITHMETIC WITH THE FLEXIBLE SELECTION OF SCALING FACTOR
POZNAN UNIVE RSITY OF TE CHNOLOGY ACADE MIC JOURNALS No 76 Electrical Egieerig 203 Zeo ULMAN* Macie CZYŻAK* Robert SMYK* SCALING OF NUMBERS IN RESIDUE ARITHMETIC WITH THE FLEXIBLE SELECTION OF SCALING
More informationApplications in Linear Algebra and Uses of Technology
1 TI-89: Let A 1 4 5 6 7 8 10 Applicatios i Liear Algebra ad Uses of Techology,adB 4 1 1 4 type i: [1,,;4,5,6;7,8,10] press: STO type i: A type i: [4,-1;-1,4] press: STO (1) Row Echelo Form: MATH/matrix
More information, then cv V. Differential Equations Elements of Lineaer Algebra Name: Consider the differential equation. and y2 cos( kx)
Cosider the differetial equatio y '' k y 0 has particular solutios y1 si( kx) ad y cos( kx) I geeral, ay liear combiatio of y1 ad y, cy 1 1 cy where c1, c is also a solutio to the equatio above The reaso
More informationCOMM 602: Digital Signal Processing
COMM 60: Digital Sigal Processig Lecture 4 -Properties of LTIS Usig Z-Trasform -Iverse Z-Trasform Properties of LTIS Usig Z-Trasform Properties of LTIS Usig Z-Trasform -ve +ve Properties of LTIS Usig Z-Trasform
More informationArithmetic Circuits. (Part I) Randy H. Katz University of California, Berkeley. Spring Time vs. Space Trade-offs. Arithmetic Logic Units
rithmetic rcuits (art I) Rady H. Katz Uiversity of Califoria, erkeley otivatio rithmetic circuits are excellet examples of comb. logic desig Time vs. pace Trade-offs Doig thigs fast requires more logic
More information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
More informationAlgorithm Analysis. Chapter 3
Data Structures Dr Ahmed Rafat Abas Computer Sciece Dept, Faculty of Computer ad Iformatio, Zagazig Uiversity arabas@zu.edu.eg http://www.arsaliem.faculty.zu.edu.eg/ Algorithm Aalysis Chapter 3 3. Itroductio
More informationChapter 13, Part A Analysis of Variance and Experimental Design
Slides Prepared by JOHN S. LOUCKS St. Edward s Uiversity Slide 1 Chapter 13, Part A Aalysis of Variace ad Eperimetal Desig Itroductio to Aalysis of Variace Aalysis of Variace: Testig for the Equality of
More informationf(x) dx as we do. 2x dx x also diverges. Solution: We compute 2x dx lim
Math 3, Sectio 2. (25 poits) Why we defie f(x) dx as we do. (a) Show that the improper itegral diverges. Hece the improper itegral x 2 + x 2 + b also diverges. Solutio: We compute x 2 + = lim b x 2 + =
More informationChimica Inorganica 3
himica Iorgaica Irreducible Represetatios ad haracter Tables Rather tha usig geometrical operatios, it is ofte much more coveiet to employ a ew set of group elemets which are matrices ad to make the rule
More information2D DSP Basics: 2D Systems
- Digital Image Processig ad Compressio D DSP Basics: D Systems D Systems T[ ] y = T [ ] Liearity Additivity: If T y = T [ ] The + T y = y + y Homogeeity: If The T y = T [ ] a T y = ay = at [ ] Liearity
More informationU8L1: Sec Equations of Lines in R 2
MCVU U8L: Sec. 8.9. Equatios of Lies i R Review of Equatios of a Straight Lie (-D) Cosider the lie passig through A (-,) with slope, as show i the diagram below. I poit slope form, the equatio of the lie
More informationCHAPTER 10 INFINITE SEQUENCES AND SERIES
CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece
More informationComplex Number Theory without Imaginary Number (i)
Ope Access Library Joural Complex Number Theory without Imagiary Number (i Deepak Bhalchadra Gode Directorate of Cesus Operatios, Mumbai, Idia Email: deepakm_4@rediffmail.com Received 6 July 04; revised
More informationClassification of problem & problem solving strategies. classification of time complexities (linear, logarithmic etc)
Classificatio of problem & problem solvig strategies classificatio of time complexities (liear, arithmic etc) Problem subdivisio Divide ad Coquer strategy. Asymptotic otatios, lower boud ad upper boud:
More informationDefinitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients.
Defiitios ad Theorems Remember the scalar form of the liear programmig problem, Miimize, Subject to, f(x) = c i x i a 1i x i = b 1 a mi x i = b m x i 0 i = 1,2,, where x are the decisio variables. c, b,
More information1 Hash tables. 1.1 Implementation
Lecture 8 Hash Tables, Uiversal Hash Fuctios, Balls ad Bis Scribes: Luke Johsto, Moses Charikar, G. Valiat Date: Oct 18, 2017 Adapted From Virgiia Williams lecture otes 1 Hash tables A hash table is a
More informationSection 4.3. Boolean functions
Sectio 4.3. Boolea fuctios Let us take aother look at the simplest o-trivial Boolea algebra, ({0}), the power-set algebra based o a oe-elemet set, chose here as {0}. This has two elemets, the empty set,
More informationIP Reference guide for integer programming formulations.
IP Referece guide for iteger programmig formulatios. by James B. Orli for 15.053 ad 15.058 This documet is iteded as a compact (or relatively compact) guide to the formulatio of iteger programs. For more
More informationThe Maximum-Likelihood Decoding Performance of Error-Correcting Codes
The Maximum-Lielihood Decodig Performace of Error-Correctig Codes Hery D. Pfister ECE Departmet Texas A&M Uiversity August 27th, 2007 (rev. 0) November 2st, 203 (rev. ) Performace of Codes. Notatio X,
More informationData Structures Lecture 9
Fall 2017 Fag Yu Software Security Lab. Dept. Maagemet Iformatio Systems, Natioal Chegchi Uiversity Data Structures Lecture 9 Midterm o Dec. 7 (9:10-12:00am, 106) Lec 1-9, TextBook Ch1-8, 11,12 How to
More informationFall 2011, EE123 Digital Signal Processing
Lecture 5 Miki Lustig, UCB September 14, 211 Miki Lustig, UCB Motivatios for Discrete Fourier Trasform Sampled represetatio i time ad frequecy umerical Fourier aalysis requires a Fourier represetatio that
More informationDESIGN AND IMPLEMENTATION OF ENCODERS AND DECODERS. To design and implement encoders and decoders using logic gates.
DESIGN AND IMPLEMENTATION OF ENCODERS AND DECODERS AIM To design and implement encoders and decoders using logic gates. COMPONENTS REQUIRED S.No Components Specification Quantity 1. Digital IC Trainer
More informationFig. 2. Block Diagram of a DCS
Iformatio source Optioal Essetial From other sources Spread code ge. Format A/D Source ecode Ecrypt Auth. Chael ecode Pulse modu. Multiplex Badpass modu. Spread spectrum modu. X M m i Digital iput Digital
More informationPH 425 Quantum Measurement and Spin Winter SPINS Lab 1
PH 425 Quatum Measuremet ad Spi Witer 23 SPIS Lab Measure the spi projectio S z alog the z-axis This is the experimet that is ready to go whe you start the program, as show below Each atom is measured
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationSect 5.3 Proportions
Sect 5. Proportios Objective a: Defiitio of a Proportio. A proportio is a statemet that two ratios or two rates are equal. A proportio takes a form that is similar to a aalogy i Eglish class. For example,
More information6.111 Lecture 6 Today: 1.Blocking vs. non-blocking assignments 2.Single clock synchronous circuits 3.Finite State Machines
6. Lecture 6 Today:.Blockig vs. o-blockig assigmets 2.Sigle clock sychroous circuits 3.Fiite State Machies 6. Fall 25 Lecture 6, Slide I. Blockig vs. Noblockig Assigmets Coceptual eed for two kids of assigmet
More information(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:
Math 5-4 Tue Feb 4 Cotiue with sectio 36 Determiats The effective way to compute determiats for larger-sized matrices without lots of zeroes is to ot use the defiitio, but rather to use the followig facts,
More information3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,
3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [
More informationFilter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and
Filter bas Separately, the lowpass ad highpass filters are ot ivertible T removes the highest frequecy / ad removes the lowest frequecy Together these filters separate the sigal ito low-frequecy ad high-frequecy
More informationMATH 112: HOMEWORK 6 SOLUTIONS. Problem 1: Rudin, Chapter 3, Problem s k < s k < 2 + s k+1
MATH 2: HOMEWORK 6 SOLUTIONS CA PRO JIRADILOK Problem. If s = 2, ad Problem : Rudi, Chapter 3, Problem 3. s + = 2 + s ( =, 2, 3,... ), prove that {s } coverges, ad that s < 2 for =, 2, 3,.... Proof. The
More informationZ - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.
Z - Trasform The -trasform is a very importat tool i describig ad aalyig digital systems. It offers the techiques for digital filter desig ad frequecy aalysis of digital sigals. Defiitio of -trasform:
More informationLesson 10: Limits and Continuity
www.scimsacademy.com Lesso 10: Limits ad Cotiuity SCIMS Academy 1 Limit of a fuctio The cocept of limit of a fuctio is cetral to all other cocepts i calculus (like cotiuity, derivative, defiite itegrals
More informationEE 505. Lecture 29. ADC Design. Oversampled
EE 505 Lecture 29 ADC Desig Oversampled Review from Last Lecture SAR ADC V IN Sample Hold C LK V REF DAC DAC Cotroller DAC Cotroller stores estimates of iput i Successive Approximatio Register (SAR) At
More information( ) GENERATING FUNCTIONS
GENERATING FUNCTIONS Solve a ifiite umber of related problems i oe swoop. *Code the problems, maipulate the code, the decode the aswer! Really a algebraic cocept but ca be eteded to aalytic basis for iterestig
More informationECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations
ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows
More informationSignals & Systems Chapter3
Sigals & Systems Chapter3 1.2 Discrete-Time (D-T) Sigals Electroic systems do most of the processig of a sigal usig a computer. A computer ca t directly process a C-T sigal but istead eeds a stream of
More informationLecture 10: Mathematical Preliminaries
Lecture : Mathematical Prelimiaries Obective: Reviewig mathematical cocepts ad tools that are frequetly used i the aalysis of algorithms. Lecture # Slide # I this
More informationDesign of Digital Circuits Lecture 7: Sequential Logic Design. Prof. Onur Mutlu ETH Zurich Spring March 2018
Desig of Digital Circuits Lecture 7: Seuetial Logic Desig Prof. Our Mutlu ETH Zurich Sprig 2018 15 March 2018 Readigs Please study Slides 102-120 from Lecture 6 o your ow This week Seuetial Logic P&P Chapter
More informationEfficient Reverse Converter Design for Five Moduli
Joural of Computatios & Modellig, vol., o., 0, 93-08 ISSN: 79-765 (prit), 79-8850 (olie) Iteratioal Scietific ress, 0 Efficiet Reverse Coverter Desig for Five Moduli Set,,,, MohammadReza Taheri, Elham
More informationOblivious Transfer using Elliptic Curves
Oblivious Trasfer usig Elliptic Curves bhishek Parakh Louisiaa State Uiversity, ato Rouge, L May 4, 006 bstract: This paper proposes a algorithm for oblivious trasfer usig elliptic curves lso, we preset
More information2.4 - Sequences and Series
2.4 - Sequeces ad Series Sequeces A sequece is a ordered list of elemets. Defiitio 1 A sequece is a fuctio from a subset of the set of itegers (usually either the set 80, 1, 2, 3,... < or the set 81, 2,
More informationSeptember 2012 C1 Note. C1 Notes (Edexcel) Copyright - For AS, A2 notes and IGCSE / GCSE worksheets 1
September 0 s (Edecel) Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright
More information( 1) n (4x + 1) n. n=0
Problem 1 (10.6, #). Fid the radius of covergece for the series: ( 1) (4x + 1). For what values of x does the series coverge absolutely, ad for what values of x does the series coverge coditioally? Solutio.
More informationMechanical Efficiency of Planetary Gear Trains: An Estimate
Mechaical Efficiecy of Plaetary Gear Trais: A Estimate Dr. A. Sriath Professor, Dept. of Mechaical Egieerig K L Uiversity, A.P, Idia E-mail: sriath_me@klce.ac.i G. Yedukodalu Assistat Professor, Dept.
More informationNumerical Methods in Fourier Series Applications
Numerical Methods i Fourier Series Applicatios Recall that the basic relatios i usig the Trigoometric Fourier Series represetatio were give by f ( x) a o ( a x cos b x si ) () where the Fourier coefficiets
More informationt distribution [34] : used to test a mean against an hypothesized value (H 0 : µ = µ 0 ) or the difference
EXST30 Backgroud material Page From the textbook The Statistical Sleuth Mea [0]: I your text the word mea deotes a populatio mea (µ) while the work average deotes a sample average ( ). Variace [0]: The
More informationA Simple Optimum-Time FSSP Algorithm for Multi-Dimensional Cellular Automata
A Simple Optimum-Time FSSP Algorithm for Multi-Dimesioal Cellular Automata HIROSHI UMEO Uiversity of Osaka Electro-Commuicatio umeo@cyt.osakac.ac.jp KINUO NISHIDE Uiversity of Osaka Electro-Commuicatio
More informationLecture 10: Universal coding and prediction
0-704: Iformatio Processig ad Learig Sprig 0 Lecture 0: Uiversal codig ad predictio Lecturer: Aarti Sigh Scribes: Georg M. Goerg Disclaimer: These otes have ot bee subjected to the usual scrutiy reserved
More information10. Comparative Tests among Spatial Regression Models. Here we revisit the example in Section 8.1 of estimating the mean of a normal random
Part III. Areal Data Aalysis 0. Comparative Tests amog Spatial Regressio Models While the otio of relative likelihood values for differet models is somewhat difficult to iterpret directly (as metioed above),
More informationSEQUENCES AND SERIES
Sequeces ad 6 Sequeces Ad SEQUENCES AND SERIES Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives rise to what is called a sequece. Sequeces
More informationPermutations & Combinations. Dr Patrick Chan. Multiplication / Addition Principle Inclusion-Exclusion Principle Permutation / Combination
Discrete Mathematic Chapter 3: C outig 3. The Basics of Coutig 3.3 Permutatios & Combiatios 3.5 Geeralized Permutatios & Combiatios 3.6 Geeratig Permutatios & Combiatios Dr Patrick Cha School of Computer
More informationDifference Equation Construction (1) ENGG 1203 Tutorial. Difference Equation Construction (2) Grow, baby, grow (1)
ENGG 03 Tutorial Differece Equatio Costructio () Systems ad Cotrol April Learig Objectives Differece Equatios Z-trasform Poles Ack.: MIT OCW 6.0, 6.003 Newto s law of coolig states that: The chage i a
More informationMath 113 Exam 3 Practice
Math Exam Practice Exam will cover.-.9. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for you
More informationEnd-of-Year Contest. ERHS Math Club. May 5, 2009
Ed-of-Year Cotest ERHS Math Club May 5, 009 Problem 1: There are 9 cois. Oe is fake ad weighs a little less tha the others. Fid the fake coi by weighigs. Solutio: Separate the 9 cois ito 3 groups (A, B,
More informationEE 505. Lecture 13. String DACs
EE 505 Lecture 13 Strig DACs -Strig DAC V FF S 1 S 2 Simple structure Iheretly mootoe Very low DNL Challeges: S N-2 S N-1 S N S k d k Maagig INL Large umber of devices for large outig thermometer/bubble
More informationBinary codes from graphs on triples and permutation decoding
Biary codes from graphs o triples ad permutatio decodig J. D. Key Departmet of Mathematical Scieces Clemso Uiversity Clemso SC 29634 U.S.A. J. Moori ad B. G. Rodrigues School of Mathematics Statistics
More informationThe Scattering Matrix
2/23/7 The Scatterig Matrix 723 1/13 The Scatterig Matrix At low frequecies, we ca completely characterize a liear device or etwork usig a impedace matrix, which relates the currets ad voltages at each
More information