Professional Documents
Culture Documents
EXTENSIN LATACUNGA
Bautista Reinoso Gabriela Alexandra.
Ingeniera Electrnica e Instrumentacin, Quinto, Universidad de las Fuerzas Armadas ESPE
Latacunga, Mrquez de Maenza S/N Latacunga, Ecuador.
email : Gaby.alexa@hotmail.es
Fecha de presentacin: Latacunga, jueves 24 de abril del 2014
ABSTRACT
In the analysis of discrete systems is vital to know all kinds of applications and procedures that can
be performed with the same. This type of system to be a function that depends on a whole
independent variable deserves special in each of its properties study. Being one of the convolution
operations. Where discrete convolution idea is the same as the continuous convolution.
Remembering that convolution is a powerful instrument in determining the outcome of a system
after learning of an arbitrary input and the impulse response of the instrument system.
DESARROLLO
1.
CONVOLUCIN
3.
12.
EJERCICIO:
x [n]
14. x [ n ]=a u [ n ]
4. Figura 1.Convolucin
5.
CONVOLUCIN LINEAL DE
SISTEMAS DISCRETOS
15. h [ n ] =u [n ]
16.Donde
0<a <1
17.
7.
y [ n ] = x [ k ] h [ nk ]
k=
8. Ecuacin 1. Ecuacin de la
convolucin lineal
18. Figura 2.
19.
h [ k ] =u [k ]
20. Figura 3.
x [ k ] =h[k ]
29.
21.
30. Figura 8.
x [ k ] =a u[k ]
31. Donde.
32.
22. Figura 4.
x [ k ] =h[1k ]
x [ k ] h [ nk ] =
23.
ak , 0 k n
0, otros valores de n
33.
Entonces, para n 0
34.
y [ n ] = a k
k=0
35.
24. Figura 5.
x [ k ] =h[ 1k ]
25.
36. Figura 9.
y [n]
x [ k ] =h[nk ]
38. Dada la secuencia peridica
27.
f [n ]
de cardinalidad N a convolucionar
con
otra
secuencia
peridica
g[ n]
tambin de cardinalidad N,
N N
28. Figura 7.
x [ k ] =h[nk ]
de sumas.
39. Empleando una operacin conocida
como FFT (Transformada Rpida de
Fourier) para calcular la convolucion,
N log 2 N
46.
f =[ f [ 0 ] , f [ 1 ] , f [2]]
47.
g=[g [ 0 ] , g [ 1 ] , g [2]]
51.
f [n ]
secuencia
de longitud N y dada la
g[n]
tambin
de
f g [ n ] =f [ n ]g[n]
matemticamente, la convolucion
circular se define como:
N1
43.
f g [ n ] = f ( m ) g ( ( mn ) )
44.
m=0
la
del
f g [ 0 ] =f [ 0 ] g [ 0 ] + f [ 1 ] g [ 1 ] +f [2] g [2]
52.
f g [ 1 ] =f [ 0 ] g [ 1 ] +f [ 1 ] g [ 0 ] +f [2] g[1]
53.
f g [ 2 ] =f [ 0 ] g [ 2 ] +f [ 1 ] g [ 1 ] + f [2] g[0]
54. Adonde algunos de los ndices en las
frmulas
de
convolucin
son
negativos. Se puede aprovechar la
periodicidad de las series de tal
forma que:
55.
g [1 ] =g [ 1 ]
56.
g [2 ] =g [ 2 ]
57.
g [3 ] =g [ 3 ]
58.
59. Figura 11. Proceso de convolucin para as secuencias f=[f[0],f[1],f[2]] y
g=[g[0],g[1],g[2]
60.
65.
61. EJERCICIO:
62. Convolucione las secuencia
peridicas f =[2,5,0,4 ] y
f g [ 2 ] =f [ 0 ] g [ 2 ] +f [ 1 ] g [ 1 ] + f [ 2 ] g [ 0 ] +f [ 3 ] g [ 3 ] =11
66.
f g [ 3 ] =f [ 0 ] g [ 3 ] + f [ 1 ] g [ 2 ] + f [ 2 ] g [ 1 ] +f [ 3 ] g [ 0 ]=31
67.
63.
f g [ 0 ] =f [ 0 ] g [ 0 ] + f [ 1 ] g [ 3 ] + f [ 2 ] g [ 2 ] + f [ 3 ] g [ 1 68.
] =12
64.
69.
f g [ 1 ] =f [ 0 ] g [ 1 ] +f [ 1 ] g [ 0 ] +f [ 2 ] g [ 3 ] +f [ 3 ] g [ 2 ] =34
70.
71.
72.
73.
74.
CONCLUSIONES
La convolucion de sistemas discretos y continuos tienen el mismo concepto ya que ambos nos
75.
%202/additional/web/ESP/conv_TD/index.html
Recuperado el 23 de abril del 2014
de:http://www.uru.edu/fondoeditorial/libros/pdf/moron/SISTEMAS-CAP%202.pdf
Recuperado el 23 de abril del 2014 de: http://cnx.org/content/m12833/latest/
Recuperado el 23 de abril del 2014 de:
http://www.itescam.edu.mx/principal/sylabus/fpdb/recursos/r92006.PDF
76.
77.