1 / 41

ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ (22Δ802) Β΄ ΕΞΑΜΗΝΟ 201 6 -1 7

ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ (22Δ802) Β΄ ΕΞΑΜΗΝΟ 201 6 -1 7. Καθηγητής Πέτρος Π. Γρουμπός  2610 996 449 Ώρες Γραφείου: Τετάρτη Πέμπτη Παρασκευή 11:00-12:00 Γραφείο: 1 ος όροφος Τομέας Συστημάτων & Αυτομάτου Ελέγχου Τμήμα ΗΜ&ΤΥ Μάθημα 3. M(s). Y(s). E(s). R(s). G P (s). G c (s).

aybar
Download Presentation

ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ (22Δ802) Β΄ ΕΞΑΜΗΝΟ 201 6 -1 7

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ (22Δ802) Β΄ ΕΞΑΜΗΝΟ 2016-17 Καθηγητής Πέτρος Π. Γρουμπός 2610 996449 Ώρες Γραφείου: Τετάρτη Πέμπτη Παρασκευή 11:00-12:00 Γραφείο: 1ος όροφος Τομέας Συστημάτων & Αυτομάτου Ελέγχου Τμήμα ΗΜ&ΤΥ Μάθημα 3

  2. M(s) Y(s) E(s) R(s) GP(s) Gc(s) Controller Plant 1. Introduction Control system

  3. GHP(z) M(z) Y(z) E(z) R(z) GP(s) ZOH Gc(z) D/A A/D Computer system Plant Introduction (συνέχεια) Computer controlled system

  4. 2.Digital control loop: Components • GHP(z) is the transfer function of control object + ZOH, where z indicates the discrete time domain • GC(z) is a controller implemented in computer languages. • A/D is the Analog-to-Digital converter (Voltage Binary number). • D/A is the Digital-to-Analog converter (Binary number  Voltage). • The little switch indicate a sampling operation.

  5. Digital control loop:Signals Discrete time domain • R(z) is the desired output • E(z) is the error signal • M(z) is the controller output/control action • C(z) is the actual output Continuous time domain In continuous time domain, R(z), E(z), M(z) and C(z) are corresponding to r(t), e(t) m(t) and c(t).

  6. Digital control loop:Sequence of events • Get desired output r(t) at this instant in time • Measure actual output c(t) • Calculate error e(t)=r(t)-c(t) • Derive control signal m(t) based on proper control algorithm • Output this control signal m(t) to controlled object • Save previous history of error and output for later use • Repeat step 1 to 6 (go to 1)

  7. Digital control loop:Forms of signals • Computer cannot sample while calculating, so there is a sample frequency 1/T for data acquisition through a A/D, where T is sampling interval. • The data of a signal are recorded and represented as a sequence of number in memory. • Based on these numbers, a control signal is derived and then conveyed to controlled object through a D/A

  8. Digital control loop:Forms of signals • In between sample instants, the input is supposed as constant and the output is held as a constant by a device termed as zero-order-hold (ZOH). • The reconstruction of a signal will be a ‘stair-step, and a low-pass filter is employed to smooth out the rough edges

  9. f(kT) f(t) Sampling time Time kT f(kT) f(t) A/D time Time kT 3. ADC and DAC

  10. f(kT) f(kT) D/A Time kT Time kT 3 ADC and DAC(συν) D/A is used as a ZOH.

  11. Output Output Input ADC  Digital Analog Input 3. ADC and DAC (συν) • Have a discrete number of quantization levels • Number of levels L=2N, where N is the number of bits • eg N=3 bits, L=23=8 levels

  12. 3. ADC and DACADC

  13. 3 ADC and DACADC More bits more accuracy. The commonly used ADC has • 8-bits: L=28=256 (coarse) • 10-bits: L=210=1024 (adequate) • 12-bits: L=212=4096 (works well) • 16-bits: L=216=65536 (almost overkill)

  14. 20 2N-1 Bit 0 Bit N-1  3 ADC and DACADC • Distances between sequential levels are the same. eg 5v/28=0.0195v • The weight of each bit is different. The most significant bit is the most left bit and the least significant bit is the most right bit.

  15. 3 ADC and DACADC Example:For N=8, find the number range of the ADC in binary, decimal and hexadecimal numbers. If the input signal is from 0 to 5 voltage for the above number range, what will be the number for a 2 voltage signal in decimal and binary numbers? Solution: In binary: 00000000B 11111111B In decimal: 0  27+26+25+24+23+22+21+20= 255 In hexadecimal: 0  F=15; 00H FFH

  16. Input Output Output DAC  Analog Input Digital 3 ADC and DACDAC Example: For N=8 and the signal is from 0 to 5, find the output value for the number 145. Solution:5/255=x/145, x=5*145/255=2.8431=2.84

  17. … AD MUX  Digital signal  Status Control Analog signal 3 ADC and DAC Multi-channel A/D converter

  18. Control … Analog signals MUX DA   Digital signals 3 ADC and DAC Multi-channel D/A converter

  19. Output  ADC Errors  Input 4 Errors

  20. 4 Errors • The quantization error or resolution error is the difference between the analog input value and the equivalent digital value. On average it is one half of the LSB. • Linearity error: the maximum deviation in step size from ideal step size, expressed as a percentage of full scale. • Settling time: the time it takes for the output to reach within +/- half of the step size of the final output.

  21. Output Input ADC  4 Errors Gain error Output Digital Analog Input

  22. f(kT) f(t) Sampling time Time kT f(kT) f(t) A/D time Time kT 5 Sampling theorem

  23. 5 Sampling theorem

  24. 5 Sampling theorem If we need the sampled data to keep all the features of the original signal, what is the minimum sampling frequency? Or what conditions should we meet if we wish that the sampled data can represent the original data exactly? The answer to the above question forms the Sampling theorem/Shannon’s sampling theorem/Shannon’s theorem.

  25. 5 Sampling theorem A continuous-time signal f(t) with a finite bandwidth 0(the highest frequency component in the signal, or the Nyquist frequency) can be uniquely described by the sampled signal f(kT){k=…,-1,0,1….}, when the sampling frequency sis greater than 20. In other words, if a signal is sampled twice faster than its highest frequency component, the sampled date can represent all the features of this signal.

  26. 6 The proven of sampling theorem The proven is based on Fourier Transform • Fourier transform: A transformation from time domain to frequency domain f(t)  F(), where t is time and  is frequency. For a continuous time function f(t), we can uniquely find F(). If given F(), we can also unique determine f(t). It means that f(t) and F() are equivalent.

  27. f(t) F() Fourier Transform  0 -0 6 The proven of sampling theorem

  28. Fourier Transform  Fs() -2s -s -0 0 s 2s 6 The proven of sampling theorem 2. For a sampled signal fs(t), we have

  29. F() Fourier Transform  Fs()  0 -0 -2s -s -0 0 s 2s 6 The proven of sampling theorem 3. The relationship between f(t) and fs(t), and F() and Fs().

  30. Fs()  Fs() s -2s -s 0 2s -0 -2s -s -0 0 s 2s 6 The proven of sampling theorem 4. If we change the sampling frequency, what will happen with fs(t) and Fs().

  31. Fs() Fs() s -2s -s 0 2s -0 Fs() -0 -2s -s 0 s 2s -2s -s -0 0 s 2s 6 The proven of sampling theorem

  32. 6 The proven of sampling theorem 5. Conclusions If our sampling frequency s is faster enough, that is s>20, there will be gaps between the shifting F() in Fs(). We can always put a filter to figure out F() from Fs(). Otherwise if the repeating F() figures overlap in Fs(), we cannot put a filter to figure out F() from Fs(). The turning point from possible to impossible is s =20, where 0 is the highest frequency component or Nyquist Frequency of the signal.

  33. 7 Aliasing 1. Aliasing problem

  34. 7 Aliasing Ambiguity: alias

  35. 7 Aliasing 2. Finding aliases The fundamental alias frequency is given by =| (0+ n)mod(s) - n| where mod() means the remainder of an division operation, 0 is signal bandwidth, n Nyquist frequency, and s sampling frequency Example: For f0=90Hz & fs=100, find alias. Solution: =2f, fn=fs/2=50Hz, f=| (f0+ fn)mod(fs) - fn|=|(90+50)mod(100)-50| =|40-50|=10Hz

  36. 7 Aliasing 3. Preventing aliases Make sure your sampling frequency is greater than twice of the highest frequency component of the signal • Pre-filtering • Set your sampling frequency to the maximum if possible

  37. 7 Aliasing Suppose that the Nyquist frequency of a signal is 100Hz. If we use an 8-bit ADC to sample this signal at the frequency of 200Hz, can the sample data represents this signal exactly? Why?

  38. 7 Aliasing Theoretically, as long as the sampling frequency is greater than or equal to twice the Nyquist frequency, aliases will not happen. However, because of the conversion/quantisation error, the practical sampling frequency is much higher than that (5 to 10 times of the Nyquist frequency). Fortunately, most of the time the speeds of ADC and computer are also much greater than signal’s Nyquist frequency.

  39. F()  Krad/s -8 -4 4 8 Exercise Exercise 1: The frequency spectrum of a continuous-time signal is shown below. • What is the minimum sampling frequency for this signal to be sampled without aliasing. • If the above process were to be sampled at 10 Krad/s, sketch the resulting spectrum from –20 Krad/s to 20 Krad/s.

  40. Hints The relationship between f(t) and fs(t), and F() and Fs(). F() Fourier Transform  0 -0 Fs()  -0-s -0-2s -0 0 0+s 0+2s -0+s 0-2s 0-s -0+2s

  41. 2 4 6 8 10 12 14 16 18  Krad/s F() Answers

More Related