Linear time-invariant system








Linear time-invariant theory, commonly known as LTI system theory, comes from applied mathematics and has direct applications in NMR spectroscopy, seismology, circuits, signal processing, control theory, and other technical areas. It investigates the response of a linear and time-invariant system to an arbitrary input signal. Trajectories of these systems are commonly measured and tracked as they move through time (e.g., an acoustic waveform), but in applications like image processing and field theory, the LTI systems also have trajectories in spatial dimensions. Thus, these systems are also called linear translation-invariant to give the theory the most general reach. In the case of generic discrete-time (i.e., sampled) systems, linear shift-invariant is the corresponding term. A good example of LTI systems are electrical circuits that can be made up of resistors, capacitors, and inductors.[1]




Contents






  • 1 Overview


  • 2 Continuous-time systems


    • 2.1 Impulse response and convolution


    • 2.2 Exponentials as eigenfunctions


      • 2.2.1 Direct proof




    • 2.3 Fourier and Laplace transforms


    • 2.4 Examples


    • 2.5 Important system properties


      • 2.5.1 Causality


      • 2.5.2 Stability






  • 3 Discrete-time systems


    • 3.1 Discrete-time systems from continuous-time systems


    • 3.2 Impulse response and convolution


    • 3.3 Exponentials as eigenfunctions


    • 3.4 Z and discrete-time Fourier transforms


    • 3.5 Examples


    • 3.6 Important system properties


      • 3.6.1 Causality


      • 3.6.2 Stability






  • 4 Notes


  • 5 See also


  • 6 References


  • 7 Further reading


  • 8 External links





Overview


The defining properties of any LTI system are linearity and time invariance.



  • Linearity means that the relationship between the input and the output of the system is a linear map: If input x1(t){displaystyle x_{1}(t),}x_{1}(t), produces response y1(t),{displaystyle y_{1}(t),,}y_{1}(t),, and input x2(t){displaystyle x_{2}(t),}x_{2}(t), produces response y2(t),{displaystyle y_{2}(t),,}y_{2}(t),, then the scaled and summed input a1x1(t)+a2x2(t){displaystyle a_{1}x_{1}(t)+a_{2}x_{2}(t),}a_{1}x_{1}(t)+a_{2}x_{2}(t), produces the scaled and summed response a1y1(t)+a2y2(t){displaystyle a_{1}y_{1}(t)+a_{2}y_{2}(t),}a_{1}y_{1}(t)+a_{2}y_{2}(t), where a1{displaystyle a_{1}}a_{1} and a2{displaystyle a_{2}}a_{2} are real scalars. It follows that this can be extended to an arbitrary number of terms, and so for real numbers c1,c2,…,ck{displaystyle c_{1},c_{2},ldots ,c_{k}}c_{1},c_{2},ldots ,c_{k},


Input   kckxk(t){displaystyle sum _{k}c_{k},x_{k}(t)}sum _{k}c_{k},x_{k}(t)   produces output   kckyk(t).{displaystyle sum _{k}c_{k},y_{k}(t).,}sum _{k}c_{k},y_{k}(t).,

In particular,








Input   (t)d⁡ω{displaystyle int _{-infty }^{infty }c_{omega },x_{omega }(t),operatorname {d} omega }int _{{-infty }}^{{infty }}c_{{omega }},x_{{omega }}(t),operatorname {d}omega   produces output   (t)d⁡ω{displaystyle int _{-infty }^{infty }c_{omega },y_{omega }(t),operatorname {d} omega ,}int _{{-infty }}^{{infty }}c_{{omega }},y_{{omega }}(t),operatorname {d}omega ,












 



 



 



 





(Eq.1)




where {displaystyle c_{omega }}c_{{omega }} and {displaystyle x_{omega }}x_{{omega }} are scalars and inputs that vary over a continuum indexed by ω{displaystyle omega }omega . Thus if an input function can be represented by a continuum of input functions, combined "linearly", as shown, then the corresponding output function can be represented by the corresponding continuum of output functions, scaled and summed in the same way.


  • Time invariance means that whether we apply an input to the system now or T seconds from now, the output will be identical except for a time delay of T seconds. That is, if the output due to input x(t){displaystyle x(t)}x(t) is y(t){displaystyle y(t)}y(t), then the output due to input x(t−T){displaystyle x(t-T)}x(t-T) is y(t−T){displaystyle y(t-T)}y(t-T). Hence, the system is time invariant because the output does not depend on the particular time the input is applied.

The fundamental result in LTI system theory is that any LTI system can be characterized entirely by a single function called the system's impulse response. The output of the system is simply the convolution of the input to the system with the system's impulse response. This method of analysis is often called the time domain point-of-view. The same result is true of discrete-time linear shift-invariant systems in which signals are discrete-time samples, and convolution is defined on sequences.




Relationship between the time domain and the frequency domain


Equivalently, any LTI system can be characterized in the frequency domain by the system's transfer function, which is the Laplace transform of the system's impulse response (or Z transform in the case of discrete-time systems). As a result of the properties of these transforms, the output of the system in the frequency domain is the product of the transfer function and the transform of the input. In other words, convolution in the time domain is equivalent to multiplication in the frequency domain.


For all LTI systems, the eigenfunctions, and the basis functions of the transforms, are complex exponentials. This is, if the input to a system is the complex waveform Asest{displaystyle A_{s}e^{st}}{displaystyle A_{s}e^{st}} for some complex amplitude As{displaystyle A_{s}}A_s and complex frequency s{displaystyle s}s, the output will be some complex constant times the input, say Bsest{displaystyle B_{s}e^{st}}{displaystyle B_{s}e^{st}} for some new complex amplitude Bs{displaystyle B_{s}}B_{s}. The ratio Bs/As{displaystyle B_{s}/A_{s}}{displaystyle B_{s}/A_{s}} is the transfer function at frequency s{displaystyle s}s.


Since sinusoids are a sum of complex exponentials with complex-conjugate frequencies, if the input to the system is a sinusoid, then the output of the system will also be a sinusoid, perhaps with a different amplitude and a different phase, but always with the same frequency upon reaching steady-state. LTI systems cannot produce frequency components that are not in the input.


LTI system theory is good at describing many important systems. Most LTI systems are considered "easy" to analyze, at least compared to the time-varying and/or nonlinear case. Any system that can be modeled as a linear homogeneous differential equation with constant coefficients is an LTI system. Examples of such systems are electrical circuits made up of resistors, inductors, and capacitors (RLC circuits). Ideal spring–mass–damper systems are also LTI systems, and are mathematically equivalent to RLC circuits.


