On the public citation graph
Design of a C-testable booth multiplier using a realistic fault model
0 signed · 34 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.1002/j.1538-7305.1978.tb02106.xopenalex-snapshot
Fault Modeling and Logic Simulation of CMOS and MOS Integrated Circuits
inferredcites →https://doi.org/10.1093/qjmam/4.2.236openalex-snapshot
A SIGNED BINARY MULTIPLICATION TECHNIQUE
inferredcites →https://doi.org/10.1093/qjmam/4.3.260openalex-snapshot
ON THE TWO-DIMENSIONAL PROBLEM OF A SEMI-INFINITE ELASTIC BODY COMPRESSED BY AN ELASTIC PLANE
inferredcites →https://doi.org/10.1109/43.46808openalex-snapshot
Computing optimal test sequences from complete test sets for stuck-open faults in CMOS circuits
inferredcites →https://doi.org/10.1109/43.87603openalex-snapshot
Easily testable gate-level and DCVS multipliers
inferredcites →https://doi.org/10.1109/54.19132openalex-snapshot
A testability strategy for microprocessor architecture
inferredcites →https://doi.org/10.1109/54.211526openalex-snapshot
Test algorithms for double-buffered random access and pointer-addressed memories
inferredcites →https://doi.org/10.1109/dac.1983.1585627openalex-snapshot
Test Generation for MOS Circuits Using D-Algorithm
inferredcites →https://doi.org/10.1109/etc.1989.36255openalex-snapshot
The testability of a modified Booth multiplier
inferredcites →https://doi.org/10.1109/mdt.1986.295048openalex-snapshot
Macro Testing: Unifying IC And Board Test
inferredcites →https://doi.org/10.1109/t-c.1973.223651openalex-snapshot
Easily Testable Iterative Systems
inferredcites →https://doi.org/10.1109/t-c.1975.224114openalex-snapshot
A Proof of the Modified Booth's Algorithm for Multiplication
inferredcites →https://doi.org/10.1109/tc.1981.1675714openalex-snapshot
A Testable Design of Iterative Logic Arrays
inferredcites →https://doi.org/10.1109/tc.1984.1676480openalex-snapshot
The Design of Easily Testable VLSI Array Multipliers
inferredcites →https://doi.org/10.1109/tc.1986.1676771openalex-snapshot
Test Schedules for VLSI Circuits Having Built-In Test Hardware
inferredcites →https://doi.org/10.1109/tcad.1985.1270112openalex-snapshot
Modeling of Lithography Related Yield Losses for CAD of VLSI Circuits
inferredcites →https://doi.org/10.1109/tcad.1986.1270228openalex-snapshot
C-Testability of Two-Dimensional Iterative Arrays
inferredcites →https://doi.org/10.1109/test.1990.114102openalex-snapshot
CMOS bridging fault detection
inferredcites →https://doi.org/10.1109/test.1990.114117openalex-snapshot
Minimal overhead modification of iterative logic arrays for C-testability
inferredcites →https://doi.org/10.1147/rd.104.0278openalex-snapshot
Diagnosis of Automata Failures: A Calculus and a Method
inferredcites →https://doi.org/10.5555/800032.800642openalex-snapshot
Test Generation for MOS Circuits Using D-Algorithm
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf00133387openalex-snapshot
C-Testable modified-Booth multipliers
inferred← citeshttps://doi.org/10.1049/ip-cdt:19960008openalex-snapshot
Linear-testable and C-testable Nx × Ny modified Booth multipliers
inferred← citeshttps://doi.org/10.1109/12.599900openalex-snapshot
Design of testable multipliers for fixed-width data paths
inferred← citeshttps://doi.org/10.1109/54.706041openalex-snapshot
Effective built-in self test for Booth multipliers
inferred← citeshttps://doi.org/10.1109/ats.1997.643914openalex-snapshot
Design of C-testable multipliers based on the modified Booth Algorithm
inferred← citeshttps://doi.org/10.1109/dftvs.1999.802877openalex-snapshot
Low power dissipation in BIST schemes for modified Booth multipliers
inferred← citeshttps://doi.org/10.1109/iccad.1995.480169openalex-snapshot
On testable multipliers for fixed-width data path architectures
inferred← citeshttps://doi.org/10.1109/icvd.1999.745129openalex-snapshot
Test-vector prediction of M-testable iterative arrays
inferred← citeshttps://doi.org/10.1109/tcad.2008.927761openalex-snapshot
Testing Transition Delay Faults in Modified Booth Multipliers
inferred← citeshttps://doi.org/10.1109/tencon.2007.4429067openalex-snapshot
Testing transition delay faults in modified Booth multipliers by using C-testable and SIC patterns
inferred← citeshttps://doi.org/10.1109/test.1995.529914openalex-snapshot
An effective BIST scheme for Booth multipliers
inferred← citeshttps://doi.org/10.1155/2001/67893openalex-snapshot
Low Power Built‐In Self‐Test Schemes for Array and Booth Multipliers
inferred← citeshttps://doi.org/10.5555/224841.225110openalex-snapshot
On testable multipliers for fixed-width data path architectures
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.