On the public citation graph
High throughput VLSI DSP using replicated finite rings
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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-662-03430-9openalex-snapshot
Number Theory in Science and Communication
inferredcites →https://doi.org/10.1007/978-3-662-22246-1openalex-snapshot
Number Theory in Science and Communication
inferredcites →https://doi.org/10.1007/bf00935210openalex-snapshot
A low-overhead scheme for testing a bit-level finite ring systolic array
inferredcites →https://doi.org/10.1016/s0065-2539(08)60608-3openalex-snapshot
Number Theoretic Techniques in Digital Signal Processing
inferredcites →https://doi.org/10.1109/12.156535openalex-snapshot
A spanning tree carry lookahead adder
inferredcites →https://doi.org/10.1109/12.250611openalex-snapshot
Large dynamic range computations over small finite rings
inferredcites →https://doi.org/10.1109/12.403712openalex-snapshot
A new design technique for column compression multipliers
inferredcites →https://doi.org/10.1109/12.57045openalex-snapshot
On modulus replication for residue arithmetic computations of complex inner products
inferredcites →https://doi.org/10.1109/31.108514openalex-snapshot
A reduced-complexity finite field ALU
inferredcites →https://doi.org/10.1109/4.272090openalex-snapshot
Dynamic computational blocks for bit-level systolic arrays
inferredcites →https://doi.org/10.1109/4.293119openalex-snapshot
Impact of clock slope on true single phase clocked (TSPC) CMOS circuits
inferredcites →https://doi.org/10.1109/4.50308openalex-snapshot
A unified single-phase clocking scheme for VLSI systems
inferredcites →https://doi.org/10.1109/4.551912openalex-snapshot
Fast adders using enhanced multiple-output domino logic
inferredcites →https://doi.org/10.1109/acssc.1991.186424openalex-snapshot
Algorithms for length 15 and 30 discrete cosine transform
inferredcites →https://doi.org/10.1109/acssc.1994.471513openalex-snapshot
Circuit driven delay optimization of EMODL carry lookahead adders
inferredcites →https://doi.org/10.1109/arith.1993.378097openalex-snapshot
The Gauss machine: A Galois-enhanced quadratic residue number system systolic array
inferredcites →https://doi.org/10.1109/asap.1995.522931openalex-snapshot
An array processor for inner product computations using a Fermat number ALU
inferredcites →https://doi.org/10.1109/cicc.1989.56826openalex-snapshot
The design and implementation of the IMS A110 image and signal processor
inferredcites →https://doi.org/10.1109/jssc.1987.1052831openalex-snapshot
A true single-phase-clock dynamic CMOS circuit technique
inferredcites →https://doi.org/10.1109/tassp.1976.1162834openalex-snapshot
A simplified binary arithmetic for the Fermat number transform
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/tcs.1987.1086130openalex-snapshot
A VLSI implementation of residue adders
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1049/el:20010378openalex-snapshot
Fault tolerant computation of large inner products
inferred← citeshttps://doi.org/10.1109/acssc.1996.599104openalex-snapshot
Design and FPGA implementation of systolic FIR filters using the Fermat number ALU
inferred← citeshttps://doi.org/10.1109/acssc.1998.751518openalex-snapshot
General purpose FIR filter arrays using optimized redundancy over direct product polynomial rings
inferred← citeshttps://doi.org/10.1109/acssc.2001.987685openalex-snapshot
Fault tolerant complex FIR filter architectures using a redundant MRRNS
inferred← citeshttps://doi.org/10.1109/acssc.2007.4487589openalex-snapshot
A Fault-Tolerant Complex FIR Filter for SoC Communication Technologies
inferred← citeshttps://doi.org/10.1109/arith.2003.1207677openalex-snapshot
Efficient multiplication in GF(p/sup k/) for elliptic curve cryptography
inferred← citeshttps://doi.org/10.1109/asap.2005.46openalex-snapshot
Multiply-Accumulate Architecture for a Special Class of Optimal Extension Fields
inferred← citeshttps://doi.org/10.1109/asap.2005.6openalex-snapshot
A Fault-Tolerant Modulus Replication Complex FIR Filter
inferred← citeshttps://doi.org/10.1109/iscas.1999.778841openalex-snapshot
Designing FIR filters with enhanced Fermat ALUs
inferred← citeshttps://doi.org/10.1109/iscas.2003.1205918openalex-snapshot
A high speed complex adaptive filter for an asymmetric wireless LAN using a new quantized polynomial representation
inferred← citeshttps://doi.org/10.1109/sips.2001.957334openalex-snapshot
Efficient fault-tolerant arithmetic using a symmetrical modulus replication RNS
inferred← citeshttps://doi.org/10.1109/sips.2004.1363069openalex-snapshot
Fault-tolerant computation within complex FIR filters
inferred← citeshttps://doi.org/10.1109/tcsi.2003.814085openalex-snapshot
Fault-tolerant computations over replicated finite rings
inferred← citeshttps://doi.org/10.1117/12.255423openalex-snapshot
VLSI digital signal processing: some arithmetic issues
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.