On the public citation graph
RNS arithmetic multiplier for medium and large moduli
0 signed · 30 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.1049/el:19800328openalex-snapshot
Practical realisation of mod p , p prime multiplier
inferredcites →https://doi.org/10.1049/el:19920260openalex-snapshot
Single-element-controlled sinusoidal oscillator employing single current conveyor IC
inferredcites →https://doi.org/10.1109/12.250610openalex-snapshot
Design of residue generators and multioperand modular adders using carry-save adders
inferredcites →https://doi.org/10.1109/12.381948openalex-snapshot
Fast combinatorial RNS processors for DSP applications
inferredcites →https://doi.org/10.1109/12.833113openalex-snapshot
New efficient structure for a modular multiplier for RNS
inferredcites →https://doi.org/10.1109/82.136572openalex-snapshot
Fast and flexible architectures for RNS arithmetic decoding
inferredcites →https://doi.org/10.1109/82.204109openalex-snapshot
Novel approaches to the design of VLSI RNS multipliers
inferredcites →https://doi.org/10.1109/82.326592openalex-snapshot
Residue multipliers using factored decomposition
inferredcites →https://doi.org/10.1109/82.475251openalex-snapshot
A systolic architecture for modulo multiplication
inferredcites →https://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)
inferredcites →https://doi.org/10.1109/icecs.1996.584539openalex-snapshot
Semi-custom VLSI design for RNS multipliers using combinational logic approach
inferredcites →https://doi.org/10.1109/iscas.1990.112396openalex-snapshot
Improved cellular structures for bit-steered ROM finite ring systolic arrays
inferredcites →https://doi.org/10.1109/proc.1980.11678openalex-snapshot
A high-speed low-cost modulo Pimultiplier with RNS arithmetic applications
inferredcites →https://doi.org/10.1109/tc.1980.1675473openalex-snapshot
Implementation of Multiplication, Modulo a Prime Number, with Applications to Number Theoretic Transforms
inferredcites →https://doi.org/10.1109/tc.1982.1675999openalex-snapshot
An Autoscale Residue Multiplier
inferredcites →https://doi.org/10.1109/tc.1982.1676036openalex-snapshot
A VLSI Residue Arithmetic Multiplier
inferredcites →https://doi.org/10.1109/tcs.1981.1085027openalex-snapshot
Large moduli multipliers for signal processing
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-030-53651-0_7openalex-snapshot
General Frameworks for Designing Arithmetic Components for Residue Number Systems
inferred← citeshttps://doi.org/10.1007/978-981-16-1089-9_61openalex-snapshot
A Modulo $$(2^n-2^{n-2}-1)$$ Adder Design
inferred← citeshttps://doi.org/10.1007/s11760-021-02097-9openalex-snapshot
Efficient variable-coefficient RNS-FIR filters with no restriction on the moduli set
inferred← citeshttps://doi.org/10.1016/s0167-9260(03)00018-xopenalex-snapshot
An arithmetic residue to binary conversion technique
inferred← citeshttps://doi.org/10.1049/iet-cdt.2017.0088openalex-snapshot
Sign detector for the extended four‐moduli set
inferred← citeshttps://doi.org/10.1080/00207217.2015.1020528openalex-snapshot
Efficient architectures for modulo 2n − 2 arithmetic units
inferred← citeshttps://doi.org/10.1109/arith.2015.9openalex-snapshot
Modulo-(2^n -- 2^q -- 1) Parallel Prefix Addition via Excess-Modulo Encoding of Residues
inferred← citeshttps://doi.org/10.1109/jeeit.2019.8717375openalex-snapshot
A Reverse Converter for Three-Moduli Set (2k, 2n - 1, 2n + 1), k < n
inferred← citeshttps://doi.org/10.1142/s0218126604001970openalex-snapshot
NOVEL DESIGN AND FPGA IMPLEMENTATION OF DA-RNS FIR FILTERS
inferred← citeshttps://doi.org/10.1142/s0218126614500017openalex-snapshot
EFFICIENT METHOD FOR DESIGNING MODULO {2n ± k} MULTIPLIERS
inferred← citeshttps://doi.org/10.3390/computers7030046openalex-snapshot
New Residue Number System Scaler for the Three-Moduli Set {2n+1 − 1, 2n, 2n − 1}
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.