On the public citation graph
An approach to implementing multiplication with small tables
0 signed · 19 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.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90150-gopenalex-snapshot
A simple approach to implementing multiplication with small tables
inferred← citeshttps://doi.org/10.1016/0923-5965(94)00047-6openalex-snapshot
An approach to fast transform coding in software
inferred← citeshttps://doi.org/10.1016/j.vlsi.2008.01.005openalex-snapshot
Partial product reduction by using look-up tables for M×N multiplier
inferred← citeshttps://doi.org/10.1080/00207219208925662openalex-snapshot
An approach to ROM-adder multiplication based on tables of squares
inferred← citeshttps://doi.org/10.1109/12.475134openalex-snapshot
Implementing multiplication with split read-only memory
inferred← citeshttps://doi.org/10.1109/12.713320openalex-snapshot
Design of a high-speed square generator
inferred← citeshttps://doi.org/10.1109/78.205736openalex-snapshot
Alternate memory compression schemes for modular multiplication
inferred← citeshttps://doi.org/10.1109/apccas.2008.4745988openalex-snapshot
Design of square generator with small look-up table
inferred← citeshttps://doi.org/10.1109/arith.1995.465357openalex-snapshot
Arithmetic for relative accuracy
inferred← citeshttps://doi.org/10.1109/cicc.1995.518132openalex-snapshot
A 32-bit complex-arithmetic integer logic unit with dynamic accuracy
inferred← citeshttps://doi.org/10.1109/eurmic.1994.390366openalex-snapshot
An accuracy-driven complex arithmetic unit
inferred← citeshttps://doi.org/10.1109/iccd.1996.563600openalex-snapshot
On design of efficient square generator
inferred← citeshttps://doi.org/10.1109/iccd.2007.4601922openalex-snapshot
Memory based computation using embedded cache for processor yield and reliability improvement
inferred← citeshttps://doi.org/10.1109/micro50266.2020.00020openalex-snapshot
Look-Up Table based Energy Efficient Processing in Cache Support for Neural Network Acceleration
inferred← citeshttps://doi.org/10.1109/tcsii.2024.3403830openalex-snapshot
HNMC: Hybrid Near-Memory Computing Circuit for Neural Network Acceleration
inferred← citeshttps://doi.org/10.1109/tvlsi.2010.2049389openalex-snapshot
Dynamic Transfer of Computation to Processor Cache for Yield and Reliability Improvement
inferred← citeshttps://doi.org/10.1117/12.359540openalex-snapshot
Toward an FPGA architecture optimized for public-key algorithms
inferred← citeshttps://doi.org/10.1145/3725843.3756087openalex-snapshot
3D-PATH: A Hierarchy LUT Processing-in-memory Accelerator with Thermal-aware Hybrid Bonding Integration
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.