EE 435. Lecture 26. Data Converters. Architectures. Characterization
|
|
- Melissa Cobb
- 5 years ago
- Views:
Transcription
1 EE 435 Lecture 26 Data Coverters Architectures Characterizatio
2 . Review from last lecture. Data Coverters Types: A/D (Aalog to Digital) Coverts Aalog Iput to a Digital Output D/A (Digital to Aalog) Coverts a Digital Iput to a Aalog Output A/D is the world s most widely used mixed-sigal compoet D/A is ofte icluded i a FB path of a A/D A/D ad D/A fields will remai hot idefiitely techology advaces make data coverter desig more challegig embedded applicatios desigs ofte very applicatio depedet
3 . Review from last lecture. D/A Coverters DAC C 0 C 1 C 2 C 3 C 4 C 5 C 6 C 7 For this ideal DAC X X b b b b b OUT=X REF b -j OUT=XREF j j=1 2 Number of outputs gets very large for large Spacig betwee outputs is X REF /2 ad gets very small for large
4 . Review from last lecture. A/D Coverters Quatizatio Errors ADC X T1 =X LSB C 7 C 6 C 5 C 4 C 3 C 2 C 1 C 0 X LSB 2X LSB 3X LSB 4X LSB 5X LSB 6X LSB 7X LSB ε Q X T1 X T2 X T3 X T4 X T5 X T6 X T7 X REF X -X Q OUT IN X T1 X T2 X T3 X T4 X T5 X T6 X T7 X REF -X LSB Magitude of ε Q bouded by X LSB for a ideal A/D
5 . Review from last lecture. Data Coverter Architectures ADC DAC Nyquist Rate Flash Charge Redistributio Pipelie Two-step ad Multi-Step Iterpolatig Algorithmic/Cyclic Successive Approximatio (Register) SAR Sigle Slope / Dual Slope Subragig Folded Iterleaved Over-Sampled (Delta-Sigma) Discrete-time First-order/Higher Order Cotiuous-time Curret Steerig R-strig Charge Redistributio Algorithmic R-2R (ladder) Pipelied Subragig Discrete-time First-order/Higher Order Cotiuous-time
6 . Review from last lecture. Data Coverter Architectures ADC Flash V REF V IN R R R R Thermometer to Biary Decoder R
7 . Review from last lecture. Data Coverter Architectures ADC Successive Approximatio Register (SAR) C LK V IN V REF DAC DAC Cotroller
8 Data Coverter Architectures Charge Redistributio ADC V ICOMP 1 C 2 C -1 C -2 C C -4 C C C C C C C 0 S 1 f A V X d-1 φb d-1 φb f f A d d -1 φb -1 φb A f A d-2 φb d -2 φ B f A d-3 φb d-3 φb f A d0 φb d 0 φ B f A φ B f A V IN V REF Successive Approximatio Block Redistribute charge with switches to drive Vx to 0 f A t 1 1 ' C C QSAM VIN Ci C 0 VIN V i INC i0 i C Q V d REDIS REF i i i0 2 f B d -1 VCOMP=0 T CONV t VCOMP=1 t Q SAM Q REDIS d -2 T CLK VCOMP=0 1 C V d V C V REF i i IN i0 2 d 1 i IN VREF i i0 2 d 0 VCOMP=1 VCOMP=0 VCOMP=1 t t
9 Data Coverter Architectures Sigle Slope ADC R S R S C LK V REF Itegrator V OUT V IN V E E Biary Couter c Comparator Chages States whe t TR V I V dt I t V IN 0 REF 0 TR REF 0 V IN f CLK Couter stops whe VIN ttrvrefi 0 COUNTTCLK VREFI 0 COUNT VREF I0 If calibrate so that fclk 2 I0 V IN COUNT 2 VREF V IN COUNT 2 V REF
10 Data Coverter Architectures DAC R-Strig V RFF R R S 1 S 2 R V OUT R S N-2 R S N-1 S N is decoded to close oe switch
11 Data Coverter Architectures DAC Curret Steerig V RFF I 1 I 2 I k S 1 S 2 S k R V OUT
12 Data Coverter Architectures DAC R-2R (4-bits) R R R R V OUT 2R 2R 2R 2R R d 3 d 2 d 1 d 0 V REF By superpositio: d V =V d +V d +V d +V d = V V 3 4 k 4-k OUT REF 3 REF 2 REF 1 REF 0 REF 4-k REF k k=0 2 k=1 2 d
13 Data Coverter Architectures Charge Redistributio DAC 1 C 2 C -1 C -2 C C -4 C C C 1 C C 2 2 C C 0 S 1 f A f B d-1 φa d-1 φa f B d-1 φa d-1 φa f B d-2 φ d -2 φ A A f B d d-3 φ -3 φa A f B d0 φa d 0 φ A φ B f A f A V OUT V REF Successive Approximatio Block 1 Q V d C SET REF i i i ' C C QRDIS VOUT Ci C 0 VOUT V i OUTC i0 i0 2 2 f A t Q SET Q RDIS T CONV f B 1 C V d V C V REF i i OUT i0 2 d 1 i OUT VREF i i0 2 t
14 Data Coverter Architectures May more data coverter architectures have bee proposed May are some variat of those listed above Recall: All typically are perfect if compoets are ideal The major oideal effects are usually due to oe of two issues: Matchig performace is ot acceptable Speed is limited by parasitics Most data coverter desig ivolves sequetially idetifyig domiat oideal effect ad developig ways to lower it Importat to observe methods for mitigatig oideal effects as they are ofte used repeatedly With data coverter desig, the devil is i the detail
15 Performace Characterizatio of Data Coverters ADC X DAC IN A very large umber of parameters (2 ) characterize the static performace of a ADC! Ad eve more parameters eeded to characterize the dyamic performace of a ADC A large (but much smaller) umber of parameters are ivariably used to characterize a data coverter Performace parameters of iterest deped strogly o the applicatio Very small umber of parameters of iterest i may/most applicatios Catalog data coverters are geerally iteded to satisfy a wide rage of applicatios ad thus have much more striget requiremets placd o their performace Custom applicatio-specific data coverter will geerally perform much better tha a catalog part i the same applicatio
16 Performace Characterizatio of Data Coverters Static characteristics Resolutio Least Sigificat Bit (LSB) Offset ad Gai Errors Absolute Accuracy Relative Accuracy Itegral Noliearity (INL) Differetial Noliearity (DNL) Mootoicity (DAC) Missig Codes (ADC) Low-f Spurious Free Dyamic Rage (SFDR) Low-f Total Harmoic Distortio (THD) Effective Number of Bits (ENOB) Power Dissipatio
17 Performace Characterizatio of Data Coverters Dyamic characteristics Coversio Time or Coversio Rate (ADC) Settlig time or Clock Rate (DAC) Samplig Time Ucertaity (aperture ucertaity or aperture jitter) Dyamic Rage Spurious Free Dyamic Rage (SFDR) Total Harmoic Distortio (THD) Sigal to Noise Ratio (SNR) Sigal to Noise ad Distortio Ratio (SNDR) Sparkle Characteristics Effective Number of Bits (ENOB)
18 Dyamic characteristics Degradatio of dyamic performace parameters ofte due to oideal effects i time-domai performace Dyamic characteristics of high resolutio data coverters ofte challegig to measure, to simulate, to uderstad source of cotributios, ad to miimize Example: A -bit ADC would ofte require SFDR at the 6+6 bit level or better. Thus, cosiderig a 14-bit ADC, the SFDR would be expected to be at the -90dB level or better. If the iput to the ADC is a 1V p-p siusoidal waveform, the secod harmoic term would 90 db / 20dB eed to be at the 10 32μV level. A 32uV level is about 1part i 30,000. Sigals at this level are difficult to accurately simulate i the presece of a 1V level sigal. For example, covergece parameters i simulators ad sample (strobe) poits used i data acquisitio adversely affect simulatio results ad observig the time domai waveforms that cotribute to oliearity at this level ad relatioships betwee these waveforms ad the sources of oliearity is ofte difficult to visualize. Simulatio errors that are at the 20dB level or worse ca occur if the simulatio eviromet is ot correctly established.
19 Performace Characterizatio of Data Coverters What is meat by low frequecy? Operatio at frequecies so low that further decreases i frequecy cause o further chages i a parameter of iterest Low frequecy operatio is ofte termed Pseudostatic operatio
20 Low-frequecy or Pseudo-Static Performace Paramater Pseudo-Static Regio f
21 Performace Characterizatio of Data Coverters Static characteristics Resolutio Least Sigificat Bit (LSB) Offset ad Gai Errors Absolute Accuracy Relative Accuracy Itegral Noliearity (INL) Differetial Noliearity (DNL) Mootoicity (DAC) Missig Codes (ADC) Low-f Spurious Free Dyamic Rage (SFDR) Low-f Total Harmoic Distortio (THD) Effective Number of Bits (ENOB) Power Dissipatio
22 Performace Characterizatio Resolutio Number of distict aalog levels i a ADC Number of digital output codes i A/D I most cases this is a power of 2 If a coverter ca resolve 2 levels, the we term it a -bit coverter 2 aalog outputs for a -bit DAC 2-1 trasitio poits for a -bit ADC Resolutio is ofte determied by architecture ad thus ot measured Effective resolutio ca be defied ad measured If N levels ca be resolved for a DAC the logn EQ= log2 If N-1 trasitio poits i a ADC, the logn EQ= log2
23 Performace Characterizatio Least Sigificat Bit Assume N = 2 Geerally Defied by Maufacturer to be X LSB =X REF /N Effective Value of LSB ca be Measured For DAC: X LSB is equal to the maximum icremet i the output for a sigle bit chage i the Boolea iput For ADC: X LSB is equal to the maximum distace betwee two adjacet trasitio poits
24 Offset Performace Characterizatio For DAC the offset is (assumig 0 is ideal value of (<0, 0>) (<0,, 0>) - absolute X OUT 0,...,0 X LSB - i LSB X REF Offset C 0 C 1 C 2 C 3 C 4 C 5 C 6 C 7 (If ideal value of (<0, 0>) 0, offset is shift from ideal value at <0, 0>)
25 Offset Performace Characterizatio (for DAC) X REF Offset C 0 C 1 C 2 C 3 C 4 C 5 C 6 C 7 Offset strogly (totally) depedet upo performace at a sigle poit Probably more useful to defie relative to a fit of the data
26 Offset Performace Characterizatio (for DAC) X REF Offset C 0 C 1 C 2 C 3 C 4 C 5 C 6 C 7 Offset relative to fit of data
27 Offset Performace Characterizatio For ADC the offset is X T1 -X LSB X X X T1 LSB LSB C 7 (assumig X LSB is the ideal first trasitio poit) - absolute - i LSB C 6 C 5 C 4 C 3 C 2 C 1 X LSB C 0 X T1 X X REF OFFSET (If ideal first trasitio poit is ot X LSB, offset is shift from ideal)
28 Performace Characterizatio Offset For ADC the offset is C 7 C 6 C 5 C 4 C 3 C 2 C 1 X LSB C 0 X T1 X OFFSET X REF Offset strogly (totally) depedet upo performace at a sigle poit Probably more useful to defie relative to a fit of the data
29 Performace Characterizatio Offset For ADC the offset is C 7 C 6 C 5 C 4 C 3 Fit Lie C 2 C 1 C 0 X LSB X OFFSET X REF Offset relative to fit of data
30 Performace Characterizatio Gai ad Gai Error For DAC X REF Ideal Output Actual Output Gai Error C 0 C 1 C 2 C 3 C 4 C 5 C 6 C 7 Gai error determied after offset is subtracted from output
31 Performace Characterizatio Gai ad Gai Error For ADC C 7 C 6 Actual Output Ideal Output C 5 C 4 C 3 Gai Error C 2 C 1 C 0 X LSB X REF Gai error determied after offset is subtracted from output
32 Ed of Lecture 26
33 Performace Characterizatio Gai ad Offset Errors Fit lie would give better idicator of error i gai but less practical to obtai i test Gai ad Offset errors of little cocer i may applicatios Performace ofte early idepedet of gai ad offset errors Ca be trimmed i field if gai or offset errors exist.
34 Itegral Noliearity (DAC) Noideal DAC X REF C 0 C 1 C 2 C 3 C 4 C 5 C 6 C 7
35 Itegral Noliearity (DAC) Noideal DAC X REF Ed Poit Fit LIe X OF (k) C 0 C 1 C 2 C 3 C 4 C 5 C 6 C 7 X OF X m= N-1 -X 0 OUT OUT N-1 OUT k = mk+ X 0
36 Itegral Noliearity (DAC) Noideal DAC X REF (k)-x OF (k) C 0 C 1 C 2 C 3 C 4 C 5 C 6 C 7 k OUT OF INL = X k -X k INL= max 0kN-1 INL k
37 Itegral Noliearity (DAC) Noideal DAC X REF INL C 0 C 1 C 2 C 3 C 4 C 5 C 6 C 7
38 Itegral Noliearity (DAC) Noideal DAC INL ofte expressed i LSB X REF INL = X k INL= max k - X OUT OF 0kN-1 X LSB INL k k INL C 0 C 1 C 2 C 3 C 4 C 5 C 6 C 7 INL is ofte the most importat parameter of a DAC INL 0 ad INL N-1 are 0 (by defiitio) There are N-2 elemets i the set of INL k that are of cocer INL is almost always omially 0 (i.e. desigers try to make it 0) INL is a radom variable at the desig stage INL k is a radom variable for 0<k<N-1 INL k ad INL k+j are almost always correlated for all k,j (ot icl 0, N-1) Fit Lie is a radom variable INL is the N-2 order statistic of a set of N-2 correlated radom variables
39 Itegral Noliearity (DAC) Noideal DAC X REF INL C 0 C 1 C 2 C 3 C 4 C 5 C 6 C 7 At desig stage, INL characterized by stadard deviatio of the radom variable Closed-form expressios for INL almost ever exist because PDF of order statistics of correlated radom variables is extremely complicated Simulatio of INL very time cosumig if is very large (large sample size required to establish reasoable level of cofidece) Model parameters become radom variables Process parameters affect multiple model parameters causig model parameter correlatio Simulatio times ca become very large INL ca be readily measured i laboratory but ofte domiates test costs because of umber of measuremets eeded whe is large Expected value of INL k at k=(n-1)/2 is largest for may architectures Major effort i DAC desig is i obtaiig acceptable yield!
40 ENOB of DAC Noideal DAC X REF INL C 0 C 1 C 2 C 3 C 4 C 5 C 6 C 7 Cocept of Equivalet Number of Bits (ENOB) is to assess performace of a actual DAC to that of a ideal DAC at a equivalet resolutio level Several differet defiitios of ENOB exist for a DAC Here will defie ENOB as determied by the actual INL performace Will use subscript to defie this ENOB, e.g. ENOB INL
41 ENOB INL of DAC Noideal DAC X REF Premise: A good DAC is ofte desiged so that the INL is equal to ½ LSB. Thus will assume that if a -bit DAC has a INL of ½ LSB that the ENOB INL =. INL C 0 C 1 C 2 C 3 C 4 C 5 C 6 C 7 Thus defie the effective umber of bits, EFF by the expressio INL V REF EFF EFF where INL is i volts 1 EFF VREF ENOBINL log2 1 INL Thus, if a -bit DAC has a INL of ½ LSB VREF 2 V LSB 1 ENOBINL log2 1 log2 1 log2 2 1 INL VLSB 2
EE 505. CMOS and BiCMOS Data Conversion Circuits
EE 505 CMOS ad BiCMOS Data Coversio Circuits Course Iformatio: Lecture Istructor: Rady Geiger 2133 Coover Voice: 294-7745 e-mail: rlgeiger@iastate.edu WEB: www.radygeiger.org Laboratory Istructor: TBD
More informationEE 435. Lecture 27. Data Converters. INL of DAC and ADC Differential Nonlinearity Spectral Performance
EE 435 Lecture 27 Data Converters INL of DAC and ADC Differential Nonlinearity Spectral Performance . Review from last lecture. Data Converter Architectures Many more data converter architectures have
More informationPerformance Plus Software Parameter Definitions
Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios
More informationData diverse software fault tolerance techniques
Data diverse software fault tolerace techiques Complemets desig diversity by compesatig for desig diversity s s limitatios Ivolves obtaiig a related set of poits i the program data space, executig the
More informationEE 435. Lecture 28. Data Converters. INL of ADCs Differential Nonlinearity Spectral Performance
EE 435 Lecture 28 Data Converters INL of ADCs Differential Nonlinearity Spectral Performance . Review from last lecture. Performance Characterization of Data Converters Static characteristics Resolution
More informationEM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS
EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS I this uit of the course we ivestigate fittig a straight lie to measured (x, y) data pairs. The equatio we wat to fit
More informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
More informationEE 435. Lecture 27. Data Converters. INL of ADC Differential Nonlinearity Spectral Performance
EE 435 Lecture 27 Data Converters INL of ADC Differential Nonlinearity Spectral Performance . Review from last lecture. Integral Nonlinearity (DAC) Nonideal DAC INL often expressed in LSB INL = X k INL=
More informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationCOMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter The Processor Part A path Desig Itroductio CPU performace factors Istructio cout Determied by ISA ad compiler. CPI ad
More informationImproving Template Based Spike Detection
Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for
More informationChapter 3. Floating Point Arithmetic
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 3 Floatig Poit Arithmetic Review - Multiplicatio 0 1 1 0 = 6 multiplicad 32-bit ALU shift product right multiplier add
More informationPolynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0
Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity
More informationOutline. Applications of FFT in Communications. Fundamental FFT Algorithms. FFT Circuit Design Architectures. Conclusions
FFT Circuit Desig Outlie Applicatios of FFT i Commuicatios Fudametal FFT Algorithms FFT Circuit Desig Architectures Coclusios DAB Receiver Tuer OFDM Demodulator Chael Decoder Mpeg Audio Decoder 56/5/ 4/48
More informationAppendix D. Controller Implementation
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);
More informationStructuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software
Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued
More informationAN OPTIMIZATION NETWORK FOR MATRIX INVERSION
397 AN OPTIMIZATION NETWORK FOR MATRIX INVERSION Ju-Seog Jag, S~ Youg Lee, ad Sag-Yug Shi Korea Advaced Istitute of Sciece ad Techology, P.O. Box 150, Cheogryag, Seoul, Korea ABSTRACT Iverse matrix calculatio
More informationDesigning a learning system
CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try
More informationBehavioral Modeling in Verilog
Behavioral Modelig i Verilog COE 202 Digital Logic Desig Dr. Muhamed Mudawar Kig Fahd Uiversity of Petroleum ad Mierals Presetatio Outlie Itroductio to Dataflow ad Behavioral Modelig Verilog Operators
More informationComputers and Scientific Thinking
Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput
More informationData Structures and Algorithms. Analysis of Algorithms
Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationSAMPLE VERSUS POPULATION. Population - consists of all possible measurements that can be made on a particular item or procedure.
SAMPLE VERSUS POPULATION Populatio - cosists of all possible measuremets that ca be made o a particular item or procedure. Ofte a populatio has a ifiite umber of data elemets Geerally expese to determie
More informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5
Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:
More informationCapability Analysis (Variable Data)
Capability Aalysis (Variable Data) Revised: 0/0/07 Summary... Data Iput... 3 Capability Plot... 5 Aalysis Summary... 6 Aalysis Optios... 8 Capability Idices... Prefereces... 6 Tests for Normality... 7
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationLearning to Shoot a Goal Lecture 8: Learning Models and Skills
Learig to Shoot a Goal Lecture 8: Learig Models ad Skills How do we acquire skill at shootig goals? CS 344R/393R: Robotics Bejami Kuipers Learig to Shoot a Goal The robot eeds to shoot the ball i the goal.
More informationCSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)
CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a
More informationDALSA CL-C8 Cameras. Operation. Table 1. CL-C8 Camera Configurations. Power Supplies. Sensor. Optical Interface
L N E S C A N C A M E R A S DALSA CL-C8 Cameras The CL-C8 provides DALSA quality ad performace i a large format camera. 6000 horizotal pixels ad a variety of high-speed output optios make the CL-C8 ideal
More information1. SWITCHING FUNDAMENTALS
. SWITCING FUNDMENTLS Switchig is the provisio of a o-demad coectio betwee two ed poits. Two distict switchig techiques are employed i commuicatio etwors-- circuit switchig ad pacet switchig. Circuit switchig
More informationEE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control
EE 459/500 HDL Based Digital Desig with Programmable Logic Lecture 13 Cotrol ad Sequecig: Hardwired ad Microprogrammed Cotrol Refereces: Chapter s 4,5 from textbook Chapter 7 of M.M. Mao ad C.R. Kime,
More informationΤεχνολογία Λογισμικού
ΕΘΝΙΚΟ ΜΕΤΣΟΒΙΟ ΠΟΛΥΤΕΧΝΕΙΟ Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών Τεχνολογία Λογισμικού, 7ο/9ο εξάμηνο 2018-2019 Τεχνολογία Λογισμικού Ν.Παπασπύρου, Αν.Καθ. ΣΗΜΜΥ, ickie@softlab.tua,gr
More informationSpectral leakage and windowing
EEL33: Discrete-Time Sigals ad Systems Spectral leakage ad widowig. Itroductio Spectral leakage ad widowig I these otes, we itroduce the idea of widowig for reducig the effects of spectral leakage, ad
More informationMarkov Chain Model of HomePlug CSMA MAC for Determining Optimal Fixed Contention Window Size
Markov Chai Model of HomePlug CSMA MAC for Determiig Optimal Fixed Cotetio Widow Size Eva Krimiger * ad Haiph Latchma Dept. of Electrical ad Computer Egieerig, Uiversity of Florida, Gaiesville, FL, USA
More informationn Industrial inspection n Laser gauging n Low light applications n Spectroscopy Figure 1. IL-C Sensor Block Diagram Pixel Reset Drain
L I N E S C A N C A M E R A S DALSA CL-C6 Cameras Tall pixels (38: aspect ratio), tremedous dyamic rage, great full-well capacity ad a sigle output make the CL-C6 a outstadig performer i spectroscopic
More informationSouth Slave Divisional Education Council. Math 10C
South Slave Divisioal Educatio Coucil Math 10C Curriculum Package February 2012 12 Strad: Measuremet Geeral Outcome: Develop spatial sese ad proportioal reasoig It is expected that studets will: 1. Solve
More informationn n B. How many subsets of C are there of cardinality n. We are selecting elements for such a
4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset
More informationCOP4020 Programming Languages. Functional Programming Prof. Robert van Engelen
COP4020 Programmig Laguages Fuctioal Programmig Prof. Robert va Egele Overview What is fuctioal programmig? Historical origis of fuctioal programmig Fuctioal programmig today Cocepts of fuctioal programmig
More informationModule Instantiation. Finite State Machines. Two Types of FSMs. Finite State Machines. Given submodule mux32two: Instantiation of mux32two
Give submodule mux32two: 2-to- MUX module mux32two (iput [3:] i,i, iput sel, output [3:] out); Module Istatiatio Fiite Machies esig methodology for sequetial logic -- idetify distict s -- create trasitio
More informationL6: FSMs and Synchronization
L6: FSMs ad Sychroizatio Ackowledgemets: Materials i this lecture are courtesy of the followig sources ad are used with permissio. Rex Mi J. Rabaey, A. Chadrakasa, B. Nikolic. igital Itegrated Circuits:
More informationIntroduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP
Nature-Ispired Computig Hadlig Costraits Dr. Şima Uyar September 2006 Itroductio may practical problems are costraied ot all combiatios of variable values represet valid solutios feasible solutios ifeasible
More informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationMath 10C Long Range Plans
Math 10C Log Rage Plas Uits: Evaluatio: Homework, projects ad assigmets 10% Uit Tests. 70% Fial Examiatio.. 20% Ay Uit Test may be rewritte for a higher mark. If the retest mark is higher, that mark will
More informationEE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 )
EE26: Digital Desig, Sprig 28 3/6/8 EE 26: Itroductio to Digital Desig Combiatioal Datapath Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Combiatioal Logic Blocks Multiplexer Ecoders/Decoders
More informationRunning Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The
More informationThe following algorithms have been tested as a method of converting an I.F. from 16 to 512 MHz to 31 real 16 MHz USB channels:
DBE Memo#1 MARK 5 MEMO #18 MASSACHUSETTS INSTITUTE OF TECHNOLOGY HAYSTACK OBSERVATORY WESTFORD, MASSACHUSETTS 1886 November 19, 24 Telephoe: 978-692-4764 Fax: 781-981-59 To: From: Mark 5 Developmet Group
More informationTest 4 Review. dy du 9 5. sin5 zdz. dt. 5 Ê. x 2 È 1, 3. 2cos( x) dx is less than using Simpson's. ,1 t 5 t 2. ft () t2 4.
Name: Class: Date: ID: A Test Review Short Aswer. Fid the geeral solutio of the differetial equatio below ad check the result by differetiatio. dy du 9 u. Use the error formula to estimate the error i
More information1 Graph Sparsfication
CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider
More informationService Oriented Enterprise Architecture and Service Oriented Enterprise
Approved for Public Release Distributio Ulimited Case Number: 09-2786 The 23 rd Ope Group Eterprise Practitioers Coferece Service Orieted Eterprise ad Service Orieted Eterprise Ya Zhao, PhD Pricipal, MITRE
More informationComputer Systems - HS
What have we leared so far? Computer Systems High Level ENGG1203 2d Semester, 2017-18 Applicatios Sigals Systems & Cotrol Systems Computer & Embedded Systems Digital Logic Combiatioal Logic Sequetial Logic
More informationDALSA CL-F2 TDI Cameras
T D L N E S C A N C A M E R A S DALSA CL-F2 TD Cameras The CL-F2 offers the sestivity ad flexibility of bidirectioal TD lie scaig with a sigle output for ease of iterface. Features Time Delay ad tegratio
More informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
More informationAnnouncements. Reading. Project #4 is on the web. Homework #1. Midterm #2. Chapter 4 ( ) Note policy about project #3 missing components
Aoucemets Readig Chapter 4 (4.1-4.2) Project #4 is o the web ote policy about project #3 missig compoets Homework #1 Due 11/6/01 Chapter 6: 4, 12, 24, 37 Midterm #2 11/8/01 i class 1 Project #4 otes IPv6Iit,
More informationAnalysis of Algorithms
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationDATA MINING II - 1DL460
DATA MINING II - 1DL460 Sprig 2017 A secod course i data miig http://www.it.uu.se/edu/course/homepage/ifoutv2/vt17/ Kjell Orsbor Uppsala Database Laboratory Departmet of Iformatio Techology, Uppsala Uiversity,
More informationThe Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana
The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:
More informationChapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationTELETERM M2 Series Programmable RTU s
Model C6xC ad C6xC Teleterm MR Radio RTU s DATASHEET Cofigurable Iputs ad Outputs 868MHz or 900MHz radio port 0/00 Etheret port o C6Cx ISaGRAF 6 Programmable microsd Card Loggig Low power operatio Two
More informationNON-LINEAR MODELLING OF A GEOTHERMAL STEAM PIPE
14thNew Zealad Workshop 1992 NON-LNEAR MODELLNG OF A GEOTHERMAL STEAM PPE Y. Huag ad D. H. Freesto Geothermal stitute, Uiversity of Aucklad SUMMARY Recet work o developig a o-liear model for a geothermal
More informationCS 111: Program Design I Lecture # 7: First Loop, Web Crawler, Functions
CS 111: Program Desig I Lecture # 7: First Loop, Web Crawler, Fuctios Robert H. Sloa & Richard Warer Uiversity of Illiois at Chicago September 18, 2018 What will this prit? x = 5 if x == 3: prit("hi!")
More informationOutline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis
Outlie ad Readig Aalysis of Algorithms Iput Algorithm Output Ruig time ( 3.) Pseudo-code ( 3.2) Coutig primitive operatios ( 3.3-3.) Asymptotic otatio ( 3.6) Asymptotic aalysis ( 3.7) Case study Aalysis
More informationPolitecnico di Milano Advanced Network Technologies Laboratory. Internet of Things. Projects
Politecico di Milao Advaced Network Techologies Laboratory Iteret of Thigs Projects 2016-2017 Politecico di Milao Advaced Network Techologies Laboratory Geeral Rules Geeral Rules o Gradig 26/30 are assiged
More informationLecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein
068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig
More informationFast Fourier Transform (FFT) Algorithms
Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform
More informationChapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 5 Fuctios for All Subtasks Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 5.1 void Fuctios 5.2 Call-By-Referece Parameters 5.3 Usig Procedural Abstractio 5.4 Testig ad Debuggig
More informationFuzzy Membership Function Optimization for System Identification Using an Extended Kalman Filter
Fuzzy Membership Fuctio Optimizatio for System Idetificatio Usig a Eteded Kalma Filter Srikira Kosaam ad Da Simo Clevelad State Uiversity NAFIPS Coferece Jue 4, 2006 Embedded Cotrol Systems Research Lab
More informationTELETERM M2 Series Programmable RTU s
DATASHEET Cofigurable Iputs ad Outputs 868, 900 or 58MHz radio port operatig i licesefree bads 0/00 Etheret port o C6Cx ISaGRAF 6 Programmable microsd Card Loggig Low power operatio Two serial ports (icl.
More informationChapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.
Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4
More informationCHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs
CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics
More informationOverview. Chapter 18 Vectors and Arrays. Reminder. vector. Bjarne Stroustrup
Chapter 18 Vectors ad Arrays Bjare Stroustrup Vector revisited How are they implemeted? Poiters ad free store Destructors Iitializatio Copy ad move Arrays Array ad poiter problems Chagig size Templates
More informationSD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.
SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that
More informationEE123 Digital Signal Processing
Last Time EE Digital Sigal Processig Lecture 7 Block Covolutio, Overlap ad Add, FFT Discrete Fourier Trasform Properties of the Liear covolutio through circular Today Liear covolutio with Overlap ad add
More informationLecture 21: Variation Risk Management
Lecture : Variatio Ris Maagemet Quality Types Total Quality Huma resources Maufacturig Orgaizig ad operatig Product ad Services Desig What is variatio? Variatio = Deviatio from omial variatio: the etet
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists
More informationUNIVERSITY OF MORATUWA
UNIVERSITY OF MORATUWA FACULTY OF ENGINEERING DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING B.Sc. Egieerig 2014 Itake Semester 2 Examiatio CS2052 COMPUTER ARCHITECTURE Time allowed: 2 Hours Jauary 2016
More informationCOMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Single-Cycle Disadvantages & Advantages
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 4 The Processor Pipeliig Sigle-Cycle Disadvatages & Advatages Clk Uses the clock cycle iefficietly the clock cycle must
More informationHash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.
Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative
More informationCMSC Computer Architecture Lecture 10: Caches. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 10: Caches Prof. Yajig Li Uiversity of Chicago Midterm Recap Overview ad fudametal cocepts ISA Uarch Datapath, cotrol Sigle cycle, multi cycle Pipeliig Basic idea,
More informationtop() Applications of Stacks
CS22 Algorithms ad Data Structures MW :00 am - 2: pm, MSEC 0 Istructor: Xiao Qi Lecture 6: Stacks ad Queues Aoucemets Quiz results Homework 2 is available Due o September 29 th, 2004 www.cs.mt.edu~xqicoursescs22
More informationAnalysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve
Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao
More informationAppendix A. Use of Operators in ARPS
A Appedix A. Use of Operators i ARPS The methodology for solvig the equatios of hydrodyamics i either differetial or itegral form usig grid-poit techiques (fiite differece, fiite volume, fiite elemet)
More informationCOMP 558 lecture 6 Sept. 27, 2010
Radiometry We have discussed how light travels i straight lies through space. We would like to be able to talk about how bright differet light rays are. Imagie a thi cylidrical tube ad cosider the amout
More informationAPPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS
APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful
More informationThe number n of subintervals times the length h of subintervals gives length of interval (b-a).
Simulator with MadMath Kit: Riema Sums (Teacher s pages) I your kit: 1. GeoGebra file: Ready-to-use projector sized simulator: RiemaSumMM.ggb 2. RiemaSumMM.pdf (this file) ad RiemaSumMMEd.pdf (educator's
More informationAutomatic Generation of Polynomial-Basis Multipliers in GF (2 n ) using Recursive VHDL
Automatic Geeratio of Polyomial-Basis Multipliers i GF (2 ) usig Recursive VHDL J. Nelso, G. Lai, A. Teca Abstract Multiplicatio i GF (2 ) is very commoly used i the fields of cryptography ad error correctig
More information. Perform a geometric (ray-optics) construction (i.e., draw in the rays on the diagram) to show where the final image is formed.
MASSACHUSETTS INSTITUTE of TECHNOLOGY Departmet of Electrical Egieerig ad Computer Sciece 6.161 Moder Optics Project Laboratory 6.637 Optical Sigals, Devices & Systems Problem Set No. 1 Geometric optics
More informationANN WHICH COVERS MLP AND RBF
ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi
More informationReversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits
Egieerig Letters, :, EL Reversible Realizatio of Quaterary Decoder, Multiplexer, ad Demultiplexer Circuits Mozammel H.. Kha, Member, ENG bstract quaterary reversible circuit is more compact tha the correspodig
More informationLast class. n Scheme. n Equality testing. n eq? vs. equal? n Higher-order functions. n map, foldr, foldl. n Tail recursion
Aoucemets HW6 due today HW7 is out A team assigmet Submitty page will be up toight Fuctioal correctess: 75%, Commets : 25% Last class Equality testig eq? vs. equal? Higher-order fuctios map, foldr, foldl
More informationOperating System Concepts. Operating System Concepts
Chapter 4: Mass-Storage Systems Logical Disk Structure Logical Disk Structure Disk Schedulig Disk Maagemet RAID Structure Disk drives are addressed as large -dimesioal arrays of logical blocks, where the
More informationFPGA IMPLEMENTATION OF BASE-N LOGARITHM. Salvador E. Tropea
FPGA IMPLEMENTATION OF BASE-N LOGARITHM Salvador E. Tropea Electróica e Iformática Istituto Nacioal de Tecología Idustrial Bueos Aires, Argetia email: salvador@iti.gov.ar ABSTRACT I this work, we preset
More informationOur second algorithm. Comp 135 Machine Learning Computer Science Tufts University. Decision Trees. Decision Trees. Decision Trees.
Comp 135 Machie Learig Computer Sciece Tufts Uiversity Fall 2017 Roi Khardo Some of these slides were adapted from previous slides by Carla Brodley Our secod algorithm Let s look at a simple dataset for
More informationChapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3
More informationNeuro Fuzzy Model for Human Face Expression Recognition
IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1
More information