• Home
  • Browse
    • Current Issue
    • By Issue
    • By Author
    • By Subject
    • Author Index
    • Keyword Index
  • Journal Info
    • About Journal
    • Aims and Scope
    • Editorial Board
    • Editorial Staff
    • Publication Ethics
    • Indexing and Abstracting
    • Related Links
    • FAQ
    • Peer Review Process
    • News
  • Guide for Authors
  • Submit Manuscript
  • Reviewers
  • Contact Us
 
  • Login
  • Register
Home Articles List Article Information
  • Save Records
  • |
  • Printable Version
  • |
  • Recommend
  • |
  • How to cite Export to
    RIS EndNote BibTeX APA MLA Harvard Vancouver
  • |
  • Share Share
    CiteULike Mendeley Facebook Google LinkedIn Twitter Telegram
Journal of Advances in Computer Research
Articles in Press
Current Issue
Journal Archive
Volume Volume 9 (2018)
Volume Volume 8 (2017)
Issue Issue 4
Issue Issue 3
Issue Issue 2
Issue Issue 1
Volume Volume 7 (2016)
Volume Volume 6 (2015)
Volume Volume 5 (2014)
Volume Volume 4 (2013)
Volume Volume 3 (2012)
Volume Volume 2 (2011)
Volume Volume 1 (2010)
TaghipourEivazi, S. (2017). Efficient Reverse Converter for Three Modules Set {2^n-1,2^(n+1)-1,2^n} in Multi-Part RNS. Journal of Advances in Computer Research, 8(4), 87-94.
Shiva TaghipourEivazi. "Efficient Reverse Converter for Three Modules Set {2^n-1,2^(n+1)-1,2^n} in Multi-Part RNS". Journal of Advances in Computer Research, 8, 4, 2017, 87-94.
TaghipourEivazi, S. (2017). 'Efficient Reverse Converter for Three Modules Set {2^n-1,2^(n+1)-1,2^n} in Multi-Part RNS', Journal of Advances in Computer Research, 8(4), pp. 87-94.
TaghipourEivazi, S. Efficient Reverse Converter for Three Modules Set {2^n-1,2^(n+1)-1,2^n} in Multi-Part RNS. Journal of Advances in Computer Research, 2017; 8(4): 87-94.

Efficient Reverse Converter for Three Modules Set {2^n-1,2^(n+1)-1,2^n} in Multi-Part RNS

Article 64, Volume 8, Issue 4 - Serial Number 30, Autumn 2017, Page 87-94  XML PDF (339 K)
Document Type: Original Manuscript
Author
Shiva TaghipourEivazi
Department of Computer Engineering, Tabriz Branch, Islamic Azad University, Tabriz, Iran
Abstract
Residue Number System is a numerical system which arithmetic operations are performed parallelly. One of the main factors that affects the system’s performance is the complexity of reverse converter. It should be noted that the complexity of this part should not affect the earned speed of parallelly performed arithmetic unit. Therefore in this paper a high speed converter for moduli set {2n-1, 2n+1 -1, 2n} is proposed which is based on Two-Part RNS and Chinese Reminder Theorem. Using this method has increased the speed of reverse converter. To have an accurate comparison both unit gate model and synthesized silicon tools are used and their parameters are compared in terms of delay and area. Converters are implemented in hardware description language and correctness for various n values are verified by simulation and execution on Cadence. As the results show, the proposed circuit has lower delay by around 21% in comparison to previous presented converter.
Keywords
Chinese Remainder Theorem (CRT); Computer Arithmetic; parallel processing; Residue Number System (RNS); R/B Converter; VLSI Architectures
Main Subjects
A.3. Arithmetic and Logic Structures
Statistics
Article View: 749
PDF Download: 117
Home | Glossary | News | Aims and Scope | Sitemap
Top Top

Journal Management System. Designed by sinaweb.