Multiple Constant Multiplication using Difference based Adder Graph
Küçük Resim Yok
Tarih
2021
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
IEEE
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
In 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.
Açıklama
10th International Symposium on Signal, Image, Video and Communications (ISIVC) -- APR 07-09, 2021 -- ELECTR NETWORK
Anahtar Kelimeler
multiple constant multiplication algorithm, Difference based Adder Graph, heuristic, FREYR
Kaynak
2020 10th International Symposium on Signal, Image, Video And Communications (Isivc)
WoS Q Değeri
N/A
