Details
Presenter(s)
![Rémi Garcia Headshot](https://confcats-catavault.s3.amazonaws.com/CATAVault/ieeecass/master/files/styles/cc_user_photo/s3/user-pictures/20011_0.jpg?h=6f92cd28&itok=LezA0q9y)
Display Name
Rémi Garcia
- Affiliation
-
AffiliationUniversité de Nantes
- Country
Abstract
Many algorithms from digital signal processing require the multiplications with several constants. Finding a multiplierless solution with minimal cost is known as the multiple constant multiplication (MCM) problem. Usually, not the full precision is required at the output. The state-of-the-art approaches consist in finding an MCM solution first, and truncating it in a second step. In this work, we solve the MCM problem with minimal number of full adders for truncated outputs. By combining the two steps into a global optimization problem, we are able to reduce the number of full adders by 12% on average.