A less recursive variant of Karatsuba-Ofman algorithm for multiplying operands of size a power of two

Basit Öğe Kaydı
dc.contributor.authorErdem, SS
dc.contributor.authorKoç, ÇK
dc.date.accessioned2025-10-29T11:15:53Z
dc.date.issued2003
dc.departmentGebze Teknik Üniversitesi
dc.description16th IEEE Symposium on Computer Arithmetic -- JUN 15-18, 2003 -- Santiago de Compostela, SPAIN
dc.description.abstractWe propose a new algorithm for fast multiplication of large integers having a precision of 2(k) computer words, where k is an integer. The algorithm is derived from the Karatsuba-Ofman Algorithm and has the same asymptotic complexity. However, the running time of the new algorithm is slightly better, and it makes one third as many recursive calls.
dc.description.sponsorshipIEEE Comp Soc TC VLSI,Univ Santiago Compostela,Minist Ciencia & Tecnol Espana,Univ Calif Los Angeles,AutoPD,Direcc Xeral Invest & Desenvolvemento Galicia
dc.identifier.doi10.1109/ARITH.2003.1207657
dc.identifier.endpage35
dc.identifier.isbn0-7695-1894-X
dc.identifier.issn1063-6889
dc.identifier.orcid0000-0002-2572-9565
dc.identifier.scopus2-s2.0-0041562409
dc.identifier.scopusqualityN/A
dc.identifier.startpage28
dc.identifier.urihttps://doi.org/10.1109/ARITH.2003.1207657
dc.identifier.urihttps://hdl.handle.net/20.500.14854/7326
dc.identifier.wosWOS:000184018900005
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherIEEE Computer Soc
dc.relation.ispartof16th IEEE Symposium on Computer Arithmetic, Proceedings
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WOS_20251020
dc.titleA less recursive variant of Karatsuba-Ofman algorithm for multiplying operands of size a power of two
dc.typeConference Object

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu