On the public citation graph

An efficient residue to binary converter design

0 signed · 74 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1109/31.7577openalex-snapshot
Residue to binary conversion for RNS arithmetic using only modular look-up tables
inferredcites →https://doi.org/10.1109/proc.1984.12937openalex-snapshot
Digital optical computing
inferredcites →https://doi.org/10.1109/proc.1985.13154openalex-snapshot
A new residue to decimal converter
inferredcites →https://doi.org/10.1109/tcs.1978.1084495openalex-snapshot
Techniques for residue-to-analog conversion for residue-encoded digital filters
inferredcites →https://doi.org/10.1109/tcs.1981.1084942openalex-snapshot
An efficient residue-to-decimal converter
inferredcites →https://doi.org/10.1109/tcs.1983.1085311openalex-snapshot
An improved residue number system digital-to-analog converter

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781119206804.ch6openalex-snapshot
RNS‐Based Arithmetic Circuits and Applications
inferred← citeshttps://doi.org/10.1002/cta.3594openalex-snapshot
RNS processor using moduli sets of the form 2n±1
inferred← citeshttps://doi.org/10.1007/978-1-4615-0997-4_9openalex-snapshot
References
inferred← citeshttps://doi.org/10.1007/978-3-319-41385-3_5openalex-snapshot
RNS to Binary Conversion
inferred← citeshttps://doi.org/10.1007/978-3-319-49742-6_3openalex-snapshot
Non-Modular Operations of the Residue Number System: Functions for Computing
inferred← citeshttps://doi.org/10.1007/978-3-540-24709-8_23openalex-snapshot
Multiplier with Parallel CSA using CRT’s Specific Moduli (2 k -1, 2 k , 2 k +1)
inferred← citeshttps://doi.org/10.1007/s00034-006-0219-yopenalex-snapshot
Reverse Converters for a New Moduli Set {22n − 1, 2n, 22n + 1}
inferred← citeshttps://doi.org/10.1007/s00034-016-0354-zopenalex-snapshot
Sign Detection and Number Comparison on RNS 3-Moduli Sets $$\{2^n-1, 2^{n+x}, 2^n+1\}$$ { 2 n - 1 , 2 n + x , 2 n + 1 }
inferred← citeshttps://doi.org/10.1007/s00034-018-0756-1openalex-snapshot
Designing Efficient Two-Level Reverse Converters for Moduli Set $$\{2^{2n+1}-1,2^{2n},2^{n}-1\}$$ { 2 2 n + 1 - 1 , 2 2 n , 2 n - 1 }
inferred← citeshttps://doi.org/10.1007/s11265-017-1238-6openalex-snapshot
Design of RNS Reverse Converters with Constant Shifting to Residue Datapath Channels
inferred← citeshttps://doi.org/10.1016/0165-1684(95)00092-2openalex-snapshot
Novel RNS structures for the moduli set (2n − 1, 2n, 2n + 1) and their application to digital filter implementation
inferred← citeshttps://doi.org/10.1016/j.aeue.2007.08.008openalex-snapshot
New reverse converters for the moduli set
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00077-6openalex-snapshot
On the optimal utilization of all available states in the moduli set
inferred← citeshttps://doi.org/10.1016/s0898-1221(02)00280-8openalex-snapshot
Four-moduli set (2, 2n−1, 2n+2n−1−1, 2n+1+2n−1) simplies the residue to binary converters based on CRT II
inferred← citeshttps://doi.org/10.1016/s0898-1221(03)90191-xopenalex-snapshot
RNS sign detector based on chinese remainder theorem II (CRT II)
inferred← citeshttps://doi.org/10.1016/s1383-7621(03)00062-6openalex-snapshot
Residue number system to binary converter for the moduli set (2n−1,2n−1,2n+1)
inferred← citeshttps://doi.org/10.1049/el:19940566openalex-snapshot
Selection of basesfor a residue number system
inferred← citeshttps://doi.org/10.1049/ip-cdt:20040033openalex-snapshot
Residue-to-binary decoder for an enhanced moduli set
inferred← citeshttps://doi.org/10.1049/ip-g-2.1993.0042openalex-snapshot
New designs for a sign detector and a residue to binary convertor
inferred← citeshttps://doi.org/10.1080/09747338.2003.12088395openalex-snapshot
Residue Number Systems — A Tutorial Review
inferred← citeshttps://doi.org/10.1080/10655140290010097openalex-snapshot
A Parallel Residue‐to‐binary Converter for the Moduli Set {2m−1111,220m+,221m+,…,22km+}
inferred← citeshttps://doi.org/10.1109/12.628400openalex-snapshot
A signed-digit architecture for residue to binary transformation
inferred← citeshttps://doi.org/10.1109/12.795127openalex-snapshot
Fast converter for 3 moduli RNS using new property of CRT
inferred← citeshttps://doi.org/10.1109/31.55048openalex-snapshot
Adaptive equalization using the backpropagation algorithm
inferred← citeshttps://doi.org/10.1109/81.340862openalex-snapshot
Fast conversion techniques for binary-residue number systems
inferred← citeshttps://doi.org/10.1109/81.721268openalex-snapshot
Breaking the 2n-bit carry propagation barrier in residue to binary conversion for the [2/sup n/-1, 2/sup n/, 2/sup n/+1] modula set
inferred← citeshttps://doi.org/10.1109/81.883337openalex-snapshot
Adaptive control of uncertain Chua's circuits
inferred← citeshttps://doi.org/10.1109/81.883343openalex-snapshot
An improved residue-to-binary converter
inferred← citeshttps://doi.org/10.1109/82.136572openalex-snapshot
Fast and flexible architectures for RNS arithmetic decoding
inferred← citeshttps://doi.org/10.1109/82.160172openalex-snapshot
An RNS to binary converter in 2n+1, 2n, 2n-1 moduli set
inferred← citeshttps://doi.org/10.1109/82.300194openalex-snapshot
A preprocessing architecture for resolution enhancement in high-speed analog-to-digital converters
inferred← citeshttps://doi.org/10.1109/82.378047openalex-snapshot
An RNS to binary converter in a three moduli set with common factors
inferred← citeshttps://doi.org/10.1109/82.471401openalex-snapshot
A high-speed realization of a residue to binary number system converter
inferred← citeshttps://doi.org/10.1109/82.559370openalex-snapshot
The digit parallel method for fast RNS to weighted number system conversion for specific moduli (2/sup k/-1,2/sup k/,2/sup k/+1)
inferred← citeshttps://doi.org/10.1109/82.661651openalex-snapshot
Residue-to-binary arithmetic converter for the moduli set (2/sup k/, 2/sup k/-1, 2/sup k-1/-1)
inferred← citeshttps://doi.org/10.1109/82.700943openalex-snapshot
High-speed and low-cost reverse converters for the (2n-1, 2n, 2n+1) moduli set
inferred← citeshttps://doi.org/10.1109/82.826745openalex-snapshot
Residue-to-binary converters based on new Chinese remainder theorems
inferred← citeshttps://doi.org/10.1109/acssc.1996.600859openalex-snapshot
Choosing the system moduli of RNS arithmetic processors
inferred← citeshttps://doi.org/10.1109/acssc.1998.750847openalex-snapshot
New Chinese remainder theorems
inferred← citeshttps://doi.org/10.1109/arith.1989.72827openalex-snapshot
theta (logN) architectures for RNS arithmetic decoding
inferred← citeshttps://doi.org/10.1109/arith.1997.614901openalex-snapshot
Design and implementation of an RNS division algorithm
inferred← citeshttps://doi.org/10.1109/arith.1999.762842openalex-snapshot
A reverse converter for the 4-moduli superset {2/sup n/-1, 2/sup n/, 2/sup n/+1, 2/sup n+1/+1}
inferred← citeshttps://doi.org/10.1109/ccece.1999.807251openalex-snapshot
A comprehensive study of three moduli sets for residue arithmetic
inferred← citeshttps://doi.org/10.1109/fccm.2015.38openalex-snapshot
Optimizing Residue Number Reverse Converters through Bitwise Arithmetic on FPGAs
inferred← citeshttps://doi.org/10.1109/glsv.1998.665221openalex-snapshot
Residue to binary number converters for (2/sup n/-1, 2/sup n/, 2/sup n/+1)
inferred← citeshttps://doi.org/10.1109/glsv.1998.665223openalex-snapshot
An efficient residue to weighted converter for a new residue number system
inferred← citeshttps://doi.org/10.1109/icassp.1994.389619openalex-snapshot
A novel efficient parallel algorithm for RNS to binary conversion for arbitrary moduli set
inferred← citeshttps://doi.org/10.1109/icassp.1999.756279openalex-snapshot
A parallel residue-to-binary converter
inferred← citeshttps://doi.org/10.1109/icccas.2004.1346305openalex-snapshot
An efficient algorithm and implementation for residue to binary number conversion
inferred← citeshttps://doi.org/10.1109/icecs.1999.813388openalex-snapshot
New area efficient residue-to-weighted number system converters
inferred← citeshttps://doi.org/10.1109/iscas.1989.100326openalex-snapshot
A fast and flexible residue decoder based on the Chinese remainder theorem
inferred← citeshttps://doi.org/10.1109/iscas.1991.176670openalex-snapshot
Novel RNS to binary converters
inferred← citeshttps://doi.org/10.1109/iscas.1994.408977openalex-snapshot
Intermediate signed-digit stage to perform residue to binary transformations based on CRT
inferred← citeshttps://doi.org/10.1109/mwscas.1995.510330openalex-snapshot
An algorithm for the design of a residue-to-binary converter
inferred← citeshttps://doi.org/10.1109/mwscas.1996.593166openalex-snapshot
An efficient 3-modulus residue to binary converter
inferred← citeshttps://doi.org/10.1109/mwscas.1999.867826openalex-snapshot
Fast residue-to-binary converter architectures
inferred← citeshttps://doi.org/10.1109/ssst.1990.138222openalex-snapshot
Digital-parallel residue-binary conversion
inferred← citeshttps://doi.org/10.1109/tc.2008.126openalex-snapshot
The Mixed-Radix Chinese Remainder Theorem and Its Applications to Residue Comparison
inferred← citeshttps://doi.org/10.1109/tcsi.2002.808191openalex-snapshot
A study of the residue-to-binary converters for the three-moduli sets
inferred← citeshttps://doi.org/10.1109/tcsi.2007.895515openalex-snapshot
RNS-to-Binary Converters for Two Four-Moduli Sets $\{2^{n}-1,2^{n},2^{n}+1,2^{{n}+1}-1\}$ and $\{2^{n}-1,2^{n},2^{n}+1,2^{{n}+1}+1\}$
inferred← citeshttps://doi.org/10.1109/tcsi.2008.917994openalex-snapshot
Fast Sign Detection for RNS $(2^{n}-1,2^{n},2^{n}+1)$
inferred← citeshttps://doi.org/10.1109/tcsii.2003.814808openalex-snapshot
Residue-to-binary conversion by the "quotient function"
inferred← citeshttps://doi.org/10.1109/tcsii.2003.814810openalex-snapshot
Comments on "2-D FIR filters design using least square error with scaling-free McClellan transformation"
inferred← citeshttps://doi.org/10.1109/tsp.2002.1011216openalex-snapshot
Adder based residue to binary number converters for (2/sup n/-1, 2/sup n/, 2/sup n/+1)
inferred← citeshttps://doi.org/10.1142/s0218126619501263openalex-snapshot
A Residue-to-Binary Converter with an Adjustable Structure for an Extended RNS Three-Moduli Set
inferred← citeshttps://doi.org/10.32657/10356/2379openalex-snapshot
VLSI efficient architectures for triple moduli based RNS computations
inferred← citeshttps://doi.org/10.3844/ajassp.2021.96.106openalex-snapshot
A Novel Exploitation of Errors in Redundant Residue Number System Architecture
inferred← citeshttps://doi.org/10.5120/14938-2906openalex-snapshot
RNS Overflow Detection by Operands Examination
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.