Multiple constant multiplication using difference based Adder graph

Knifati A., Myderrizi I.

10th International Symposium on Signal, Image, Video and Communications, ISIVC 2020, Saint Etienne, France, 7 - 09 April 2021 identifier

  • Publication Type: Conference Paper / Full Text
  • Doi Number: 10.1109/isivc49222.2021.9487533
  • City: Saint Etienne
  • Country: France
  • Keywords: Difference based Adder Graph, FREYR, Heuristic, Multiple constant multiplication algorithm
  • Istanbul Gelisim University Affiliated: Yes


© 2021 IEEE.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.