On the public citation graph

Modulo-(2^n -- 2^q -- 1) Parallel Prefix Addition via Excess-Modulo Encoding of Residues

0 signed · 34 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.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.250610openalex-snapshot
Design of residue generators and multioperand modular adders using carry-save adders
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/12.980018openalex-snapshot
High-speed and reduced-area modular adder structures for RNS
inferredcites →https://doi.org/10.1109/82.142036openalex-snapshot
VLSI implementation of residue adders based on binary adders
inferredcites →https://doi.org/10.1109/82.868463openalex-snapshot
RNS arithmetic multiplier for medium and large moduli
inferredcites →https://doi.org/10.1109/acssc.2003.1292373openalex-snapshot
A taxonomy of parallel prefix networks
inferredcites →https://doi.org/10.1109/acssc.2007.4487461openalex-snapshot
Residue Number System for Low-Power DSP Applications
inferredcites →https://doi.org/10.1109/acssc.2011.6189975openalex-snapshot
On building general modular adders from standard binary arithmetic components
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/arith.2009.20openalex-snapshot
Selected RNS Bases for Modular Multiplication
inferredcites →https://doi.org/10.1109/iccd.1994.331962openalex-snapshot
Design of high-speed residue-to-binary number system converter based on Chinese Remainder Theorem
inferredcites →https://doi.org/10.1109/iscas.2001.921068openalex-snapshot
Tradeoffs between residue number system and traditional FIR filters
inferredcites →https://doi.org/10.1109/iscas.2011.5937843openalex-snapshot
Design of multi-residue generators using shared logic
inferredcites →https://doi.org/10.1109/islped.2011.5993671openalex-snapshot
Fast and energy-efficient constant-coefficient FIR filters using residue number system
inferredcites →https://doi.org/10.1109/tc.2007.1001openalex-snapshot
Fast Modulo 2^{n} - (2^{n - 2} + 1) Addition: A New Class of Adder for RNS
inferredcites →https://doi.org/10.1109/tc.2007.70750openalex-snapshot
Fast Parallel-Prefix Architectures for Modulo 2n-1 Addition with a Single Representation of Zero
inferredcites →https://doi.org/10.1109/tcs.1987.1086130openalex-snapshot
A VLSI implementation of residue adders
inferredcites →https://doi.org/10.1109/tcsi.2007.895369openalex-snapshot
Novel Power-Delay-Area-Efficient Approach to Generic Modular Addition
inferredcites →https://doi.org/10.1109/tcsi.2013.2246211openalex-snapshot
A New Approach to the Design of Efficient Residue Generators for Arbitrary Moduli
inferredcites →https://doi.org/10.1109/tcsi.2013.2252639openalex-snapshot
A Novel Modulo $2^{n}-2^{k}-1$ Adder for Residue Number System
inferredcites →https://doi.org/10.1109/tcsi.2013.2283674openalex-snapshot
Multifunction Residue Architectures for Cryptography
inferredcites →https://doi.org/10.1145/1629395.1629401openalex-snapshot
Exploiting residue number system for power-efficient digital signal processing in embedded processors
inferredcites →https://doi.org/10.1587/elex.9.193openalex-snapshot
An universal architecture for designing modulo (2n-2p-1) multipliers

What points at this work

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

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.1080/03772063.2024.2352147openalex-snapshot
Adder-Only Reverse Converters for 5-Moduli Set {2 q , 2 q − 1, 2 q +1 ± 1, 2 q +2 − 1}
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/dexa.2017.46openalex-snapshot
Unfairness Correction in P2P Grids Based on Residue Number System of a Special Form
inferred← citeshttps://doi.org/10.1109/isas64331.2024.10845354openalex-snapshot
A Modulo (2n - (2k + 1)) Adder for RNS-based Digital Signal Processing Applications
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.2018.2798595openalex-snapshot
FIR Filter Realization via Deferred End-Around Carry Modular Addition
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.1109/tetc.2026.3689523openalex-snapshot
A 22-nm 4.92 TOPS/W End-to-End RNS DNN Accelerator for Edge-AI Devices
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.