Approximate computing is a fast-emerging paradigm promising higher circuit performances in error tolerant applications. Binary multipliers are a common target for approximate computing due to their complexity and the multitude of their applications. In this paper, we investigate approximate recursive multipliers based on novel 4x4 multiplier blocks. We present three approximate 4x4 multipliers, with different error-precision trade-off, obtained by carry truncation and error compensation. These basic blocks are exploited to design 8x8 approximate multipliers. The proposed circuits are implemented in a 14 nm FinFET technology and show improved performance compared to the state-of-the-art.
Approximate Recursive Multipliers Using Carry Truncation and Error Compensation / Nunziata, I.; Zacharelos, E.; Saggese, G.; Strollo, A. G. M.; Napoli, E.. - (2022), pp. 137-140. (Intervento presentato al convegno 17th International Conference on Ph.D Research in Microelectronics and Electronics, PRIME 2022 tenutosi a ita nel 2022) [10.1109/PRIME55000.2022.9816787].
Approximate Recursive Multipliers Using Carry Truncation and Error Compensation
Nunziata I.;Zacharelos E.;Saggese G.;Strollo A. G. M.;Napoli E.
2022
Abstract
Approximate computing is a fast-emerging paradigm promising higher circuit performances in error tolerant applications. Binary multipliers are a common target for approximate computing due to their complexity and the multitude of their applications. In this paper, we investigate approximate recursive multipliers based on novel 4x4 multiplier blocks. We present three approximate 4x4 multipliers, with different error-precision trade-off, obtained by carry truncation and error compensation. These basic blocks are exploited to design 8x8 approximate multipliers. The proposed circuits are implemented in a 14 nm FinFET technology and show improved performance compared to the state-of-the-art.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