Most LTI system concepts are similar between the continuous-time and discrete-time (linear shift-invariant) cases. In image processing, the time variable is replaced with two space variables, and the notion of time invariance is replaced by two-dimensional shift invariance. When analyzing filter banks and MIMO systems, it is often useful to consider vectors of signals.


A linear system that is not time-invariant can be solved using other approaches such as the Green function method. The same method must be used when the initial conditions of the problem are not null.



Continuous-time systems



Impulse response and convolution


The behavior of a linear, continuous-time, time-invariant system with input signal x(t) and output signal y(t) is described by the convolution integral:[2]












y(t)=(x∗h)(t){displaystyle y(t)=(x*h)(t),}{displaystyle y(t)=(x*h)(t),}

=def∫x(t−τ)⋅h(τ)dτ{displaystyle {}quad {stackrel {mathrm {def} }{=}}int limits _{-infty }^{infty }x(t-tau )cdot h(tau ),mathrm {d} tau }{displaystyle {}quad {stackrel {mathrm {def} }{=}}int limits _{-infty }^{infty }x(t-tau )cdot h(tau ),mathrm {d} tau }


=∫x(τ)⋅h(t−τ)dτ,{displaystyle {}quad =int limits _{-infty }^{infty }x(tau )cdot h(t-tau ),mathrm {d} tau ,}{displaystyle {}quad =int limits _{-infty }^{infty }x(tau )cdot h(t-tau ),mathrm {d} tau ,}       (using commutativity)

where h(t){displaystyle textstyle h(t)}textstyle h(t) is the system's response to an impulse:  x(τ)=δ).{displaystyle textstyle x(tau )=delta (tau ).}textstyle x(tau )=delta (tau ).   y(t){displaystyle textstyle y(t)}{displaystyle textstyle y(t)} is therefore proportional to a weighted average of the input function x(τ).{displaystyle textstyle x(tau ).}textstyle x(tau ).  The weighting function is h(−τ),{displaystyle textstyle h(-tau ),}textstyle h(-tau ), simply shifted by amount t.{displaystyle textstyle t.}textstyle t.   As t{displaystyle textstyle t}textstyle t changes, the weighting function emphasizes different parts of the input function. When h(τ){displaystyle textstyle h(tau )}textstyle h(tau ) is zero for all negative τ,{displaystyle textstyle tau ,}textstyle tau ,  y(t){displaystyle textstyle y(t)}textstyle y(t) depends only on values of x{displaystyle textstyle x}textstyle x prior to time t,{displaystyle textstyle t,}textstyle t,  and the system is said to be causal.


To understand why the convolution produces the output of an LTI system, let the notation {x(u−τ); u}{displaystyle textstyle {x(u-tau ); u}}textstyle {x(u-tau ); u} represent the function x(u−τ){displaystyle textstyle x(u-tau )}textstyle x(u-tau ) with variable u{displaystyle textstyle u}textstyle u and constant τ.{displaystyle textstyle tau .}textstyle tau .  And let the shorter notation {x}{displaystyle textstyle {x},}textstyle {x}, represent {x(u); u}.{displaystyle textstyle {x(u); u}.}textstyle {x(u); u}. Then a continuous-time system transforms an input function, {x},{displaystyle textstyle {x},}textstyle {x}, into an output function, {y}{displaystyle textstyle {y}}{displaystyle textstyle {y}}. And in general, every value of the output can depend on every value of the input. This concept is represented by:


y(t) =def Ot{x},{displaystyle y(t) {stackrel {text{def}}{=}} O_{t}{x},}{displaystyle y(t) {stackrel {text{def}}{=}} O_{t}{x},}

where Ot{displaystyle textstyle O_{t}}textstyle O_{t} is the transformation operator for time t{displaystyle textstyle t}textstyle t. In a typical system, y(t){displaystyle textstyle y(t)}textstyle y(t) depends most heavily on the values of x{displaystyle textstyle x}textstyle x that occurred near time t.{displaystyle textstyle t.}textstyle t.  Unless the transform itself changes with t,{displaystyle textstyle t,}textstyle t, the output function is just constant, and the system is uninteresting.


For a linear system, O{displaystyle textstyle O}textstyle O must satisfy Eq.1 :








Ot{∫ xτ(u)dτ; u}=∫ yτ(t)⏟Ot{xτ}dτ.{displaystyle O_{t}left{int limits _{-infty }^{infty }c_{tau } x_{tau }(u),mathrm {d} tau ; uright}=int limits _{-infty }^{infty }c_{tau } underbrace {y_{tau }(t)} _{O_{t}{x_{tau }}},mathrm {d} tau .,}{displaystyle O_{t}left{int limits _{-infty }^{infty }c_{tau } x_{tau }(u),mathrm {d} tau ; uright}=int limits _{-infty }^{infty }c_{tau } underbrace {y_{tau }(t)} _{O_{t}{x_{tau }}},mathrm {d} tau .,}












 



 



 



 





(Eq.2)




And the time-invariance requirement is:








Ot{x(u−τ); u} = y(t−τ)=def Ot−τ{x}.{displaystyle {begin{aligned}O_{t}{x(u-tau ); u} &{stackrel {quad }{=}} y(t-tau )\&{stackrel {text{def}}{=}} O_{t-tau }{x}.,end{aligned}}}{begin{aligned}O_{t}{x(u-tau ); u} &{stackrel  {quad }{=}} y(t-tau )\&{stackrel  {{text{def}}}{=}} O_{{t-tau }}{x}.,end{aligned}}












 



 



 



 





(Eq.3)




In this notation, we can write the impulse response as  h(t) =def Ot{δ(u); u}.{displaystyle textstyle h(t) {stackrel {text{def}}{=}} O_{t}{delta (u); u}.}textstyle h(t) {stackrel  {{text{def}}}{=}} O_{t}{delta (u); u}.


Similarly:












h(t−τ){displaystyle h(t-tau ),}h(t-tau ),

=def Ot−τ(u); u}{displaystyle {}{stackrel {text{def}}{=}} O_{t-tau }{delta (u); u}}{}{stackrel  {{text{def}}}{=}} O_{{t-tau }}{delta (u); u}


=Ot{δ(u−τ); u}.{displaystyle {}=O_{t}{delta (u-tau ); u}.,}{}=O_{t}{delta (u-tau ); u}.,       (using Eq.3)

Substituting this result into the convolution integral:


(x∗h)(t)=∫x(τ)⋅h(t−τ)dτ=∫x(τ)⋅Ot{δ(u−τ); u}dτ,{displaystyle {begin{aligned}(x*h)(t)&=int limits _{-infty }^{infty }x(tau )cdot h(t-tau ),mathrm {d} tau \[4pt]&=int limits _{-infty }^{infty }x(tau )cdot O_{t}{delta (u-tau ); u},mathrm {d} tau ,,end{aligned}}}{displaystyle {begin{aligned}(x*h)(t)&=int limits _{-infty }^{infty }x(tau )cdot h(t-tau ),mathrm {d} tau \[4pt]&=int limits _{-infty }^{infty }x(tau )cdot O_{t}{delta (u-tau ); u},mathrm {d} tau ,,end{aligned}}}

