| Articolul precedent |
| Articolul urmator |
 |
 546 2 |
| Ultima descărcare din IBN: 2019-03-14 15:36 |
 SM ISO690:2012GRIŢCOV, Sergiu. Algorithmic complexity of pseudo-ring testing for stuck-at faults. In: Telecommunications, Electronics and Informatics, Ed. 5, 20-23 mai 2015, Chișinău. Chișinău, Republica Moldova: 2015, Ed. 5, pp. 75-76. ISBN 978-9975-45-377-6. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Telecommunications, Electronics and Informatics Ed. 5, 2015 |
||||||
|
Conferința "Telecommunications, Electronics and Informatics" 5, Chișinău, Moldova, 20-23 mai 2015 | ||||||
|
||||||
| Pag. 75-76 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
This paper describes calculation of algorithmic complexity of pseudo-ring testing obtained by simulation of stuck-at faults and realization of pseudo-ring testing of 4-bit and 8-bit memory. The method is designed for both bit- and wordoriented memory and it is invariant to the width of data bus of the memory. |
||||||
| Cuvinte-cheie Pseudo-ring testing, stuck-at faults, bit width invariance, generator polynomial, algorithmic complexity |
||||||
|
|
|
|
