On the public citation graph

A systolic architecture for modulo multiplication

0 signed · 36 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/0167-9260(86)90004-0openalex-snapshot
Lower bounds for VLSI implementation of residue number system architectures
inferredcites →https://doi.org/10.1049/el:19770117openalex-snapshot
Multipliers for residue-number-arithmetic digital filters
inferredcites →https://doi.org/10.1109/31.55001openalex-snapshot
A theta (1) algorithm for modulo addition
inferredcites →https://doi.org/10.1109/82.136572openalex-snapshot
Fast and flexible architectures for RNS arithmetic decoding
inferredcites →https://doi.org/10.1109/icassp.1985.1168482openalex-snapshot
A custom-designed integrated circuit for the realization of residue number digital filters
inferredcites →https://doi.org/10.1109/mc.1984.1659138openalex-snapshot
Residue Arithmetic A Tutorial with Examples
inferredcites →https://doi.org/10.1109/proc.1980.11678openalex-snapshot
A high-speed low-cost modulo Pimultiplier with RNS arithmetic applications
inferredcites →https://doi.org/10.1109/tc.1980.1675473openalex-snapshot
Implementation of Multiplication, Modulo a Prime Number, with Applications to Number Theoretic Transforms
inferredcites →https://doi.org/10.1109/tc.1982.1675999openalex-snapshot
An Autoscale Residue Multiplier
inferredcites →https://doi.org/10.1109/tcs.1981.1085027openalex-snapshot
Large moduli multipliers for signal processing
inferredcites →https://doi.org/10.1109/tcs.1987.1086188openalex-snapshot
A look-up table VLSI design methodology for RNS structures used in DSP applications

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-1-4615-0997-4_9openalex-snapshot
References
inferred← citeshttps://doi.org/10.1007/978-3-540-24669-5_133openalex-snapshot
Parallel Modular Multiplication Algorithm in Residue Number System
inferred← citeshttps://doi.org/10.1007/978-3-540-24709-8_23openalex-snapshot
Multiplier with Parallel CSA using CRT’s Specific Moduli (2 k -1, 2 k , 2 k +1)
inferred← citeshttps://doi.org/10.1016/s0026-2692(99)00110-xopenalex-snapshot
An FPGA implementation guide for some different types of serial–parallel multiplier structures
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00400-6openalex-snapshot
How to fake an RSA signature by encoding modular root finding as a SAT problem
inferred← citeshttps://doi.org/10.1049/ip-cds:20010338openalex-snapshot
Novel serial–parallel multipliers
inferred← citeshttps://doi.org/10.1109/12.833113openalex-snapshot
New efficient structure for a modular multiplier for RNS
inferred← citeshttps://doi.org/10.1109/12.980018openalex-snapshot
High-speed and reduced-area modular adder structures for RNS
inferred← citeshttps://doi.org/10.1109/82.868463openalex-snapshot
RNS arithmetic multiplier for medium and large moduli
inferred← citeshttps://doi.org/10.1109/82.877147openalex-snapshot
Novel high-radix residue number system architectures
inferred← citeshttps://doi.org/10.1109/82.958337openalex-snapshot
A low-complexity combinatorial RNS multiplier
inferred← citeshttps://doi.org/10.1109/acssc.1996.600859openalex-snapshot
Choosing the system moduli of RNS arithmetic processors
inferred← citeshttps://doi.org/10.1109/aspdac.2003.1195065openalex-snapshot
Implementation of the super-systolic array for convolution
inferred← citeshttps://doi.org/10.1109/dsd.2011.65openalex-snapshot
Binary-to-RNS Conversion Units for moduli {2^n ± 3}
inferred← citeshttps://doi.org/10.1109/icecs.1996.584539openalex-snapshot
Semi-custom VLSI design for RNS multipliers using combinational logic approach
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/mwscas.1996.594235openalex-snapshot
Combinational logic approach for designing RNS multipliers
inferred← citeshttps://doi.org/10.1109/mwscas.2002.1187123openalex-snapshot
Graph-based optimization for a CSD-enhanced RNS multiplier
inferred← citeshttps://doi.org/10.1109/patmos.2019.8862036openalex-snapshot
Radix-3 low-complexity modulo-M multipliers
inferred← citeshttps://doi.org/10.1109/sips.2008.4671771openalex-snapshot
Low-complexity polynomials modulo integer with linearly incremented variable
inferred← citeshttps://doi.org/10.1109/tcsi.2003.820243openalex-snapshot
A Novel Architecture and a Systematic Graph-Based Optimization Methodology for Modulo Multiplication
inferred← citeshttps://doi.org/10.1109/tcsi.2009.2015548openalex-snapshot
A Low-Complexity High-Radix RNS Multiplier
inferred← citeshttps://doi.org/10.1142/s0218126605002726openalex-snapshot
ON THE DESIGN OF EFFICIENT MODULAR ADDERS
inferred← citeshttps://doi.org/10.1145/1119772.1119873openalex-snapshot
Implementation of the super-systolic array for convolution
inferred← citeshttps://doi.org/10.32657/10356/2379openalex-snapshot
VLSI efficient architectures for triple moduli based RNS computations
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.