We show that for an arbitrary Boolean function realized by a combinational circuit with elements from a basis whose extension contains the function xy (x\( \overline{y} \)), there exists a circuit that allows a single-fault detection test with at most three (resp. four) tuples.
Similar content being viewed by others
References
V. Geetha, N. Devarajan, and P. N. Neelakantan, “Analysis of different types of faults in a class of Boolean circuits,” International Journal of Engineering and Innovative Technology (IJEIT), 2, No. 4, 145–149 (2012).
V. Geetha, N. Devarajan, and P. N. Neelakantan, “Single network structure for stuck-at and bridging fault analysis and diagnosis for Exclusive-OR sum of products in Reed–Muller canonical circuits,” Elixir Elec. Eng., 57, 14080–14085 (2013).
V. Geetha, N. Devarajan, and P. N. Neelakantan, “Network structure for testability improvement in exclusive-OR sum of products Reed–Muller canonical circuits,” Int. J. Eng. Res. Gen. Sci., 3, No. 3, 368–378 (2015).
A. K. Jameil, “A new single stuck fault detection algorithm for digital circuits,” Int. J. Eng. Res. Gen. Sci., 3, No. 1, 1050–1056 (2015).
S. M. Reddy, “Easily testable realization for logic functions,” IEEE Trans. Comput., 21, No. 1, 124–141 (1972).
S. M. Thamarai, K. Kuppusamy, and T. Meyyappan, “Fault detection and test minimization methods for combinational circuits — A survey,” International Journal of Computer Trends and Technology, 2, No. 2, 140–146 (2011).
Yu. V. Borodina, “Synthesis of easily-testable stuck-on faults of the same type on gate outputs,” Vestnik MGU, series 15: Vychisl. Mat. i Kibernet., No. 1, 40–44 (2008); English translation: Moscow University Computational Mathematics and Cybernetics, 32, No. 1, 42–46 (2008); DOI: 10.3103/S0278641908010068.
Yu. V. Borodina, “Circuits admitting single-fault tests of length 1 for stuck-on faults on gate outputs,” Vestnik MGU, series 1: Math. Mechan., 63, No. 5, 49–52 (2008); English translation: Moscow University Mathematics Bulletin, 63, No. 5, 202–204 (2008); DOI: 10.3103/S0027132208050069.
Yu. V. Borodina and P. A. Borodin, “Synthesis of easily testable circuits over the Zhegalkin basis for stuck-on-0 faults on gate outputs,” Discr. Math., 22, No. 3, 127–133 (2010); English translation: Discr. Math., 20, No. 4, 441–449 (2010); DOI: 10.1515/dma.2010.027.
S. V. Kovatsenko, “Synthesis of easily testable circuits in the Zhegalkin basis for inversion faults,” Vestnik MGU, series 15: Vychisl. Mat. Kibernet., No. 2, 45–47 (2000).
S. S. Kolyada, “On single-fault detection tests for stuck-on faults on outputs of combinational elements,” Vestnik MGU, series 1: Math. Mechan., No. 6, 47–49 (2011); English translation: Moscow Univ. Math. Bull., 66, 267–269 (2011); DOI: 10.3103/S002713221106009X.
S. S. Kolyada, “Single fault detection tests for combinational circuits in bases of elements with at mot two inputs,” Discrete Analysis and Operations Research, 20, No. 2, 58–74 (2013).
S. S. Kolyada, “Single fault detection tests for combinational circuits,” Vestnik MGU, series 1: Math., Mechan., No. 4, 32–34 (2013); English translation: Moscow Univ. Math. Bull., 68, 192–193 (2013); DOI: 10.3103/S0027132213040049.
K. A. Popkov, “Lower bounds on the lengths of single fault tests for combinational circuits,” Diskr. Mat., 29, No. 2, 53–69 (2017); English translation: Discrete Mathematics and Applications, 29, No. 1, 23–33 (2019); DOI: 10.1515/dma-2019–0004.
K. A. Popkov, “Single fault detection tests for combinational circuits in the ‘conjunction-negation’ basis,” Prikl. Diskr. Mat., 38, 66–88 (2017).
K. A. Popkov, “Short single-fault tests for arbitrary stuck-on faults on gte outputs,” Diskr. Mat., 30, No. 3, 99–116 (2018); English translation: Discrete Mathematics and Applications, 29, No. 5, 321–333 (2019); DOI: 10.1515/dma-2019-0030.
K. A. Popkov, “Circuits admitting short single-fault detection tests for arbitrary faults in combinational elements,” Prikl. Diskr. Mat., No. 51, 85–100 (2021).
N. N. Red’kin, Reliability and Circuit Diagnosis [in Russian], Izd. MGU, Moscow (1992).
N. N. Red’kin, “Single-fault detection tests for circuits with inversion faults,” Matem. Voprosy Kibern., Fizmatlit, Moscow, No. 12, 217–230 (2003).
D. S. Romanov, “Synthesis of easily testable circuits admitting single-fault tests of constant length,” Diskr. Mat., 26, No. 2, 100–130 (2014); English translation: Discrete Mathematics and Applications, 24, No. 4, 227–251 (2014); DOI: 10.1515/dma-2014-0021.
D. S. Romanov and E. Yu. Romanova, “Synthesis of irredundant circuits admitting single-fault detection tests of constant length,” Diskr. Mat., 29, No. 4, 87–105 (2017); English translation: Discrete Mathematics and Applications, 29, No. 1, 35–48 (2019); DOI: 10.1515/dma-2019-0005.
G. G. Temerbekova and D. S. Romanov, “On single-fault detection tests with respect to substitution of inverters for logic gates,” Uchenye Zapizki Kazan. Univ., Series: Phys.-Math. Sci., 162, No. 3, 359–366 (2020).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Prikladnaya Matematika i Informatika, No. 67, 2021, pp. 89–100.
Rights and permissions
About this article
Cite this article
Temerbekova, G., Romanov, D.S. The Length of Single-Fault Detection Tests with Respect to Substitution of Inverters for Combinational Elements in Some Bases. Comput Math Model 32, 356–363 (2021). https://doi.org/10.1007/s10598-021-09540-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10598-021-09540-z