Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Avtomatika i Telemekhanika, 1985, Issue 2, Pages 165–167 (Mi at6898)  
Notes

Comparison of Signature Analysis with Trivial Compression in Detection of Faults of a Linear Combinational Circuit

R. Kh. Latypov

Kazan'
Full-text PDF (652 kB)
Abstract: For linear combinational circuits (LCC) signature analysis is shown to offer no advantages because the credibility of the resultant information is equal to that of trivial compression of the output sequence through truncation.

Received: 17.06.1983
Document Type: Article
UDC: 681.325.65, 681.326.7
Language: Russian
Citation: R. Kh. Latypov, “Comparison of Signature Analysis with Trivial Compression in Detection of Faults of a Linear Combinational Circuit”, Avtomat. i Telemekh., 1985, no. 2, 165–167
Citation in format AMSBIB
\Bibitem{Lat85}
\by R.~Kh.~Latypov
\paper Comparison of Signature Analysis with Trivial Compression in Detection of Faults of a~Linear Combinational Circuit
\jour Avtomat. i Telemekh.
\yr 1985
\issue 2
\pages 165--167
\mathnet{http://mi.mathnet.ru/at6898}
Linking options:
  • https://www.mathnet.ru/eng/at6898
  • https://www.mathnet.ru/eng/at/y1985/i2/p165
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:94
    Full-text PDF :41
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024