This paper presents fast hardware algorithms for channel operations in the Residue Number System (RNS) in terms of addition, subtraction and multiplication. These algorithms compare favorably with other popular algorithms due to the use of special moduli in the form of 2n - 1. They are particularly applicable for the largest channel or redundant channels in RNS.
Copyright 2009 IEEE. Reprinted from Proceedings, 2009 International Conference on Information Engineering and Computer Science : ICIECS 2009, Wuhan China 19 -20 December 2009. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Macquarie University’s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to email@example.com. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.