On the public citation graph

A practical approach to the synthesis of arithmetic circuits using carry-save-adders

0 signed · 35 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.1007/978-1-4613-2821-6openalex-snapshot
Logic Minimization Algorithms for VLSI Synthesis
inferredcites →https://doi.org/10.1007/978-1-4615-3636-9openalex-snapshot
High — Level Synthesis
inferredcites →https://doi.org/10.1007/bf02406474openalex-snapshot
High-level algorithm and architecture transformations for DSP synthesis
inferredcites →https://doi.org/10.1109/43.265670openalex-snapshot
Optimizing resource utilization using transformations
inferredcites →https://doi.org/10.1109/43.329271openalex-snapshot
Optimizing pipelined networks of associative and commutative operators
inferredcites →https://doi.org/10.1109/43.728918openalex-snapshot
Circuit optimization using carry-save-adder cells
inferredcites →https://doi.org/10.1109/asic.1999.806498openalex-snapshot
Utilization of carry-save-adders in arithmetic optimization
inferredcites →https://doi.org/10.1109/dac.1986.1586129openalex-snapshot
MAHA: A Program for Datapath Synthesis
inferredcites →https://doi.org/10.1109/edtc.1996.494139openalex-snapshot
A specification invariant technique for regularity improvement between flow-graph clusters
inferredcites →https://doi.org/10.1109/iccad.1989.76916openalex-snapshot
Tree-height minimization in pipelined architectures
inferredcites →https://doi.org/10.1109/iccad.1991.185199openalex-snapshot
Optimizing resource utilization using transformations
inferredcites →https://doi.org/10.1109/iccad.1992.279356openalex-snapshot
Maximally fast and arbitrarily fast implementation of linear computations (circuit layout CAD)
inferredcites →https://doi.org/10.1109/iccad.1995.480156openalex-snapshot
A delay model for logic synthesis of continuously-sized networks
inferredcites →https://doi.org/10.1109/iccad.1995.480157openalex-snapshot
Power vs. delay in gate sizing: conflicting objectives?
inferredcites →https://doi.org/10.1109/ishls.1994.302328openalex-snapshot
A specification invariant technique for operation cost minimisation in flow-graphs
inferredcites →https://doi.org/10.1109/tcad.1987.1270347openalex-snapshot
MIS: A Multiple-Level Logic Optimization System
inferredcites →https://doi.org/10.1145/127601.127767openalex-snapshot
Incremental tree height reduction for high level synthesis
inferredcites →https://doi.org/10.1145/127601.127768openalex-snapshot
Redundant operator creation
inferredcites →https://doi.org/10.5555/224841.225089openalex-snapshot
A delay model for logic synthesis of continuously-sized networks
inferredcites →https://doi.org/10.5555/254208.254258openalex-snapshot
A specification invariant technique for operation cost minimisation in flow-graphs
inferredcites →https://doi.org/10.5555/304032.304124openalex-snapshot
Maximally fast and arbitrarily fast implementation of linear computations
inferredcites →https://doi.org/10.5555/318013.318087openalex-snapshot
MAHA: A Program for Datapath Synthesis
inferredcites →https://doi.org/10.5555/787259.787534openalex-snapshot
A specification invariant technique for regularity improvement between flow-graph clusters

What points at this work

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

inferred← citeshttps://doi.org/10.1007/0-306-47823-4_1openalex-snapshot
Introduction and Overview of the Book
inferred← citeshttps://doi.org/10.1007/0-306-47823-4_4openalex-snapshot
High-Speed Logic, Circuits, Libraries and Layout
inferred← citeshttps://doi.org/10.1016/j.mejo.2014.06.005openalex-snapshot
Improving circuit performance with multispeculative additive trees in high-level synthesis
inferred← citeshttps://doi.org/10.1023/b:vlsi.0000028530.88948.36openalex-snapshot
Complex ±1 Multiplier Based on Signed-Binary Transformations
inferred← citeshttps://doi.org/10.1109/dac.2002.1012621openalex-snapshot
Layout-aware synthesis of arithmetic circuits
inferred← citeshttps://doi.org/10.1109/tc.2018.2795611openalex-snapshot
Advanced Compressor Tree Synthesis for FPGAs
inferred← citeshttps://doi.org/10.1109/tcad.2003.818301openalex-snapshot
Synthesis of arithmetic circuits considering layout effects
inferred← citeshttps://doi.org/10.1109/tcad.2012.2208966openalex-snapshot
Multispeculative Addition Applied to Datapath Synthesis
inferred← citeshttps://doi.org/10.1109/tvlsi.2015.2390974openalex-snapshot
Flexible DSP Accelerator Architecture Exploiting Carry-Save Arithmetic
inferred← citeshttps://doi.org/10.1145/505306.505325openalex-snapshot
Efficient implementation of a complex ±1 multiplier
inferred← citeshttps://doi.org/10.1145/513918.513971openalex-snapshot
Layout-aware synthesis of arithmetic circuits
inferred← citeshttps://doi.org/10.5120/12851-9334openalex-snapshot
Novel Architecture of High Speed Parallel MAC using Carry Select Adder
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.