High Speed Reverse Converter for the Five Moduli Set \(2^n , 2^n -1, 2^ n+ 1, 2 ^n -3, 2^ {n-1} -1\)

Volume 9, Issue 4, pp 438 - 450 http://dx.doi.org/10.22436/jmcs.09.04.19

Download PDF

Download XML

• Export citations
  • CITATIONS & REFERENCES
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)
  • ARTICLE CITATION
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)
  • REFERENCES
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)

• 2477 Downloads
• 3436 Views

Authors

Mohammad Esmaeildoust - Faculty of Marine Engineering, Khorramshahr University of Marine Science and Technology, Iran. Amer Kaabi - Faculty of Marine Engineering, Khorramshahr University of Marine Science and Technology, Iran.

Abstract

The new moduli set \(\{2^n , 2^n -1, 2^ n+ 1, 2 ^n -3, 2^ {n-1} -1\}\)is profitable to construct high performance residue number system (RNS) due to well-formed moduli set and high dynamic range. Conversion from residues to binary is a bottleneck in RNS. With growth of number of moduli, this problem has b een more critical due to complex multiplicative inverses. In this paper a high speed design of reverse converter for the moduli set \(\{2^n , 2^n -1, 2^ n+ 1, 2 ^n -3, 2^ {n-1} -1\}\) is presented. This design is derived by using mix radix conversion (MRC) in three stages. Converter architecture is adder based which is suitable to realize efficient VLSI implementation. Proposed architecture has better delay performance compared to other reverse converters for five moduli sets in literature.

Share and Cite

Keywords

• residue numbers system
• reverse converter
• mixed radix conversion
• digital circuits
• VLSI design.

MSC

•  68M07
•  65Y04
•  94A12
•  11A07

References

• [1] J. Ramirez, U. Meyer-Base, A. Garcia, Efficient RNS-based Design of Programmable FIR Filters Targeting FPL Technology, Journal of Circuits, Systems and Computers, 14 (2005), 165-177.
  • View Article
  • Google Scholar


• [2] W. Wei, M. N. S. Swamy, M. O. Ahmad, RNS application for digital image processing, Proceedings of the 4th IEEE international workshop on system-on-chip for real time applications, (2004)
  • View Article
  • Google Scholar


• [3] M. Esmaeildoust, D. Schinianakis, H. Javashi, T. Stouraitis, K. Navi, Efficient RNS Implemenation of Elliptic Curve Point Multiplication Over GF(p), IEEE Transaction on Very Large Scale Integration (VLSI) Systems, 21 (2013), 1545 - 1549.
  • View Article
  • Google Scholar


• [4] K. Navi, A. S. Molahosseini, M. Esmaeildoust, How to Teach Residue Number System to Computer Scientists and Engineers, IEEE Transactions on Education, 54 (2011), 156-163
  • View Article
  • Google Scholar


• [5] I. Koren , Computer Arithmetic Algorithms, Prentice-Hall, (1993)
  • MathSciNet
  • Google Scholar


• [6] B. Parhami, Computer Arithmetic: Algorithms and Hardware Design, , Oxford University Press (2000)
  • Google Scholar


• [7] Y. Wang, X. Song, M. Aboulhamid, H. Shen, Adder based residue to binary numbers converters for \((2^n-1, 2^n, 2^n+1)\), IEEE Transactions on Signal Processing, 50 (2002), 1772-1779.
  • View Article
  • MathSciNet
  • Google Scholar


• [8] W. Wang, M. N. S. Swamy, M. O. Ahmad, Y. Wang, A high-speed residue-to-binary converter and a scheme of its VLSI implementation, IEEE Transactions on Circuits and Systems-II, 47 (2000), 1576–1581.
  • View Article
  • Google Scholar
  • MATH


• [9] P. V. A. Mohan, RNS-To-Binary Converter for a New Three-Moduli Set \(\{2^{n+1}–1, 2^n, 2^n–1\}\), IEEE Transactions on Circuits and Systems-II, 54 (2007), 775-779.
  • Google Scholar


• [10] P. V. A. Mohan, A. B. Premkumar, RNS-to-Binary Converters for Two Four-Moduli Set \(\{2^n-1, 2^n, 2^n+1, 2^{n+1}–1\}\) and \(\{2^n-1, 2^n, 2^n+1, 2^{n+1}+1\}\), IEEE Transactions on Circuits and Systems-I, 54 (2007), 1245-1254.
  • View Article
  • MathSciNet
  • Google Scholar


• [11] M. Esmaeildoust, K. Navi, M. R. Taheri, A. S. Molahosseini, S. Khodambashi, Efficient RNS to binary converters for the new 4-moduli set \(\{2^n, 2^{n+ 1}-1, 2^n-1, 2^{n-1}-1\}\), IEICE Electronics Express , 9 (1) (2012), 1-7.
  • View Article
  • Google Scholar


• [12] P. V. A. Mohan, New reverse converters for the moduli set \(\{2^n −3, 2^n −1, 2^n +1, 2^n +3\}\), Elsevier Journal of Electronics and Communications (AEU), 62 (2008), 643-658.
  • View Article
  • Google Scholar


• [13] B. Cao, C. H. Chang, T. Srikanthan, An Efficient Reverse Converter for the 4-Moduli Set \(\{2^n-1, 2^n, 2^n+1, 2^{2n}+1\}\) Based on the New Chinese Remainder Theorem, IEEE Transactions on Circuits and Systems-I, 50 (2003), 1296-1303.
  • View Article
  • MathSciNet
  • Google Scholar
  • MATH


• [14] B. Cao, C. H. Chang, T. Srikanthan, A Residue-to-Binary Converter for a New Five-Moduli Set, IEEE Transactions on Circuits and Systems-I, 54 (2007), 1041–1049.
  • View Article
  • MathSciNet
  • Google Scholar
  • MATH


• [15] Mohammad Esmaeildoust, Keivan Navi, Mohammad Reza Taheri, High speed reverse converter for new five-moduli set \(\{2^n, 2^{2n+1}-1, 2^{n/2}-1, 2^{n/2}+1, 2^n+1\}\), IEICE Electron. Express, 7 (2010), 118-125.
  • View Article
  • Google Scholar


• [16] A. S. Molahosseini, C. Dadkhah, K. Navi, A New Five-Moduli Set for Efficient Hardware Implementation of the Reverse Converter, IEICE Electronics Express, 6 (2009), 1006-1012.
  • View Article
  • Google Scholar


• [17] N. Keivan, M. Esmaeildoust, A. S. Molahosseini, A General Reverse Converter Architecture with Low Complexity and High Performance, IEICE TRANSACTIONS on Information and Systems, 94 (2) (2011), 264-273.
  • View Article
  • Google Scholar