On the public citation graph
Optimization of Area and Delay at Gate-Level in Multiple Constant Multiplications
0 signed · 26 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.1016/j.micpro.2009.10.001openalex-snapshot
Search algorithms for the multiple constant multiplications problem: Exact and approximate
inferredcites →https://doi.org/10.1109/82.466647openalex-snapshot
Use of minimum-adder multiplier blocks in FIR digital filters
inferredcites →https://doi.org/10.1109/82.539000openalex-snapshot
Subexpression sharing in filters using canonic signed digit multipliers
inferredcites →https://doi.org/10.1109/82.959867openalex-snapshot
FIR filter synthesis algorithms for minimizing the delay and the number of adders
inferredcites →https://doi.org/10.1109/92.863621openalex-snapshot
Number-splitting with shift-and-add decomposition for power and hardware optimization in linear DSP synthesis
inferredcites →https://doi.org/10.1109/dac.2007.375200openalex-snapshot
Optimization of Area in Digital FIR Filters using Gate-Level Metrics
inferredcites →https://doi.org/10.1109/ecctd.2005.1523161openalex-snapshot
A detailed complexity model for multiple constant multiplication and an algorithm to minimize the complexity
inferredcites →https://doi.org/10.1109/iscas.2002.1010818openalex-snapshot
Designing multiplier blocks with low logic depth
inferredcites →https://doi.org/10.1109/tassp.1984.1164433openalex-snapshot
Some complexity issues in digital signal processing
inferredcites →https://doi.org/10.1109/tcad.2008.923242openalex-snapshot
Exact and Approximate Algorithms for the Optimization of Area and Delay in Multiple Constant Multiplications
inferredcites →https://doi.org/10.1109/tec.1961.5219227openalex-snapshot
Signed-Digit Numbe Representations for Fast Parallel Arithmetic
inferredcites →https://doi.org/10.1145/1240233.1240234openalex-snapshot
Multiplierless multiple constant multiplication
inferredcites →https://doi.org/10.1145/1278480.1278588openalex-snapshot
Optimization of area in digital FIR filters using gate-level metrics
inferredcites →https://doi.org/10.1145/378239.378564openalex-snapshot
Digital filter synthesis based on minimal signed digit representation
inferredcites →https://doi.org/10.5555/602902.602915openalex-snapshot
FIR filter synthesis algorithms for minimizing the delay and the number of adders
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.micpro.2011.08.009openalex-snapshot
Finding the optimal tradeoff between area and delay in multiple constant multiplications
inferred← citeshttps://doi.org/10.1016/j.vlsi.2011.11.008openalex-snapshot
High-level algorithms for the optimization of gate-level area in digit-serial multiple constant multiplications
inferred← citeshttps://doi.org/10.1109/ecctd.2011.6043602openalex-snapshot
Optimization of gate-level area in high throughput Multiple Constant Multiplications
inferred← citeshttps://doi.org/10.1109/icdamt.2017.7904978openalex-snapshot
Automated parking area optimization for garage construction using geometric algorithm
inferred← citeshttps://doi.org/10.1109/iscas.2012.6272072openalex-snapshot
Pipelined adder graph optimization for high speed multiple constant multiplication
inferred← citeshttps://doi.org/10.1109/tap.2014.2366198openalex-snapshot
Optimized Beam Steering Approach for Improved Sidelobes in Phased Array Radars Using a Minimal Number of Control Bits
inferred← citeshttps://doi.org/10.1109/tc.2017.2701365openalex-snapshot
Optimization of Constant Matrix Multiplication with Low Power and High Throughput
inferred← citeshttps://doi.org/10.1109/tcsi.2019.2892588openalex-snapshot
Design Methodology to Explore Hybrid Approximate Adders for Energy-Efficient Image and Video Processing Accelerators
inferred← citeshttps://doi.org/10.1109/tcsii.2022.3191662openalex-snapshot
Multiplierless Design of Very Large Constant Multiplications in Cryptography
inferred← citeshttps://doi.org/10.1145/1973009.1973026openalex-snapshot
Design of low-power multiple constant multiplications using low-complexity minimum depth operations
inferred← citeshttps://doi.org/10.48550/arxiv.2108.02073openalex-snapshot
Efficient Hardware Realizations of Feedforward Artificial Neural Networks
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.