Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 1

Σχετικά έγγραφα
Main source: "Discrete-time systems and computer control" by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1

CHAPTER 25 SOLVING EQUATIONS BY ITERATIVE METHODS

Homework 3 Solutions

ST5224: Advanced Statistical Theory II

Phys460.nb Solution for the t-dependent Schrodinger s equation How did we find the solution? (not required)

Απόκριση σε Μοναδιαία Ωστική Δύναμη (Unit Impulse) Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο. Απόστολος Σ.

EE512: Error Control Coding

HOMEWORK 4 = G. In order to plot the stress versus the stretch we define a normalized stretch:

Section 8.3 Trigonometric Equations

Matrices and Determinants

6.3 Forecasting ARMA processes

C.S. 430 Assignment 6, Sample Solutions

Second Order RLC Filters

The Simply Typed Lambda Calculus

ΕΙΣΑΓΩΓΗ ΣΤΗ ΣΤΑΤΙΣΤΙΚΗ ΑΝΑΛΥΣΗ

ΔΙΑΚΡΙΤΟΣ ΜΕΤΑΣΧΗΜΑΤΙΣΜΟΣ FOURIER - Discrete Fourier Transform - DFT -

6.1. Dirac Equation. Hamiltonian. Dirac Eq.

Chapter 6: Systems of Linear Differential. be continuous functions on the interval

Αθανάσιος Σκόδρας /

Inverse trigonometric functions & General Solution of Trigonometric Equations

Example Sheet 3 Solutions

ANSWERSHEET (TOPIC = DIFFERENTIAL CALCULUS) COLLECTION #2. h 0 h h 0 h h 0 ( ) g k = g 0 + g 1 + g g 2009 =?

Finite Field Problems: Solutions

derivation of the Laplacian from rectangular to spherical coordinates

Second Order Partial Differential Equations

Concrete Mathematics Exercises from 30 September 2016

ω ω ω ω ω ω+2 ω ω+2 + ω ω ω ω+2 + ω ω+1 ω ω+2 2 ω ω ω ω ω ω ω ω+1 ω ω2 ω ω2 + ω ω ω2 + ω ω ω ω2 + ω ω+1 ω ω2 + ω ω+1 + ω ω ω ω2 + ω

Statistical Inference I Locally most powerful tests

Bayesian statistics. DS GA 1002 Probability and Statistics for Data Science.

Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit

Instruction Execution Times

2 Composition. Invertible Mappings

Fourier Series. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics

Solution Series 9. i=1 x i and i=1 x i.

k A = [k, k]( )[a 1, a 2 ] = [ka 1,ka 2 ] 4For the division of two intervals of confidence in R +

Areas and Lengths in Polar Coordinates

4.6 Autoregressive Moving Average Model ARMA(1,1)

A Bonus-Malus System as a Markov Set-Chain. Małgorzata Niemiec Warsaw School of Economics Institute of Econometrics

Problem Set 3: Solutions

The challenges of non-stable predicates

Lecture 34 Bootstrap confidence intervals

PARTIAL NOTES for 6.1 Trigonometric Identities

5.4 The Poisson Distribution.

Areas and Lengths in Polar Coordinates

Fractional Colorings and Zykov Products of graphs

3.4 SUM AND DIFFERENCE FORMULAS. NOTE: cos(α+β) cos α + cos β cos(α-β) cos α -cos β

Math221: HW# 1 solutions

2. THEORY OF EQUATIONS. PREVIOUS EAMCET Bits.

Chapter 6: Systems of Linear Differential. be continuous functions on the interval

Approximation of distance between locations on earth given by latitude and longitude

Econ 2110: Fall 2008 Suggested Solutions to Problem Set 8 questions or comments to Dan Fetter 1

Section 9.2 Polar Equations and Graphs

ΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 6/5/2006

Μηχανική Μάθηση Hypothesis Testing

Nowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in

Solutions to Exercise Sheet 5

DESIGN OF MACHINERY SOLUTION MANUAL h in h 4 0.

