Signals and Systems Chapter 1 Problems Part

2 (1.21-1.31)
Feb 15, 2020 · 20 min read · ! " ! * # $

Project % Watch it " Docs & Inst $ Weibo Wechat ' Source " Source

Slides ! Follow ( Follow ) listen

Table of Contents
1 Problem 1.21
2 Problem 1.22
3 Problem 1.23
4 Problem 1.24
5 Problem 1.25
6 Problem 1.26
7 Problem 1.27
8 Problem 1.28
9 Problem 1.29
10 Problem 1.30
11 Problem 1.31
12 Reference

# This post consists of solutions to problems from 1.21 to 1.31 in chapter 1 of the
book Signals and Systems by Oppenheim ,Willsky and Nawab.oppenheim_signals_1997
1 Problem 1.21

A continuout-time signal x(t) is shown below. Sketch and label carefully each
of the following signals:

(a) : x(t − 1) (b) : x(2 − t)

(c) : x(2t + 1) (d) : x(4 − 2t )
(e) : [x(t) + x(−t)]u(t) (f ) : x(t)δ(t + 32 ) − δ(t − 32 )

Before we figure all the sub-problem out. Let’s review how a and b a!ect x(at + b) . we
know that:

1. when |a| < 1, x(t) will be linearly stretched;

2. when |a| > 1, x(t) will be linearly compressed;
3. when a < 0, x(t) will be reversed;
4. when b ≠ 0 , x(t) will be shifted in time.
5. when a > 0, b > 0, x(t) will be shifted left.
6. when a > 0, b < 0, x(t) will be shifted right.
7. when a < 0, b > 0, x(t) will be reversed first then shifted right.
8. when a < 0, b < 0, x(t) will be reversed first, then shifted left.

Problem 1.21a

Based on the conclusion given above, we know that x(t − 1) can be obtained by right
shifting x(t) with step 1. So the result can be visualized as follows.
Problem 1.21b

For x(2 − t), we re-write it as x(−(t − 2)) which can be obtained by first reversing x(t)
then right shifting it with step 2. The result can be shown as follows

Problem 1.21c

x(2t + 1) can be re-written as x(2(t + 12 )) which means that x(2t + 1) can be obtained
1
by first linearly compressing x(t) with factor 2 then left shifting compressed signal by 2 .

Problem 1.21d

x(4 − 2t ) can be re-written as x(− 12 (t − 8)) which means that x(4 − 2t ) can be obtained
by first linearly stretching x(t) by factor 2 then right shifting it with step 8.
Problem 1.21e

At first glance, [x(t) + x(−t)]u(t) is 0 if t < 0.

> 0, we have to figure out x(−t). After obtaining x(−t), we add the right part of x(t)
If t
and left part of x(−t) then we have [x(t) + x(−t)]u(t)

x(t)δ(t + 32 ) − δ(t − 32 ) only have two points with non-negative values: t = 3

2
and
t = − 32 .
2 Problem 1.22

A discrete-time signal is shown in below figure. Sketch and label carefully

each of the following signals:

(a) : x[n − 4] (b) : x[3 − n]

(c) : x[3n] (d) : x[3n + 1]
(e) : x[n]u[3 − n] (f ) : x[n − 2]δ[n − 2]
1
(g) : 2 x[n]
+ 12 (−1)n x[n] (h) : x[(n − 1)2 ]

Problem 1.22a

x[n − 4] can be obtained by right shifting x[n] with step 4.

Problem 1.22b

x[3 − n] can be obtained by reversing x[n] first then right shifting the reversed signal with
step 3
Problem 1.22c

x[3n] can be obtained by downsampling x[n] with a factor 3. Notice that downsampling
discrete-time signal is di!erent with compressing continuous-time signal because
discrete-time signal only have integers as independent variables.

Problem 1.22d

x[3n + 1] can be obtained by downsampling x[n] with a factor 3 and a delay 1.

Problem 1.22e

