Copyright © 2026 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{145077,
        author = {G.CHANDANA  and P.RAJANI},
        title = {OPTIMIZED ERROR DETECTION FOR RESIDUE ADDER USING SIGNED DIGIT ARITHMETIC},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {4},
        number = {7},
        pages = {258-260},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=145077},
        abstract = {In this paper, a new residue checker using optimal signed-digit (SD) adder tree structure is presented for the error detection of multiply-accumulate arithmetic circuit. The modulus of the redisue cheker is set to m = 2p + u, where u ∈ {−1, 1}and p is the word length of the residue checker. By switching u = 1 to/from u = −1, more 2-bit errors can be detected using the same checking circuit. The fast modulo m SD adder with an end-around carry is introduced, so that the modulo m addition time is independent of the word length of operands of the residue checker, and the delay time of the proposed residue checker is dependent of the stages of the binary tree structure of the modulo-m SD adders.},
        keywords = {Residue Adder, Error Detection},
        month = {},
        }