On the public citation graph

Binary-to-RNS Conversion Units for moduli {2^n ± 3}

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/j.aeue.2007.08.008openalex-snapshot
New reverse converters for the moduli set
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/82.475251openalex-snapshot
A systolic architecture for modulo multiplication
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/dsd.2010.77openalex-snapshot
Arithmetic Units for RNS Moduli {2n-3} and {2n+3} Operations
inferredcites →https://doi.org/10.1109/tcsii.2002.1002515openalex-snapshot
A formal framework for conversion from binary to residue numbers
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.2005.857090openalex-snapshot
Improved memoryless RNS forward converter based on the periodicity of residues
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/tsp.2002.1011216openalex-snapshot
Adder based residue to binary number converters for (2/sup n/-1, 2/sup n/, 2/sup n/+1)
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
inferredcites →https://doi.org/10.3929/ethz-a-001912749openalex-snapshot
Binary adder architectures for cell-based VLSI and their synthesis
inferredcites →https://doi.org/10.4324/9780203864760-20openalex-snapshot
ADDITION AND MULTIPLICATION

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-41385-3_3openalex-snapshot
Binary to Residue Conversion
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.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/asap.2013.6567565openalex-snapshot
A compact and scalable RNS architecture
inferred← citeshttps://doi.org/10.1109/cads.2013.6714234openalex-snapshot
Improved modulo-(2n ± 3) multipliers
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/lascas.2017.7948058openalex-snapshot
Design of residue generators with CLA/compressor trees and multi-bit EAC
inferred← citeshttps://doi.org/10.1109/patmos.2014.6951866openalex-snapshot
A unique network EDA tool to create optimized ad hoc binary to residue number system converters
inferred← citeshttps://doi.org/10.1109/tcsi.2019.2959638openalex-snapshot
Balanced $(3+2\log n)\Delta G$ Adders for Moduli Set $\{{2}^{n+1},2^{n}+2^{n-1}-1,2^{n+1}-1\}$
inferred← citeshttps://doi.org/10.1145/2645791.2645815openalex-snapshot
Designing optimized forward residue number systems IP blocks converters from a network interface
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.7494/csci.2021.22.1.3823openalex-snapshot
A Multifunctional Unit For Reverse Conversion and Sign Detection Based on The 5-Moduli Set
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.