Signals and Systems - System Classifications

What is a System?

  • A system processes an input signal x(t)x(t) to produce an output signal y(t)y(t).
  • Broadly, a system is anything that responds when stimulated.
  • A basic system can be represented as a block diagram with an input signal and an output signal, connected by a system function h(t)h(t).

Examples of Systems (Block Diagrams)

  • Integrator
  • Adder
  • Multiplier

A. Continuous-Time and Discrete-Time Systems

Continuous Time System

  • Operates with a continuous-time signal and produces a continuous-output signal.
  • A continuous-time signal x(t)x(t) is transformed into another continuous-time signal y(t)y(t).

Discrete-Time System

  • Operates with a discrete-time signal and produces a discrete-output signal.
  • A discrete-time signal x[n]x[n] is transformed into another discrete-time signal y[n]y[n].

B. Systems With Memory and Without Memory

Memoryless (Static) System

  • The output at any instant depends only on the input at that instant, not on past input values.

System with Memory (Dynamic)

  • The output at any instant depends on past or future input values.
  • All differential equations represent systems with memory.
  • Systems with memory are also called Dynamic systems.
  • Memoryless systems are also called Instantaneous, Static, or Memoryless systems.

Memory vs. Memoryless Comparison

  • Memory System: Present output depends on past or future input.
  • Memoryless System: Present output depends only on present input.

Procedure for Testing Memory

  1. Choose a value for tt (or nn).
  2. Substitute this value into the input.
  3. Determine if the input values are equal to, more than, or less than the present output value.
  4. Justify whether the system has memory based on the characteristics (past, present, or future input).
Example
  • If the present output is assumed to be 5:
    • Past input value: < 5
    • Present input value: 5
    • Future input value: > 5

EXAMPLE 1: Memory and Memoryless System

(a)
  • Moving-average system: y[n]=(1/3)(x[n1]+x[n]+x[n+1])y[n] = (1/3)(x[n-1] + x[n] + x[n+1])
  • It has memory because the output y[n]y[n] at time nn depends on the present and two past values of x[n]x[n].
(b)
  • y[n]=2x[n]y[n] = 2x[n]
  • It is memoryless because the output signal y[n]y[n] depends only on the present value of the input signal x[n]x[n].

EXAMPLE 2

  • System: y(t)=7x(t)+6y(t) = 7x(t) + 6
  • Let t=2t = 2: y(2)=7x(2)+6y(2) = 7x(2) + 6
  • Since the present output depends only on the present input value, the system is memoryless.

EXAMPLE 3

  • System: y(t)=7x(t+1)+6y(t) = 7x(t+1) + 6
  • Let t=2t = 2: y(2)=7x(3)+6y(2) = 7x(3) + 6
  • Since the present output value depends on a future input, the system has memory.

C. Causal and Noncausal Systems

Causal System

  • A system is causal if its output depends only on present and past values of the input, but not on future values.

Noncausal System

  • A system is non-causal if its output depends on future values of the input.

Example: Causal and Noncausal

  • y[n]=x[n+1]y[n] = x[n+1] is noncausal because the output signal y[n]y[n] depends on a future value of the input signal, x[n+1]x[n+1].
  • Causality is required for a system to operate in real time.

Procedures for Testing Causality

  • The procedure is the same as with memory:
    1. Choose a value for tt.
    2. Substitute tt into the input.
    3. Determine if the input values are equal to, more, or less than the present output value.
    4. Justify whether the system is causal or non-causal based on the characteristics.

Causal vs. Non-causal Comparison

  • Causal System: Present output values depend on past or present input values.
  • Non-causal System: Present output values depend on future input.

EXAMPLE 1

  • System: y(t)=7x(t)+6y(t) = 7x(t) + 6
  • Let t=2t = 2: y(2)=7x(2)+6y(2) = 7x(2) + 6
  • Since present output depends on the present input value, the system is causal.

EXAMPLE 2

  • System: y(t)=8x(t)+7x(t+5)y(t) = 8x(t) + 7x(t+5)
  • Let t=2t = 2: y(2)=8x(2)+7x(7)y(2) = 8x(2) + 7x(7)
  • Since the present output depends on a future input value, the system is non-causal.

D. Linear Systems and Nonlinear Systems

Linear System Conditions

  • If an operator TT satisfies the following two conditions, then TT is a linear operator, and the system represented by TT is a linear system:
    1. Additivity: Given that Tx<em>1=y</em>1T{x<em>1} = y</em>1 and Tx<em>2=y</em>2T{x<em>2} = y</em>2, then Tx<em>1+x</em>2=y<em>1+y</em>2T{x<em>1 + x</em>2} = y<em>1 + y</em>2
    2. Homogeneity (or Scaling): If Tx=yT{x} = y, then Tax=ayT{ax} = ay

