jagomart
digital resources
picture1_Lecture9b Notes


 166x       Filetype PDF       File size 0.41 MB       Source: mil.ufl.edu


File: Lecture9b Notes
eel3135 discrete time signals and systems lecture 9 b discrete time signals lecture 9 b discrete time signals 1 introduction now that we have explored the process of sampling that ...

icon picture PDF Filetype PDF | Posted on 30 Jan 2023 | 2 years ago
Partial capture of text on file.
                   
                   EEL3135: Discrete-Time Signals and Systems                                          Lecture #9(b): Discrete-Time Signals
                                                      Lecture #9(b): Discrete-Time Signals
                   1.  Introduction
                       Now that we have explored the process of sampling — that is, the conversion of continuous-time signals to dis-
                       crete-time signals,
                               xn[]= x ()nf⁄                                                                                          (1)
                                         c    s
                       — we are ready to cover some important aspects of discrete-time signals, as we did with continuous-time signals.
                       Specifically, this set of notes covers the following topics:
                       1. Mathematical representation and transformations of discrete-time signals.
                       2. Some important discrete-time functions.
                       This introductory treatment closely parallels our previous treatment of continuous-time signals.
                   2.  Discrete-time signals
                       A. Signal transformations
                           Let xn[] denote a discrete-time function of time index n . As we have already seen for continuous-time func-
                           tions, it will frequently be important to know how the function x  changes when we change its argument. The
                           table below gives the qualitative effect of some simple changes in argument for discrete-time signals.
                                            discrete-time function                         effect
                                         xn[]–                           Reflection
                                                                         Compression
                                         x[]an ,  a ∈ {}23,,…
                                                                         Shift to the right along the horizontal axis
                                         xn[]– a, a ∈ {}123,,,…
                                                                         Shift to the left along the horizontal axis
                                         xn[]+ a, a ∈ {}123,,,…
                                         ax⋅ []n, a > 1                  Magnification
                                         ax⋅ []n, a < 1                  Reduction
                                         xn[]+a, a>0                     Shift up along the vertical axis
                                         xn[]–a, a>0                     Shift down along the vertical axis
                           Figures 1 and 2 illustrate some of these on two simple discrete-time functions, which are sampled versions of
                           the continuous-time functions in Figures 1 and 2 of the “Lecture #6” notes, with sampling frequencies of
                           10Hz and 5Hz, respectively. It is very important that you understand each of these illustrations, and are able
                           to perform them yourself without the aid of a computer or calculator. 
                           As was the case for continuous-time signals, compound transformations that perform both scaling and left/
                           right shifting are a little trickier than each one by itself. Consider xn[] in Figure 1 and the compound trans-
                           formation x[]2n – 10 . To understand what this function looks like, we first change it to:
                               x[]2n – 10  = x[]2()n – 5                                                                              (2)
                           In this form, we see that we first scale the function, and then shift the scaled function by 5  units (not 10 units)
                           to the right; this transformation is illustrated in the bottom right corner of Figure 1. Figure 2 (bottom right
                           corner) illustrates another compound-transformation example:
                               xn[]– +20 = xn[]–()– 20                                                                                (3)
                           Again, we see that by factoring the scaling information (in this case a reflection), the function is first reflected
                           about the y-axis, and is then shifted 20 time units to the right (not to the left). (The Mathematica notebook
                           “discrete_transformations.nb was used to generate these examples.)
                                                                            - 1 -
                                                                  
                 EEL3135: Discrete-Time Signals and Systems                                    Lecture #9(b): Discrete-Time Signals
                      4 xn[]                                                4 xn[]–
                      3                                                     3
                      2                                                     2
                      1                                                     1
                      0                                                     0
                       -20       -10         0        10         20          -20        -10        0         10        20
                                             nn
                      4 x[]2n                                               4   xn[]+1
                      3                                                     3
                      2                                                     2
                      1                                                     1
                      0                                                     0
                       -20       -10         0        10         20          -20        -10        0         10        20
                                              n                                                    n
                      4 xn[]– 5                                             4 xn[]+ 5
                      3                                                     3
                      2                                                     2
                      1                                                     1
                      0                                                     0
                       -20       -10         0        10         20          -20        -10        0         10        20
                                             nn
                      4 2xn[]                                               4 x[]2n – 10  = x[]2()n – 5
                      3                                                     3
                      2                                                     2
                      1                                                     1
                      0                                                     0
                       -20       -10         0        10         20          -20        -10        0         10        20
                                             n                     Figure 1                         n
                                                                      - 2 -
                                                                                                                                                                                                                                    
                                            EEL3135: Discrete-Time Signals and Systems                                                                                                                                                              Lecture #9(b): Discrete-Time Signals
                                                                    xn[]                                                                                                                                        xn[]–
                                                        0.2                                                                                                                                          0.2
                                                        0.1                                                                                                                                          0.1
                                                             0                                                                                                                                            0
                                                      -0.1                                                                                                                                        -0.1
                                                                          -40                  -20                     0                  20                   40                                                      -40                  -20                    0                   20                   40
                                                                                                                   nn
                                                                      x[]2n                                                                                                                                        xn[]–11⁄ 0
                                                        0.2                                                                                                                                          0.2
                                                        0.1                                                                                                                                          0.1
                                                             0                                                                                                                                            0
                                                      -0.1                                                                                                                                        -0.1
                                                                          -40                  -20                     0                  20                   40                                                      -40                  -20                    0                   20                   40
                                                                                                                      n                                                                                                                                         n
                                                                    xn[]– 20                                                                                                                                                                                                                 xn[]+ 20
                                                        0.2                                                                                                                                          0.2
                                                        0.1                                                                                                                                          0.1
                                                             0                                                                                                                                            0
                                                      -0.1                                                                                                                                        -0.1
                                                                          -40                  -20                     0                  20                   40                                                      -40                  -20                    0                   20                   40
                                                                                                                   nn
                                                                     1                                                                                                                                            xn[]–          +20 = xn[]–()– 20
                                                                   
                                                                     ---    xn[]
                                                                   
                                                        0.2          2                                                                                                                               0.2
                                                        0.1                                                                                                                                          0.1
                                                             0                                                                                                                                            0
                                                      -0.1                                                                                                                                        -0.1
                                                                          -40                  -20                     0                  20                   40                                                      -40                  -20                    0                   20                   40
                                                                                                                    n                                                         Figure 2                                                                            n
                                                                                                                                                                                    - 3 -
                                                                                                                                    
                   EEL3135: Discrete-Time Signals and Systems                                          Lecture #9(b): Discrete-Time Signals
                       B. Some useful discrete-time signals
                           In this section, we introduce some very useful discrete-time signals. The first of these is the discrete-time
                           impulse or delta function δ[]n , defined by,
                               δ[]n  = 1        n = 0, (4)
                                        0       n ≠ 0
                                        
                           and plotted in Figure 3 below.
                                                                                  δ[]n
                                                                                   1
                                                                                                            n
                                                                              Figure 3
                           We can define any discrete-time signal as the weighted sum of time-shifted δ  functions:
                                          ∞
                               xn[]=     ∑ xk[]δ[]nk–                                                                                 (5)
                                       k = –∞
                           For example, the discrete-time signal xn[] in Figure 4 below can be written as:
                               xn[]= δ[]n + 1 ++2δ[]n       2δ[]n – 1 – δ[]n – 2                                                      (6)
                                                                                   δ[]n
                                                                                   2      2
                                                                             1
                                                                                                            n
                                                                                                 –1
                                                                              Figure 4
                           Another discrete-time function of significance in our mathematical representation of signals is the discrete
                           unit step function un[],
                               un[]= 1          n ≥ 0                                                                                (7)
                                        0       n < 0
                                        
                           plotted in Figure 5. 
                           Finally, we introduce the discrete-time sinusoidal function. Since the continuous-time sinusoid can be written
                           as,
                                                                            - 4 -
The words contained in this file might help you see if this file matches what you are looking for:

...Eel discrete time signals and systems lecture b introduction now that we have explored the process of sampling is conversion continuous to dis crete xn x nf c s are ready cover some important aspects as did with specically this set notes covers following topics mathematical representation transformations functions introductory treatment closely parallels our previous a signal let denote function index n already seen for func tions it will frequently be know how changes when change its argument table below gives qualitative effect simple in reection compression xan shift right along horizontal axis left ax magnication reduction up vertical down figures illustrate these on two which sampled versions frequencies hz respectively very you understand each illustrations able perform them yourself without aid computer or calculator was case compound both scaling shifting little trickier than one by itself consider figure trans formation what looks like rst form see scale then scaled units not ...

no reviews yet
Please Login to review.