which has the form of the right side of Eq.2 for the case =x(τ){displaystyle textstyle c_{tau }=x(tau )}{displaystyle textstyle c_{tau }=x(tau )} and (u)=δ(u−τ).{displaystyle textstyle x_{tau }(u)=delta (u-tau ).}{displaystyle textstyle x_{tau }(u)=delta (u-tau ).}
Eq.2 then allows this continuation:


(x∗h)(t)=Ot{∫x(τ)⋅δ(u−τ)dτ; u}=Ot{x(u); u} =def y(t).{displaystyle {begin{aligned}(x*h)(t)&=O_{t}left{int limits _{-infty }^{infty }x(tau )cdot delta (u-tau ),mathrm {d} tau ; uright}\&=O_{t}left{x(u); uright}\& {stackrel {text{def}}{=}} y(t).,end{aligned}}}{displaystyle {begin{aligned}(x*h)(t)&=O_{t}left{int limits _{-infty }^{infty }x(tau )cdot delta (u-tau ),mathrm {d} tau ; uright}\&=O_{t}left{x(u); uright}\& {stackrel {text{def}}{=}} y(t).,end{aligned}}}

In summary, the input function, {x},{displaystyle textstyle {x},}textstyle {x},  can be represented by a continuum of time-shifted impulse functions, combined "linearly", as shown at Eq.1. The system's linearity property allows the system's response to be represented by the corresponding continuum of impulse responses, combined in the same way.  And the time-invariance property allows that combination to be represented by the convolution integral.


The mathematical operations above have a simple graphical simulation.[3]



Exponentials as eigenfunctions


An eigenfunction is a function for which the output of the operator is a scaled version of the same function. That is,


Hf=λf,{displaystyle {mathcal {H}}f=lambda f,}{displaystyle {mathcal {H}}f=lambda f,}

where f is the eigenfunction and λ{displaystyle lambda }lambda is the eigenvalue, a constant.


The exponential functions Aest{displaystyle Ae^{st}}Ae^{{st}}, where A,s∈C{displaystyle A,sin mathbb {C} }A,sin {mathbb  {C}}, are eigenfunctions of a linear, time-invariant operator. A simple proof illustrates this concept. Suppose the input is x(t)=Aest{displaystyle x(t)=Ae^{st}}x(t)=Ae^{{st}}. The output of the system with impulse response h(t){displaystyle h(t)}h(t) is then


h(t−τ)Aesτd⁡τ{displaystyle int _{-infty }^{infty }h(t-tau )Ae^{stau },operatorname {d} tau }{displaystyle int _{-infty }^{infty }h(t-tau )Ae^{stau },operatorname {d} tau }

which, by the commutative property of convolution, is equivalent to


h(τ)Aes(t−τ)d⁡τHf=∫h(τ)Aeste−d⁡τ=Aest∫h(τ)e−d⁡τ=Aest⏟Input⏞fH(s)⏟Scalar⏞λ,{displaystyle {begin{aligned}overbrace {int _{-infty }^{infty }h(tau ),Ae^{s(t-tau )},operatorname {d} tau } ^{{mathcal {H}}f}&=int _{-infty }^{infty }h(tau ),Ae^{st}e^{-stau },operatorname {d} tau \&=Ae^{st}int _{-infty }^{infty }h(tau ),e^{-stau },operatorname {d} tau \&=overbrace {underbrace {Ae^{st}} _{text{Input}}} ^{f}overbrace {underbrace {H(s)} _{text{Scalar}}} ^{lambda },end{aligned}}}{displaystyle {begin{aligned}overbrace {int _{-infty }^{infty }h(tau ),Ae^{s(t-tau )},operatorname {d} tau } ^{{mathcal {H}}f}&=int _{-infty }^{infty }h(tau ),Ae^{st}e^{-stau },operatorname {d} tau \&=Ae^{st}int _{-infty }^{infty }h(tau ),e^{-stau },operatorname {d} tau \&=overbrace {underbrace {Ae^{st}} _{text{Input}}} ^{f}overbrace {underbrace {H(s)} _{text{Scalar}}} ^{lambda },end{aligned}}}

where the scalar


H(s) =def ∫h(t)e−std⁡t{displaystyle H(s) {stackrel {text{def}}{=}} int _{-infty }^{infty }h(t)e^{-st},operatorname {d} t}H(s) {stackrel  {{text{def}}}{=}} int _{{-infty }}^{infty }h(t)e^{{-st}},operatorname {d}t

is dependent only on the parameter s.


So the system's response is a scaled version of the input. In particular, for any A,s∈C{displaystyle A,sin mathbb {C} }A,sin {mathbb  {C}}, the system output is the product of the input Aest{displaystyle Ae^{st}}Ae^{{st}} and the constant H(s){displaystyle H(s)}H(s). Hence, Aest{displaystyle Ae^{st}}Ae^{{st}} is an eigenfunction of an LTI system, and the corresponding eigenvalue is H(s){displaystyle H(s)}H(s).



Direct proof


It is also possible to directly derive complex exponentials as eigenfunctions of LTI systems.


Let's set v(t)=eiωt{displaystyle v(t)=e^{iomega t}}v(t)=e^{{iomega t}} some complex exponential and va(t)=eiω(t+a){displaystyle v_{a}(t)=e^{iomega (t+a)}}v_{a}(t)=e^{{iomega (t+a)}} a time-shifted version of it.


H[va](t)=eiωaH[v](t){displaystyle H[v_{a}](t)=e^{iomega a}H[v](t)}H[v_{a}](t)=e^{{iomega a}}H[v](t) by linearity with respect to the constant eiωa{displaystyle e^{iomega a}}e^{{iomega a}} .


H[va](t)=H[v](t+a){displaystyle H[v_{a}](t)=H[v](t+a)}H[v_{a}](t)=H[v](t+a) by time invariance of H{displaystyle H}H .


So H[v](t+a)=eiωaH[v](t){displaystyle H[v](t+a)=e^{iomega a}H[v](t)}H[v](t+a)=e^{{iomega a}}H[v](t). Setting t=0{displaystyle t=0}t=0 and renaming we get :


H[v](τ)=eiωτH[v](0){displaystyle H[v](tau )=e^{iomega tau }H[v](0)}H[v](tau )=e^{{iomega tau }}H[v](0)

i.e. that a complex exponential eiωτ{displaystyle e^{iomega tau }}e^{{iomega tau }} as input will give a complex exponential of same frequency as output.



