A New Efficient Residue to Binary Converter for (5n+2)-bit Dynamic Range Moduli Set
نویسندگان
چکیده
منابع مشابه
Residue-to-Binary Arithmetic Converter for the Moduli Set
In this paper we investigate residue number system to binary converter algorithms for special moduli sets. A new five moduli set proposed is shown to exhibit high speed forward and reverse conversion properties. The architectures are memoryless and area efficient.
متن کاملAn Efficient Reverse Converter for The New High Dynamic Range 5-Moduli Set
In this paper, an efficient residue to binary converter design for the new high dynamic range moduli set {2-1,2+1,2,2+1,2-1} is presented. The reverse conversion in the four-moduli set {2, 2+1, 2+1, 2-1} has been proposed in literature. Hence, the converters are based on the new moduli set {2-1, (2-1)(2+1)(2+1)2} and propose its residue to binary converter using New Chinese Remainder Theorem 2 ...
متن کاملNew Efficient Reverse Converters for 8n-bit Dynamic Range Moduli Set
This paper proposes two efficient residue to binary converters on a new three-moduli set{2^2n-1,2^4n,2^2n+1} using the Chinese Remainder Theorem. The proposed reverseconverters are adder based and memoryless. In comparison with other moduli sets with similardynamic range, the new schemes out-perform the existing schemes in terms of both hardwarecost and relative performance....
متن کاملAn Efficient RNS to Binary Converter Using the Moduli Set
In this paper, we investigate Residue Number System (RNS) to decimal conversion which is an important issue concerning the utilization of RNS numbers in Digital Signal Processing (DSP) applications. We propose a reverse converter using the moduli set {2n+1, 2n, 2n−1}. First, we show that this converter does not require the computation of multiplicative inverses. Next, we simplify the Chinese Re...
متن کاملA New Efficient Fpga Design of Residue-to-binary Converter
In this paper, we introduce a new 6n bit Dynamic Range Moduli set { 2 2n , 2 2n + 1, 2 2n – 1} and then present its associated novel reverse converters. First, we simplify the Chinese Remainder Theorem in order to obtain an efficient reverse converter which is completely memory less and adder based. Next, we present a low complexity implementation that does not require the explicit use of modul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2018
ISSN: 0975-8887
DOI: 10.5120/ijca2018916726