Multiple Constant Multiplication using Difference based Adder Graph

dc.authoridMyderrizi, Indrit/0000-0002-2112-7911
dc.contributor.authorKnifati, Abdurrahman
dc.contributor.authorMyderrizi, Indrit
dc.date.accessioned2024-09-11T19:51:57Z
dc.date.available2024-09-11T19:51:57Z
dc.date.issued2021
dc.departmentİstanbul Gelişim Üniversitesien_US
dc.description10th International Symposium on Signal, Image, Video and Communications (ISIVC) -- APR 07-09, 2021 -- ELECTR NETWORKen_US
dc.description.abstractIn this paper, the multiple constant multiplication is implemented using the difference based adder graph. The experiments carried with the developed algorithm using Matlab, show that difference based adder graph provides low adder depth at the expense of having more adder cost, especially dealing with sets of many small constants or large constants. For such cases, results show an adder depth reduction up to 17% while an adder cost increase up to 11% compared to a recent adder graph algorithm known as FREYR in the state-of-art algorithms.en_US
dc.identifier.doi10.1109/ISIVC49222.2021.9487533
dc.identifier.isbn978-1-7281-7668-0
dc.identifier.scopus2-s2.0-85112650648en_US
dc.identifier.urihttps://doi.org/10.1109/ISIVC49222.2021.9487533
dc.identifier.urihttps://hdl.handle.net/11363/7869
dc.identifier.wosWOS:000848630900005en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.relation.ispartof2020 10th International Symposium on Signal, Image, Video And Communications (Isivc)en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.snmz20240903_Gen_US
dc.subjectmultiple constant multiplication algorithmen_US
dc.subjectDifference based Adder Graphen_US
dc.subjectheuristicen_US
dc.subjectFREYRen_US
dc.titleMultiple Constant Multiplication using Difference based Adder Graphen_US
dc.typeConference Objecten_US

Dosyalar