Fourier and Laplace transforms


The eigenfunction property of exponentials is very useful for both analysis and insight into LTI systems. The Laplace transform


H(s) =def L{h(t)} =def ∫h(t)e−std⁡t{displaystyle H(s) {stackrel {text{def}}{=}} {mathcal {L}}{h(t)} {stackrel {text{def}}{=}} int _{-infty }^{infty }h(t)e^{-st},operatorname {d} t}H(s) {stackrel  {{text{def}}}{=}} {mathcal  {L}}{h(t)} {stackrel  {{text{def}}}{=}} int _{{-infty }}^{infty }h(t)e^{{-st}},operatorname {d}t

is exactly the way to get the eigenvalues from the impulse response. Of particular interest are pure sinusoids (i.e., exponential functions of the form ejωt{displaystyle e^{jomega t}}e^{jomega t} where ωR{displaystyle omega in mathbb {R} }omega in {mathbb  {R}} and j =def −1{displaystyle j {stackrel {text{def}}{=}} {sqrt {-1}}}j {stackrel  {{text{def}}}{=}} {sqrt  {-1}}). These are generally called complex exponentials even though the argument is purely imaginary. The Fourier transform H(jω)=F{h(t)}{displaystyle H(jomega )={mathcal {F}}{h(t)}}H(jomega )={mathcal  {F}}{h(t)} gives the eigenvalues for pure complex sinusoids. Both of H(s){displaystyle H(s)}H(s) and H(jω){displaystyle H(jomega )}H(jomega ) are called the system function, system response, or transfer function.


The Laplace transform is usually used in the context of one-sided signals, i.e. signals that are zero for all values of t less than some value. Usually, this "start time" is set to zero, for convenience and without loss of generality, with the transform integral being taken from zero to infinity (the transform shown above with lower limit of integration of negative infinity is formally known as the bilateral Laplace transform).


The Fourier transform is used for analyzing systems that process signals that are infinite in extent, such as modulated sinusoids, even though it cannot be directly applied to input and output signals that are not square integrable. The Laplace transform actually works directly for these signals if they are zero before a start time, even if they are not square integrable, for stable systems. The Fourier transform is often applied to spectra of infinite signals via the Wiener–Khinchin theorem even when Fourier transforms of the signals do not exist.


Due to the convolution property of both of these transforms, the convolution that gives the output of the system can be transformed to a multiplication in the transform domain, given signals for which the transforms exist


y(t)=(h∗x)(t) =def ∫h(t−τ)x(τ)d⁡τ =def L−1{H(s)X(s)}.{displaystyle y(t)=(h*x)(t) {stackrel {text{def}}{=}} int _{-infty }^{infty }h(t-tau )x(tau ),operatorname {d} tau {stackrel {text{def}}{=}} {mathcal {L}}^{-1}{H(s)X(s)}.}y(t)=(h*x)(t) {stackrel  {{text{def}}}{=}} int _{{-infty }}^{infty }h(t-tau )x(tau ),operatorname {d}tau  {stackrel  {{text{def}}}{=}} {mathcal  {L}}^{{-1}}{H(s)X(s)}.

Not only is it often easier to do the transforms, multiplication, and inverse transform than the original convolution, but one can also gain insight into the behavior of the system from the system response. One can look at the modulus of the system function |H(s)| to see whether the input exp⁡(st){displaystyle exp({st})}exp({st}) is passed (let through) the system or rejected or attenuated by the system (not let through).



Examples


  • A simple example of an LTI operator is the derivative.


    • dd⁡t(c1x1(t)+c2x2(t))=c1x1′(t)+c2x2′(t){displaystyle {frac {operatorname {d} }{operatorname {d} t}}left(c_{1}x_{1}(t)+c_{2}x_{2}(t)right)=c_{1}x'_{1}(t)+c_{2}x'_{2}(t)}{frac  {operatorname {d}}{operatorname {d}t}}left(c_{1}x_{1}(t)+c_{2}x_{2}(t)right)=c_{1}x'_{1}(t)+c_{2}x'_{2}(t)   (i.e., it is linear)


    • dd⁡tx(t−τ)=x′(t−τ){displaystyle {frac {operatorname {d} }{operatorname {d} t}}x(t-tau )=x'(t-tau )}{frac  {operatorname {d}}{operatorname {d}t}}x(t-tau )=x'(t-tau )   (i.e., it is time invariant)




When the Laplace transform of the derivative is taken, it transforms to a simple multiplication by the Laplace variable s.
L{dd⁡tx(t)}=sX(s){displaystyle {mathcal {L}}left{{frac {operatorname {d} }{operatorname {d} t}}x(t)right}=sX(s)}{mathcal  {L}}left{{frac  {operatorname {d}}{operatorname {d}t}}x(t)right}=sX(s)


That the derivative has such a simple Laplace transform partly explains the utility of the transform.


  • Another simple LTI operator is an averaging operator


A{x(t)} =def ∫t−at+ax(λ)d⁡λ.{displaystyle {mathcal {A}}left{x(t)right} {stackrel {text{def}}{=}} int _{t-a}^{t+a}x(lambda ),operatorname {d} lambda .}{mathcal  {A}}left{x(t)right} {stackrel  {{text{def}}}{=}} int _{{t-a}}^{{t+a}}x(lambda ),operatorname {d}lambda .

By the linearity of integration,
A{c1x1(t)+c2x2(t)}=∫t−at+a(c1x1(λ)+c2x2(λ))d⁡λ=c1∫t−at+ax1(λ)d⁡λ+c2∫t−at+ax2(λ)d⁡λ=c1A{x1(t)}+c2A{x2(t)},{displaystyle {begin{aligned}{mathcal {A}}{c_{1}x_{1}(t)+c_{2}x_{2}(t)}&=int _{t-a}^{t+a}(c_{1}x_{1}(lambda )+c_{2}x_{2}(lambda )),operatorname {d} lambda \&=c_{1}int _{t-a}^{t+a}x_{1}(lambda ),operatorname {d} lambda +c_{2}int _{t-a}^{t+a}x_{2}(lambda ),operatorname {d} lambda \&=c_{1}{mathcal {A}}{x_{1}(t)}+c_{2}{mathcal {A}}{x_{2}(t)},end{aligned}}}{displaystyle {begin{aligned}{mathcal {A}}{c_{1}x_{1}(t)+c_{2}x_{2}(t)}&=int _{t-a}^{t+a}(c_{1}x_{1}(lambda )+c_{2}x_{2}(lambda )),operatorname {d} lambda \&=c_{1}int _{t-a}^{t+a}x_{1}(lambda ),operatorname {d} lambda +c_{2}int _{t-a}^{t+a}x_{2}(lambda ),operatorname {d} lambda \&=c_{1}{mathcal {A}}{x_{1}(t)}+c_{2}{mathcal {A}}{x_{2}(t)},end{aligned}}}


it is linear. Additionally, because
A{x(t−τ)}=∫t−at+ax(λτ)d⁡λ=∫(t−τ)−a(t−τ)+ax(ξ)d⁡ξ=A{x}(t−τ),{displaystyle {begin{aligned}{mathcal {A}}left{x(t-tau )right}&=int _{t-a}^{t+a}x(lambda -tau ),operatorname {d} lambda \&=int _{(t-tau )-a}^{(t-tau )+a}x(xi ),operatorname {d} xi \&={mathcal {A}}{x}(t-tau ),end{aligned}}}{begin{aligned}{mathcal  {A}}left{x(t-tau )right}&=int _{{t-a}}^{{t+a}}x(lambda -tau ),operatorname {d}lambda \&=int _{{(t-tau )-a}}^{{(t-tau )+a}}x(xi ),operatorname {d}xi \&={mathcal  {A}}{x}(t-tau ),end{aligned}}


it is time invariant. In fact, A{displaystyle {mathcal {A}}}{mathcal {A}} can be written as a convolution with the boxcar function Π(t){displaystyle Pi (t)}Pi (t). That is,
A{x(t)}=∫Πt2a)x(λ)d⁡λ,{displaystyle {mathcal {A}}left{x(t)right}=int _{-infty }^{infty }Pi left({frac {lambda -t}{2a}}right)x(lambda ),operatorname {d} lambda ,}{mathcal  {A}}left{x(t)right}=int _{{-infty }}^{infty }Pi left({frac  {lambda -t}{2a}}right)x(lambda ),operatorname {d}lambda ,


