Abstract
Residue number system (RNS) is a promising tool for improving performance in various areas of modern science and technology. Recently were published number of papers on the use of Diagonal Function for problematic RNS operations implementation. The main conclusion of those works is the assertion that the Diagonal Function (DF) does not give an advantages over Chinese Remainder Theorem in general case. The main difficulty in the use of the DF in VLSI is the implementation of modulo Sum of Quotients (SQ) operations. In this paper we have decided to consider the problem of RNS constructing with VLSI-friendly DF. We analyzed the cases where SQ takes one of three forms 2n, 2n −1 or 2n +1. In this paper we shows the methods of RNS construction with SQ forms 2n, 2n −1 and 2n +1.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
