Design and Modeling of Modulo Multipliers Using RNS
1A.Sivannarayana, Department of Electronics & Communication Engineering, KL University, Vijayawada (Andhra Pradesh), India.
2K.Harikishore, Department of Electronics & Communication Engineering, KL University, Vijayawada (Andhra Pradesh), India.
Manuscript received on 10 July 2013 | Revised Manuscript received on 18 July 2013 | Manuscript Published on 30 July 2013 | PP: 47-54 | Volume-3 Issue-2, July 2013 | Retrieval Number: B1023073213/13©BEIESP
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: The special moduli set,Residue Number System is intended to implement the long and repeated multiplications of cryptographic and signal processing algorithms. In this paper, area and power trade-of of modulo 2 n – 1 and modulo 2n + 1 multipliers based on RNS are proposed. The proposed modulo multipliers are based on the radix-8 Booth encoding technique. In the proposed modulo 2 n – 1 multipliers, the number of partial products is lowered to └ n/3 ┘ + 1 for n = 32 to 64, which is around 33% reduction over radix-4 Booth encoded multiplier for n = 32 to 64.For modulo 2n + 1multiplier,the aggregate bias is composed of multiplier dependent dynamic bias and multiplier independent static bias due to hard multiple and modulo-reduced partial products generation. The total number of partial products is reduced to └ n/3 ┘ + 6 for modulo 2n + 1 multiplier. From synthesis results for modulo 2 n – 1 and modulo 2n + 1 based RNS multipliers constructed from different modulo 2 n – 1 and modulo 2 n + 1 multipliers.
Keywords: Algorithm, Computer Arithmetic, Multiplication, Residue Number System(RNS).
Scope of the Article: Low-power design