Self-Checking Checker Designs for Various 2-Rail Codes

Hideo ITOH; Matsuroh NAKAMICHI

Self-Checking Checker Designs for Various 2-Rail Codes

Hideo ITOH, Matsuroh NAKAMICHI

Full Text Views

0

Cite this

Summary :

Three efficient designs of Self-Checking (SC) checkers for various 2-rail codes (Self-Checking Two-rail code Checker: SCTC) are described. In the designs, only one type of modules with 2 pairs of inputs and a pair of outputs is used. The module is realized by a 2-level AND-OR circuit, and denoted by N₂. Every N₂ in a checker needs a set of 4 test patterns (the set is denoted by T) to detect any fault in N₂. Firstly, it is shown that any tree (fanout-free) circuit consisting of only N₂'s is an SCTC if the number of code words is (3・2^n-21) or more. Secondarily, a design which is called a checking design is proposed. For a given 2-rail code and a properly constructed checker, the checking design checks whether T is applied or not to every N₂ in the checker. If T is applied, the checker becomes an SCTC. Whether the checking design can construct an SCTC or not is a probability phenomenon mainly due to the number of code words in the given 2-rail code. Therefore, the probability is derived from practical experiments. The probability shows that SCTC's can be constructed by the checking design for most codes. Thirdly, an algorithmic design is proposed for codes consisting of a very few code words. A necessary and sufficient condition for which an SCTC can be constructed for a given code is presented, and the algorithmic design is described. The experimental results show that the algorithmic design can construct SCTC's successfully.

Publication: IEICE TRANSACTIONS on transactions Vol.E65-E No.11 pp.665-671

Publication Date: 1982/11/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Digital Circuits

Authors

Hideo ITOH
Matsuroh NAKAMICHI

Keyword

Cite this

Copy

Hideo ITOH, Matsuroh NAKAMICHI, "Self-Checking Checker Designs for Various 2-Rail Codes" in IEICE TRANSACTIONS on transactions, vol. E65-E, no. 11, pp. 665-671, November 1982, doi: .
Abstract: Three efficient designs of Self-Checking (SC) checkers for various 2-rail codes (Self-Checking Two-rail code Checker: SCTC) are described. In the designs, only one type of modules with 2 pairs of inputs and a pair of outputs is used. The module is realized by a 2-level AND-OR circuit, and denoted by N₂. Every N₂ in a checker needs a set of 4 test patterns (the set is denoted by T) to detect any fault in N₂. Firstly, it is shown that any tree (fanout-free) circuit consisting of only N₂'s is an SCTC if the number of code words is (3・2^n-21) or more. Secondarily, a design which is called a checking design is proposed. For a given 2-rail code and a properly constructed checker, the checking design checks whether T is applied or not to every N₂ in the checker. If T is applied, the checker becomes an SCTC. Whether the checking design can construct an SCTC or not is a probability phenomenon mainly due to the number of code words in the given 2-rail code. Therefore, the probability is derived from practical experiments. The probability shows that SCTC's can be constructed by the checking design for most codes. Thirdly, an algorithmic design is proposed for codes consisting of a very few code words. A necessary and sufficient condition for which an SCTC can be constructed for a given code is presented, and the algorithmic design is described. The experimental results show that the algorithmic design can construct SCTC's successfully.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e65-e_11_665/_p

Copy

@ARTICLE{e65-e_11_665,
author={Hideo ITOH, Matsuroh NAKAMICHI, },
journal={IEICE TRANSACTIONS on transactions},
title={Self-Checking Checker Designs for Various 2-Rail Codes},
year={1982},
volume={E65-E},
number={11},
pages={665-671},
abstract={Three efficient designs of Self-Checking (SC) checkers for various 2-rail codes (Self-Checking Two-rail code Checker: SCTC) are described. In the designs, only one type of modules with 2 pairs of inputs and a pair of outputs is used. The module is realized by a 2-level AND-OR circuit, and denoted by N₂. Every N₂ in a checker needs a set of 4 test patterns (the set is denoted by T) to detect any fault in N₂. Firstly, it is shown that any tree (fanout-free) circuit consisting of only N₂'s is an SCTC if the number of code words is (3・2^n-21) or more. Secondarily, a design which is called a checking design is proposed. For a given 2-rail code and a properly constructed checker, the checking design checks whether T is applied or not to every N₂ in the checker. If T is applied, the checker becomes an SCTC. Whether the checking design can construct an SCTC or not is a probability phenomenon mainly due to the number of code words in the given 2-rail code. Therefore, the probability is derived from practical experiments. The probability shows that SCTC's can be constructed by the checking design for most codes. Thirdly, an algorithmic design is proposed for codes consisting of a very few code words. A necessary and sufficient condition for which an SCTC can be constructed for a given code is presented, and the algorithmic design is described. The experimental results show that the algorithmic design can construct SCTC's successfully.},
keywords={},
doi={},
ISSN={},
month={November},}

Copy

TY - JOUR
TI - Self-Checking Checker Designs for Various 2-Rail Codes
T2 - IEICE TRANSACTIONS on transactions
SP - 665
EP - 671
AU - Hideo ITOH
AU - Matsuroh NAKAMICHI
PY - 1982
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E65-E
IS - 11
JA - IEICE TRANSACTIONS on transactions
Y1 - November 1982
AB - Three efficient designs of Self-Checking (SC) checkers for various 2-rail codes (Self-Checking Two-rail code Checker: SCTC) are described. In the designs, only one type of modules with 2 pairs of inputs and a pair of outputs is used. The module is realized by a 2-level AND-OR circuit, and denoted by N₂. Every N₂ in a checker needs a set of 4 test patterns (the set is denoted by T) to detect any fault in N₂. Firstly, it is shown that any tree (fanout-free) circuit consisting of only N₂'s is an SCTC if the number of code words is (3・2^n-21) or more. Secondarily, a design which is called a checking design is proposed. For a given 2-rail code and a properly constructed checker, the checking design checks whether T is applied or not to every N₂ in the checker. If T is applied, the checker becomes an SCTC. Whether the checking design can construct an SCTC or not is a probability phenomenon mainly due to the number of code words in the given 2-rail code. Therefore, the probability is derived from practical experiments. The probability shows that SCTC's can be constructed by the checking design for most codes. Thirdly, an algorithmic design is proposed for codes consisting of a very few code words. A necessary and sufficient condition for which an SCTC can be constructed for a given code is presented, and the algorithmic design is described. The experimental results show that the algorithmic design can construct SCTC's successfully.
ER -