A combinatorial approach to X-tolerant compaction circuits

Abstract

Test response compaction for integrated circuits (ICs) with scan-based design-for-testability (DFT) support in the presence of unknown logic values (Xs) is investigated from a combinatorial viewpoint. The theoretical foundations of X-codes, employed in an X-tolerant compaction technique called X-compact, are examined. Through the formulation of a combinatorial model of X-compact, novel design techniques are developed for X-codes to detect a specified maximum number of errors in the presence of a specified maximum number of unknown logic values, while requiring only small fan-out. The special class of X-codes that results leads to an avoidance problem for configurations in combinatorial designs. General design methods and nonconstructive existence theorems to estimate the compaction ratio of an optimal X-compactor are also derived.

11 pages, final accepted version for publication in the IEEE Transactions on Information Theory

Cited by in corpus (6)

• High-rate quantum low-density parity-check codes assisted by reliable qubits
• Bounds on Separating Redundancy of Linear Codes and Rates of X-Codes
• Weak Superimposed Codes of Improved Asymptotic Rate and Their Randomized Construction
• Even-freeness of cyclic 2-designs
• On the Maximum Number of Codewords of X-Codes of Constant Weight Three
• New bounds and constructions for constant weighted $X$-codes