10.7 Performance of Second-Order System (Unit Step Response)

Reminders: linear functions

Lecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3

Probability and Random Processes (Part II)

Section 7.6 Double and Half Angle Formulas

DERIVATION OF MILES EQUATION FOR AN APPLIED FORCE Revision C

Other Test Constructions: Likelihood Ratio & Bayes Tests

Homework 8 Model Solution Section

Mean-Variance Analysis

ΔΕΙΓΜΑΤΟΛΗΨΙΑ - SAMPLING -

Overview. Transition Semantics. Configurations and the transition relation. Executions and computation

ECE 308 SIGNALS AND SYSTEMS FALL 2017 Answers to selected problems on prior years examinations

Bounding Nonsplitting Enumeration Degrees

ΣΗΜΑΤΑ ΔΙΑΚΡΙΤΟΥ ΧΡΟΝΟΥ

Modbus basic setup notes for IO-Link AL1xxx Master Block

Démographie spatiale/spatial Demography

Physical DB Design. B-Trees Index files can become quite large for large main files Indices on index files are possible.

ΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 19/5/2007

Assalamu `alaikum wr. wb.

[1] P Q. Fig. 3.1

Every set of first-order formulas is equivalent to an independent set

CHAPTER 48 APPLICATIONS OF MATRICES AND DETERMINANTS

Numerical Analysis FMN011

SCHOOL OF MATHEMATICAL SCIENCES G11LMA Linear Mathematics Examination Solutions

Exercises 10. Find a fundamental matrix of the given system of equations. Also find the fundamental matrix Φ(t) satisfying Φ(0) = I. 1.

forms This gives Remark 1. How to remember the above formulas: Substituting these into the equation we obtain with

( y) Partial Differential Equations

Tridiagonal matrices. Gérard MEURANT. October, 2008

(1) Describe the process by which mercury atoms become excited in a fluorescent tube (3)

Πανεπιστήµιο Κύπρου Πολυτεχνική Σχολή

w o = R 1 p. (1) R = p =. = 1

Partial Differential Equations in Biology The boundary element method. March 26, 2013

Block Ciphers Modes. Ramki Thurimella

Ηλεκτρονικοί Υπολογιστές IV

Uniform Convergence of Fourier Series Michael Taylor

Study of In-vehicle Sound Field Creation by Simultaneous Equation Method

Elements of Information Theory

ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ. Ψηφιακή Οικονομία. Διάλεξη 10η: Basics of Game Theory part 2 Mαρίνα Μπιτσάκη Τμήμα Επιστήμης Υπολογιστών

D Alembert s Solution to the Wave Equation

Practice Exam 2. Conceptual Questions. 1. State a Basic identity and then verify it. (a) Identity: Solution: One identity is csc(θ) = 1

2. Let H 1 and H 2 be Hilbert spaces and let T : H 1 H 2 be a bounded linear operator. Prove that [T (H 1 )] = N (T ). (6p)

Strain gauge and rosettes

UNIVERSITY OF CALIFORNIA. EECS 150 Fall ) You are implementing an 4:1 Multiplexer that has the following specifications:

Transcript:

Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 1

ΧΡΟΝΟΣ ΥΠΟΛΟΓΙΣΜΟΥ Υπάρχει πάντοτε µια καθυστέρηση µεταξύ της στιγµής δειγµατοληψίας και της στιγµής που η υπολογισθείσα τιµή ελέγχου εφαρµόζεται στο σύστηµα. Η µεταβλητότητα στη καθυστέρηση υπολογισµού ονοµάζεται control jitter. H καθυστέρηση υπολογισµού πρέπει να είναι πάντοτε µικρότερη της περιόδου δειγµατοληψίας. Τα ψηφιακά συστήµατα ελέγχου είναι συστήµατα πραγµατικού-χρόνου (realtime systems). Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 2

ΕΠΙΛΟΓΗ ΣΥΧΝΟΤΗΤΑΣ ΔΕΙΓΜΑΤΟΛΗΨΙΑΣ: Αναλογικό Φίλτρο Εισόδου (antialiasing) We choose the sampling frequency in the range between 5 and 10 times the max frequency of the signal to be sampled. The continuous signal to be sampled must not include significant frequency components greater than the Nyquist frequency Fs/2. It is recommended to low-pass filter the continuous signal before sampling, especially in the presence of high-frequency noise. Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 3

SAMPLING RATE & ANALOG ANTIALIASING FILTER The antialiasing filter is typically a simple first-order RC filter, but some applications require a higher-order filter such as a Butterworth or a Bessel filter. The cut-off frequency of the low-pass filter must be higher than the bandwidth of the closed-loop system so as not to degrade the transient response. The low-pass filter can be chosen as 10 times the bandwidth of the closed-loop system to minimize its effect on the control system dynamics, and then the sampling frequency can be chosen 10 times higher than the filter cut-off frequency so that there is a sufficient attenuation above the Nyquist frequency. Thus, the sampling frequency is 100 times the bandwidth of the closed-loop system. For a low-pass filter with a high roll-off (i.e., a high-order filter), the sampling frequency is chosen as five times the closed-loop bandwidth. Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 4

EXAMPLE: Consider a 1 Hz sinusoidal signal of unity amplitude with an additive 50 Hz sinusoidal noise. Verify the effectiveness of an antialiasing filter for the signal sampled at a frequency of 30 Hz. Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 5

Phase Delay introduced by the ZOH The frequency response of the zero-order hold (ZOH) can be approximated as: This introduces an additional delay in the control loop approximately equal to half of the sampling period. The additional delay reduces the stability margins of the control system, and the reduction is worse as the sampling period is increased. This imposes an upper bound on the value of the sampling period T. Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 6

ΣΥΣΤΗΜΑΤΑ ΠΟΛΛΩΝ ΕΙΣΟΔΩΝ-ΕΞΟΔΩΝ (ΜΙΜΟ) Πολυπλεξία για τη µείωση του κόστους Προσοχή στον χρονισµό Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 7

ΕΠΙΛΟΓΗ ADC & DAC Χρόνοι µετατροπής αµελητέοι σε σχέση µε την περίοδο δειγµατοληψίας. Το µήκος λέξης καθορίζει το σφάλµα κβάντισης (quantization resolution). 8-bit συνεπάγεται σφάλµα 0.4% = 1/256 10-bit συνεπάγεται σφάλµα 0.1% 16-bit συνεπάγεται σφάλµα 0.0015% H ακρίβεια (resolution) του DAC είναι της ακρίβειας του ADC. H ακρίβεια του σήµατος αναφοράς πρέπει να είναι ίση µε αυτή του ADC και του DAC. Εάν η ακρίβεια του σήµατος αναφοράς είναι υψηλότερη αυτής του ADC, το σφάλµα ελέγχου δεν θα γίνεται ποτέ µηδέν και θα εµφανίζονται limit cycles. Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 8

QUANTIZATION ERRORS The noise due to quantization can be modeled as a uniformly distributed random process. q is the quantization level, i.e. the range of the ADC divided by 2^n, and n is the number of bits. Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 9

QUANTIZATION: Roundoff and Truncation without Saturation Arithmetic Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 10

QUANTIZATION: Roundoff and Truncation with Saturation Arithmetic Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 11

OVERFLOW Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 12

Quantization Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 13

Quantization & Coding Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 14

ADC Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 15

QUANTIZATION ERRORS It is proved that: the mean value is independent of the sampling period, is linear in the controller gain for small gains, and is almost independent of the gain for large gains. In any case, the worst value achieved is half the quantization interval. the variance is linear in the sampling period and linear in the controller gain for large gains. Thus, the effect of the quantization noise can be reduced by decreasing the sampling period, once the ADC has been selected. We conclude that decreasing the sampling period has beneficial effects with respect to both aliasing and quantization noise. However, decreasing the sampling period requires more expensive hardware and may aggravate problems because of the finite-word representation of parameters. Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 16

QUANTIZATION ERRORS The nonlinear quantization operation will sometimes generate (nontrivial) periodic solutions known as overflow oscillations and limit cycles. Overflow oscillations occur when the saturation arithmetic characteristic of the quantizer in invoked; otherwise any nontrivial periodic solution is referred to as limit cycle. Overflow oscillations influence the MSB, whereas limit cycles generally affect only LSB of the states. Thus if overflow occurs, it can cause much more severe signal distortion. Floating point arithmetic usually has sufficient dynamic range to prevent the occurrence of overflow oscillations. In fact, the prevention of overflow is the main reason for using floating point arithmetic and not for improving small scale accuracy! However, limit cycles can also exist in floating point implementations and their amplitude can be large. Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 17

FINITE WORDLENGTH EFFECTS Rounding or Roundoff can cause the filter output to oscillate forever, even when the filter input sequence is all zeros. This is the so called limit cycles phenomenon. Example: Let's assume this filter rounds the adder's output to the nearest integer value. If the situation ever arises where y( 2)=0, y( 1)=8, and x (0) and all successive x(n) inputs are zero, the filter output goes into endless oscillation. If this filter were to be used in an audio application, when the input signal went silent the listener could end up hearing an audio tone instead of silence. Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 18

FINITE WORDLENGTH EFFECTS Consider infinite precision computations for 19 Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 19

FINITE WORDLENGTH EFFECTS Now the same operation with integer precision 20 Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 20

FINITE WORDLENGTH EFFECTS Notice that with infinite precision the response converges to the origin. With finite precision the response does not converge to the origin but assumes cyclically a set of values the Limit Cycle. 21 Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 21

FINITE WORDLENGTH ERRORS ADC and Multiplication Errors Parallel realization has a lower multiplication noise amplification than direct realization. Coefficient Errors Parallel and cascade realizations are less sensitive than direct realization. As a general rule, it is best NOT to use the direct realization for finite wordlength. Other Issues Wordlength and sampling rate are interdependent and the selection of a max sampling interval and a min wordlegth is an iterative process. Cost is directly related to the wordlength and sampling rate. Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 22

FINITE WORDLENGTH EFFECTS Difference Equations Consider the ideal 1 st order difference equation: y(n) = a x(n) + b y(n-1) In general, coefficients a, b cannot be represented exactly with finite precision arithmetic. Even if a, b could be exactly represented, the state y(n-1) can NEVER be exactly represented for all discrete time instants n (unless b=0). To demonstrate this, suppose that a, b, x(n) and the initial state y(0) are all 8 bit fractions. Then, y(1) will in general have a 16 bit fractional part, y(2) will have a 24 bit fractional part, etc. Hence, given any available wordlength, there will be a value of n for which y(n) cannot be exactly represented. Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 23

Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 24

Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 25

We conclude that decreasing the sampling period has beneficial effects with respect to both aliasing and quantization noise. However, decreasing the sampling period requires more expensive hardware and may aggravate problems because of the finite-word representation of parameters. EXAMPLE: Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 26

ΑΠΕΥΘΕΙΑΣ ΠΑΡΑΛΛΗΛΗ ΣΕ ΣΕΙΡΑ πραγµατοποίηση συστήµατος ΠΑΡΑΔΕΙΓΜΑ Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 27

ΦΙΛΤΡΑ BUTTERWORTH: Τα βαθυπερατά φίλτρα έχουν ΜΟΝΟ πόλους Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 28

ΠΑΡΑΡΤΗΜΑ 1: ΑΡΙΘΜΟΙ ΣΤΑΘΕΡΗΣ ΥΠΟΔΙΑΣΤΟΛΗΣ (Fixed-point representation) Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 29

ΠΑΡΑΡΤΗΜΑ 1: ΑΡΙΘΜΟΙ ΚΙΝΗΤΗΣ ΥΠΟΔΙΑΣΤΟΛΗΣ (Floating-point representation) Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 30

Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 31

Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 32

Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 9 ΔΙΑΦΑΝΕΙΑ 33