In this paper, we present a multiplier based on a sequence of approximated accumulations. According to a given splitting point of the carry chains, the technique herein introduced allows varying the quality of the accumulations and, consequently, the overall product. Our approximate multiplier trades-off accuracy for a reduced latency (with respect to an accurate sequential multiplier) and exploits the inherent area savings of sequential over combinatorial approaches. We implemented multiple versions with different bit-width and accuracy configurations, targeting an FPGA and a 45nm ASIC to estimate resources, power consumption, and latency. We also present two error analyses of the proposed design based on closed-form analysis and simulations.
@article{arxiv.2105.05588,
title = {On the Approximation of Accuracy-configurable Sequential Multipliers via Segmented Carry Chains},
author = {Jorge Echavarria and Stefan Wildermann and Oliver Keszocze and Faramarz Khosravi and Andreas Becher and Jürgen Teich},
journal= {arXiv preprint arXiv:2105.05588},
year = {2021}
}