Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss
algorithm of converting pole/residue to polynomials?
5 views
Skip to first unread message
Ben
Feb 10, 2012, 6:56:12 PM2/10/12
to
Hi all,
i wonder if anyone knows the algorithm used in the "residue" function in matlab? for one project, i need to implement the function in C, so have to know the algorithm behind the function. I have a good understanding how to convert polynomials to pole/residue form, and not clear on how to convert pole/residue to the polynomials.
Your help is highly appreciated.
Ben
i wonder if anyone knows the algorithm used in the "residue" function in matlab? for one project, i need to implement the function in C, so have to know the algorithm behind the function. I have a good understanding how to convert polynomials to pole/residue form, and not clear on how to convert pole/residue to the polynomials.
Your help is highly appreciated.
Ben
Bruno Luong
Feb 11, 2012, 4:19:33 AM2/11/12
to
"Ben " <benja...@gmail.com> wrote in message <jh4aqr$96d$1...@newscl01ah.mathworks.com>...
[1] Oppenheim, A.V. and R.W. Schafer, Digital Signal Processing, Prentice-Hall, 1975, p. 56.
It's probably based on eucliden division algorithm
http://en.wikipedia.org/wiki/Greatest_common_divisor_of_two_polynomials
Bruno
> Hi all,
>
> i wonder if anyone knows the algorithm used in the "residue" function in matlab? for one project, i need to implement the function in C, so have to know the algorithm behind the function. I have a good understanding how to convert polynomials to pole/residue form, and not clear on how to convert pole/residue to the polynomials.
>
My version 2011B gives the reference to
>
> i wonder if anyone knows the algorithm used in the "residue" function in matlab? for one project, i need to implement the function in C, so have to know the algorithm behind the function. I have a good understanding how to convert polynomials to pole/residue form, and not clear on how to convert pole/residue to the polynomials.
>
[1] Oppenheim, A.V. and R.W. Schafer, Digital Signal Processing, Prentice-Hall, 1975, p. 56.
It's probably based on eucliden division algorithm
http://en.wikipedia.org/wiki/Greatest_common_divisor_of_two_polynomials
Bruno
0 new messages