Академический Документы
Профессиональный Документы
Культура Документы
Definicion
Cuando se trata de hacer un procesamiento digital de seal no tiene
sentido hablar de convoluciones aplicando esctrictamente la definicin
ya que solo disponemos de valores en instantes discretos de tiempo .
Es necesario , pues , una aproximacin numrica.Para realizar la
convolucion entre dos seales , se evaluara el rea de la funcin
x ( ) h (t) .Para ello , disponemos de muestreos de ambas seales en
x [ k ] y h [nk ]
( donde k y
n son enteros ).
El rea es, por tanto ,
y [ n ]=
k =
t . x [ k ] h [ nk ]=t s .
k=
x [ k ] h [ nk ]
y [ n ] =x [ n ]h [ n ] = x [ k ] h [ nk ]
k=
t =1 :
en
n=n0 +n1 .
Para dos secuencias de duracin M y N , su convolucion se
extiende durante M + N -1 muestreos.
Propiedades de la convolucion discreta
y [ n ] = x [ k ] h [ nk ]
k=
[ n ]h [ n ] =h[n]
[ A x1 + B x2 ]h= y1 + y 2
h [ n ] = [ n ]h [ n ] = {u [ n ]u [ n1 ] }h [ n ] = y u [ n ] y u [n-1]
(x [ n ]h [ n ] = y [ n ] )
x [ n ]h [ n ] =x [ n ]h [ n ] = y [n ]
u [ n ]x [ n ] = x [k ]
k=
x [ n ]h [ n ] = y [ n ]
{ x [ n ] x [ n1 ] }h [ n ] = y [ n ] y [n1]
Metodo de la tira deslizante (sliding strip Method )
h [ n ] ={2,5,0,4 }
sea
x [ n ]= { 4,1,3 }
t s=
1
2
x [ n ] = {3,1,4 } .
t=t x
t=0
t=2 t s
h
2504
2504
2504
x
314
314
008000
022000
suma=8
suma=22
314
6500
suma=11
1
y s { 0 }=8. =4
2
1
y s [ 2 ] =11. =5.5
2
1
y s [ 1 ] =22. =11
2
t=3 t s
t=4 t s
t=5 t s
2504
2504
2504
x
314
314
015 0 16
00040
314
0001200
suma =31
suma=12
1
y s [ 3 ] =31. =15.5
2
La convolucion discreta
suma=4
1
y s [ 4 ] =4. =2
2
y [ n ] es { 8,22,11,31,4,12 } .
1
y s [ 5 ] =12. =6
2
La convolucion
numrica es
{4,11,5.5,15.5,2,6} .
n 0 1 2 3 4 5
h 2 5 0 4
x 4 1 3
y [ n ] ={ 8,22,11,31,4,12 } , n=0,1,2, .,5
8 20 0 16
2 5 0 4
6 15 0 12
y
8 22 11 31 4 12
R xy [ n ]=
x [ k ] y [k n]
para n=0, 1, 2, 3, .
k=
R XY [ n ] =
y [ k ] x [kn ]
para n=0, 1, 2, 3, ..
K=
y =conv ( x , h )
hace la convolucion de los vectores x y h . El vector resultante y
tiene un tamao
problema 1
1
x [ n ]= [ n ] + 2 [ n1]
2
y [ n ] =x [ n ] h [ n ] = x [ k ] h [nk ]
k=
h [ n ] =u [ n ] u [n3]
n<0, y [ n ] =0
n=0, y [ 0 ] =
x [ k ] h [ 0k ] =x [ 0 ] h[0]=
k =
1
2
5
2
5
2
n>3, y [ n ] =0
Problema 2
x [ n ]= n u [ n ] ,
y [ n ] =x [ n ] h [ n ] = x [ k ] h [nk ]
k=
h [ n ] = n u [ n ] , 0< , <1
k=
k u [ k ] nk = k nk u [nk ]
k =0
1
2
n<0, y [ n ] =0 , n 0 , y [ n ] =
k=0
y [n ]=
n +1 n+1
u[n]
Problema 3
x [ n ]=2n u [n]
y [ n ] =x [ n ]h [ n ] = x [ k ] h [nk ]
k=
h [ n ] =u [n ]
nk
n+ 1
n+1
n<0, y [ n ] = 2 k =2n+1
k=
n 0, y [ n ] =
2 =2
k=
Problema 4
n
x [ n ]= 1 ,0 n 4 , h [ n ] = ,0 n 6
0, resto
0, resto
y [ n ] =x [ n ]h [ n ] = x [ k ] h [nk ]
k=
n<0 , y [ n ] =0
n
0 n 4 , nk =
k=0
1 n+1
1
4
nk
k=0
n 4 n+1
=
1
{ n6>0 , n6 4 ,= 6< n 10 , y [ n ]=
k=n6
n6>4= n>10 , y [ n ] =0
nk =
n 4 7
1
Problema 5
x [ n ]= 1 ,0 n 5 , h [ n ] = 1 ,2 n 7 , 11 n 16
0, resto
0, resto
n<2 , y [ n ] =0
n
2 n 7 , y [ n ]= 1=n1
k=2
8 n 10 , y [ n ] =
k=n5
11 n 12 , y [ n ] =3
1=13n
13 n 16 , y [ n ]= 1=n10
k=11
13 n 16 , y [ n ]= 1=n10
k=11
16
17 n 21 , y [ n ] =
k=n5
n 22 , y [ n ] =0
1=22n