On the public citation graph

RNS Arithmetic Units for Modulo {2^n+-k}

0 signed · 32 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.1016/j.camwa.2007.04.028openalex-snapshot
A new high dynamic range moduli set with efficient reverse converter
inferredcites →https://doi.org/10.1049/cp:20080692openalex-snapshot
Design of residue multipliers-accumulators using periodicity
inferredcites →https://doi.org/10.1049/el:19960026openalex-snapshot
Designing multioperand modular adders
inferredcites →https://doi.org/10.1109/82.958337openalex-snapshot
A low-complexity combinatorial RNS multiplier
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.2010.77openalex-snapshot
Arithmetic Units for RNS Moduli {2n-3} and {2n+3} Operations
inferredcites →https://doi.org/10.1109/glsv.1998.665223openalex-snapshot
An efficient residue to weighted converter for a new residue number system
inferredcites →https://doi.org/10.1109/ictta.2006.1684856openalex-snapshot
New Design of RNS Subtractor for modulo 2>sup /sup<+ 1
inferredcites →https://doi.org/10.1109/mcas.2004.1286980openalex-snapshot
Video coding with H.264/AVC: tools, performance, and complexity
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.1109/tvlsi.2004.840400openalex-snapshot
VLSI implementation of new arithmetic residue to binary decoders
inferredcites →https://doi.org/10.1142/9781860948671openalex-snapshot
Residue Number Systems - Theory and Implementation
inferredcites →https://doi.org/10.1142/p523openalex-snapshot
Residue Number Systems

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cta.70432openalex-snapshot
Scalable Reverse Converters for the Moduli Set {2n+1−1,2n−1,2n−1−1} (n Even)
inferred← citeshttps://doi.org/10.1007/978-3-319-49742-6_2openalex-snapshot
RNS-Based Embedded Processor Design
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/s40009-024-01414-3openalex-snapshot
Area and Power Modeling of Mod ($${2}^{\mathbf{n}}-\mathbf{K}$$) Adder Structure for 6-Input Lookup Table Based FPGAs
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.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/arith64983.2025.00023openalex-snapshot
A Generic Modulo- $(2^{n}\pm\delta)$ Addition Algorithm via Two-Valued Digit Encoding
inferred← citeshttps://doi.org/10.1109/asap.2013.6567565openalex-snapshot
A compact and scalable RNS architecture
inferred← citeshttps://doi.org/10.1109/eurocon.2013.6625222openalex-snapshot
Modulo 2n−2 arithmetic units
inferred← citeshttps://doi.org/10.1109/icsc53193.2021.9673363openalex-snapshot
Design and Implementation of Area-Power Efficient Generic Modular Adder using Flagged Prefix Addition Approach
inferred← citeshttps://doi.org/10.1109/iscas.2015.7168568openalex-snapshot
A new unified modular adder/subtractor for arbitrary moduli
inferred← citeshttps://doi.org/10.1109/isvlsi65124.2025.11130342openalex-snapshot
Efficient modulo 2n–4 arithmetic units
inferred← citeshttps://doi.org/10.1109/tcsi.2016.2612723openalex-snapshot
A Reverse Converter and Sign Detectors for an Extended RNS Five-Moduli Set
inferred← citeshttps://doi.org/10.1109/tcsii.2013.2286433openalex-snapshot
Method to Design General RNS Reverse Converters for Extended Moduli Sets
inferred← citeshttps://doi.org/10.1109/tvlsi.2014.2314174openalex-snapshot
Arithmetic-Based Binary-to-RNS Converter Modulo ${\{2^{n}{\pm}k\}}$ for $jn$ -bit Dynamic Range
inferred← citeshttps://doi.org/10.1109/tvlsi.2017.2681758openalex-snapshot
A Residue-to-Binary Converter for the Extended Four-Moduli Set $\{2^{n}-1, 2^{n}+1, 2^{2n}+1, 2^{2n+p}\} $
inferred← citeshttps://doi.org/10.18280/isi.280514openalex-snapshot
Performance Analysis of a Generic Modular Adder via RTL Programming and IP Modeling Techniques on FPGA
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.