Booth Modified RNS Multiplier in RNS to Binary Code Converator Using {2P+1 2P, 2p-1}

  • P. charantej VIT University
  • R. dhanabal VIT University
  • S. S Kerur VIT University
  • Harish Kittu VIT University

Abstract

A RNS reverse convertor moduli set {2p+1,2p,2p-1} is proposed in this paper. Chinese Remainder Theorem is simplified to get a reverse converter that uses mod-{2p-1} operations. The proposed architecture reduces the
burden of explicit use of moduli operation in conversion process and we prove that theoretically speaking it outperforms state of the art equivalent converters. In order to restrict the range we makes use of radix-8 booth modified rns multiplier in the proposed converter on cyclone2 FPGA. When compare to other convertors, this architecture saves power, area, delay and cost .

Author Biographies

P. charantej, VIT University

P. Charantej
MTECH (VLSI) Student,
Sense Department, VIT University,
Vellore, Tamil Nadu

R. dhanabal, VIT University

Assistant Professor (Senior Grade)
VLSI Division, SENSE,
VIT University, Vellore, Tamil Nadu

S. S Kerur, VIT University

MTECH (VLSI) Student,
Sense Department, VIT University,
Vellore, Tamil Nadu

Harish Kittu, VIT University

MTECH (VLSI) Student,
Sense Department, VIT University,
Vellore, Tamil Nadu

Published
2018-06-27
How to Cite
CHARANTEJ, P. et al. Booth Modified RNS Multiplier in RNS to Binary Code Converator Using {2P+1 2P, 2p-1}. MR International Journal of Engineering & Technology, [S.l.], v. 6, n. 2, p. 27-31, june 2018. ISSN 0975-4997. Available at: <http://mrijet.manavrachna.edu.in/index.php/journal/article/view/220>. Date accessed: 26 may 2019.