Implementation of Arithmetic unit for RNS using 2n -3 as Base
Nagaraj.Aiholli1, Uday.Wali2, Rashmi.Rachh3
1Nagaraj Aiholli, Department of E&C, KLECET, Belagavi (Karnataka), India.
2Uday Wali, C-Quad Research, Desur IT Park, Belagavi (Karnataka), India.
3Rashmi Rachh, Department of CS, VTU Post Graduate Studies, Belagavi (Karnataka), India.
Manuscript received on 04 December 2019 | Revised Manuscript received on 12 December 2019 | Manuscript Published on 31 December 2019 | PP: 254-258 | Volume-9 Issue-2S December 2019 | Retrieval Number: B10171292S19/2019©BEIESP | DOI: 10.35940/ijitee.B1017.1292S19
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open-access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Residue Number System (RNS) is often used in Cryptographic applications. Choice of a unique base for RNS is an important factor in implementing RNS. Bit folding after multiplication is a commonly used method for implementing RNS. In this paper an architecture based on modulo 2 n -3 arithmetic is implemented. Each word of partial product is mapped once normal and then with one bit left shift with reference to the base number. The results are tabulated in terms of delay and area with Xilinx tool. Efficiency of implementation is compared with results available in literature.
Keywords: Modulo Arithmetic, Residue Number System, Squarer.
Scope of the Article: Expert Systems