Publication: On the Polynomial Multiplication in Chebyshev Form
| dc.contributor.author | Akleylek, Sedat | |
| dc.contributor.author | Cenk, Murat | |
| dc.contributor.author | Ozbudak, Ferruh | |
| dc.contributor.authorID | Akleylek, Sedat/0000-0001-7005-6489 | |
| dc.date.accessioned | 2020-06-21T14:27:56Z | |
| dc.date.available | 2020-06-21T14:27:56Z | |
| dc.date.issued | 2012 | |
| dc.department | OMÜ | en_US |
| dc.department-temp | [Akleylek, Sedat] Ondokuz Mayis Univ, Dept Comp Engn, Samsun, Turkey -- [Ozbudak, Ferruh] Middle E Tech Univ, Dept Math, Inst Appl Math, TR-06531 Ankara, Turkey -- [Cenk, Murat] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada -- | en_US |
| dc.description.abstract | We give an efficient multiplication method for polynomials in Chebyshev form. This multiplication method is different from the previous ones. Theoretically, we show that the number of multiplications is at least as good as Karatsuba-based algorithm. Moreover, using the proposed method, we improve the number of additions slightly. We remark that our method works efficiently for any N and it is easy to implement. To the best of our knowledge, the proposed method has the best multiplication and addition complexity for the N-term polynomial multiplication in Chebyshev form with 3 <= N <= 13. | en_US |
| dc.description.sponsorship | TUBITAKTurkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK) [TBAG-107T826, TBAG-109T672] | en_US |
| dc.description.sponsorship | The authors thank the anonymous referees for their detailed and very helpful comments. Murat Cenk performed this work while he was with the Institute of Applied Mathematics, Middle East Technical University. Murat Cenk and Ferruh Ozbudak were partially supported by TUBITAK under Grant No. TBAG-107T826 and TBAG-109T672. | en_US |
| dc.identifier.doi | 10.1109/TC.2011.38 | |
| dc.identifier.endpage | 587 | en_US |
| dc.identifier.issn | 0018-9340 | |
| dc.identifier.issue | 4 | en_US |
| dc.identifier.startpage | 584 | en_US |
| dc.identifier.uri | https://doi.org/10.1109/TC.2011.38 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12712/16603 | |
| dc.identifier.volume | 61 | en_US |
| dc.identifier.wos | WOS:000300574100012 | |
| dc.language.iso | en | en_US |
| dc.publisher | IEEE Computer Soc | en_US |
| dc.relation.journal | Ieee Transactions on Computers | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | Chebyshev Polynomials | en_US |
| dc.subject | Theory of Computation | en_US |
| dc.subject | Multiplication of Polynomials | en_US |
| dc.subject | Arithmetic Complexity. | en_US |
| dc.title | On the Polynomial Multiplication in Chebyshev Form | en_US |
| dc.type | Article | en_US |
| dspace.entity.type | Publication |