当前位置:网站首页>[digital signal processing] linear time invariant system LTI (judge whether a system is a "non time varying" system | case 1 | transform before shift | shift before transform)

[digital signal processing] linear time invariant system LTI (judge whether a system is a "non time varying" system | case 1 | transform before shift | shift before transform)

2022-06-23 14:09:00 Hanshuliang





One 、 Judge whether the system is " Non time varying "




1、 Case a


y ( n ) = x ( − n ) y(n) = x(-n) y(n)=x(n) Whether it is " Time does not change " Of ;

x ( n ) x(n) x(n) It's the input sequence , x ( − n ) x(-n) x(n) Is the output sequence ;


① Time invariant system


Time invariant system ( time-invariant ) : System features , Does not change with time ;

y ( n − m ) = T [ x ( n − m ) ] y(n - m) = T[x(n-m)] y(nm)=T[x(nm)]

After input delay , The output is also delayed ;


And " Time does not change " The system corresponds to " time varying " System ;


② First transform and then shift


take " Output sequence " Shift , First " Transformation " after " displacement " ;

First the " Input sequence " Conduct " Transformation " operation , obtain " Output sequence " , Then on Output sequence Conduct " displacement " operation ;

among " Transformation " refer to , Discrete time systems , take " Input sequence " Transformation by " Output sequence " , Input sequence To Output sequence Operation between , yes " Transformation " ;

Change operation : First the Input sequence x ( n ) x(n) x(n) Conduct Transformation operation , obtain Output sequence x ( − n ) x(-n) x(n) ,

Shift operation : then Yes x ( − n ) x(-n) x(n) Output sequence Shift n − n 0 n - n_0 nn0 obtain x ( − ( n − n 0 ) ) = x ( − n + n 0 ) x(-(n-n_0)) = x(-n + n_0) x((nn0))=x(n+n0) ,

The complete operation process is as follows :

y ( n − n 0 ) = x [ − ( n − n 0 ) ] = x ( − n + n 0 ) y(n - n_0) = x[-(n-n_0)] = x(-n + n_0) y(nn0)=x[(nn0)]=x(n+n0)


③ Shift first and then transform


yes Shift first , take " Input sequence " to " displacement " operation , obtain new " Input sequence " by x ( n − n 0 ) x(n-n_0) x(nn0) , then The new input sequence is " Transformation " operation , obtain " Output sequence " ;

The transformation process is y ( n ) = x ( − n ) y(n) = x(-n) y(n)=x(n) , Transformation time , Just to n n n Negative value ;

x ( n − n 0 ) x(n-n_0) x(nn0) Transformation time , Only will n n n Take the negative , n 0 n_0 n0 unchanged , The transformation result is as follows x ( − n − n 0 ) x(-n - n_0) x(nn0) ;


The whole process is as follows :

T ( x ( n − n 0 ) ) = x ( − n − n 0 ) T(x(n-n_0)) = x(-n - n_0) T(x(nn0))=x(nn0)


④ Conclusion


First " Transformation " after " displacement " , The result is x ( − n + n 0 ) x(-n + n_0) x(n+n0) ,

First " displacement " after " Transformation " , The result is x ( − n − n 0 ) x(-n - n_0) x(nn0) ,

The system is " Time varying system " ;

原网站

版权声明
本文为[Hanshuliang]所创,转载请带上原文链接,感谢
https://yzsam.com/2022/02/202202211726425891.html