Scribd
Upload
16 views3 pages

Discrete Time Signal Properties

signal spectra

Uploaded by

Alyanah Vicencio
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views3 pages

Discrete Time Signal Properties

signal spectra

Uploaded by

Alyanah Vicencio
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

ELX 303 : SIGNALS, SPECTRA AND PROCESSING

TOPIC 3: Discrete Time System Properties

Learning Outcomes
Topic Title Estimated
time
“I SHOULD BE ABLE TO”…

3 Discrete Time System Differentiate static and dynamic systems. 10 hours


Properties Determine a system whether it is linear or
non linear.

Classification of Discrete-Time Systems Why is this so


important?
• mathematical techniques developed to analyze systems are often contingent upon the general
characteristics of the systems being considered
For a system to possess a given property, the property must hold for every possible input to the system.
• to disprove a property, need a single counter-example
• to prove a property, need to prove for the general case

Common System Properties:


static vs. dynamic
time-invariant vs. time-variant
linear vs. nonlinear
causal vs. non-causal
stable vs. unstable
systems

STATIC VS. DYNAMIC


• Static system (a.k.a. memoryless): the output at time n depends only on the input sample at time n;
otherwise the system is said to be dynamic
• a system is static iff (if and only if)
y(n) = T [x(n), n] for every time instant n.

• Consider the general system:


y(n) = T [x(n − N), x(n − N + 1), · · · , x(n − 1), x(n), x(n + 1), · · · , x(n + M − 1), x(n + M)], N, M > 0

• For N = M = 0, y(n) = T [x(n)], the system is static.


• For 0 < N, M < ∞, the system is said to be dynamic with finite memory of duration N + M + 1.
• For either N and/or M equal to infinite, the system is said to have infinite memory.

Example 3.1: memoryless or not?


1. y(n) = A x(n), A  0 YES

2. y(n) = A x(n) + B, A, B,  0 YES

3. y(n) = x(n) cos[(π/25) (n − 5)] YES

4. y(n) = x(−n) NO

5. y(n) = x(n + 1) NO

6. y(n) = 1/[1−x(n+2)] NO

7. y(n) = e3x(n) YES

8. y(n) = NO

LINEAR VS. NONLINEAR SYSTEMS


• Linear system: obeys superposition principle
• a system is linear iff (if and only if)
T [a1 x1(n) + a2 x2(n)] = a1 T [x1(n)] + a2 T [x2(n)]
for any arbitrary input sequences x1(n) and x2(n), and any arbitrary constants a1 and a2.

• Homogeneity: Let a2 = 0
T [a1 x1(n)] = a1 T [x1(n)]

for any constant a1.

• Additivity: Let a1 = a2 = 1.

T [x1(n) + x2(n)] = T [x1(n)] + T [x2(n)]

for any input sequences x1(n) and x2(n).

Therefore:
Linearity = Homogeneity + Additivity

Need both!
If a system is not homogeneous, it is not linear.
If a system is not additive, it is not linear.
Example 3.2: linear or not?
1. y(n) = A x(n), A  0 YES

2. y(n) = A x(n) + B, A, B,  0 NO

3. y(n) = x(n) cos[(π/25) (n − 5)] YES

4. y(n) = x(−n) YES

5. y(n) = x(n + 1) YES

6. y(n) = 1/[1−x(n+2)] NO

7. y(n) = e3x(n) NO

8. y(n) = YES

ACTIVITY NO.3
Answer the following.
1. Find whether the following systems are dynamic or not, and explain, in brief.

a. y[n] = x[n-3]
b. y[n] = x[2n]
c. y[n] = x[n+2]

2. Determine if the system is linear or not


y[n] = u[2(n − 1)]

REFERENCES
1. Sadiko, M N. O. Signals and Systems: A Primer with Matlab. CRC Press. 2016.
2. Tan, L.. Digital Signal Processing: Fundamentals and Applications. Academic Press. 2008.
3. Oppenheim, A. V., Wilsky, A. Signals and Systems. 2nd edition. Prentice Hall. 1996.
4. Orfanidis, S. J. Introduction to Signal Processing, Prentice Hall. 2010.
5. Proakis, J. G., Manolakis, D. G. Digital Signal Processing. 4th edition. Pearson. 2006.

You might also like