x[n]u[3 − n] consists of two parts: x[n] and u[3 − n]. u[3 − n], which can be obtained by
reversing u[n] then right shifting 3 decides whether the result is zero or not.
Notice that x[n]u[3 − n] is the same as x[n] which is due to that u[3 − n] is 0 if n > 3 and
x[n] is also 0 if n > 3.

Problem 1.22f

x[n − 2]δ[n − 2] can be obtained by sampling x[n] at n = 2.

Problem 1.22g

1 1 0
x[n] + (−1)n x[n] = {
n is odd
2 2 x[n] n is even

Problem 1.22h

x[(n − 1)2 ] can be obtained by sampling x[n] with sampling index (n − 1)2 .

Let y[n] = x[(n − 1)2 ], we have

[−1] = [4] = 0
 y[−1] = x[4] = 0
y[0] = x[1] = 1
y[1] = x[0] = 1
y[2] = x[1] = 1
y[3] = x[4] = 0

3 Problem 1.23

Determine and sketch the even and odd parts of the signals shown below.
Label your sketches carefully
Before we figure them out, let’s review the definition of odd and even part of one signal.

Any signal can be seperated into two parts: the even part and the odd part.

1
xe (t) = Even{x(t)} = [x(t) + x(−t)]
2
1
xo (t) = Odd{x(t)} = [x(t) − x(−t)]
2
Problem 1.23a

1
If t ≤ 0, we have xe (t) = 2 x(−t)
;

1
if t > 0 , we have xe (t) = 2 x(t)
; So, we illustrate xe (t) as follows
If t < 0, we have xo (t) = − 12 x(−t) ;
1
if t > 0 , we have xo (t) = 2 x(t)
; So, we illustrate xo (t) as follows

Problem 1.23b

1 1 1
To draw the xe (t) , get 2 x(t) , 2 x(−t) and − 2 x(−t) first.
So we have xe (t) and xo (t) as below:
Problem 1.23c

I decide to figure this problem in a algebraic instead of geometrical way. because we have:

−2t t<0
x(t) = {
t t>0

So

−t t<0
x(−t) = {
2t t>0

Then,

3
xe (t) = { 2t t>0
− 32 t t<0
− 12 t
{ 1
t>0
xo (t) =
−2t t<0

Then we can draw them

4 Problem 1.24

Determine and sketch the even and odd parts of the signals depicted in the
following figure. Label your sketches carefully
Based on the definition of even and odd parts of one signal and the analysis in Problem 1.23
, draw the result directly.

Problem 1-24a

Problem 1.24b
Problem 1-24c

5 Problem 1.25

Determine whether or not each of the following continuous-time signals is

periodic. If the signal is periodic, determine its fundamental period.

π
(a) : x(t) = 3 cos(4t + )
3
(b) : x(t) = ei(πt−1)
π 2
(c) : x(t) = [cos(2t − )]
3
(d) : x(t) = Even{cos(4πt)u(t)}
(e) : x(t) = Even{sin(4πt)u(t)}
∞
(f ) : x(t) = ∑ e−(2t−n) u(2t − n)
n=−∞

Problem 1.25a

π
The signal is periodic and the fundamental period T satisfies 4T = 2π , so T = 2

Problem 1.25b

The signal is periodic and the fundamental period T satisfies πT = 2π, so T = 2

Problem 1.25c

To figure out whether or not the signal is periodic, we have to re-express the signal as:
π π
2 i(2t− ) −i(2t− ) 2
3 −e 3
[ cos(2t − =[ ]
π e
3
)]
2
π π
) −i2(2t− )
i2(2t−
1 e 3 +e 3
= [ ]
4 2
1
= (1 + cos(4t − 2π
3
))
2
π
so the signal is periodic and the fundamental period T satisfies 4T = 2π , so T = 2
.

Problem 1.25d

Because even part of cos(4πt)u(t) is symmetrical about y-axis, the signal is periodic and
1
the fundamental period T satisfies 4πT = 2π. So the fundamental period is T = 2

Problem 1.25e

Because sin(4πt) is an odd signal and Even{sin(4πt)u(t)} is symmetrical about y-axis. So

the signal is not periodic.

Problem 1.25f

From the signal (f ) , we can see that there is no di!erence between whether n is n + 1 or
n − 1 because n have value from −∞ to ∞. So when we set n as n + 1, we have,
∞ ∞
∑ e −(2t−n−1)
u(2t − n − 1) = ∑ e−(2t−n) u(2t − n)
n=−∞ n=−∞

Notice we can move the 1 in the left part of the above equation into t , so

∞ 1 ∞
∑ e − n) = ∑ e−(2t−n) u(2t − n)
−(2(t− 2 )−n) 1
u(2(t − 2
)
n=−∞ n=−∞

Because n must be integers, so 1 is the minimum value we can add to n. Hence, the signal is
1
periodic and its fundamental period is 2

6 Problem 1.26

Determine whether or not each of the following discrete-time signals is

periodic. If the signal is periodic, determine its fundamental period.

6π
(a) : x[n] = sin( n + 1)
7
n
(b) : x[n] = cos( − π)
8
π 2
(c) : x[n] = cos( n )
8
π π
(d) : x[n] = cos( n) cos( n)
2 4
π π π π
(e) : x[n] = 2 cos( n) + sin( n) − 2 cos( n + )
4 8 2 6
Suppose (a) is periodic and the fundamental period is N , so

6π
N = m2π
7
we have

14
N =m
3
Hence, signal (a) is periodic and the fundamental period is 14 (when m = 3).

Suppose signal (b) is periodic and the fundamental period is N , so

N
= m2π
8
we have,

N = 16mπ
So there is no interger m such that N is integer. So the signal is not periodic.

Suppose signal (c) is periodic and the fundamental period is N , we have

π π
x[n + N] = cos( (n + N)2 ) = cos( (n2 + 2nN + N 2 ))
8 8
and x[n] = x[n + N], Then
π
(2nN + N 2 ) = m2π
8
which means that no matter what n is the equation must have interger m and N . When
N = 8 we have m as integer.

π π
 π π
Both cos( 2 n) and cos( 4 n) are periodic with fundamental period 4 and 8 respectively. So
the least common multiple of 4, 8 will be the fundamental period of signal (d). i.e. 8

Problem 1.26e

π π π π
Signal (e) consists of three parts cos( 4 n) , sin( 8 n) and cos( 2 n + 6 ) , with fundamental
period 8, 16, 4 respectively. So the fundamental period is 16.
7 Problem 1.27

In this chapter, we introduced a number of general properities of systems. In

particular, a system may or may not be

1. Memoryless
2. Time invariant
3. Linear
4. Causal
5. Stable

Determine which of these properities hold and which do not hold for each of
the following continuous-time systems. Justify your answers. In each
example, y(t) denotes the system output and x(t) is the system input.

(a)y(t) = x(t − 1) + x(2 − t)

(b)y(t) = [cos(3t)]x(t)
2t
(c)y(t) = ∫ x(τ)dτ
−∞
0, t<0
(d)y(t) = {
x(t) + x(t − 2), t≥0
0, x(t) < 0
(e)y(t) = {
x(t) + x(t − 2), x(t) ≥ 0
(f )y(t) = x(t/3)
dx(t)
(g)y(t) =
dt

Memoryless : A system is memoryless if its output for each value of the independent
variable at a give time is dependent on the input at only that same time.

Time invariant
invariant: A system is time invariant if the behavior and characteristics of the
system are fixed over time. Time invariance can be justified very simply. A system is time
invariant if a time shift in the input signal results in an identical time shift in the output
signal.

Linear
Linear: A system is linear if it possesses the property of superposition: if an input consists
of the weighted sum of several signals, then the output is the superposition.

Causality
Causality: A system is causal if the output at any time depends on values of the input at
only the present and past time.

Stability
Stability: A system is stable if small inputs lead to response that do not diverge.

Problem 1.27a

1. y(0) = x(−1) + x(2) , system (a) has memory;

2. If we delay the input by t0 , then we have the output x(t − 1 − t0 ) + x(2 − t − t0 ); if
we delay the output by t0 , then we have the output
y(t − t0 ) = x(t − t0 − 1) + x(2 − (t − t0 )); system (a) is time variant.
2 2
(a)
 3. System (a) is not linear due to the counterexample x(t) = t2 . If x(t) = t2 ,
y(t) = t2 − 6t + 5 which is obviously not linear.
4. Because y(0) = x(−1) + x(2), system (a) is not causal.
5. If |x(t)| < B , then |y(t)| < 2B. System (a) is stable.

Problem 1.27b

1. The system is memoryless because the output only related with the current input.
2. The system is time variant because the system has a time-varying gain with the input.
3. The system is linear.
4. The system is causal because the system is memoryless.
5. The system is stable. If |x(t)| < B, then |y(t)| < B.

Problem 1.27c

1. The system has memory because of the integration.

2. The system is time variant. Let x1 (t) be an arbitary signal, and y1 (t) the output. If we
delay the input by t0 to get x2 (t) = x1 (t − t0 ), then the output should be:
2t
y2 (t) = ∫ x2 (τ)dτ
−∞
2t
=∫ x 1 (τ − t0 )dτ
−∞
2t+t0
=∫ x1 (τ )dτ
−∞

However, when we delay the y1 (t) by t0 , we get

2(t−t0 )
y1 (t − t0 ) = ∫ x1 (τ)dτ
−∞
≠ y2 (t)

3. The system is linear because of integration.

4. The system is not causal because y(t) is related with x(2t).

5. The system is not stable because of the existence of −∞.

Problem 1.27d

1. The system has memory. because y(4) = x(4) + x(2)

2. The system is time variant. because when t < 0 the output is 0. If we shift the time to
make t ≥ 0, then the output y(t) is x(t) + x(t − 2) which is possible not 0. i.e. a time
shift in the input signal does not result in an identical time shift in the output signal.
3. The system is linear.
4. The system is causal because the current output only related with current or past
input.
5. The system is stable.

Problem 1.27e

1. The system has memory.

2. The system is time invariant. because a time shift in the input signal will definitely
result an identical shift in the output. Notice carefully that the system is defined only

(d)
 relating with x(t) instead of t as in system (d).
3. The system is linear.
4. The system is causal because the output only relate with the current and the past
input.
5. The system is stable.

Problem 1.27f

1. The system has memory.

2. The system is time variant.
3. The system is linear.
4. The system is not causal, because y(−1) = x(− 13 ).
5. The system is stable.

Now, I justify the properity of time variant of system (f ). Let arbitary input x1 (t) and the
output y1 (t)= x1 ( 3t ). Let x2 (t) = x1 (t − t0 ), then y2 (t) = x2 ( 3t ) = x1 ( 3t − t0 ) which is
t−t
not equal with y1 (t − t0 ) = x( 3 0 ) .

Problem 1.27g

1. The system has memory by definition of di!enence.

2. The system is time invariant.
3. The system is linear
4. The system is causal.
5. The system is not stable. For some signal x(t) with certain t the signal is not
di!erentiable.

8 Problem 1.28

Determine which of the properties listed in Problem 1.27 hold and which do
not hold for each of the following discrete-time systems. Justify your
answers. In each example, y[n] denotes the system output and x[n] is the
system input.

(a)y[n] = x[−n]
(b)y[n] = x[n − 2] − 2x[n − 8]
(c)y[n] = nx[n]
(d)y[n] = Even{x[n − 1]}
⎧ x[n], n≥1
(e)y[n] = ⎨ 0,
⎩
n=0
x[n + 1], n ≤ −1
⎧ x[n], n ≥ 1
(f )y[n] = ⎨ 0,
⎩
n=0
x[n], n ≤ −1
(g)y[n] = x[4n + 1]

Memoryless : A system is memoryless if its output for each value of the independent
variable at a give time is dependent on the input at only that same time.
Time invariant
invariant: A system is time invariant if the behavior and characteristics of the
system are fixed over time. Time invariance can be justified very simply. A system is time
invariant if a time shift in the input signal results in an identical time shift in the output
signal.

Linear
Linear: A system is linear if it possesses the property of superposition: if an input consists
of the weighted sum of several signals, then the output is the superposition.

Causality
Causality: A system is causal if the output at any time depends on values of the input at
only the present and past time.

Stability
Stability: A system is stable if small inputs lead to response that do not diverge.

Problem 1.28a

1. The system has memory.

2. The system time variant.
3. The system is linear.
4. The system is not causal because y[−2] = x[2]
5. The system is stable.

Now, Let me justify the property of time variant. Let x1 [n] be an arbitary singal and hence
the output y1 [n]= x1 [−n]. Let x2 [n] = x1 [n − n0 ] and hence
y2 [n] = x2 [−n] = x1 [−n − n0 ] which is not equal with y1 [n − n0 ] = x1 [−(n − n0 )].
Hence, the time shift in the input signal does not result in the same time shift in the output
signal.

The process of justifing can be visualized as below:

As we can see y2 [n] ≠ y1 [n − 2] i.e. the time shift ( here 2) in input signal does not result in
the identical time shift in the result.

Problem 1.28b

1. The system has memory.

2. The system is time invariant.
3. The system is linear.
4. The system is causal.
5. The system is stable.

Problem 1.28c

1. The system is memoryless.

2. The system is time variant.
3. The system is linear.
4. The system is causal.
5. The system is not stable.

Problem 1.28d

1. The system has memory.

2. The system is time variant.
 3. The system is linear.
4. The system is not causal.
5. The system is stable.

Problem 1.28e

1. The system has memory.

2. The system is time variant
3. The system is linear.
4. The system is not causal.
5. The system is stable.

Problem 1.28f

1. The system has no memory.

2. The system is time variant.
3. The system is linear.
4. The system is causal.
5. The system is stable.

Problem 1.28g

1. The system has memory.

2. The system is time variant.
3. The system is linear.
4. The system is not causal.
5. The system is stable.

9 Problem 1.29

1. Show that the discrete-time system whose input x[n] and output y[n]
are related by y[n] = Re{x[n]} is additive. Does this system remain
additive if its input-output relationship is changed to
y[n] = Re{eiπn/4 x[n]}? (Do not assume that x[n] is real in this
problem.)
2. In the text, we discussed the fact that the property of linearity for a
system is equivalent to the system possessing both the additive property
and homogeneity property. Determine whether each of the systems
defined below is additive and/or homogeneous. Justify your answers by
providing a proof for each property if it holds or a counterexample if it
does not.

1 dx(t) 2
(i) : y(t) = [ ]
x(t) dt
x[n]x[n−2]
(ii) : y[n] = { x[n−1] , x[n − 1] ≠ 0
0, x[n − 1] = 0

Problem 1.29a
Let x[n] = xr [n] + ixi [n] where xr [n] and xi [n] stand for the real part and imagary part of
x[n] respectively. Let x1 [n] = x1r [n] + ix1i [n] and x2 [n] = x2r [n] + ix2i [n], so
y1 [n] = Re{x1 [n]} = x1r [n] and y2 [n] = Re{x2 [n]} = x1r [n]. Let
x3 [n] = x1 [n] + x2 [n] = (x1r [n] + x2r [n]) + i(x1i [n] + x2i [n]). Then we have
y3 [n] = x1r [n] + x2r [n] = y1 [n] + y2 [n]. So the the relationship y[n] = Re{x[n]}
between x[n] and y[n] is additive.

Next Let’s check whether or not the additive property of y[n] = Re{eiπn/4 x[n]} holds.
First Let x[n] = xr [n] + ixi [n] like before. Then,

y[n] = Re{eiπn/4 x[n]}

= Re{(cos( πn
4
) + i sin( πn
4
))(xr [n] + ixi [n])}
πn πn
= cos( 4 )xr [n] − sin( 4 )xi [n]

The additive property holds in a straightforward way.

Problem 1.29b(i)

First let’s check whether the additive property holds or not. Suppose

1 dx1 (t) 2
y1 (t) = [ ]
x1 (t) dt
1 dx2 (t) 2
y2 (t) = [ ]
x2 (t) dt

and x3 (t) = x1 (t) + x2 (t), then,

1 dx3 (t) 2
y3 (t) = [ ]
x3 (t) dt
1 d(x1 (t) + x2 (t)) 2
= [ ]
x1 (t) + x2 (t) dt
≠ y1 (t) + y2 (t)

So the additive property does not holds.

Second, let’s check the property of homogeneity. Suppose x4 (t) = ax1 (t), then

1 dx4 (t) 2
y4 (t) = [ ]
x4 (t) dt
1 dax1 (t) 2
= [ ]
ax1 (t) dt
1 dx1 (t) 2
=a [ ]
x1 (t) dt
= ay1 (t)

So the homogeneity property holds.

Problem 1.29b(ii)

Let

[ ] [ −2]
 x1 [n]x1 [n−2]
y1 [n] = { x1 [n−1] , x1 [n − 1] ≠ 0
0, x1 [n − 1] = 0
x2 [n]x2 [n−2]
y2 [n] = { x2 [n−1]
, x2 [n − 1] ≠ 0
0, x2 [n − 1] = 0

and let x3 [n] = x1 [n] + x2 [n], we have

x3 [n]x3 [n−2]
y3 [n] = { x3 [n−1] , x3 [n − 1] ≠ 0
0, x3 [n − 1] = 0
(x1 [n]+x2 [n])(x1 [n−2]+x2 [n−2])
={ x1 [n−1]+x2 [n−1] , x1 [n − 1] + x2 [n − 1] ≠ 0
0, x1 [n − 1] + x2 [n − 1] = 0

We cannot reach the conclusion that y3 [n] = y1 [n] + y2 [n]. So the additive property does
not hold.

Second Let’s check whether the homogeneity property holds. Let x4 [n] = ax1 [n] , It’s easy
to check the system is homogeneous. i.e. y4 [n] = ay1 [n]

10 Problem 1.30

Determine if each of the following systems is invertible. If it is, construct the

inverse system. If it is not, find two input signals to the system that have the
same output.

(a)y(t) = x(t − 4)
(b)y(t) = cos[x(t)]
(c)y(t) = nx[n]
t
(d)y(t) = ∫ x(τ)dτ
−∞
⎧ x[n − 1], n ≥ 1
(e)y[n] = ⎨ 0,
⎩
n=0
x[n], n ≤ −1
(f )y[n] = x[n]x[n − 1]
(g)y[n] = x[1 − n]
t
(h)y(t) = ∫ e−(t−τ) x(τ)dτ
−∞
n
(i)y[n] = ∑ ( 12 )n−k x[k]
k=−∞
dx(t)
(j)y(t) =
dt
x[n + 1], n ≥ 0
(k)y[n] = {
x[n], n ≤ −1
(l)y(t) = x(2t)
(m)y[n] = x[2n]
x[n/2], n even
(n)y[n] = {
0, n odd
A system is invertible if distinct inputs lead to distinct outputs. There exists an inverse
system for an invertible system so that when cascaded with the original system, the output
will be equal to the input to the original system.

Problem 1.30a

For system (a), the output is the input delayed by 4, so the inverse system should be a
system that advance the input by 4, i.e.

y(t) = x(t + 4)

Problem 1.30b

For system (b), cos(t) is and periodic signal with fundamental period 2π which means
that di!erent inputs will lead to one same output. So the system may not be invertible.

Problem 1.30c

δ[n] and 2δ[n] lead to the same result. So the system is not invertible.

The integration is invertible and the inverse system is

dx(t)
y(t) =
dt
d(x(t)+t0 )
Notice that the di!erence is not invertible like system (j), because dt
will lead to the
same result no matter what value t0 will be.

Like system (a), this discrete-time system is invertible and the inverse system is

⎧ x[n + 1], n≥1

y[n] = ⎨ 0,
⎩
n=0
x[n], n ≤ −1

Problem 1.30f

This system is not invertible. Let x[n] = δ[n] and x[n] = δ[n − 1], we have the same
output.

Problem 1.30g

y[n] is obtained by first flipping x[n] the right shifting the flipped signal by one. So we have
the inverted system as y[n] = x[−n + 1]

Problem 1.30h

dx(t)
The system is invertible and the inverse system is y(t) = x(t) + dt

Problem 1.30i

The system is invertible. First let’s re-express the original system as:

n
y[n] = ∑ ( 12 )n−k x[k]
k=−∞
n−1
1
= ∑ ( )n−k x[k] + x[n]
2
k=−∞
1 −1 1 −1− 1
Then, we have x[n] = y[n] − 12 ∑n−1 1 n−1−k
k=−∞ ( 2 ) x[k] = y[n] − 12 y[n − 1] So the inverse
1 1
system is y[n] = x[n] − 2 x[n − 1] So the inverse system is y[n] = x[n] − 2 x[n − 1].

Problem 1.30j

The system is not invertible because x(t) and x(t) + x0 will result the same y(t). x0 is a
constant.

Problem 1.30k

The system is not invertible. δ[n] and 2δ[n] will result in same result.

Problem 1.30l

The system is invertible and the inverse system is y(t) = x( 12 t).

Problem 2.30m

The system is not invertible. Notice this system is di!erent with system (l) which is
continuous-time system. x[2n] is a downsampling of x[n]. So there are tons of signals as
x[n] which can be downsampling to get x[2n].

Problem 2.30n

The system is invertible and the system is y[n] = x[2n]

11 Problem 1.31

In this problem, we illustrate one of the most important consequences of the

properties of linearity and time invariance. Specifically, once we know the
response of a linear system or a linear time-invariant (LTI) system to a single
input or the response to several inputs, we can directly compute the response
to many other input signals. Much of the remainder of this book deals with a
thorough exploitation of this fact in order to develop results and techniques
for analyzing and synthesizing LTI systems.

1. Consider an LTI system whose response to the signal x1 (t) in the

following figure is the signal y1 (t). Determine and sketch carefully the
response of the system to the input x2 (t) .
2. Determine and sketch the response of the system considered in part (a)
to the input x3 (t).
Problem 1.31a

Notice that x2 (t) = x1 (t) − x1 (t − 2). Based on the properties of LTI system , we have
y2 (t) = y1 (t) − y1 (t − 2).

Notice that x3 (t) = x1 (t + 1) + x1 (t). So the output y3 (t) = y1 (t + 1) + y1 (t).

12 Reference

Bibliography
[oppenheim_signals_1997] Oppenheim, Signals and Systems, Prentice Hall (1997). ↩

SignalsAndSystems

MSC
Make STEAM Clear
I post articles and make videos about STEAM and try to explain the concepts in a more approachable
and beautiful way.

! ! ' ( & ) $ %

Related
Signals and Systems Chapter 1 Problems Part 1 (1.1-1.20)
Signals and Systems Chapter 1 Problems Part 3 (1.32-1.47)

NEXT
Signals and Systems Chapter 1 Problems Part 3 (1.32-1.47)

PREVIOUS
Signals and Systems Chapter 1 Problems Part 1 (1.1-1.20)

© MSC, 2019-2020, All rights reserved ·

$