576 Procesamiento de Señales

Tarea 2
TE3002.1 Procesamiento Digital de Señales

Curso Profesor:
576. Procesamiento Dr. Luis Jiménez Ángeles
de Señales

Profesor Dr. Luis Jiménez Ángeles

Tarea No: 2. 1er parcial

Correo electrónico luis.jimenez@ieee.org

Fecha de Entrega: 12 de Septiembre de 2013
(16:00 hrs)
Campus
Tarea 2 Ciudad de México
Alumno:
División de Ingeniería y
Arquitectura
Departamento de Ingeniería
RESOLVER LOS SIGUIENTES PROBLEMAS
Mecatrónica Calificación:

Nota: Entregar de forma impresa la solución a los siguientes problemas.

1.- Determine si las siguientes señales son periódicas. En caso afirmativo especifique su frecuencia
fundamental:

a) 𝑥𝑎 (𝑡) = 3cos⁡(5𝑡 + 𝜋/6)

b) 𝑥(𝑛) = 3cos⁡(5𝑛 + 𝜋/6)

𝑛
c) 𝑥(𝑛) = 2exp⁡[𝑗(6 − 𝜋)]

d) 𝑥(𝑛) = cos⁡(𝑛/8)cos⁡(𝑛𝜋/8)
𝜋𝑛 𝜋𝑛 𝜋𝑛 𝜋
e) 𝑥(𝑛) = cos ( 2 ) − 𝑠𝑒𝑛 ( 8 ) + 3𝑐𝑜𝑠 ( 4 + 3 )

2.- a) Demuestre que el periodo fundamental Np de las señales:⁡𝒔𝒌 (𝒏) = 𝒆𝒋𝟐𝝅𝒌𝒏/𝑵 para k= 0,1,2,… está
determinado por ⁡𝑵𝒑 = 𝑵/𝑴𝑪𝑫(𝒌, 𝑵), donde MCD es el máximo común divisor de k y N.

b) ¿Cuál es el periodo fundamental de este conjunto para N=7 y para N=16?

3.- Una sinusoide continua en el tiempo ⁡𝒙𝒂 (𝒕) con un periodo fundamental ⁡𝑻𝒑 = 𝟏/𝑭𝟎 se muestrea a
una frecuencia ⁡𝑭𝒔 = 𝟏/𝑻, con el fin de generar una señal sinusoidal discreta en el tiempo ⁡𝒙𝒏 =
𝒙𝒂 (𝒏𝑻).

a) Demuestre que x(n) es periódica si T/Tp = k/N.

b) Si 𝑥(𝑛) es periódica ¿Cuál es su periodo fundamental 𝑇𝑝 en segundos?

4.- Una señal analógica contiene frecuencias hasta de 10 kHz.

a) ¿Cuál es el rango de frecuencias de muestreo que permite la reconstrucción exacta de esta señal a
partir de sus muestras?

!1
 576 Procesamiento de Señales
Tarea 2

b) Suponga que muestreamos esta señal a una Fs = 8kHz. Examine lo que ocurre con la frecuencia F1 =
5kHz.

c) Repita (b) para una frecuencia F2=9 kHz.

Problems 55

5.- Una señal biológica de ECG contiene frecuencias útiles de hasta 100 Hz.
1. Modify the evenodd function discussed in the text so that it accepts an arbitrary
a) ¿Cuál es la frecuencia de Nyquist de esta señal?
sequence and decomposes it into its conjugate-symmetric and conjugate-antisymmetric
components
b) Suponga by implementing
se muestrea esta señal a 250(2.27).
muestras/s. ¿Cuál es la frecuencia más alta que puede
2. Decompose the following
representarse en forma unívoca para sequence:
esta tasa de muestreo?
x(n) = 10 exp([−0.1 + ȷ0.2π]n), 0 ≤ n ≤ 10

6.- Una señal

