On the public citation graph

A look-up scheme for scaling in the RNS

0 signed · 38 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.1049/ip-vis:19952323openalex-snapshot
New transform using the Mersenne numbers
inferredcites →https://doi.org/10.1109/12.156545openalex-snapshot
A novel division algorithm for the residue number system
inferredcites →https://doi.org/10.1109/12.403714openalex-snapshot
Integer division in residue number systems
inferredcites →https://doi.org/10.1109/12.57044openalex-snapshot
An algorithm for scaling and single residue error correction in residue number systems
inferredcites →https://doi.org/10.1109/icassp.1998.678178openalex-snapshot
Pipelined Hogenauer CIC filters using field-programmable logic and residue number system
inferredcites →https://doi.org/10.1109/mc.1984.1659138openalex-snapshot
Residue Arithmetic A Tutorial with Examples
inferredcites →https://doi.org/10.1109/tc.1978.1675105openalex-snapshot
Residue Number Scaling and Other Operations Using ROM Arrays

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781119206804.ch6openalex-snapshot
RNS‐Based Arithmetic Circuits and Applications
inferred← citeshttps://doi.org/10.1007/978-1-4615-0997-4_9openalex-snapshot
References
inferred← citeshttps://doi.org/10.1007/978-3-319-41385-3_6openalex-snapshot
Scaling, Base Extension, Sign Detection and Comparison in RNS
inferred← citeshttps://doi.org/10.1007/s00034-016-0336-1openalex-snapshot
Highly Parallel Modular Multiplier for Elliptic Curve Cryptography in Residue Number System
inferred← citeshttps://doi.org/10.1007/s11432-010-0015-yopenalex-snapshot
A 2 n scaling scheme for signed RNS integers and its VLSI implementation
inferred← citeshttps://doi.org/10.1109/access.2017.2766841openalex-snapshot
A Multifunctional Unit for Designing Efficient RNS-Based Datapaths
inferred← citeshttps://doi.org/10.1109/apccas.2012.6419030openalex-snapshot
A unified {2n−1, 2n, 2n+1} RNS scaler with dual scaling constants
inferred← citeshttps://doi.org/10.1109/icecs.2002.1046391openalex-snapshot
A full adder based methodology for scaling operation in residue number system
inferred← citeshttps://doi.org/10.1109/icent.2017.36openalex-snapshot
Fast Power-of-Two RNS Scaling Algorithm for Large Dynamic Ranges
inferred← citeshttps://doi.org/10.1109/iscas.2005.1464785openalex-snapshot
Programmable Power-of-two RNS Scaler and its Application to a QRNS Polyphase Filter
inferred← citeshttps://doi.org/10.1109/iscas.2011.5937842openalex-snapshot
A new RNS scaler for {2n − 1, 2n, 2n + 1}
inferred← citeshttps://doi.org/10.1109/iscas.2013.6572315openalex-snapshot
A signed integer programmable power-of-two scaler for {2n-1, 2n, 2n+1} RNS
inferred← citeshttps://doi.org/10.1109/iscit.2012.6380956openalex-snapshot
An implementation of a scaler in the Residue number System
inferred← citeshttps://doi.org/10.1109/isise.2008.83openalex-snapshot
An Efficient RNS Scaler for Moduli Set
inferred← citeshttps://doi.org/10.1109/nrsc.2001.929397openalex-snapshot
A secure image coding scheme using residue number system
inferred← citeshttps://doi.org/10.1109/tc.2015.2401026openalex-snapshot
$2^n$ RNS Scalers for Extended 4-Moduli Sets
inferred← citeshttps://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)$
inferred← citeshttps://doi.org/10.1109/tcsi.2007.913608openalex-snapshot
A Full-Adder-Based Methodology for the Design of Scaling Operation in Residue Number System
inferred← citeshttps://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\}$
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1109/tvlsi.2003.810799openalex-snapshot
New power-of-2 RNS scaling scheme for cell-based IC design
inferred← citeshttps://doi.org/10.1109/tvlsi.2008.2004550openalex-snapshot
Fast Scaling in the Residue Number System
inferred← citeshttps://doi.org/10.1145/3639631.3639640openalex-snapshot
Non-iterative high-precision RNS scaling based on Core function
inferred← citeshttps://doi.org/10.1360/zf2010-40-6-899openalex-snapshot
一种有符号余数系统2n 缩放方法及VLSI 实现
inferred← citeshttps://doi.org/10.2298/sjee140213026sopenalex-snapshot
Scaling function based on Chinese remainder theorem applied to a recursive filter design
inferred← citeshttps://doi.org/10.32657/10356/59524openalex-snapshot
VLSI efficient RNS scalers and arbitrary modulus residue generators
inferred← citeshttps://doi.org/10.32657/10356/66937openalex-snapshot
New algorithms and VLSI architectures for efficient RNS computations
inferred← citeshttps://doi.org/10.3390/axioms11010005openalex-snapshot
Zero-Aware Low-Precision RNS Scaling Scheme
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}
inferred← citeshttps://doi.org/10.5120/ijca2017913974openalex-snapshot
RNS Scaling Algorithm for a New Moduli Set {2^(2n+1) +1, 2^(2n+1), 2^(2n+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.