On the public citation graph
Arithmetic Units for RNS Moduli {2n-3} and {2n+3} Operations
0 signed · 36 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/j.camwa.2007.04.028openalex-snapshot
A new high dynamic range moduli set with efficient reverse converter
inferredcites →https://doi.org/10.1049/el:20056837openalex-snapshot
Power-delay-area efficient modulo 2 n +1 adder architecture for RNS
inferredcites →https://doi.org/10.1049/iet-cdt:20060026openalex-snapshot
Design of efficient modulo 2 n +1 multipliers
inferredcites →https://doi.org/10.1049/ip-cdt:20050166openalex-snapshot
Efficient new approach for modulo 2n−1 addition in RNS
inferredcites →https://doi.org/10.1109/arith.1999.762841openalex-snapshot
Efficient VLSI implementation of modulo (2/sup n/±1) addition and multiplication
inferredcites →https://doi.org/10.1109/dsd.2004.1333279openalex-snapshot
{2/sup n/ + 1, 2/sup n+k/, 2/sup n/ - 1} : a new RNS moduli set extension
inferredcites →https://doi.org/10.1109/tcsi.2005.849143openalex-snapshot
A universal architecture for designing efficient modulo 2/sup n/+1 multipliers
inferredcites →https://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)
inferredcites →https://doi.org/10.1109/tcsii.2008.2010157openalex-snapshot
A Generalization of a Fast RNS Conversion for a New 4-Modulus Base
inferredcites →https://doi.org/10.1142/9781860948671openalex-snapshot
Residue Number Systems - Theory and Implementation
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-319-49742-6_2openalex-snapshot
RNS-Based Embedded Processor Design
inferred← citeshttps://doi.org/10.1007/978-981-15-8289-9_58openalex-snapshot
Implementation of Arithmetic Unit for RNS Using 2n + 3 as Base
inferred← citeshttps://doi.org/10.1007/s11265-014-0875-2openalex-snapshot
An Efficient Scalable RNS Architecture for Large Dynamic Ranges
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.1049/iet-cds.2017.0470openalex-snapshot
General modular adder designs for residue number system applications
inferred← citeshttps://doi.org/10.1049/iet-cdt.2012.0148openalex-snapshot
A ROM‐less reverse RNS converter for moduli set {2 q ± 1, 2 q ± 3}
inferred← citeshttps://doi.org/10.1080/09747338.2015.1115378openalex-snapshot
Reverse Converters for the Moduli Set {2n+1−3, 2n−1, 2n−1−1}
inferred← citeshttps://doi.org/10.1109/acssc.2018.8645523openalex-snapshot
High-Performance Multiplication Modulo 2n – 3
inferred← citeshttps://doi.org/10.1109/arith.2019.00035openalex-snapshot
Modulo-(2n+3) Parallel Prefix Addition via Diminished-3 Representation of Residues
inferred← citeshttps://doi.org/10.1109/arith58626.2023.00023openalex-snapshot
Modulo-(2q − 3) Multiplication with Fully Modular Partial Product Generation and Reduction
inferred← citeshttps://doi.org/10.1109/asap.2013.6567565openalex-snapshot
A compact and scalable RNS architecture
inferred← citeshttps://doi.org/10.1109/dexa.2017.46openalex-snapshot
Unfairness Correction in P2P Grids Based on Residue Number System of a Special Form
inferred← citeshttps://doi.org/10.1109/dsd.2011.65openalex-snapshot
Binary-to-RNS Conversion Units for moduli {2^n ± 3}
inferred← citeshttps://doi.org/10.1109/dsd.2012.114openalex-snapshot
RNS Arithmetic Units for Modulo {2^n+-k}
inferred← citeshttps://doi.org/10.1109/iccci.2012.6158921openalex-snapshot
A novel high dynamic range 4-module set {22n+1, 22n + 1, 2n + 1, 2n − 1} whit efficient reverse converter and review improving modular multiplication's dynamic range with this module set
inferred← citeshttps://doi.org/10.1109/iceeccot43722.2018.9001339openalex-snapshot
Design of Arithmetic unit for RNS using 2n-3 as Base
inferred← citeshttps://doi.org/10.1109/isicir.2014.7029521openalex-snapshot
ROM-less RNS-to-binary converter moduli {22n − 1, 22n + 1, 2n − 3, 2n + 3}
inferred← citeshttps://doi.org/10.1109/isvlsi65124.2025.11130342openalex-snapshot
Efficient modulo 2n–4 arithmetic units
inferred← citeshttps://doi.org/10.1109/tc.2021.3086071openalex-snapshot
Up to 8k-bit Modular Montgomery Multiplication in Residue Number Systems with Fast 16-bit Residue Channels
inferred← citeshttps://doi.org/10.1109/tcsi.2013.2252639openalex-snapshot
A Novel Modulo $2^{n}-2^{k}-1$ Adder for Residue Number System
inferred← citeshttps://doi.org/10.1109/tencon.2017.8228211openalex-snapshot
New modulo multipliers using residue signed-digit adders
inferred← citeshttps://doi.org/10.1109/tetc.2026.3689523openalex-snapshot
A 22-nm 4.92 TOPS/W End-to-End RNS DNN Accelerator for Edge-AI Devices
inferred← citeshttps://doi.org/10.22436/jmcs.012.01.05openalex-snapshot
Efficient Implementation Of Rns Montgomery Multiplication Using Balanced Rns Bases
inferred← citeshttps://doi.org/10.2991/emcs-16.2016.500openalex-snapshot
High-speed and High-efficient Modulo (2n-3) Multipliers
inferred← citeshttps://doi.org/10.35940/ijitee.b1017.1292s19openalex-snapshot
Implementation of Arithmetic unit for RNS using 2n-3 as Base
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.