On the public citation graph

New Residue Number System Scaler for the Three-Moduli Set {2n+1 − 1, 2n, 2n − 1}

0 signed · 27 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/s1383-7621(03)00062-6openalex-snapshot
Residue number system to binary converter for the moduli set (2n−1,2n−1,2n+1)
inferredcites →https://doi.org/10.1049/ip-cds:19982396openalex-snapshot
Efficient digital sweep oscillator with extremely low sweep rates
inferredcites →https://doi.org/10.1093/comjnl/47.1.93openalex-snapshot
A Suggestion for a Fast Residue Multiplier for a Family of Moduli of the Form (2n - (2p 1))
inferredcites →https://doi.org/10.1109/12.863036openalex-snapshot
High-speed parallel-prefix module 2/sup n/-1 adders
inferredcites →https://doi.org/10.1109/82.868463openalex-snapshot
RNS arithmetic multiplier for medium and large moduli
inferredcites →https://doi.org/10.1109/arith.1997.614901openalex-snapshot
Design and implementation of an RNS division algorithm
inferredcites →https://doi.org/10.1109/mcas.2016.2614714openalex-snapshot
Combining Residue Arithmetic to Design Efficient Cryptographic Circuits and Systems
inferredcites →https://doi.org/10.1109/mwscas.1994.519272openalex-snapshot
Design and implementation of a fast and compact residue-based semi-custom VLSI arithmetic chip
inferredcites →https://doi.org/10.1109/tc.2002.1146705openalex-snapshot
Diminished-one modulo 2/sup n/+1 adder design
inferredcites →https://doi.org/10.1109/tc.2015.2401026openalex-snapshot
$2^n$ RNS Scalers for Extended 4-Moduli Sets
inferredcites →https://doi.org/10.1109/tc.2017.2652474openalex-snapshot
Efficient RNS Scalers for the Extended Three-Moduli Set $(2^{n}-1, 2^{n+p}, 2^{n}+1)$
inferredcites →https://doi.org/10.1109/tcsi.2011.2142950openalex-snapshot
Simple, Fast, and Exact RNS Scaler for the Three-Moduli Set $\{2^{n} - 1, 2^{n}, 2^{n} + 1\}$
inferredcites →https://doi.org/10.1109/tcsi.2012.2185334openalex-snapshot
Area-Power Efficient Modulo $2^{n}-1$ and Modulo $2^{n}+1$ Multipliers for $\{2^{n}-1, 2^{n}, 2^{n}+1\}$ Based RNS
inferredcites →https://doi.org/10.1109/tcsi.2012.2206491openalex-snapshot
A VLSI Efficient Programmable Power-of-Two Scaler for $\{2^{n}-1,2^{n},2^{n}+1\}$ RNS
inferredcites →https://doi.org/10.1109/tvlsi.2012.2210916openalex-snapshot
Efficient RNS Implementation of Elliptic Curve Point Multiplication Over ${\rm GF}(p)$
inferredcites →https://doi.org/10.1109/tvlsi.2012.2221752openalex-snapshot
Efficient VLSI Implementation of $2^{{n}}$ Scaling of Signed Integer in RNS ${\{2^{n}-1, 2^{n},2^{n}+1\}}$
inferredcites →https://doi.org/10.1587/elex.13.20160090openalex-snapshot
New adaptable three-moduli set {2n+k, 2n − 1, 2n−1 − 1} for residue number system-based finite impulse response 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-030-53651-0_7openalex-snapshot
General Frameworks for Designing Arithmetic Components for Residue Number Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-34127-4_37openalex-snapshot
Improving the Parallelism and Balance of RNS with Low-Cost and $$2^{{\varvec{k}}} + 1$$ Modules
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.1016/j.compeleceng.2022.108102openalex-snapshot
An arithmetic scaler circuit design for the expanded four-moduli set {2k−1,2k+1,22k+1,22k}
inferred← citeshttps://doi.org/10.1109/access.2024.3381493openalex-snapshot
Modern Trends in Improving the Technical Characteristics of Devices and Systems for Digital Image Processing
inferred← citeshttps://doi.org/10.1109/icics49469.2020.239547openalex-snapshot
A New Scaler for the Expanded 4-Moduli Set {2 k − 1, 2 k + 1, 2 2k + 1, 2 2k }
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/s0218126620500413openalex-snapshot
A Scaler Design for the RNS Three-Moduli Set {2n+1−1,2n,2n−1} Based on Mixed-Radix Conversion
inferred← citeshttps://doi.org/10.3390/e24121824openalex-snapshot
An Efficient CRT-Base Power-of-Two Scaling in Minimally Redundant Residue Number System
inferred← citeshttps://doi.org/10.4218/etrij.2018-0408openalex-snapshot
Efficient programmable power‐of‐two scaler for the three‐moduli set {2 n + p , 2 n − 1, 2 n +1 − 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.