EE222

EE222

Signals
1. CT
  1. Even functions
    Annotations:
    - \( f\left( t\right) =f\left( -t\right),\forall t. \)
  2. Odd Functions
    Annotations:
    - [\[f(t)=-f(-t)\]
  3. Real-Valued Signals
  4. Complex-Valued Signals
  5. Digital Signals
2. DT
Systems
1. CT(Analog Clock)
2. DT(Digital Clock)
3. Hybrid both CT & DT
4. Properties
  1. Property 1
    1. Static(memoryless)
      Annotations:
      - A system is static (memoryless) if its output at any arbitrary time depends on the input at exactly the same time.
    2. Dynamic(memory)
      Annotations:
      - A system which has memory (i.e., it is not memoryless) is a dynamic system.
  2. Property 2
    1. Causal
      Annotations:
      - A system is causal if the output at any time t1 (n1) depends on values of the input at t <= t1 (n< n1).
      - In other words, a system is causal if its output is generated during or after the application of input and not before! Causal systems are also called non-anticipatory. A system which is not causal is called noncausal.
    2. Noncausal
  3. Property 3
    1. Linear
      1. Additivity
        Annotations:
        The input x = x1 + x2 yields the response y = y1 + y2.
        Homogeneity
        Annotations:
        The input ax1 yields the response ay1 for any constant a.
    2. Nonlinear
      1. Additivity Fails
      2. Homogeneity Fails
  4. Property 4
    1. Time-Invarient
      Annotations:
      - Combining the two conditions stated in the definition of the linearity property, we obtain the superposition principle
    2. Time Varying
      Annotations:
      - A system is time-varying if it is not time-invariant
  5. Property 5
    1. Invertible
      Annotations:
      - A system is invertible if distinct inputs yield distinct outputs. Inother words, in an invertible system whenever two inputs x1 and x2 yield the output y, then x1 = x2.
  6. Property 6
    Annotations:
    - A relaxed system is bounded-input, bounded-output (BIBO) stable if every bounded input yields a bounded output.
    1. Relaxed
      1. BIBO
5. Superposition Principle
6. LTI(Linear & Time-Invarient
  1. Theorem 1
    1. A CT LTI system is memoryless if its impulse-response is given by h(t) = K (t) ,for some constant K .
  2. Impulse-response
    Annotations:
    - Apart from easy cases, it is often hard to verify whether a system property holds or not. This statement is not true if we restrict our attention to LTI systems. In fact, it is possible to verify whether an LTI system is memoryless, causal, or BIBO stable simply by inspecting its so-called impulse-response.
    1. Simplified
      Annotations:
      - \[\overline {h}^{\left( n-1\right) }\left( 0+\right) =1\]
  3. Theorem 2
    1. A DT LTI system is memoryless if its impulse-response is given by h[n] = K [n] ,for some constant K .
  4. Theorem 3
    1. A CT LTI system is causal if its impulse-response satisfies the condition h(t) = 0 , 8 t < 0 .
  5. Theorem 4
    1. A DT LTI system is causal iffits impulse-response satisfies the condition h[n] = 0 , 8 n < 0 . 37
  6. Theorem 5
    1. A CT LTI system is BIBO stable if its impulse-response satisfies the condition Integral between -inf & + inf of |h(t)| dt < inf
  7. Theorem 6
    1. A DT LTI system is BIBO stable if its impulse-response satisfies the condition sum between n=−inf & +inf |h[n]| < inf.
  8. Arbitrary Inputs

Next up

Description

Resource summary

Media attachments

Similar

	Created by Shannon L. Massi about 10 years ago