where the boxcar function
Π(t) =def {1if |t|<12,0if |t|>12.{displaystyle Pi (t) {stackrel {text{def}}{=}} {begin{cases}1&{text{if }}|t|<{frac {1}{2}},\0&{text{if }}|t|>{frac {1}{2}}.end{cases}}}Pi (t) {stackrel  {{text{def}}}{=}} {begin{cases}1&{text{if }}|t|<{frac  {1}{2}},\0&{text{if }}|t|>{frac  {1}{2}}.end{cases}}




Important system properties


Some of the most important properties of a system are causality and stability. Causality is a necessity if the independent variable is time, but not all systems have time as an independent variable. For example, a system that processes still images does not need to be causal. Non-causal systems can be built and can be useful in many circumstances. Even non-real systems can be built and are very useful in many contexts.



Causality



A system is causal if the output depends only on present and past, but not future inputs. A necessary and sufficient condition for causality is


h(t)=0∀t<0,{displaystyle h(t)=0quad forall t<0,}h(t)=0quad forall t<0,

where h(t){displaystyle h(t)}h(t) is the impulse response. It is not possible in general to determine causality from the Laplace transform, because the inverse transform is not unique. When a region of convergence is specified, then causality can be determined.



Stability



A system is bounded-input, bounded-output stable (BIBO stable) if, for every bounded input, the output is finite. Mathematically, if every input satisfying


 ‖x(t)‖<∞{displaystyle |x(t)|_{infty }<infty } |x(t)|_{{infty }}<infty

leads to an output satisfying


 ‖y(t)‖<∞{displaystyle |y(t)|_{infty }<infty } |y(t)|_{{infty }}<infty

(that is, a finite maximum absolute value of x(t){displaystyle x(t)}x(t) implies a finite maximum absolute value of y(t){displaystyle y(t)}y(t)), then the system is stable. A necessary and sufficient condition is that h(t){displaystyle h(t)}h(t), the impulse response, is in L1 (has a finite L1 norm):


 ‖h(t)‖1=∫|h(t)|d⁡t<∞.{displaystyle |h(t)|_{1}=int _{-infty }^{infty }|h(t)|,operatorname {d} t<infty .} |h(t)|_{1}=int _{{-infty }}^{infty }|h(t)|,operatorname {d}t<infty .

In the frequency domain, the region of convergence must contain the imaginary axis s=jω{displaystyle s=jomega }s=jomega .


As an example, the ideal low-pass filter with impulse response equal to a sinc function is not BIBO stable, because the sinc function does not have a finite L1 norm. Thus, for some bounded input, the output of the ideal low-pass filter is unbounded. In particular, if the input is zero for t<0{displaystyle t<0,}t<0, and equal to a sinusoid at the cut-off frequency for t>0{displaystyle t>0,}t>0,, then the output will be unbounded for all times other than the zero crossings.



Discrete-time systems


Almost everything in continuous-time systems has a counterpart in discrete-time systems.



Discrete-time systems from continuous-time systems


In many contexts, a discrete time (DT) system is really part of a larger continuous time (CT) system. For example, a digital recording system takes an analog sound, digitizes it, possibly processes the digital signals, and plays back an analog sound for people to listen to.


Formally, the DT signals studied are almost always uniformly sampled versions of CT signals. If x(t){displaystyle x(t)}x(t) is a CT signal, then an analog to digital converter will transform it to the DT signal:


x[n] =def x(nT)∀n∈Z,{displaystyle x[n] {stackrel {text{def}}{=}} x(nT)qquad forall ,nin mathbb {Z} ,}x[n] {stackrel  {{text{def}}}{=}} x(nT)qquad forall ,nin {mathbb  {Z}},

where T is the sampling period. It is very important to limit the range of frequencies in the input signal for faithful representation in the DT signal, since then the sampling theorem guarantees that no information about the CT signal is lost. A DT signal can only contain a frequency range of 1/(2T){displaystyle 1/(2T)}1/(2T); other frequencies are aliased to the same range.



Impulse response and convolution


Let {x[m−k]; m}{displaystyle {x[m-k]; m}}{x[m-k]; m} represent the sequence {x[m−k]; for all integer values of m}.{displaystyle {x[m-k];{text{ for all integer values of }}m}.}{displaystyle {x[m-k];{text{ for all integer values of }}m}.}


And let the shorter notation {x}{displaystyle {x},}{x}, represent {x[m]; m}.{displaystyle {x[m]; m}.}{x[m]; m}.


A discrete system transforms an input sequence, {x}{displaystyle {x}}{x} into an output sequence, {y}.{displaystyle {y}.}{y}. In general, every element of the output can depend on every element of the input. Representing the transformation operator by O{displaystyle O}O, we can write:


y[n] =def On{x}.{displaystyle y[n] {stackrel {text{def}}{=}} O_{n}{x}.}y[n] {stackrel  {{text{def}}}{=}} O_{n}{x}.

Note that unless the transform itself changes with n, the output sequence is just constant, and the system is uninteresting. (Thus the subscript, n.) In a typical system, y[n] depends most heavily on the elements of x whose indices are near n.


For the special case of the Kronecker delta function, x[m]=δ[m],{displaystyle x[m]=delta [m],}x[m]=delta [m], the output sequence is the impulse response:


h[n] =def On{δ[m]; m}.{displaystyle h[n] {stackrel {text{def}}{=}} O_{n}{delta [m]; m}.,}h[n] {stackrel  {{text{def}}}{=}} O_{n}{delta [m]; m}.,

For a linear system, O{displaystyle O}O must satisfy:








On{∑k=−ck⋅xk[m]; m}=∑k=−ck⋅On{xk}.{displaystyle O_{n}left{sum _{k=-infty }^{infty }c_{k}cdot x_{k}[m]; mright}=sum _{k=-infty }^{infty }c_{k}cdot O_{n}{x_{k}}.,}O_{n}left{sum _{{k=-infty }}^{{infty }}c_{k}cdot x_{k}[m]; mright}=sum _{{k=-infty }}^{{infty }}c_{k}cdot O_{n}{x_{k}}.,












 



 



 



 





(Eq.4)




And the time-invariance requirement is:








On{x[m−k]; m} = y[n−k]=def On−k{x}.{displaystyle {begin{aligned}O_{n}{x[m-k]; m} &{stackrel {quad }{=}} y[n-k]\&{stackrel {text{def}}{=}} O_{n-k}{x}.,end{aligned}}}{begin{aligned}O_{n}{x[m-k]; m} &{stackrel  {quad }{=}} y[n-k]\&{stackrel  {{text{def}}}{=}} O_{{n-k}}{x}.,end{aligned}}












 



 



 



 





(Eq.5)




In such a system, the impulse response, {h},{displaystyle {h},,}{h},, characterizes the system completely. I.e., for any input sequence, the output sequence can be calculated in terms of the input and the impulse response. To see how that is done, consider the identity:


x[m]≡k=−x[k]⋅δ[m−k],{displaystyle x[m]equiv sum _{k=-infty }^{infty }x[k]cdot delta [m-k],,}x[m]equiv sum _{{k=-infty }}^{{infty }}x[k]cdot delta [m-k],,

which expresses {x}{displaystyle {x},}{x}, in terms of a sum of weighted delta functions.


Therefore:


y[n]=On{x}=On{∑k=−x[k]⋅δ[m−k]; m}=∑k=−x[k]⋅On{δ[m−k]; m},{displaystyle {begin{aligned}y[n]=O_{n}{x}&=O_{n}left{sum _{k=-infty }^{infty }x[k]cdot delta [m-k]; mright}\&=sum _{k=-infty }^{infty }x[k]cdot O_{n}{delta [m-k]; m},,end{aligned}}}{displaystyle {begin{aligned}y[n]=O_{n}{x}&=O_{n}left{sum _{k=-infty }^{infty }x[k]cdot delta [m-k]; mright}\&=sum _{k=-infty }^{infty }x[k]cdot O_{n}{delta [m-k]; m},,end{aligned}}}

where we have invoked Eq.4 for the case ck=x[k]{displaystyle c_{k}=x[k],}c_{k}=x[k], and xk[m]=δ[m−k].{displaystyle x_{k}[m]=delta [m-k].,}x_{k}[m]=delta [m-k].,


And because of Eq.5, we may write:


On{δ[m−k]; m} = On−k{δ[m]; m}=def h[n−k].{displaystyle {begin{aligned}O_{n}{delta [m-k]; m} &{stackrel {quad }{=}} O_{n-k}{delta [m]; m}\&{stackrel {text{def}}{=}} h[n-k].,end{aligned}}}{begin{aligned}O_{n}{delta [m-k]; m} &{stackrel  {quad }{=}} O_{{n-k}}{delta [m]; m}\&{stackrel  {{text{def}}}{=}} h[n-k].,end{aligned}}

Therefore:












y[n]{displaystyle y[n],}y[n],

=∑k=−x[k]⋅h[n−k]{displaystyle =sum _{k=-infty }^{infty }x[k]cdot h[n-k],}=sum _{{k=-infty }}^{{infty }}x[k]cdot h[n-k],


=∑k=−x[n−k]⋅h[k],{displaystyle =sum _{k=-infty }^{infty }x[n-k]cdot h[k],}=sum _{{k=-infty }}^{{infty }}x[n-k]cdot h[k],       (commutativity)

which is the familiar discrete convolution formula. The operator On{displaystyle O_{n},}O_{n}, can therefore be interpreted as proportional to a weighted average of the function x[k].
The weighting function is h[-k], simply shifted by amount n. As n changes, the weighting function emphasizes different parts of the input function. Equivalently, the system's response to an impulse at n=0 is a "time" reversed copy of the unshifted weighting function. When h[k] is zero for all negative k, the system is said to be causal.



Exponentials as eigenfunctions


An eigenfunction is a function for which the output of the operator is the same function, scaled by some constant. In symbols,



Hf=λf{displaystyle {mathcal {H}}f=lambda f}{mathcal  {H}}f=lambda f,

where f is the eigenfunction and λ{displaystyle lambda }lambda is the eigenvalue, a constant.


The exponential functions zn=esTn{displaystyle z^{n}=e^{sTn}}z^{n}=e^{{sTn}}, where n∈Z{displaystyle nin mathbb {Z} }n in mathbb{Z}, are eigenfunctions of a linear, time-invariant operator. T∈R{displaystyle Tin mathbb {R} }Tin {mathbb  {R}} is the sampling interval, and z=esT, z,s∈C{displaystyle z=e^{sT}, z,sin mathbb {C} }z=e^{{sT}}, z,sin {mathbb  {C}}. A simple proof illustrates this concept.


Suppose the input is x[n]=zn{displaystyle x[n]=,!z^{n}}x[n]=,!z^{n}. The output of the system with impulse response h[n]{displaystyle h[n]}h[n] is then


m=−h[n−m]zm{displaystyle sum _{m=-infty }^{infty }h[n-m],z^{m}}sum _{{m=-infty }}^{{infty }}h[n-m],z^{m}

which is equivalent to the following by the commutative property of convolution


m=−h[m]z(n−m)=zn∑m=−h[m]z−m=znH(z){displaystyle sum _{m=-infty }^{infty }h[m],z^{(n-m)}=z^{n}sum _{m=-infty }^{infty }h[m],z^{-m}=z^{n}H(z)}sum _{{m=-infty }}^{{infty }}h[m],z^{{(n-m)}}=z^{n}sum _{{m=-infty }}^{{infty }}h[m],z^{{-m}}=z^{n}H(z)

where


H(z) =def ∑m=−h[m]z−m{displaystyle H(z) {stackrel {text{def}}{=}} sum _{m=-infty }^{infty }h[m]z^{-m}}H(z) {stackrel  {{text{def}}}{=}} sum _{{m=-infty }}^{infty }h[m]z^{{-m}}

is dependent only on the parameter z.


So zn{displaystyle z^{n}}z^n is an eigenfunction of an LTI system because the system response is the same as the input times the constant H(z){displaystyle H(z)}H(z).



Z and discrete-time Fourier transforms


The eigenfunction property of exponentials is very useful for both analysis and insight into LTI systems. The Z transform


H(z)=Z{h[n]}=∑n=−h[n]z−n{displaystyle H(z)={mathcal {Z}}{h[n]}=sum _{n=-infty }^{infty }h[n]z^{-n}}H(z)={mathcal  {Z}}{h[n]}=sum _{{n=-infty }}^{infty }h[n]z^{{-n}}

is exactly the way to get the eigenvalues from the impulse response. Of particular interest are pure sinusoids, i.e. exponentials of the form ejωn{displaystyle e^{jomega n}}e^{{jomega n}}, where ωR{displaystyle omega in mathbb {R} }omega in {mathbb  {R}}. These can also be written as zn{displaystyle z^{n}}z^n with z=ejω{displaystyle z=e^{jomega }}z = e^{j omega}. These are generally called complex exponentials even though the argument is purely imaginary.
The discrete-time Fourier transform (DTFT) H(ejω)=F{h[n]}{displaystyle H(e^{jomega })={mathcal {F}}{h[n]}}H(e^{{jomega }})={mathcal  {F}}{h[n]}
gives the eigenvalues of pure sinusoids. Both of H(z){displaystyle H(z)}H(z) and H(ejω){displaystyle H(e^{jomega })}H(e^{{jomega }}) are called the system function, system response, or transfer function'.


The Z transform is usually used in the context of one-sided signals, i.e. signals that are zero for all values of t less than some value. Usually, this "start time" is set to zero, for convenience and without loss of generality. The Fourier transform is used for analyzing signals that are infinite in extent.


Due to the convolution property of both of these transforms, the convolution that gives the output of the system can be transformed to a multiplication in the transform domain. That is,


y[n]=(h∗x)[n]=∑m=−h[n−m]x[m]=Z−1{H(z)X(z)}.{displaystyle y[n]=(h*x)[n]=sum _{m=-infty }^{infty }h[n-m]x[m]={mathcal {Z}}^{-1}{H(z)X(z)}.}y[n]=(h*x)[n]=sum _{{m=-infty }}^{infty }h[n-m]x[m]={mathcal  {Z}}^{{-1}}{H(z)X(z)}.

Just as with the Laplace transform transfer function in continuous-time system analysis, the Z transform makes it easier to analyze systems and gain insight into their behavior. One can look at the modulus of the system function |H(z)| to see whether the input zn{displaystyle z^{n}}z^n is passed (let through) by the system, or rejected or attenuated by the system (not let through).



Examples


  • A simple example of an LTI operator is the delay operator D{x[n]} =def x[n−1]{displaystyle D{x[n]} {stackrel {text{def}}{=}} x[n-1]}D{x[n]} {stackrel  {{text{def}}}{=}} x[n-1].


    • D(c1⋅x1[n]+c2⋅x2[n])=c1⋅x1[n−1]+c2⋅x2[n−1]=c1⋅Dx1[n]+c2⋅Dx2[n]{displaystyle Dleft(c_{1}cdot x_{1}[n]+c_{2}cdot x_{2}[n]right)=c_{1}cdot x_{1}[n-1]+c_{2}cdot x_{2}[n-1]=c_{1}cdot Dx_{1}[n]+c_{2}cdot Dx_{2}[n]}{displaystyle Dleft(c_{1}cdot x_{1}[n]+c_{2}cdot x_{2}[n]right)=c_{1}cdot x_{1}[n-1]+c_{2}cdot x_{2}[n-1]=c_{1}cdot Dx_{1}[n]+c_{2}cdot Dx_{2}[n]}   (i.e., it is linear)


    • D{x[n−m]}=x[n−m−1]=x[(n−1)−m]=D{x}[n−m]{displaystyle D{x[n-m]}=x[n-m-1]=x[(n-1)-m]=D{x}[n-m],}D{x[n-m]}=x[n-m-1]=x[(n-1)-m]=D{x}[n-m],   (i.e., it is time invariant)



The Z transform of the delay operator is a simple multiplication by z−1. That is,
Z{Dx[n]}=z−1X(z).{displaystyle {mathcal {Z}}left{Dx[n]right}=z^{-1}X(z).}{mathcal  {Z}}left{Dx[n]right}=z^{{-1}}X(z).


  • Another simple LTI operator is the averaging operator


A{x[n]} =def ∑k=n−an+ax[k].{displaystyle {mathcal {A}}left{x[n]right} {stackrel {text{def}}{=}} sum _{k=n-a}^{n+a}x[k].}{displaystyle {mathcal {A}}left{x[n]right} {stackrel {text{def}}{=}} sum _{k=n-a}^{n+a}x[k].}

Because of the linearity of sums,
A{c1x1[n]+c2x2[n]}=∑k=n−an+a(c1x1[k]+c2x2[k])=c1∑k=n−an+ax1[k]+c2∑k=n−an+ax2[k]=c1A{x1[n]}+c2A{x2[n]},{displaystyle {begin{aligned}{mathcal {A}}left{c_{1}x_{1}[n]+c_{2}x_{2}[n]right}&=sum _{k=n-a}^{n+a}left(c_{1}x_{1}[k]+c_{2}x_{2}[k]right)\&=c_{1}sum _{k=n-a}^{n+a}x_{1}[k]+c_{2}sum _{k=n-a}^{n+a}x_{2}[k]\&=c_{1}{mathcal {A}}left{x_{1}[n]right}+c_{2}{mathcal {A}}left{x_{2}[n]right},end{aligned}}}{begin{aligned}{mathcal  {A}}left{c_{1}x_{1}[n]+c_{2}x_{2}[n]right}&=sum _{{k=n-a}}^{{n+a}}left(c_{1}x_{1}[k]+c_{2}x_{2}[k]right)\&=c_{1}sum _{{k=n-a}}^{{n+a}}x_{1}[k]+c_{2}sum _{{k=n-a}}^{{n+a}}x_{2}[k]\&=c_{1}{mathcal  {A}}left{x_{1}[n]right}+c_{2}{mathcal  {A}}left{x_{2}[n]right},end{aligned}}


and so it is linear. Because,
A{x[n−m]}=∑k=n−an+ax[k−m]=∑k′=(n−m)−a(n−m)+ax[k′]=A{x}[n−m],{displaystyle {begin{aligned}{mathcal {A}}left{x[n-m]right}&=sum _{k=n-a}^{n+a}x[k-m]\&=sum _{k'=(n-m)-a}^{(n-m)+a}x[k']\&={mathcal {A}}left{xright}[n-m],end{aligned}}}{begin{aligned}{mathcal  {A}}left{x[n-m]right}&=sum _{{k=n-a}}^{{n+a}}x[k-m]\&=sum _{{k'=(n-m)-a}}^{{(n-m)+a}}x[k']\&={mathcal  {A}}left{xright}[n-m],end{aligned}}


it is also time invariant.



Important system properties


The input-output characteristics of discrete-time LTI system are completely described by its impulse response h[n]{displaystyle h[n]}h[n].
Some of the most important properties of a system are causality and stability. Unlike CT systems, non-causal DT systems can be realized. It is trivial to make an acausal FIR system causal by adding delays. It is even possible to make acausal IIR systems.[4] Non-stable systems can be built and can be useful in many circumstances. Even non-real systems can be built and are very useful in many contexts.



Causality



A discrete-time LTI system is causal if the current value of the output depends on only the current value and past values of the input.,[5] A necessary and sufficient condition for causality is


h[n]=0 ∀n<0,{displaystyle h[n]=0 forall n<0,}h[n]=0 forall n<0,

where h[n]{displaystyle h[n]}h[n] is the impulse response. It is not possible in general to determine causality from the Z transform, because the inverse transform is not unique. When a region of convergence is specified, then causality can be determined.



Stability



A system is bounded input, bounded output stable (BIBO stable) if, for every bounded input, the output is finite. Mathematically, if


 ‖x[n]‖<∞{displaystyle |x[n]|_{infty }<infty } |x[n]|_{{infty }}<infty

implies that


 ‖y[n]‖<∞{displaystyle |y[n]|_{infty }<infty } |y[n]|_{{infty }}<infty

(that is, if bounded input implies bounded output, in the sense that the maximum absolute values of x[n]{displaystyle x[n]}x[n] and y[n]{displaystyle y[n]}y[n] are finite), then the system is stable. A necessary and sufficient condition is that h[n]{displaystyle h[n]}h[n], the impulse response, satisfies


h[n]‖1 =def ∑n=−|h[n]|<∞.{displaystyle |h[n]|_{1} {stackrel {text{def}}{=}} sum _{n=-infty }^{infty }|h[n]|<infty .}|h[n]|_{1} {stackrel  {{text{def}}}{=}} sum _{{n=-infty }}^{infty }|h[n]|<infty .

In the frequency domain, the region of convergence must contain the unit circle (i.e., the locus satisfying |z|=1{displaystyle |z|=1}|z|=1 for complex z).



Notes





  1. ^ Hespanha 2009, p. 78.


  2. ^ Crutchfield, p. 1. Welcome!


  3. ^ Crutchfield, p. 1. Exercises


  4. ^ Vaidyanathan,1995


  5. ^ Phillips 2007, p. 508.




See also



  • Circulant matrix

  • Frequency response

  • Impulse response

  • System analysis

  • Green function

  • Signal-flow graph



References




  • Phillips, C.l., Parr, J.M., & Riskin, E.A (2007). Signals, systems and Transforms. Prentice Hall. ISBN 0-13-041207-4.CS1 maint: Multiple names: authors list (link).mw-parser-output cite.citation{font-style:inherit}.mw-parser-output .citation q{quotes:"""""""'""'"}.mw-parser-output .citation .cs1-lock-free a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/6/65/Lock-green.svg/9px-Lock-green.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .citation .cs1-lock-limited a,.mw-parser-output .citation .cs1-lock-registration a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/d/d6/Lock-gray-alt-2.svg/9px-Lock-gray-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .citation .cs1-lock-subscription a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/a/aa/Lock-red-alt-2.svg/9px-Lock-red-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration{color:#555}.mw-parser-output .cs1-subscription span,.mw-parser-output .cs1-registration span{border-bottom:1px dotted;cursor:help}.mw-parser-output .cs1-ws-icon a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/4/4c/Wikisource-logo.svg/12px-Wikisource-logo.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output code.cs1-code{color:inherit;background:inherit;border:inherit;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;font-size:100%}.mw-parser-output .cs1-visible-error{font-size:100%}.mw-parser-output .cs1-maint{display:none;color:#33aa33;margin-left:0.3em}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration,.mw-parser-output .cs1-format{font-size:95%}.mw-parser-output .cs1-kern-left,.mw-parser-output .cs1-kern-wl-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right,.mw-parser-output .cs1-kern-wl-right{padding-right:0.2em}


  • Hespanha, J.P. (2009). Linear System Theory. Princeton university press. ISBN 0-691-14021-9.


  • Crutchfield, Steve (October 12, 2010), "The Joy of Convolution", Johns Hopkins University, retrieved November 21, 2010


  • Vaidyanathan, P. P.; Chen, T. (May 1995). "Role of anticausal inverses in multirate filter banks — Part I: system theoretic fundamentals". IEEE Trans. Signal Process. 43 (6): 1090. Bibcode:1995ITSP...43.1090V. doi:10.1109/78.382395.



Further reading


.mw-parser-output .refbegin{font-size:90%;margin-bottom:0.5em}.mw-parser-output .refbegin-hanging-indents>ul{list-style-type:none;margin-left:0}.mw-parser-output .refbegin-hanging-indents>ul>li,.mw-parser-output .refbegin-hanging-indents>dl>dd{margin-left:0;padding-left:3.2em;text-indent:-3.2em;list-style:none}.mw-parser-output .refbegin-100{font-size:100%}


  • Porat, Boaz (1997). A Course in Digital Signal Processing. New York: John Wiley. ISBN 978-0-471-14961-3.


  • Vaidyanathan, P. P.; Chen, T. (May 1995). "Role of anticausal inverses in multirate filter banks — Part I: system theoretic fundamentals". IEEE Trans. Signal Process. 43 (5): 1090. Bibcode:1995ITSP...43.1090V. doi:10.1109/78.382395.



External links




  • ECE 209: Review of Circuits as LTI Systems – Short primer on the mathematical analysis of (electrical) LTI systems.


  • ECE 209: Sources of Phase Shift – Gives an intuitive explanation of the source of phase shift in two common electrical LTI systems.


  • JHU 520.214 Signals and Systems course notes. An encapsulated course on LTI system theory. Adequate for self teaching.


  • LTI system example: RC low-pass filter. Amplitude and phase response.




Popular posts from this blog

Daylamites

Czechs

Lambaréné