Boolean functional decomposition techniques built on top of Shannon cofactoring have been discussed in various applications of logic synthesis targeting reductions in area, delay and power. In this paper we investigate a generalization of decomposition based on Shannon cofactoring by means of non-orthonormal projection functions. We provide an approximation algorithm, by showing a constant approximation ratio between its result and the best solution. Experimental results in logic restructuring to reduce area and switching power show significant gains with respect to standard Shannon cofactoring, for even shorter computation time.
An approximation algorithm for cofactoring-based synthesis / A. Bernasconi, V. Ciriani, V. Liberali, G. Trucco, T. Villa - In: Proceedings of the 21. ACM Great Lakes symposium on VLSI 2011, Lausanne, Switzerland, May 2-6, 2011 / [a cura di] D. Atienza, Y. Xie, J. L. Ayala, K. S. Stevens. - New York : ACM, 2011 May. - ISBN 978-1-4503-0667-6. - pp. 193-198 (( Intervento presentato al 21. convegno Great Lakes symposium on VLSI tenutosi a Lausanne, Switzerland nel 2011 [10.1145/1973009.1973048].
An approximation algorithm for cofactoring-based synthesis
V. CirianiSecondo
;V. Liberali;G. TruccoPenultimo
;
2011
Abstract
Boolean functional decomposition techniques built on top of Shannon cofactoring have been discussed in various applications of logic synthesis targeting reductions in area, delay and power. In this paper we investigate a generalization of decomposition based on Shannon cofactoring by means of non-orthonormal projection functions. We provide an approximation algorithm, by showing a constant approximation ratio between its result and the best solution. Experimental results in logic restructuring to reduce area and switching power show significant gains with respect to standard Shannon cofactoring, for even shorter computation time.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
