Some basic Applications of Digital filters : - PowerPoint PPT Presentation

1 / 34
About This Presentation
Title:

Some basic Applications of Digital filters :

Description:

Given M data points (tm, um), m=1,2,...,M wish to fit ... 20 log|ratio| = decibel units (dB) 20 dB = factor of 10. 18. CMLab. Missing Data and Interpolation : ... – PowerPoint PPT presentation

Number of Views:37
Avg rating:3.0/5.0
Slides: 35
Provided by: yal9
Category:

less

Transcript and Presenter's Notes

Title: Some basic Applications of Digital filters :


1
Some basic Applications of Digital filters
  • Least-square fitting of polynomials
  • Given M data points (tm, um), m1,2,,M wish
    to fit (approximate) these data, in some sense,
    by a polynomial uu(t) of degree N where M?N1
  • Principle of least square
  • the sum of the squares of the residuals is
    the least

2
  • Ex consider a set of 5 equally spaced data
    points.
  • tmm for m-2, -1, 0, 1, 2
  • um unspecified
  • fit the above data by a straight line
    uABt
  • in least-square sense.

3
  • From the frequency point of view
  • Spose the input function is one of the
    eigenfunctions in the complex form eiwt of
    frequency w.
  • Since the system is linear, the same function
    will emerge at the output except that it is
    multiplied by its eigenvalue H(w).

4
transfer function
In general
5
the more terms used , the more rapid are the
wiggles of H(w), and the more the envelope of the
wiggles is squeezed toward the frequency axis.
6
  • Least-squares Quadratics and Quartics
  • Instead of a straight line, fit by a
    quardratic (or a cubic) u(t)ABtCt2

7
  • The effect of the higher-degree polynomial is a
    higher degree of tangency at w0
  • The use of more terms in the smoothing formula
    makes the curve come down sooner.

8
  • Modified least squares
  • Smoothing Window for 2N1 points
  • modified Smoothing Windows for 2N1 points
  • reduce the two end values to one-half their
    assigned values

9
  • The curve will come down more rapidly
  • The main lobe is slightly wider.

? the end constants can be chosen as a parameter
10
  • Differences and Derivatives
  • The difference operator
  • the operator annihilates a polynomial
    Pn(x) of degree n in X that is

11
  • from frequency point of view

12
  • Since , so the
    amplification at frequency w is contained in the
    factor
  • ?decreases the amplitude of
    any frequency
  • there is an amplification

13
high-pass behavior of the difference operator ?k
14
  • Differences are also used to approximate
    derivatives.
  • Central difference formula
  • from the formula (with h1)

15
  • The ratio of the calculated to the true answer
    (which is iw) is
  • w0, R1
  • w?0, Rlt1 ? the formula underestimates the
    value of the derivatives for all other freqs.
  • For the 2nd derivate

16
not informative
  • Spencers smoothing formula
  • 15-point
  • 21-point

17
  • plot the logs of the numbers H(w)
  • 20 logratio decibel units (dB)
  • 20 dB factor of 10

18
  • Missing Data and Interpolation
  • The reasons or situations for the occurrence of
    missing data in a long record of data
  • the measurements may never have been made they
    may have been misrecorded and thus later removed
  • the formula used to compute successive values of
    the function may have involved an indeterminate
    form, such as at x0, and the computer
    refused to divide by zero.

19
  • Usually, an interpolation formula based on the
    assumption that the data locally is a polynomial
    of some odd degree.
  • This is equivalent to the assumption that the
    next higher-order difference is zero.

20
  • For instance, k4
  • note the sum of the sequences of the binomial
    coeffs. of order N is . Hence for the 2k
    th difference formula, the noise amplification is

21
  • If set
  • then

22
  • H(0)1 However, for high freqs, the value is not
    too
  • good, particularly for very high
    freqs.
  • Negative values on the graph of the transfer
    function imply a change in sign.
  • The above figure points out the damager of
    interpolating a missing value when the data is
    noisy, which means that the data has numerous
    high frequencies.

23
  • Interpolation midpoint values linear
    interpolation gives
  • if 4 adjacent points are used

24
  • A Class of Nonre cursive Smoothing Filters
  • Design of filters
  • H(0)1 exact at dc(lowest freq.)
  • H(?)0 no highest freq. get through

L.P.
25
  • Since H(?)0 the factor cos w1 had to occur
  • Now one can select a filter that approximately
    meets the requirement.

26
  • for Ex.1, if we require

Ex.2 if we set
27
  • Ex. 3. Spose that we try to do as well as
    possible in the neighborhood of zero freq.

28
  • Ex we pick our filter form as

29
  • Integration Recursive Filters
  • Trapezoid Rule (using y00)

30
  • The true answer for integration of is

31
  • Simpsons Rule
  • w0 , R1
  • and has a tangency through the 3rd derivative

32
  • Midpoint integration formula (using y00)

33
  • Leo Tick Formula

34
  • Simpsons formula amplifies the upper part of
    Nyquist interval (the higher frequencies) where
    as the trapezoid rule damps them out.
  • In the presence of noise. Simpsons formula is
    more dangerous to use than are the trapezoid or
    midpoint formulas. But when there is relatively
    little high freq. In the function being
    integrated, then the flatness of Simpsons
    formula for low freqs. show why it is superior.
Write a Comment
User Comments (0)
About PowerShow.com