<article_id>JCIR_V3_N1_RP2</article_id>
<title>Design and Verification of RNS Adder for Moduli-Set {2K -1, 2K, 2K +1}</title>
<author>Praise Amulya</author>
<author>Neelima Koppala</author>
<journal>Journal on Circuits And Systems</journal>
<issn>2322–035X</issn>
<volume>3</volume>
<issue>1</issue>
<first_page>5</first_page>
<last_page>9</last_page>
<keywords>Forward Converter, Carry-Free Operation, Compressor, Ling Adder, Area, Delay, Area-Delay Product</keywords>
<abstract>RNS based adder circuit provides an efficient way, alternate to the conventional method due to its parallel operation and small data size. The main aim for improving the performance of computation of adder is that to eliminate the carry propagation chain which is time consuming. The integers are represented in its residues of particular moduli set. The adder depends on only residues of respective moduli set. This paper presents the design of adder which is capable of providing carry free operation with proposed design of forward converter and Compressor based RNS to Binary reverse    converter for the {2^k -1, 2^k , 2^k +1}moduli set.</abstract>
<date>December 2014 - February 2015</date>
<copyright>Copyright &copy; 2015 i-manager publications. All rights reserved.</copyright>
<publisher>i-manager Publications</publisher>
<article_url>http://www.imanagerpublications.com/Article.aspx?ArticleId=3257</article_url>