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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Inexact computing with approximate adder application


    Contributors:


    Publication date :

    2014-06-01


    Size :

    669302 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English