|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
Fault Detecting Test Sets for Reed-Muller Canonic Networks
October 1975 (vol. 24 no. 10)
pp. 995-998
| ASCII Text | x | ||
| K.K. Saluja, S.M. Reddy, "Fault Detecting Test Sets for Reed-Muller Canonic Networks," IEEE Transactions on Computers, vol. 24, no. 10, pp. 995-998, October, 1975. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1975.224108, author = {K.K. Saluja and S.M. Reddy}, title = {Fault Detecting Test Sets for Reed-Muller Canonic Networks}, journal ={IEEE Transactions on Computers}, volume = {24}, number = {10}, issn = {0018-9340}, year = {1975}, pages = {995-998}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1975.224108}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Fault Detecting Test Sets for Reed-Muller Canonic Networks IS - 10 SN - 0018-9340 SP995 EP998 EPD - 995-998 A1 - K.K. Saluja, A1 - S.M. Reddy, PY - 1975 KW - Easily testable logic networks KW - multiple faults. VL - 24 JA - IEEE Transactions on Computers ER - | |||
Fault detecting test sets to detect multiple stuck-at-faults (s-a-faults) in certain networks, realizing Reed-Muller(RM) canonic expressions called RM canonic (RMC) networks, are given. It is shown that to detect t faults, t = 1, in a network realizing an arbitrary n-variable logic function only tests need be applied ([x] is the integer part of x) and that these tests are independent of the function being realized.
Index Terms:
Easily testable logic networks, multiple faults.
Citation:
K.K. Saluja, S.M. Reddy, "Fault Detecting Test Sets for Reed-Muller Canonic Networks," IEEE Transactions on Computers, vol. 24, no. 10, pp. 995-998, Oct. 1975, doi:10.1109/T-C.1975.224108
Usage of this product signifies your acceptance of the Terms of Use.

