Skip Navigation

The Computer Journal 1999 42(3):232-240; doi:10.1093/comjnl/42.3.232
© 1999 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Hiasat, A. A.
Right arrow Articles by Abdel-Aty-Zohdy, H.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Semi-Custom VLSI Design and Implementation of a New Efficient RNS Division Algorithm

Ahmad A. HiasatA1 and Hoda Abdel-Aty-ZohdyA2

A1 Elect. Eng. Dept., Princess Sumaya University, PO Box 1438, Amman 11941, Jordan Email: aahiasat@rss.gov.jo A2 Elect. & Sys. Eng. Dept., Oakland University, Rochester, MI 48309, USA A3 Part of this paper is based on [1]. Another part of this paper is based on [2].

In this paper we introduce a new algorithm for division in residue number system, which can be applied to any moduli set. Simulation results indicated that the algorithm is faster than the most competitive published work. To further improve this speed, we customize this algorithm to serve two specific moduli sets: (2k, 2k–1, 2k–1–1) and (2k+1, 2k, 2k–1). The customization results in eliminating memory devices (ROMs), thus increasing the speed of operation. A semi-custom VLSI design for this algorithm for the moduli (2k+1, 2k, 2k–1) has been implemented, fabricated and tested.

Received 31 August, 1998. Revised 26 April, 1999.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.