into its analógica 𝒙𝒂 (𝒕) = 𝒔𝒆𝒏(𝟒𝟖𝟎𝝅𝒕)
conjugate-symmetric + 𝟑𝒔𝒆𝒏(𝟕𝟐𝟎𝝅𝒕) se muestrea
and conjugate-antisymmetric 600 vecesPlot
components. por segundo.
their real
and imaginary parts to verify the decomposition. (Use the subplot function.)
a) Determine la frecuencia de muestreo de 𝑥𝑎 (𝑡)
P2.8 The operation of signal dilation (or decimation or down-sampling) is defined by
b) Determine la frecuencia de solapamiento.
y(n) = x(nM )
c) ¿Cuáles son las frecuencias, en radianes, de la señal discreta en el tiempo resultante de x(n)?
in which the sequence x(n) is down-sampled by an integer factor M . For example, if
d) Si 𝑥(𝑛) se pasa a través de un convertidor ideal D/A, ¿Cómo es la señal reconstruída 𝑦𝑎 (𝑡)?
x(n) = {. . . , −2, 4, 3, −6, 5, −1, 8, . . .}
↑

7.- Grafique las siguientes secuencias:

then the down-sampled sequences by a factor 2 are given by

y(n) = {. . . , −2, 3, 5, 8, . . .}
↑

1. Develop a MATLAB function dnsample that has the form

function [y,m] = dnsample(x,n,M)

8.- Para x(n)= [1, -2, 4, sequence
% Downsample 6, -5, 8 y 10], con n=[-4
x(n) by a afactor
2], grafique
M tolasobtain
siguientes señales:
y(m)

to implement the above operation. Use the indexing mechanism of MATLAB with
careful attention to the origin of the time axis n = 0.
2. Generate x(n) = sin(0.125πn), − 50 ≤ n ≤ 50. Decimate x(n) by a factor of 4 to
generate y(n). Plot both x(n) and y(n) using subplot and comment on the results.
3. Repeat the above using x(n) = sin(0.5πn), − 50 ≤ n ≤ 50. Qualitatively discuss the
effect of down-sampling on signals.
P2.9 Using the conv_m function, determine the autocorrelation sequence rxx (ℓ) and the
crosscorrelation sequence rxy (ℓ) for the following sequences.

x(n) = (0.9)n , 0 ≤ n ≤ 20; y(n) = (0.8)−n , − 20 ≤ n ≤ 0

Describe your observations of these results.

P2.10 In a certain concert hall, echoes of the original audio signal x(n) are generated due to the
reflections at the walls and ceiling. The audio signal experienced by the listener y(n) is a
combination of x(n) and its echoes. Let

y(n) = x(n) + αx(n − k)

where k is the amount of delay in samples and α is its relative strength. We want to
estimate the delay using the correlation analysis.

!2
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
 generate y(n). Plot both x(n) and y(n) using subplot and comment on the results.
where3.round[·] denotes
Repeat the aboverounding
using x(n)to=the nearest integer.
sin(0.5πn), − 50 ≤ n ≤ 50. Qualitatively discuss the
effect oftodown-sampling
1. Use (2.10) on signals. whether these systems are linear.
determine analytically
2. Let
P2.9 x1 (n)
Using thebe a uniformly
conv_m function,distributed
determine therandom sequence sequence
autocorrelation between r[0, 576 Procesamiento
1] over
xx (ℓ) and the de Señales
0 ≤ n ≤ 100,
and let x2 (n) be sequence
crosscorrelation a Gaussian random
rxy (ℓ) for thesequence
following with mean 0 and variance 10 over
sequences. Tarea 2
0 ≤ n ≤ 100. Using these nsequences, verify the linearity −n of these systems. Choose any
x(n) = (0.9) , 0 ≤ n ≤ 20; y(n) = (0.8) , − 20 ≤ n ≤ 0
values for constants a1 and a2 in (2.10). You should use several realizations of the above
sequences
Describe toyourarrive at your ofanswers.
observations these results.

