This paper presents an analysis of an inexact N-bit ripple carry adder architecture. Results show that a 30 percent power reduction is achieved for several approximate adders while maintaining a root-mean square error of 16 percent.
Inexact computing with approximate adder application
2014-06-01
669302 byte
Conference paper
Electronic Resource
English
Online Contents | 2004
|NTRS | 1993
|