Superposition Principle

  • A system is linear if superposition (additivity and homogeneity) can be applied. Superposition = additivity + homogeneity.
  • Superposition implies that the response resulting from several input signals can be computed as the sum of the responses resulting from each input signal acting alone.
  • A system is non-linear if superposition cannot be applied.

Linear vs. Non-linear Comparison

  • Linear System:
    • Superposition can be applied.
    • Both Additivity AND Homogeneity must be true.
  • Non-linear System:
    • Superposition cannot be applied.
    • Either Additivity OR Homogeneity is not true.

Procedure for Testing Linearity

  1. Let y<em>1(t)y<em>1(t) be the output corresponding to the input x</em>1(t)x</em>1(t), and y<em>2(t)y<em>2(t) be the output corresponding to the input x</em>2(t)x</em>2(t).
  2. Additivity Property: The response to x<em>1(t)+x</em>2(t)x<em>1(t) + x</em>2(t) is y<em>1(t)+y</em>2(t)y<em>1(t) + y</em>2(t).
  3. Homogeneity Property: The response to αx<em>1(t)\alpha x<em>1(t) is αy</em>1(t)\alpha y</em>1(t), where α\alpha is any arbitrary constant.
  • The two properties can be combined into a single statement: αx<em>1(t)+βx</em>2(t)αy<em>1(t)+βy</em>2(t)\alpha x<em>1(t) + \beta x</em>2(t) \rightarrow \alpha y<em>1(t) + \beta y</em>2(t)
    • Where α\alpha and β\beta are arbitrary constants.

EXAMPLE 1

  • System: y(t)=tx(t)y(t) = tx(t)
  • Solution:
    • Let x<em>1(t)y</em>1(t)=tx1(t)x<em>1(t) \rightarrow y</em>1(t) = tx_1(t)
    • Let x<em>2(t)y</em>2(t)=tx2(t)x<em>2(t) \rightarrow y</em>2(t) = tx_2(t)
    • Let x<em>3(t)=x</em>1(t)+x<em>2(t)y</em>3(t)=tx3(t)x<em>3(t) = x</em>1(t) + x<em>2(t) \rightarrow y</em>3(t) = tx_3(t)
    • Additivity Test:
      • x<em>3(t)=x</em>1(t)+x2(t)x<em>3(t) = x</em>1(t) + x_2(t)
      • y<em>3(t)=t(x</em>1(t)+x<em>2(t))=tx</em>1(t)+tx<em>2(t)=y</em>1(t)+y2(t)y<em>3(t) = t(x</em>1(t) + x<em>2(t)) = tx</em>1(t) + tx<em>2(t) = y</em>1(t) + y_2(t)
    • Homogeneity Test:
      • Let x<em>3(t)=ax</em>1(t)x<em>3(t) = ax</em>1(t)
      • y<em>3(t)=t(ax</em>1(t))=a(tx<em>1(t))=ay</em>1(t)y<em>3(t) = t(ax</em>1(t)) = a(tx<em>1(t)) = ay</em>1(t)
    • Therefore, the system is linear.

Linear Systems and Nonlinear Systems

  • Linear Systems: Systems that follow the principle of superposition.
    1. Law of Additivity:
      • If x<em>1(t)y</em>1(t)x<em>1(t) \rightarrow y</em>1(t) and x<em>2(t)y</em>2(t)x<em>2(t) \rightarrow y</em>2(t), then x<em>1(t)+x</em>2(t)y<em>1(t)+y</em>2(t)x<em>1(t) + x</em>2(t) \rightarrow y<em>1(t) + y</em>2(t).
    2. Law of Homogeneity:
      • If x(t)y(t)x(t) \rightarrow y(t), then kx(t)ky(t)kx(t) \rightarrow ky(t).

E. Time-Invariant and Time-Variant Systems

Time-Invariant System

  • A system is time-invariant if a time shift (delay or advance) in the input signal causes the same time shift in the output signal.
  • Continuous-time: If Tx(tt<em>0)=y(tt</em>0)T{x(t - t<em>0)} = y(t - t</em>0) for any real value of t0t_0.
  • Discrete-time: If Tx[nk]=y[nk]T{x[n - k]} = y[n - k] for any integer kk.

Time-Varying System

  • A system that does not satisfy the above equations is a time-varying system.

Time-Variant vs. Time-Invariant

  • Time-Variant: Input-output relationship varies with time; the same input produces different outputs at different times.
    • y<em>2(t)y</em>1(tt0)y<em>2(t) \neq y</em>1(t - t_0)
  • Time-Invariant: The input-output relationship does not vary with time; the same input produces the same output at different times.
    • y<em>2(t)=y</em>1(tt0)y<em>2(t) = y</em>1(t - t_0)

