On the public citation graph
Test generation, design-for-testability and built-in self-test for arithmetic units based on graph labeling
0 signed · 61 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/0898-1221(87)90074-5openalex-snapshot
Testing in two-dimensional iterative logic arrays
inferredcites →https://doi.org/10.1016/0898-1221(87)90077-0openalex-snapshot
The use of linear sums in exhaustive testing
inferredcites →https://doi.org/10.1049/ep.1978.0048openalex-snapshot
Theory and Design of Switching Circuits
inferredcites →https://doi.org/10.1049/sqj.1969.0041openalex-snapshot
Finite-State Models for Logical Machines
inferredcites →https://doi.org/10.1109/12.53577openalex-snapshot
Easily testable iterative logic arrays
inferredcites →https://doi.org/10.1109/12.53597openalex-snapshot
Computational complexity of controllability/observability problems for combinational circuits
inferredcites →https://doi.org/10.1109/43.16804openalex-snapshot
Implementation of VLSI self-testing by regularization
inferredcites →https://doi.org/10.1109/focs.1967.33openalex-snapshot
Testing for faults in combinational cellular logic arrays
inferredcites →https://doi.org/10.1109/iccad.1988.122542openalex-snapshot
NCUBE: an automatic test generation program for iterative logic arrays
inferredcites →https://doi.org/10.1109/mdt.1985.294856openalex-snapshot
Built-In Self-Test Techniques
inferredcites →https://doi.org/10.1109/t-c.1971.223286openalex-snapshot
Fault Detection in Iterative Logic Arrays
inferredcites →https://doi.org/10.1109/tc.1976.1674660openalex-snapshot
Truth-Table Verification of an Iterative Logic Array
inferredcites →https://doi.org/10.1109/tc.1981.1675714openalex-snapshot
A Testable Design of Iterative Logic Arrays
inferredcites →https://doi.org/10.1109/tc.1981.1675715openalex-snapshot
Design of Easily Testable Bit-Sliced Systems
inferredcites →https://doi.org/10.1109/tc.1984.1676477openalex-snapshot
Verification Testing—A Pseudoexhaustive Test Technique
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.1984.1676481openalex-snapshot
Built-In Testing of One-Dimensional Unilateral Iterative Arrays
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/tcad.1986.1270228openalex-snapshot
C-Testability of Two-Dimensional Iterative Arrays
inferredcites →https://doi.org/10.1109/tcad.1987.1270317openalex-snapshot
On the C-Testability of Generalized Counters
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf00136077openalex-snapshot
Balance testing and balance-testable design of logic circuits
inferred← citeshttps://doi.org/10.1109/12.278489openalex-snapshot
Testing iterative logic arrays for sequential faults with a constant number of patterns
inferred← citeshttps://doi.org/10.1109/12.48874openalex-snapshot
The design of a testable parallel multiplier
inferred← citeshttps://doi.org/10.1109/12.506429openalex-snapshot
Detection of multiple faults in two-dimensional ILAs
inferred← citeshttps://doi.org/10.1109/12.61070openalex-snapshot
Fault detection and design complexity in C-testable VLSI arrays
inferred← citeshttps://doi.org/10.1109/12.795222openalex-snapshot
An effective built-in self-test scheme for parallel multipliers
inferred← citeshttps://doi.org/10.1109/12.93746openalex-snapshot
Test generation for iterative logic arrays based on an N-cube of cell states model
inferred← citeshttps://doi.org/10.1109/4.133159openalex-snapshot
Concurrent error detection and fault location in an FFT architecture
inferred← citeshttps://doi.org/10.1109/4.68128openalex-snapshot
Design of C-testable DCVS binary array dividers
inferred← citeshttps://doi.org/10.1109/43.184848openalex-snapshot
Easily testable nonrestoring and restoring gate-level cellular array dividers
inferred← citeshttps://doi.org/10.1109/43.229765openalex-snapshot
On the multiple-fault testability of generalized counters
inferred← citeshttps://doi.org/10.1109/43.87603openalex-snapshot
Easily testable gate-level and DCVS multipliers
inferred← citeshttps://doi.org/10.1109/43.908472openalex-snapshot
Realization-independent ATPG for designs with unimplemented blocks
inferred← citeshttps://doi.org/10.1109/92.486089openalex-snapshot
Built-in self-test (BIST) design of high-speed carry-free dividers
inferred← citeshttps://doi.org/10.1109/ats.1994.367236openalex-snapshot
C-testable multipliers based on the modified Booth algorithm
inferred← citeshttps://doi.org/10.1109/ats.1995.485349openalex-snapshot
An effective BIST scheme for carry-save and carry-propagate array multipliers
inferred← citeshttps://doi.org/10.1109/ats.1995.485351openalex-snapshot
An effective BIST design for PLA
inferred← citeshttps://doi.org/10.1109/ats.1998.741663openalex-snapshot
Test pattern generation for column compression multiplier
inferred← citeshttps://doi.org/10.1109/ats.1999.810740openalex-snapshot
A novel fault-detection technique for the parallel multipliers and dividers
inferred← citeshttps://doi.org/10.1109/ats.2008.40openalex-snapshot
Level-Testability of Multi-operand Adders
inferred← citeshttps://doi.org/10.1109/etc.1993.246555openalex-snapshot
On the testability of FFT arrays
inferred← citeshttps://doi.org/10.1109/iccad.1988.122542openalex-snapshot
NCUBE: an automatic test generation program for iterative logic arrays
inferred← citeshttps://doi.org/10.1109/iccd.1988.25678openalex-snapshot
Test generation of C-testable array dividers
inferred← citeshttps://doi.org/10.1109/iccd.1993.393379openalex-snapshot
A C-testable carry-free divider
inferred← citeshttps://doi.org/10.1109/icvd.1995.512124openalex-snapshot
A C-testable modified Booth's array multiplier
inferred← citeshttps://doi.org/10.1109/icwsi.1993.255258openalex-snapshot
Testing constant-geometry FFT arrays for wafer scale integration
inferred← citeshttps://doi.org/10.1109/iscas.1990.111902openalex-snapshot
Test generation for hybrid iterative logic arrays
inferred← citeshttps://doi.org/10.1109/iscas.1990.112573openalex-snapshot
Constant testability for single fault detection in two-dimensional systolic array structures for matrix multiplication
inferred← citeshttps://doi.org/10.1109/iscas.1990.112574openalex-snapshot
Easily testable DCVS multiplier
inferred← citeshttps://doi.org/10.1109/iscas.1995.523793openalex-snapshot
Built-in self-test (BIST) design of high-speed carry-free dividers
inferred← citeshttps://doi.org/10.1109/isvd.1991.185107openalex-snapshot
Efficient testing techniques for bit and digit-serial arrays
inferred← citeshttps://doi.org/10.1109/mwscas.1990.140697openalex-snapshot
Testing of iterative logic arrays
inferred← citeshttps://doi.org/10.1109/mwscas.1994.519235openalex-snapshot
Design of C-testable high-speed dividers
inferred← citeshttps://doi.org/10.1109/test.1995.529914openalex-snapshot
An effective BIST scheme for Booth multipliers
inferred← citeshttps://doi.org/10.1109/test.1998.743201openalex-snapshot
High-coverage ATPG for datapath circuits with unimplemented blocks
inferred← citeshttps://doi.org/10.1109/vtest.2000.843842openalex-snapshot
A general BIST-amenable method of test generation for iterative logic arrays
inferred← citeshttps://doi.org/10.1587/transinf.e93.d.2783openalex-snapshot
A C-Testable 4-2 Adder Tree for an Easily Testable High-Speed Multiplier
inferred← citeshttps://doi.org/10.5120/5060-7390openalex-snapshot
Universal Pattern Set for Arithmetic Circuits
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.