Guessing a particular solution. Recall that a general linear recurrence has the form: f(n)=a1f(n-1)+a2f(n-2)+…+aaf(n-d)+g(n) As explained in lecture, one step in solving this recurrence is finding a particular solu- tion; i.e., a function f(n)that satisfies the recurrence, but may not be consistent with the boundary conditions. Here's a recipe to help you guess a particular solution:
1. Any arbitrary input sequence x[n] can be expressed as a linear combination of delaved and advanced unit sample sequences [n]=x[k][n-k] k=-0 2. .Linear Time-Invariant()System A system satisfying both the linearity and the time-invariance property. .If yiln] is the output due to an input xiln] and y2ln] is the output due to an input x2n] then for an input xn]=axiln]+bx2n] the output is given by ]=]+by2[n]
