Knifati, AbdurrahmanMyderrizi, Indrit2024-09-112024-09-112021978-1-7281-7668-0https://doi.org/10.1109/ISIVC49222.2021.9487533https://hdl.handle.net/11363/786910th International Symposium on Signal, Image, Video and Communications (ISIVC) -- APR 07-09, 2021 -- ELECTR NETWORKIn 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.eninfo:eu-repo/semantics/closedAccessmultiple constant multiplication algorithmDifference based Adder GraphheuristicFREYRConference Object10.1109/ISIVC49222.2021.94875332-s2.0-85112650648WOS:000848630900005N/A