Procedure for Testing Time-Invariance

  1. Let y<em>1(t)y<em>1(t) be the output corresponding to the input x</em>1(t)x</em>1(t).
  2. Consider a second input, x<em>2(t)x<em>2(t), obtained by shifting x</em>1(t)x</em>1(t): x<em>2(t)=x</em>1(tt0)x<em>2(t) = x</em>1(t - t_0).
  3. Find the output y<em>2(t)y<em>2(t) corresponding to the input x</em>2(t)x</em>2(t).
  4. Find y<em>1(tt</em>0)y<em>1(t - t</em>0) from step 1 and compare with y2(t)y_2(t).
  5. If y<em>2(t)=y</em>1(tt0)y<em>2(t) = y</em>1(t - t_0), then the system is time-invariant; otherwise, it is time-variant.

EXAMPLE 1

  • System: y(t)=sin(x(t))y(t) = \sin(x(t))
  • Let x<em>1(t)y</em>1(t)=sin(x1(t))x<em>1(t) \rightarrow y</em>1(t) = \sin(x_1(t))
  • Let x<em>2(t)=x</em>1(tt0)x<em>2(t) = x</em>1(t - t_0)
  • Then y<em>2(t)=sin(x</em>2(t))=sin(x<em>1(tt</em>0))y<em>2(t) = \sin(x</em>2(t)) = \sin(x<em>1(t - t</em>0))
  • y<em>1(tt</em>0)=sin(x<em>1(tt</em>0))y<em>1(t - t</em>0) = \sin(x<em>1(t - t</em>0))
  • Since y<em>2(t)=y</em>1(tt0)y<em>2(t) = y</em>1(t - t_0), the system is time-invariant.

EXAMPLE 2

  • System: y(t)=tx(t)y(t) = tx(t)
  1. Let x<em>1(t)y</em>1(t)=tx1(t)x<em>1(t) \rightarrow y</em>1(t) = tx_1(t)
  2. Introduce a time delay t<em>0t<em>0 in the input: x</em>2(t)=x<em>1(tt</em>0)x</em>2(t) = x<em>1(t-t</em>0)
  3. The delayed input produces an output: y<em>2(t)=tx</em>1(tt0)y<em>2(t) = tx</em>1(t-t_0).
  4. Introduce a time delay t<em>0t<em>0 in the output of equation (1): y</em>1(tt<em>0)=(tt</em>0)x<em>1(tt</em>0)y</em>1(t-t<em>0) = (t-t</em>0)x<em>1(t-t</em>0)
  5. Compare equations (2) and (3): y<em>2(t)y</em>1(tt0)y<em>2(t) \neq y</em>1(t - t_0). Therefore, the system is Time-variant.

HOMEWORK

  • Check Time-Invariance and Time-Variance Properties of the following systems:
    1. y(t)=x(sin(t))y(t) = x(\sin(t))
    2. y(t)=x(t+2)y(t) = x(t + 2)
    3. y(t)=cos(t)+x(t)y(t) = \cos(t) + x(t)

F. Linear Time-Invariant (LTI) Systems

  • If a system is both linear and time-invariant, it is called a linear time-invariant (LTI) system.
  • Linear: αx<em>1(t)+βx</em>2(t)αy<em>1(t)+βy</em>2(t)\alpha x<em>1(t) + \beta x</em>2(t) \rightarrow \alpha y<em>1(t) + \beta y</em>2(t)
  • Time-invariant: y<em>2(t)=y</em>1(tt0)y<em>2(t) = y</em>1(t - t_0)
  • Why LTI? For an LTI system, knowing the impulse response h(t)h(t) is sufficient to predict the output for any input by convolving the input with the impulse response. LTI systems are easier to analyze, which is not true for nonlinear or time-variant systems.

G. Stable Systems

  • A system is stable if a bounded-input produces a bounded-output (BIBO).
  • Bounded input refers to a finite value of the input signal x(t)x(t) for any value of tt.
  • If x(t)x(t) is bounded, then there exists a constant M < \infty such that |x(t)| \le M < \infty for all tt.
  • Stable: If its impulse response h(t)h(t) vanishes after a sufficiently long time (goes to 0, convergence).
  • Unstable: If its impulse response h(t)h(t) grows without bound (approaches \infty) after a sufficiently long time (divergence).

H. Feedback Systems

  • A feedback system is a special class of systems where the output signal is fed back and added to the input.
  • In a feedback system, the output at any time depends on past output, past input, and present input.
  • In a non-feedback system, the output depends only on the present and past input.

Interconnection of Systems

  • (a) Series (Cascade): S<em>1S</em>2S<em>1 \rightarrow S</em>2
  • (b) Parallel: S<em>1+S</em>2S<em>1 + S</em>2
  • (c) Feedback: S<em>1,S</em>2,S3S<em>1, S</em>2, S_3