Advanced search
Publication Cover
IETE Journal of Research Volume 69, 2023 - Issue 5
Submit an article Journal homepage
52
Views
0
CrossRef citations to date
0
Altmetric
Articles

RNS Comparison via Shortcut Mixed Radix Conversion: The Case of Three 4-Moduli Sets {2n + k, 2n ± 1, m} (m ϵ {2n + 1 ± 1, 2n − 1 − 1})

Z. Torabi1 Department of Computer Engineering, Shahid Rajaee Teacher Training University, Tehran, IranCorrespondence[email protected]
ORCID Iconhttps://orcid.org/0000-0002-2526-688XView further author information
ORCID Icon,
G. Jaberipur2 Department of Computer Science and Engineering, Shahid Beheshti University, Tehran1983963113, Iran;3 School of Computer Sciences, Institute for Research in Fundamental Sciences (IPM), P.O. Box: 19395-5746, Tehran, IranView further author information
&
S. A. Mirnaseri4 College of Engineering, Amol University of Special Modern Technologies, Mazandaran, IranView further author information
Pages 2567-2573 | Published online: 30 Mar 2021

References

  • L. Sousa, “Efficient method for magnitude comparison in RNS based on two pairs of conjugate moduli,” in Proceedings of 18th IEEE International Symposium on Computer Arithmetic, Montpellier, France, Jun. 2007, pp. 240–50.
  • S. Bi, and W. J. Gross, “The mixed-radix Chinese remainder theorem and its applications to residue comparison,” IEEE Trans. Comput., Vol. 57, no. 12, pp. 1624–32, Dec. 2008.
  • T. F. Tay, and C. H. Chang, “New algorithm for signed integer comparison in four-moduli superset {2n,2n−1,2n+1,2n+1−1},” in IEEE Asia Pacific Conference on Circuits and Systems, APCCAS, Okinawa, Japan, 2014, pp. 519–22.
  • Z. Torabi, and G. Jaberipur, “Fast low energy RNS comparators for 4-moduli sets {2n± 1,2n,m} with ∈ {2n+1± 1,2n−1−1},” Integr. VLSI J., Vol. 55, pp. 155–61, Sep. 2016.
  • Z. Torabi, and G. Jaberipur, “Low-power/cost RNS comparison via partitioning the dynamic range,” IEEE Trans. Very Large Scale Integr. (VLSI) Syst., Vol. 24, no. 5, pp. 1849–57, 2016.
  • N. S. Szabó, and R. I. Tanaka, Residue Arithmetic and Its Applications to Computer Technology. New York: McGraw-Hill, 1967.
  • B. Cao, T. Srikanthan, and C. H. Chang, “Efficient reverse converters for the four-moduli sets {2n−1,2n,2n+1,2n+1−1} and {2n−1,2n,2n+1,2n−1−1},” Proc. IEE Comput. Digit. Tech., Vol. 152, no. 5, pp. 687–96, Sep. 2005.
  • P. Patronik, and S. J. Piestrak, “Design of reverse converters for general RNS moduli sets {2k,2n−1,2n+1,2n+1−1} and {2k,2n−1,2n+1,2n−1−1} (even),” IEEE Trans. Circuits Syst. I Reg. Papers, Vol. 61, no. 6, pp. 1687–700, Jun. 2014.
  • L. Sousa, S. Antao, and R. Chaves, “On the design of RNS reverse converters for the four-moduli set {2n−1,2n,2n+1,2n+1+1},” IEEE Trans. Very Large Scale Integr. (VLSI) Syst., Vol. 21, no. 10, pp. 1945–9, 2013.
  • P. V. A. Mohan, and A. B. Premkumar, “RNS-to-binary converters for two four-moduli sets {2n−1,2n,2n+1,2n+1−1} and {2n−1,2n,2n+1,2n+1+1},” IEEE Trans. Circuits Syst. I Reg. Papers, Vol. 54, no. 6, pp. 1245–54, 2007.
  • G. Jaberipur, and B. Parhami, “Efficient realisation of arithmetic algorithms with weighted collection of posibits and negabits,” IET Comput. Digit. Tech., Vol. 6, no. 5, pp. 259–68, 2012.
  • G. Jaberipur, and S. Nejati, “Balanced minimal latency RNS addition for moduli set {2n−1,2n,2n+1},” in Proceedings 18th International Conference on Systems, Signals and Image Processing, Sarajevo, Bosnia and Herzegovina, Jun. 2011, pp. 159–65.
  • Y. Wang, “Residue-to-binary converters based on new Chinese remainder theorems,” IEEE Trans. Circuits Syst. II Analog Digit. Signal Proc., Vol. 47, no. 3, pp. 197–205, 2000.
  • A. Tyagi, “A reduced-area scheme for carry-select adders,” IEEE Trans. Comput., Vol. 42, no. 11, pp. 63–70, 1993.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.