Hello,
I am being bugged by this problem for many days.
Problem: Is the following system represented by the difference
equation time invariant?
y(n) = a*y(n-1) + b*x(n)
x(n) is the input, y(n) is the output. a and b are constants. y(-1) =
0
I proceeded like this
Solve the difference equation:
y(n) = b*x(n) + a*b*x(n-1) + ... + a^(n-1)*b*x(1) + a^n
*b*x(0)
where a^r, means a raised to r. a^3, for example, means a cubed.
Let XI(n) be the input and YI(n) be the corresponding output.
Let XI(n) = x(n-n0),n0 is the delay
YI(n) = b*XI(n) + a*b*XI(n-1) + ... + a^(n-1)*b*XI(1) + a^n
*b*XI(0)
= b*x(n-n0) + a*b*x(n-n0-1) + ... + a^(n-1)*b*x(1-n0) + a^n
*b*x(-n0)
Calculate y(n-n0). Replace n by n-n0 in y(n)
y(n-n0) = b*x(n-n0) + a*b*x(n-n0-1)+ ... + a^(n-n0-1)*b*x(1) +
a^(n-n0)*b*x(0)
y(n-n0) is not equal to YI(n-n0). So the system is not time-invariant.
But some websites mentioned it as time invariant. Is my solution
correct? If not, where is the mistake in my solution?
Thanks
P.S: This was NOT given as an assignment problem
|
|
0
|
|
|
|
Reply
|
innocent_802000
|
8/5/2003 3:23:52 AM |
|
In article 7f6c0a9a.0308041923.473336b7@posting.google.com, Jay at
innocent_802000@yahoo.com wrote on 08/04/2003 23:23:
> Hello,
> I am being bugged by this problem for many days.
>
> Problem: Is the following system represented by the difference
> equation time invariant?
> y(n) = a*y(n-1) + b*x(n)
> x(n) is the input, y(n) is the output. a and b are constants. y(-1) =
> 0
>
> I proceeded like this
> Solve the difference equation:
> y(n) = b*x(n) + a*b*x(n-1) + ... + a^(n-1)*b*x(1) + a^n
> *b*x(0)
> where a^r, means a raised to r. a^3, for example, means a cubed.
> Let XI(n) be the input and YI(n) be the corresponding output.
> Let XI(n) = x(n-n0),n0 is the delay
> YI(n) = b*XI(n) + a*b*XI(n-1) + ... + a^(n-1)*b*XI(1) + a^n
> *b*XI(0)
> = b*x(n-n0) + a*b*x(n-n0-1) + ... + a^(n-1)*b*x(1-n0) + a^n
> *b*x(-n0)
>
> Calculate y(n-n0). Replace n by n-n0 in y(n)
> y(n-n0) = b*x(n-n0) + a*b*x(n-n0-1)+ ... + a^(n-n0-1)*b*x(1) +
> a^(n-n0)*b*x(0)
>
> y(n-n0) is not equal to YI(n-n0).
check your math. they are equal. keep in mind that your impulse response
is infinitely long so, to compare apples to apples, you have to make the
same assumptions about x[n] being zero before n=0 in one case, and n=n0 in
the other case.
> So the system is not time-invariant.
it is time-invariant if a and b are constant.
> But some websites mentioned it as time invariant. Is my solution
> correct? If not, where is the mistake in my solution?
> Thanks
>
> P.S: This was NOT given as an assignment problem
doesn't matter.
r b-j
|
|
0
|
|
|
|
Reply
|
robert
|
8/5/2003 5:08:37 AM
|
|
robert bristow-johnson wrote:
>
> In article 7f6c0a9a.0308041923.473336b7@posting.google.com, Jay at
> innocent_802000@yahoo.com wrote on 08/04/2003 23:23:
>
> > P.S: This was NOT given as an assignment problem
>
> doesn't matter.
>
> r b-j
It doesn't matter because you've shown your work and you've asked to
have your mistake pointed out. comp.dsper's generally don't mind
HELPING with homework - they just don't like to be asked to DO someone
else's homework.
--
Jim Thomas Principal Applications Engineer Bittware, Inc
jthomas@bittware.com http://www.bittware.com (703) 779-7770
Sometimes experience is the only teacher that works - Mike Rosing
|
|
0
|
|
|
|
Reply
|
Jim
|
8/5/2003 2:05:09 PM
|
|
robert bristow-johnson wrote:
>
> In article 7f6c0a9a.0308041923.473336b7@posting.google.com, Jay at
> innocent_802000@yahoo.com wrote on 08/04/2003 23:23:
>
...
> >
> > P.S: This was NOT given as an assignment problem
>
> doesn't matter.
>
> r b-j
I speak for myself, and apparently for R.B-j. too. We don't mind helping
with homework at all. We object to being asked to do it when it seems
that the request is only to save work for the requester. "Why doesn't
this work?", "Why does this work?", and "Please tell me how to get
started" are fine.
As for Jay's question: The filter is time invariant, but not memoryless.
Those are orthogonal properties.
Jerry
--
Engineering is the art of making what you want from things you can get.
�����������������������������������������������������������������������
|
|
0
|
|
|
|
Reply
|
Jerry
|
8/5/2003 2:14:00 PM
|
|
robert bristow-johnson wrote:
>
> In article 7f6c0a9a.0308041923.473336b7@posting.google.com, Jay at
> innocent_802000@yahoo.com wrote on 08/04/2003 23:23:
>
...
> >
> > P.S: This was NOT given as an assignment problem
>
> doesn't matter.
>
> r b-j
I speak for myself, and apparently for R.B-J. too. We don't mind helping
with homework at all. We object to being asked to do it when it seems
that the request is only to save work for the requester. "Why doesn't
this work?", "Why does this work?", and "Please tell me how to get
started" are fine.
As for Jay's question: The filter is time invariant, but not memoryless.
Those are orthogonal properties.
Jerry
--
Engineering is the art of making what you want from things you can get.
�����������������������������������������������������������������������
|
|
0
|
|
|
|
Reply
|
Jerry
|
8/5/2003 2:17:01 PM
|
|
|
4 Replies
110 Views
(page loaded in 0.072 seconds)
Similiar Articles: Filter and inverse filter =/ timedelay? - comp.dsp> The answer is no, there shouldn't (ideally) be a pure time-delay in the > above mentioned setup? Correct. In fact, for a linear, time-invariant, minimum-phase (no ... Amplitude Time Ave. w/o Rectification - comp.dspIs there anyway to get an amplitude of an ac signal averaged over time w/o some ... That is true for time-invariant systems. Look at my previous post and, for instance ... Discrete Kalman Filter in Simulink - comp.soft-sys.matlab ...custom filter bank with time varying filters in Simulink - comp ... Discrete ... The discrete process under consideration is a simple first order, time-invariant system ... Filter object from z transform equation? - comp.soft-sys.matlab ...Z Transform of Difference Equations - DSPRelated.com Analysis of a Digital Comb Filter; Linear Time-Invariant Digital Filters ... Z Transform of Difference Equations. Solving very large systems of ODEs with NDSolve - comp.soft-sys ...Perhaps you can reformulate your problem as a time independent problem then. ... > > - Each equation has a invariant and using the projection method to control > the error ... help me with Impulse invariance - comp.soft-sys.matlab... on the analog lowpass filter prototype with the sampling method the impulse invariant. ... and I'll try to do better as ... you want to have the property of "reverse time ... Timekeeping broken on Windows XP with multimedia timer enabled (-M ...Quite some time ago we had a customer who also had timing problems with our ... Windows chooses the most precise, invariant frequency source available in the system. RDTSC (was: Fastest logical not) - comp.lang.asm.x86But in general I have no problem to time short code-snips and if they would show ... copied from 25481.pdf: TscInvariant: 1 = The TSC rate is ensured to be invariant ... High resolution timer. - comp.lang.asm.x86To measure real time you need a timer that measures real time, not a timer that ... If CPUID 8000_0007.edx[8] = 1, then the TSC rate is ensured to be invariant across all ... Bottom-up heap construction in O(n) - comp.lang.c++.moderated ...You build the heap from the far end of the array up, with the invariant being that the ... The only complex part is proving that this does indeed take only linear time. Time-invariant system - Wikipedia, the free encyclopediaA time-invariant (TIV) system is one whose output does not depend explicitly on time. If the input signal produces an output then any time shifted input,, results in ... LTI system theory - Wikipedia, the free encyclopediaLinear time-invariant system theory, commonly known as LTI system theory, comes from applied mathematics and has direct applications in NMR spectroscopy, seismology ... 7/28/2012 12:04:51 PM
|