On the public citation graph

Efficient Test Methodologies for Conditional Sum Adders

0 signed · 25 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.1002/0471457787openalex-snapshot
Digital Logic Testing and Simulation
inferredcites →https://doi.org/10.1109/12.2262openalex-snapshot
Efficient testing of optimal time adders
inferredcites →https://doi.org/10.1109/12.53577openalex-snapshot
Easily testable iterative logic arrays
inferredcites →https://doi.org/10.1109/12.536237openalex-snapshot
Testability of convergent tree circuits
inferredcites →https://doi.org/10.1109/12.565614openalex-snapshot
A fast binary adder with conditional carry generation
inferredcites →https://doi.org/10.1109/12.641935openalex-snapshot
Fault tolerant algorithms for broadcasting on the star graph network
inferredcites →https://doi.org/10.1109/43.406707openalex-snapshot
On the generation of area-time optimal testable adders
inferredcites →https://doi.org/10.1109/82.868460openalex-snapshot
Easily testable and fault-tolerant FFT butterfly networks
inferredcites →https://doi.org/10.1109/92.365462openalex-snapshot
C-testable design techniques for iterative logic arrays
inferredcites →https://doi.org/10.1109/92.831442openalex-snapshot
On the design of fast, easily testable ALU's
inferredcites →https://doi.org/10.1109/ats.1997.643907openalex-snapshot
On the adders with minimum tests
inferredcites →https://doi.org/10.1109/iccd.1988.25678openalex-snapshot
Test generation of C-testable array dividers
inferredcites →https://doi.org/10.1109/tc.1987.1676985openalex-snapshot
A Minimum Test Set for Multiple Fault Detection in Ripple Carry Adders
inferredcites →https://doi.org/10.1109/tvlsi.2002.1043329openalex-snapshot
Efficient FFT network testing and diagnosis schemes
inferredcites →https://doi.org/10.1201/9781315275567openalex-snapshot
Computer Arithmetic Algorithms

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-3-642-31494-0_25openalex-snapshot
Design of a Fault-Tolerant Conditional Sum Adder
inferred← citeshttps://doi.org/10.1007/s13369-018-3556-9openalex-snapshot
Design of Fault Tolerant Adders: A Review
inferred← citeshttps://doi.org/10.1016/j.microrel.2014.12.011openalex-snapshot
Real-time fault-tolerance with hot-standby topology for conditional sum adder
inferred← citeshttps://doi.org/10.1109/ats.2006.261019openalex-snapshot
A Design of Pipelined Carry-dependent Sum Adder With its Self-checking Structure
inferred← citeshttps://doi.org/10.1109/ats.2006.7openalex-snapshot
A Design of Pipelined Carry-dependent Sum Adder With its Self-checking Structure
inferred← citeshttps://doi.org/10.1109/icemi.2007.4350925openalex-snapshot
Path Delay Fault Design For Test and Testability Analysis of Conditional Sum Adders
inferred← citeshttps://doi.org/10.1109/tvlsi.2008.2009452openalex-snapshot
Built-in Self-Detection/Correction Architecture for Motion Estimation Computing Arrays
inferred← citeshttps://doi.org/10.1109/tvlsi.2011.2109972openalex-snapshot
Design of an Error Detection and Data Recovery Architecture for Motion Estimation Testing Applications
inferred← citeshttps://doi.org/10.47893/ijeee.2014.1103openalex-snapshot
DESIGN OF AN ERROR DETECTION AND DATA RECOVERY ARCHITECTURE FOR MOTION ESTIMATION TESTING APPLICATIONS
inferred← citeshttps://doi.org/10.47893/ijipvs.2013.1055openalex-snapshot
DESIGN FOR TESTABILITY TECHNIQUES FOR VIDEO CODING SYSTEMS
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.