A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
A Novel Power Saving Approach for Residue Number System Moduli Set Based On Fast Sign Detection Algorithm
2016
International Journal Of Engineering And Computer Science
Preserved Fulltext
Then, a sign detection unit for the moduli set {2n+1 − 1, 2n − 1, 2n} is proposed based on the new sign detection algorithm. ...
Then, a sign detection unit for the moduli set {2n+1 − 1, 2n − 1, 2n} is proposed based on the new sign detection algorithm. ...
A sign detection unit for the moduli set {2n+1 − 1, 2n − 1, 2n} is proposed based on the proposed sign detection algorithm. ...
doi:10.18535/ijecs/v4i10.21
fatcat:wqszeuewkffjbikshr4f7zyrhe
A Novel RNS Overflow Detection and Correction Algorithm for the Moduli Set {2^n-1,2^n,2^n+1}
2015
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The approach which is novel to the moduli set 2 𝑛 − 1, 2 𝑛 , 2 𝑛 + 1 is based on the Chinese Remainder Theorem and demonstrates theoretically to be a very fast scheme compared to similar state of the ...
In this paper, an efficient scheme for detecting and correcting overflow during addition in Residue Number System (RNS) is presented. ...
In this paper, an efficient algorithm for RNS overflow detection and correction for the moduli set 2 𝑛 − 1, 2 𝑛 , 2 𝑛 + 1 is proposed. ...
doi:10.5120/19403-0925
fatcat:miiqhfkcjralfl6ut6le7htwja
A fast and robust RNS algorithm for evaluating signs of determinants
1998
Computers and Mathematics with Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A new and efficient number theoretic algorithm for evaluating signs of determinants is proposed. The algorithm uses computations over small finite rings. ...
It is devoted to a variety of computational geometry problems, where the necessity of evaluating signs of determinants of small matrices often arises. ...
For this value of b, we may select the set of moduli given in Table 1 . ...
doi:10.1016/s0898-1221(98)00041-8
fatcat:aaj4fahjfjdghozyyiugxnsx7y
Magnitude Comparison and Sign Detection based on the 4-Moduli Set {2n+1, 2n−1, 2n+3, 2n−3}
2021
Majlesi journal of electrical engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The 4-moduli set residue number system (RNS), {2 𝑛 + 3,2 𝑛 − 3,2 𝑛 + 1, 2 𝑛 − 1}, with a wide dynamic range, has recently been proposed as a balanced 4-moduli set for utilizing the cases that demand ...
for detecting signs and recognizing comparators. ...
Next, we derive an algorithm for sign detection and magnitude comparison for this moduli set. The proposed method uses the same reverse converter to extract sign. ...
doi:10.52547/mjee.15.3.93
fatcat:j4vjf6gzj5asdgj64gpofr3asa
Effective Reverse Converter for General Three Moduli Set{(2^n)-1,(2^n)+1,(2^(pn+1))-1}
2012
International Journal of Image Graphics and Signal Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The special case of this set for p=2 which is }2 n -1,2 n +1,2 2n+1 -1{ is also described in this paper. ...
In this paper, the general three moduli set }2 n -1,2 n +1,2 pn+1 -1} based on CRT algorithm is proposed in which -p‖ is an even number greater than zero. ...
Finally X is calculated as follow : 2n +1 3 3 X = 2 Y -Y + x = Yx + Y + 1. (39) Example: For moduli set {2 n -1,2 n +1,2 2n+1 -1}for n=2 we have the moduli set {3,5,31}. ...
doi:10.5815/ijigsp.2012.09.06
fatcat:bqdg3kdxkfdedf2vjfc6ckcnma
Hybrid RNS-to-Binary Converter for the Moduli Set {22n, 2n-1, 2n+1, 2n+1-1}
2013
Research Journal of Applied Sciences Engineering and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This study introduces the RNS four-moduli set {2 2n , 2 n -1, 2 n +1, 2 n+1 -1} which is obtained by enhancing the moduli set {2 n -1, 2 n , 2 n +1, 2 n+1 -1}. ...
Besides, an efficient RNS-tobinary converter for the proposed moduli set is designed using a two-level architecture where a previous converter design for subset {2 2n , 2 n -1, 2 n +1} is used in the first ...
In this study, we are going to design efficient reverse converter for the large DR four-moduli set {2 2n , 2 n -1, 2 n +1, 2 n+1 -1} to achieve fast RNS system since this moduli set can provide high dynamic ...
doi:10.19026/rjaset.6.3819
fatcat:pggqlo37w5c55glvimfd7ammey
A New Efficient Residue to Binary Converter for (5n+2)-bit Dynamic Range Moduli Set
2018
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
This paper proposes an efficient residue to binary converter on a new three-moduli set (2 2𝑛 +1 , 2 2𝑛 +1 − 1, 2 𝑛 − 1) using the Mixed Radix Conversion. ...
In comparison with other moduli sets with similar dynamic range, the new schemes out-perform the existing schemes in terms of both hardware cost and propagation delay. ...
The internal RNS processing for the above mentioned moduli set only relies on efficient modulo 2 𝑛 and 2 𝑛 + 1 − 𝑡𝑦𝑝𝑒 operations for leading to a simple and fast RNS system. ...
doi:10.5120/ijca2018916726
fatcat:oektoznl5vfrdlbsqickvowxoy
RNS Scaling Algorithm for a New Moduli Set {2^(2n+1) +1, 2^(2n+1), 2^(2n+1)-1}
2017
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, a scaling algorithm for a new moduli set {2 2n+1 +1, 2 2n+1 , 2 2n+1 -1} using the Chinese Remainder Theorem (CRT) is presented. ...
The CRT is further simplified for the selected moduli set to reduce the hardware complexity of the scaling algorithm. ...
In this paper, a scaling algorithm for a new moduli set {2 2n+1 +1, 2 2n+1 , 2 2n+1 -1} is presented. ...
doi:10.5120/ijca2017913974
fatcat:mdmv5vcrqzcavnysqoijdqquhm
Sign Detection and Signed Integer Comparison for the 3-Moduli Set {2^n±1,2^(n+k)}
2021
Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
If efficient circuits are provided for comparison, division and sign detection, the application of RNS can be extended to the cases including these operations.For RNS comparison in the 3-moduli set , we ...
In this paper, an efficient RNS comparator is proposed for the moduli set which employs sign detection method and operates more efficient than its counterparts. ...
Figure 1 . 1 Comparison of power dissipation for simple addition and addition with sign detection
Algorithm 1 : 1 Signed number comparison in moduli set τ 1. ...
doi:10.7494/csci.2021.22.3.3955
fatcat:2qs6wasbu5hglnnq3bgelim37e
A New Efficient Rns Reverse Converter For The 4-Moduli Set
2014
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a new efficient reverse converter for the 4-moduli set {2n, 2n + 1, 2n − 1, 22n+1 – 1} based on a modified Chinese Remainder Theorem and Mixed Radix Conversion. ...
The proposed converter has an area cost of (12n + 2) FAs and (5n + 1) HAs with a delay of (9n + 6)tFA + tMUX. ...
However, RNS has not found a wide spread usage in general purpose computing due to the following difficult RNS arithmetic operations: magnitude comparison, sign detection, overflow detection, moduli selection ...
doi:10.5281/zenodo.1091392
fatcat:a4gs3mf6rbf2pgma3vxsoe3g2a
Efficient VLSI Implementation of $2^{{n}}$ Scaling of Signed Integer in RNS ${\{2^{n}-1, 2^{n},2^{n}+1\}}$
2013
IEEE Transactions on Very Large Scale Integration (vlsi) Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, a fast and area efficient 2 n signed integer RNS scaler for the moduli set {2 n 1, 2 n , 2 n +1} is proposed. ...
Existing signed integer RNS scalers entail a dedicated sign detection circuit, which is as complex as the magnitude scaling operation preceding it. ...
The moduli set selected for a RNS has an influence on its implementation efficiency. Of the known moduli sets, {2 n 1, 2 n , 2 n 1} has been most extensively studied. ...
doi:10.1109/tvlsi.2012.2221752
fatcat:kfd6ap37jjhiflj7ivv5uyrhuq
Efficient MRC-Based Residue to Binary Converters for the New Moduli Sets {22n, 2n-1, 2n+1-1} and {22n, 2n-1, 2n-1-1}
2009
IEICE transactions on information and systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Comparison with the other residue to binary converters for 4n-bit dynamic range moduli sets shown that the presented designs based on new moduli sets {2 2n , 2 n − 1, 2 n+1 − 1} and {2 2n , 2 n − 1, 2 ...
Next, efficient residue to binary converters for the proposed moduli sets based on mixed-radix conversion (MRC) algorithm are presented. ...
Besides, the residue to binary conversion can be used for performing difficult RNS operations such as division, sign detection and magnitude comparison [2] . ...
doi:10.1587/transinf.e92.d.1628
fatcat:fs6k4ai54jfqjatm3em4xay3n4
A General Reverse Converter Architecture with Low Complexity and High Performance
2011
IEICE transactions on information and systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The moduli set {2 α , 2 2β+1 -1, 2 β -1} is free from modulo (2 k +1)-type which can result in an efficient arithmetic unit for residue number system (RNS). ...
Moreover, due to the current importance of the 5n-bit DR moduli sets, we also introduced the moduli set {2 2n , 2 2n+1 -1, 2 n -1} which is a special case of the general set {2 α , 2 2β+1 -1, 2 β -1}, ...
Acknowledgment The authors would like to thank Dr. Belmond Yoberd for his literature contribution. ...
doi:10.1587/transinf.e94.d.264
fatcat:dcj2lr5spfbltp6nkpqxs7qhuq
An improved RNS reverse converter for the {22n+1−1, 2n, 2n−1} moduli set
2010
Proceedings of 2010 IEEE International Symposium on Circuits and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a novel high speed memoryless reverse converter for the moduli set {2 2n+1 − 1, 2 n , 2 n − 1}. ...
The proposed converter has a critical path delay of (7n + 7) Full Adders (FA) while the best state of the art converter for this moduli set requires (10n + 5) FA on the critical path. ...
However, the moduli set {2 n+1 − 1, 2 n , 2 n − 1}, which is able to utilize fast modulo operations, is insufficient for applications requiring larger dynamic ranges. ...
doi:10.1109/iscas.2010.5537062
dblp:conf/iscas/GbolagadeCSC10
fatcat:eu6wdoml6bhwhnmly2e5mv6uzq
A Novel Exploitation of Errors in Redundant Residue Number System Architecture
2021
American Journal of Applied Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
for the detection and correction of multiple bit errors in RNS. ...
The transfer of data in digital channels is very important for some critical applications where accuracy is very important. ...
Acknowledgment The author would like to especially thank anonymous reviewers who took the time to make some necessary inputs. ...
doi:10.3844/ajassp.2021.96.106
fatcat:nwlenrq6pbdlnjmlyk2et3vuk4
« Previous
Showing results 1 — 15 out of 164 results