On the public citation graph

Enhancing testability of VLSI arrays for fast fourier transform

0 signed · 21 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.1109/12.278489openalex-snapshot
Testing iterative logic arrays for sequential faults with a constant number of patterns
inferredcites →https://doi.org/10.1109/12.4606openalex-snapshot
Fault-tolerant FFT networks
inferredcites →https://doi.org/10.1109/12.4614openalex-snapshot
A fault-tolerant FFT processor
inferredcites →https://doi.org/10.1109/12.53577openalex-snapshot
Easily testable iterative logic arrays
inferredcites →https://doi.org/10.1109/tc.1982.1676041openalex-snapshot
The Complexity of Fault Detection Problems for Combinational Logic Circuits
inferredcites →https://doi.org/10.1109/tc.1983.1676274openalex-snapshot
Sign/Logarithm Arithmetic for FFT Implementation

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.mejo.2009.06.002openalex-snapshot
Design-for-testability techniques for CORDIC design
inferred← citeshttps://doi.org/10.1049/iet-cds.2008.0296openalex-snapshot
Scalable and bijective cells for C-testable iterative logic array architectures
inferred← citeshttps://doi.org/10.1049/iet-cds.2009.0353openalex-snapshot
Effective design-for-testability techniques for H.264 all-binary integer motion estimation
inferred← citeshttps://doi.org/10.1109/82.868460openalex-snapshot
Easily testable and fault-tolerant FFT butterfly networks
inferred← citeshttps://doi.org/10.1109/ats.2000.893661openalex-snapshot
A testable/fault-tolerant FFT processor design
inferred← citeshttps://doi.org/10.1109/ats.2002.1181716openalex-snapshot
Easily testable and fault-tolerant design of FFT butterfly networks
inferred← citeshttps://doi.org/10.1109/cas-ictd.2009.4960806openalex-snapshot
Design-for-Testability Techniques for Arithmetic Circuits
inferred← citeshttps://doi.org/10.1109/cas-ictd.2009.4960887openalex-snapshot
Testable Design and BIST Techniques for Systolic Motion Estimators in the Transform Domain
inferred← citeshttps://doi.org/10.1109/emap.2002.1188889openalex-snapshot
Testing iterative logic arrays for delay faults with a constant number of patterns
inferred← citeshttps://doi.org/10.1109/icece.2008.4769226openalex-snapshot
Scalable arithmetic cells for iterative logic array
inferred← citeshttps://doi.org/10.1109/icece.2008.4769306openalex-snapshot
Novel C-testable design for H.264 Integer Motion Estimation
inferred← citeshttps://doi.org/10.1109/prdc.2002.1185648openalex-snapshot
Enhancing delay fault testability for iterative logic arrays
inferred← citeshttps://doi.org/10.1109/tvlsi.2002.1043329openalex-snapshot
Efficient FFT network testing and diagnosis schemes
inferred← citeshttps://doi.org/10.1109/tvlsi.2005.844306openalex-snapshot
Design-for-testability and fault-tolerant techniques for FFT processors
inferred← citeshttps://doi.org/10.1587/transfun.e95.a.2396openalex-snapshot
Unified Constant Geometry Fault Tolerant DCT/IDCT for Image Codec System on a Display Panel
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.