File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/78.124959
- Scopus: eid_2-s2.0-0026817813
- WOS: WOS:A1992HB20600023
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: A new algorithm for arbitrary transformation of polynomial and rational functions
Title | A new algorithm for arbitrary transformation of polynomial and rational functions |
---|---|
Authors | |
Issue Date | 1992 |
Citation | Ieee Transactions On Signal Processing, 1992, v. 40 n. 2, p. 456-460 How to Cite? |
Abstract | A new algorithm for performing the arbitrary polynomial transformation for single and multiple variables is presented. It is based on the polynomial interpolation of the numerator and the denominator polynomials of the rational functions at the roots of unity using the discrete Fourier transform (DFT). By proper modification of the algorithm, it is possible to compute the Q matrix of the transformation. Generalization of the algorithm to higher dimensions is also presented. |
Persistent Identifier | http://hdl.handle.net/10722/154958 |
ISSN | 2023 Impact Factor: 4.6 2023 SCImago Journal Rankings: 2.520 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chan, SC | en_US |
dc.contributor.author | Ho, KL | en_US |
dc.date.accessioned | 2012-08-08T08:31:17Z | - |
dc.date.available | 2012-08-08T08:31:17Z | - |
dc.date.issued | 1992 | en_US |
dc.identifier.citation | Ieee Transactions On Signal Processing, 1992, v. 40 n. 2, p. 456-460 | en_US |
dc.identifier.issn | 1053-587X | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/154958 | - |
dc.description.abstract | A new algorithm for performing the arbitrary polynomial transformation for single and multiple variables is presented. It is based on the polynomial interpolation of the numerator and the denominator polynomials of the rational functions at the roots of unity using the discrete Fourier transform (DFT). By proper modification of the algorithm, it is possible to compute the Q matrix of the transformation. Generalization of the algorithm to higher dimensions is also presented. | en_US |
dc.language | eng | en_US |
dc.relation.ispartof | IEEE Transactions on Signal Processing | en_US |
dc.title | A new algorithm for arbitrary transformation of polynomial and rational functions | en_US |
dc.type | Article | en_US |
dc.identifier.email | Chan, SC:scchan@eee.hku.hk | en_US |
dc.identifier.email | Ho, KL:klho@eee.hku.hk | en_US |
dc.identifier.authority | Chan, SC=rp00094 | en_US |
dc.identifier.authority | Ho, KL=rp00117 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1109/78.124959 | en_US |
dc.identifier.scopus | eid_2-s2.0-0026817813 | en_US |
dc.identifier.volume | 40 | en_US |
dc.identifier.issue | 2 | en_US |
dc.identifier.spage | 456 | en_US |
dc.identifier.epage | 460 | en_US |
dc.identifier.isi | WOS:A1992HB20600023 | - |
dc.publisher.place | United States | en_US |
dc.identifier.scopusauthorid | Chan, SC=13310287100 | en_US |
dc.identifier.scopusauthorid | Ho, KL=7403581592 | en_US |
dc.identifier.issnl | 1053-587X | - |