P2.12P2.10 In a certain
Consider concert hall,systems
the discrete-time echoes ofgiven
the original audio P2.11.
in Problem signal x(n) are generated due to the
reflections at the walls and ceiling. The audio signal experienced by the listener y(n) is a
1. Use (2.12) to determine
combination of x(n) and analytically whether these systems are time-invariant.
its echoes. Let
562. Let x(n) be a Gaussian random sequence with2 mean
Chapter 0 and variance
DISCRETE-TIME 10 over
SIGNALS ≤ n ≤ 100.
AND0SYSTEMS
Using this sequence, verify the time y(n)invariance
= x(n) + αx(n − k)
of the above systems. Choose any values
forwhere
sample
k isshift k in (2.12).
the amount You
of delay in should
samplesuse
andseveral
α is its realizations of the
relative strength. Weabove
want sequence
to to
arrive
1. at
estimateyour
Determine answers.
analytically
the delay using thethecorrelation
crosscorrelation ryx (ℓ) in terms of the autocorrelation rxx (ℓ).
analysis.
2. Let
P2.13 For the x(n) =given
systems cos(0.2πn) + 0.5 cos(0.6πn),
in Problem α = 0.1, and
P2.11, determine k = 50. Generate
analytically 200 samples
their stability of
and causality.
y(n) and determine its crosscorrelation. Can you obtain α and k by observing ryx (ℓ)?
P2.14 The linear convolution defined in (2.14) has several properties:
P2.11 Consider the following discrete-time systems:
x1 (n) ∗ x2 (n) = x1 (n) ∗ x2 (n) : Commutation
T [x(n)] = x(n)u(n)
1 Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some
Copyright 2010 Cengage Learning. All Rights T [x(n)] = x(n) + n x(n + 1)
2 third party content may be suppressed from the eBook and/or eChapter(s).
[x (n) ∗ x (n)] ∗ x (n)
Editorial review has deemed that any suppressed
1
= x (n) 1∗ [x (n) ∗ x (n)]
1 content does2not materially affect
3 the overall learning : Association
!n+5
1 experience. Cengage
2 Learning3reserves the right to remove additional content at any time if subsequent rights restrictions require it.
T3 [x(n)] = x(n) + x(n − 2) − x(n − 3)x(2n) T4 [x(n)] = k=−∞ 2x(k) (2.28)
2 3
x1 (n) ∗ [x2 (n) + x3 (n)] = x1 (n) ∗ x2 (n) + x1 (n) ∗ x3 (n) : Distribution
T5 [x(n)] = x(2n) T6 [x(n)] = round[x(n)]
x(n) ∗ δ(n − n0 ) = x(n − n0 ) : Identity
where round[·] denotes rounding to the nearest integer.
1. Analytically prove these properties.
1. Use (2.10) to determine analytically whether these systems are linear.
2. Using the
2. Let following
x1 (n) three sequences,
be a uniformly distributedverify
randomthesequence
above properties.
between [0, 1] over 0 ≤ n ≤ 100,
and let x2 (n) be a Gaussian random sequence with mean 0 and variance 10 over
x (n) = cos(πn/4)[u(n + 5) − u(n − 25)]
0 ≤ n 1≤ 100. Using these sequences, verify the linearity of these systems. Choose any
x2for
values = (0.9)−n
(n)constants and a−2 u(n
a1[u(n) − 20)]You should use several realizations of the above
in (2.10).
sequences to arrive at your answers.
x3 (n) = round[5w(n)], −10 ≤ n ≤ 10; where w(n) is uniform over [−1, 1]
P2.12 Consider
Use the m
the conv discrete-time
function. systems given in Problem P2.11.
1. Use analytically
P2.15 Determine (2.12) to determine analyticallyy(n)
the convolution whether these
= x(n) systems
∗ h(n) are time-invariant.
of the following sequences, and
Problems 2. Let x(n) be a Gaussian random sequence with mean 0 and variance 10 over 0 ≤ n ≤ 100. 57
verify your answers using the conv_m function.
Using this sequence, verify the time invariance of the above systems. Choose any values
1. x(n)for sample
= {2, −4, shift k in −2,
5, 3, −1, (2.12).
6}, You
h(n)should
= {1,use
−1several
, 1, −1,realizations
1} of the above sequence to
arrive at your ↑answers. ↑
2. x(n) = {1, 1, 0, 1, 1}, h(n) = {1, −2, −3, 4}
P2.13 For the systems given in Problem P2.11, determine analytically their stability and causality.
↑ ↑
P2.14 The linear convolution
−n defined in (2.14) has several properties:
3. x(n) = (1/4) [u(n + 1) − u(n − 4)], h(n) = u(n) − u(n − 5)
4. x(n) = n/4[u(n)x1− ∗ x2 −
(n)u(n (n)6)], (n) ∗ x=
= x1h(n) 2[u(n + 2) − u(n
2 (n) − 3)]
: Commutation
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
[x (n) ∗ x (n)] ∗ x (n) = x (n) ∗ [x (n) ∗ x (n)]
n 2 affect the overall
1 not materially 3 learning experience.
1 : Association
n2 Learning 3reserves the right to remove additional content at any time if subsequent rights restrictions require it.
P2.16 Let x(n) = (0.8) u(n), h(n) = (−0.9) u(n), and y(n) = h(n) ∗ x(n). Use (2.28)
Editorial review has deemed that any suppressed content does Cengage
3 columns and 1
x (n) ∗ [x (n) + x (n)] = x
row of subplots for the following parts.
1 2 3 1 (n) ∗ x2 (n) + x1 (n) ∗ x3 (n) : Distribution
x(n) ∗ δ(n − n0 ) = x(n − n0 ) : Identity
1. Determine y(n) analytically. Plot first 51 samples of y(n) using the stem function.
1. Analytically
2. Truncate x(n) prove
and these
h(n)properties.
to 26 samples. Use conv function to compute y(n). Plot y(n)
2. Using the following three sequences, verify the above properties.
using the stem function. Compare your results with those of part 1.
3. Using the filter function, determine
x1 (n) = cos(πn/4)[u(n 25)]first 51 samples of x(n) ∗ h(n). Plot y(n) using
+ 5) − u(n −the
−n
the stem function. Compare
x2 (n) = (0.9) [u(n) −your
u(n −results
20)] with those of parts 1 and 2.
x3 (n) = round[5w(n)], −10 ≤ n ≤ 10; where w(n) is uniform over [−1, 1]
P2.17 When the sequences x(n) and h(n) are of finite duration Nx and Nh , respectively, then
Use the
their linear conv m function.
convolution (2.13) can also be implemented using matrix-vector multiplication.
If elements
P2.15 of analytically
Determine y(n) and thex(n) are arranged
convolution in column
y(n) = x(n) ∗ h(n) of vectors x and
the following y respectively,
sequences, and then from
(2.13)verify
we your answers using the conv_m function.
obtain
1. x(n) = {2, −4, 5, 3, −1, −2, 6}, h(n) = {1, −1, 1, −1, 1}
↑ ↑
y = Hx

where linear shifts in h(n − k) for n = 0, . . . , Nh − 1 are arranged as rows in the matrix H.
This matrix has an interesting structure and is called a Toeplitz matrix. To investigate this
matrix,
Copyright 2010 Cengage consider
Learning. All the
Rights Reserved. May sequences
not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.

x(n) = {1, 2, 3, 4, 5} and h(n) = {6, 7, 8, 9}

↑ ↑

!3
1. Determine the linear convolution y(n) = h(n) ∗ x(n).
2. Express x(n) as a 5 × 1 column vector x and y(n) as a 8 × 1 column vector y. Now
determine the 8 × 5 matrix H so that y = Hx.
576 Procesamiento de Señales
Tarea 2

!4