1.4 序列的运算生物信息技术.pdf

1.yn[ ] xn[ n ] Delay 0 2.yn[ ] x[n] Time Reversal 3.yn[ ] a xn[ ] Scalar Addition 4.yn[ ] xn[ ]wn[ ] Vector Addition 5.yn[ ] axn[ ] Scalar Multiplication 6.yn[ ] x[n]w[n] Vector Multiplication Echo yn[ ] xn[ ]a xn[ n ] 0 a=1: 延迟10ms，无效果 延迟10~50ms ，更响，更丰满 延迟50ms，回声效果 a1: 延迟10ms，回声效果 n0 延迟时间*采样率 Convolution   yn[ ] xn[ ]hn[ ]  xkhn[ ] [ k ]  xn[ khk] [ ] k k Characteristics: (1)xn[ ]*hn[ ] hn[ ]* xn[ ] (2)xn[ ]*(h [n]h [n]) xn[ ]*h [n] xn[ ]*h [n] 1 2 1 2 (3)(xn[ ]*h [n])*h [n] xn[ ]*(h [n]*h [n]) 1 2 1 2  (4)xn[ ]*[n]  xk[ ][nk] xn[ ], xn[ ]*[nn ] xn[ n ]同一律 0 0 k (5)if xn[ ] 0,for N nN ,length L 0 1 1 证明自己练习 hn[ ] 0,for N n N ,length L 2 3 2 then, yn[ ] 0,for N N nN N ,length L L 1 0 2 1 3 1 2   yn[ ] xn[ ]hn[ ]  xkhn[ ] [ k ]  xn[ khk] [