Efficient modulo 2n+1 adders are important for several applications including residue number system, digital signal processors and cryptography algorithms. In this paper we present a novel modulo 2n+1 addition algorithm for a recently represented number system. The proposed approach is introduced for the reduction of the power dissipated. In a conventional modulo 2n+1 adder, all operands have (n+1)-bit length. To avoid using (n+1)-bit circuits, the diminished-1 and carry save diminished-1 number systems can be effectively used in applications. In the paper, we also derive two new architectures for designing modulo 2n+1 adder, based on n-bit ripple-carry adder. The first architecture is a faster design whereas the second one uses less hardware. In the proposed method, the special treatment required for zero operands in Diminished-1 number system is removed. In the fastest modulo 2n+1 adders in normal binary system, there are 3-operand adders. This problem is also resolved in this paper. The proposed architectures are compared with some efficient adders based on ripple-carry adder and highspeed adder. It is shown that the hardware overhead and power consumption will be reduced. As well as power reduction, in some cases, power-delay product will be also reduced.


    Access

    Download


    Export, share and cite



    Title :

    Improved Modulo 2n +1 Adder Design


    Contributors:

    Publication date :

    2008-03-29


    Remarks:

    oai:zenodo.org:1083569



    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    DDC:    629





    Módulo luminoso

    BÖHLAND HEIKO / RUNGE OLAF / RENNER GUIDO | European Patent Office | 2020

    Free access


    Módulo neumático

    RISSE RAINER / STENDER AXEL | European Patent Office | 2017

    Free access

    Fast Differential Adder

    Arditti, Mort A. / Silva, Rosemary | NTRS | 1993