Fusing Adds and Shifts for Efficient Dot Products
Dot products are heavily used in applications like graphics, signal processing, navigation, and artificial intelligence (AI). These AI models in particular impose significant computational demands on modern computers. Current accelerators typically implement dot product hardware as a row of multipliers followed by a tree of adders. However, treating multiplication and summation operations separately leads to sub-optimal hardware. In contrast, we obtain significant area savings by considering the dot product operation as a whole. We propose <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">FASED</monospace>, which fuses components of a Booth multiplier with the adder tree to eliminate a significant portion of full adders from a baseline INT8×INT8,4,2 design. Compared to popular dot product hardware units, <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">FASED</monospace> reduces area by up to <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$1.9\times$</tex-math></inline-formula>.
Authors
- Gennady Pekhimenko (ORCID: https://orcid.org/0000-0002-3839-0919)
- Karthik Ganesan (ORCID: https://orcid.org/0000-0002-2541-1549)
- Mark C. Jeffrey (ORCID: https://orcid.org/0000-0003-4816-0356)
- Pavel Golikov (ORCID: https://orcid.org/0000-0001-5355-0362)
Institutions
- University of Toronto (CA)
Publication Details
- Journal
- IEEE Computer Architecture Letters
- Published
- 2025-11-26
- DOI
- https://doi.org/10.1109/lca.2025.3637718
- Primary Topic
- Numerical Methods and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00