On the public citation graph
A signed-digit architecture for residue to binary transformation
0 signed · 44 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0165-6074(87)90113-xopenalex-snapshot
Residue arithmetic for a fault-tolerant multiplier: The choice of the best triple of bases
inferredcites →https://doi.org/10.1049/ip-cds:19941391openalex-snapshot
Simple binary to residue transformation with respect to 2m+1 moduli
inferredcites →https://doi.org/10.1049/ip-g-2.1992.0096openalex-snapshot
Efficient convertors for residue and quadratic-residue number systems
inferredcites →https://doi.org/10.1109/31.14470openalex-snapshot
A new efficient memoryless residue to binary converter
inferredcites →https://doi.org/10.1109/31.7576openalex-snapshot
An efficient residue to binary converter design
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/82.136572openalex-snapshot
Fast and flexible architectures for RNS arithmetic decoding
inferredcites →https://doi.org/10.1109/arith.1991.145540openalex-snapshot
Design of residue generators and multioperand modular adders using carry-save adders
inferredcites →https://doi.org/10.1109/iscas.1991.176670openalex-snapshot
Novel RNS to binary converters
inferredcites →https://doi.org/10.1109/iscas.1994.408968openalex-snapshot
Modulo-free architecture for binary to residue transformation with respect to
inferredcites →https://doi.org/10.1109/iscas.1994.408977openalex-snapshot
Intermediate signed-digit stage to perform residue to binary transformations based on CRT
inferredcites →https://doi.org/10.1109/tec.1961.5219227openalex-snapshot
Signed-Digit Numbe Representations for Fast Parallel Arithmetic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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.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.1049/ip-cdt:20030060openalex-snapshot
Efficient residue to binary converter
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.980018openalex-snapshot
High-speed and reduced-area modular adder structures for RNS
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/82.899659openalex-snapshot
A high-speed residue-to-binary converter for three-moduli (2/sup k/, 2/sup k/-1, 2/sup k-1/-1) RNS and a scheme for its VLSI implementation
inferred← citeshttps://doi.org/10.1109/acssc.1998.750847openalex-snapshot
New Chinese remainder theorems
inferred← citeshttps://doi.org/10.1109/acssc.2001.987765openalex-snapshot
RNS representations with redundant residues
inferred← citeshttps://doi.org/10.1109/apccas.2006.342285openalex-snapshot
Efficient VLSI Design for RNS Reverse Converter Based on New Moduli Set (2n¿1, 2n+1, 22n+1)
inferred← citeshttps://doi.org/10.1109/apsipa.2016.7820790openalex-snapshot
Algorithms for comparison in residue number systems
inferred← citeshttps://doi.org/10.1109/arith.2001.930104openalex-snapshot
Modular multiplication and base extensions in residue number systems
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/ccece.1999.807262openalex-snapshot
The applications of the new Chinese Remainder Theorems for three moduli sets
inferred← citeshttps://doi.org/10.1109/ewdts.2010.5742068openalex-snapshot
A novel high speed residue to binary converter design based on the three-moduli set {2n, 2n+1+1, 2n+1−1}
inferred← citeshttps://doi.org/10.1109/icassp.1999.756279openalex-snapshot
A parallel residue-to-binary converter
inferred← citeshttps://doi.org/10.1109/iccae.2010.5451409openalex-snapshot
A novel generic three-moduli set and its optimum arithmetic residue to binary converters
inferred← citeshttps://doi.org/10.1109/icccas.2009.5250359openalex-snapshot
A New efficient RNS-to-binary conversion for the three-moduli sets
inferred← citeshttps://doi.org/10.1109/icectech.2011.5941804openalex-snapshot
A novel design approach for low pass finite impulse response filter based on residue number system
inferred← citeshttps://doi.org/10.1109/iscas.1999.780162openalex-snapshot
A high-speed residue-to-binary converter and a scheme for its VLSI implementation
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/tcsii.2002.1013871openalex-snapshot
A note on "A high-speed residue-to-binary converter for three-moduli (2/sup k/ 2/sup k/ - 1, 2/sup k-1/ - 1) RNS and a scheme for its VLSI implementation"
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/tcsii.2003.821516openalex-snapshot
An efficient VLSI design for a residue to binary converter for general balance moduli (2/sup n/-3,2/sup n/+1,2/sup n/-1,2/sup n/+3)
inferred← citeshttps://doi.org/10.1109/tvlsi.2004.840400openalex-snapshot
VLSI implementation of new arithmetic residue to binary decoders
inferred← citeshttps://doi.org/10.1109/upcon47278.2019.8980166openalex-snapshot
Efficient Design for High Speed and Low Area Reverse Converter for Moduli Set $\{2^{n}, 2^{2n}-1,2^{2n}\{1\}$
inferred← citeshttps://doi.org/10.1142/s0218126604001970openalex-snapshot
NOVEL DESIGN AND FPGA IMPLEMENTATION OF DA-RNS FIR FILTERS
inferred← citeshttps://doi.org/10.1145/1973009.1973038openalex-snapshot
A new balanced 4-moduli set {2 k , 2 n - 1, 2 n + 1, 2 n+1 -1} and its reverse converter design for efficient fir filter implementation
inferred← citeshttps://doi.org/10.2298/fuee0901125sopenalex-snapshot
Digital FIR filter architecture based on the residue number system
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.