Evaluation of Code-Word Subsets to Ensure the Self-Testing Property of a Checker

The method of a self-testing (m, n)-code checker design based on the use of CLBs is considered. CLBs are supposed to be carried out in the framework of LUT-technology. To design the checker, a special expansion formula is used. The set V of checker faults includes all multiple stuck-at faults occurr...

Full description

Saved in:
Bibliographic Details
Main Authors: Butorina, Natalia, Burkatovskaya, Yulia, Pakhomova, Elena
Format: Conference Proceeding
Language:English
Subjects:
Boolean functions
Built-in self-test
Circuit faults
Complexity theory
Detectors
Integrated circuit reliability
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 6
container_issue
container_start_page 1
container_title
container_volume
creator Butorina, Natalia
Burkatovskaya, Yulia
Pakhomova, Elena
description The method of a self-testing (m, n)-code checker design based on the use of CLBs is considered. CLBs are supposed to be carried out in the framework of LUT-technology. To design the checker, a special expansion formula is used. The set V of checker faults includes all multiple stuck-at faults occurred at CLB inputs. The number l of code words appearing at the inputs of the checker can be less than the number of all possible code words. It implies that some faults of the self-testing checker connected to the outputs of the self-checking circuit can be undetectable. The paper establishes a property of a subset of code words, which allows us to check if a given subset provides the self-testing property of the checker. The property is used in the developed algorithm for analyzing a subset of code words.
doi_str_mv 10.1109/EWDTS.2018.8524847
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_8524847</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8524847</ieee_id><sourcerecordid>8524847</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-3ff53e1ae92cd120f27c51fd4d6063035b7351d50ab2f8785d61cb7cfda8d50f3</originalsourceid><addsrcrecordid>eNotkF1LwzAYRqMgOGb_gN7kD7TmTZomvZRaP2DgoJV5N9LmjavWdSSpsH-v4q4eOHDOxUPINbAMgJW39ea-bTLOQGda8lzn6owkpdIghS6kAsbPyYLniqeqgLdLkoTwwRiDAmTJYUHW9bcZZxOHaU8nR6vJYrqZvKXN3AWMgcaJ1vswe6Rxh7TB0aUthjjs3-naTwf08fgnGlrtsP9Ef0UunBkDJqddkteHuq2e0tXL43N1t0oHUDKmwjkpEAyWvLfAmeOql-BsbgtWCCZkp4QEK5npuNNKS1tA36neWaN_qRNLcvPfHRBxe_DDl_HH7ekD8QMowE_2</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Evaluation of Code-Word Subsets to Ensure the Self-Testing Property of a Checker</title><source>IEEE Xplore All Conference Series</source><creator>Butorina, Natalia ; Burkatovskaya, Yulia ; Pakhomova, Elena</creator><creatorcontrib>Butorina, Natalia ; Burkatovskaya, Yulia ; Pakhomova, Elena</creatorcontrib><description>The method of a self-testing (m, n)-code checker design based on the use of CLBs is considered. CLBs are supposed to be carried out in the framework of LUT-technology. To design the checker, a special expansion formula is used. The set V of checker faults includes all multiple stuck-at faults occurred at CLB inputs. The number l of code words appearing at the inputs of the checker can be less than the number of all possible code words. It implies that some faults of the self-testing checker connected to the outputs of the self-checking circuit can be undetectable. The paper establishes a property of a subset of code words, which allows us to check if a given subset provides the self-testing property of the checker. The property is used in the developed algorithm for analyzing a subset of code words.</description><identifier>EISSN: 2472-761X</identifier><identifier>EISBN: 9781538657102</identifier><identifier>EISBN: 1538657104</identifier><identifier>DOI: 10.1109/EWDTS.2018.8524847</identifier><language>eng</language><publisher>IEEE</publisher><subject>Boolean functions ; Built-in self-test ; Circuit faults ; Complexity theory ; Detectors ; Integrated circuit reliability</subject><ispartof>2018 IEEE East-West Design &amp; Test Symposium (EWDTS), 2018, p.1-6</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8524847$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,27925,54555,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8524847$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Butorina, Natalia</creatorcontrib><creatorcontrib>Burkatovskaya, Yulia</creatorcontrib><creatorcontrib>Pakhomova, Elena</creatorcontrib><title>Evaluation of Code-Word Subsets to Ensure the Self-Testing Property of a Checker</title><title>2018 IEEE East-West Design &amp; Test Symposium (EWDTS)</title><addtitle>EWDTS</addtitle><description>The method of a self-testing (m, n)-code checker design based on the use of CLBs is considered. CLBs are supposed to be carried out in the framework of LUT-technology. To design the checker, a special expansion formula is used. The set V of checker faults includes all multiple stuck-at faults occurred at CLB inputs. The number l of code words appearing at the inputs of the checker can be less than the number of all possible code words. It implies that some faults of the self-testing checker connected to the outputs of the self-checking circuit can be undetectable. The paper establishes a property of a subset of code words, which allows us to check if a given subset provides the self-testing property of the checker. The property is used in the developed algorithm for analyzing a subset of code words.</description><subject>Boolean functions</subject><subject>Built-in self-test</subject><subject>Circuit faults</subject><subject>Complexity theory</subject><subject>Detectors</subject><subject>Integrated circuit reliability</subject><issn>2472-761X</issn><isbn>9781538657102</isbn><isbn>1538657104</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2018</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotkF1LwzAYRqMgOGb_gN7kD7TmTZomvZRaP2DgoJV5N9LmjavWdSSpsH-v4q4eOHDOxUPINbAMgJW39ea-bTLOQGda8lzn6owkpdIghS6kAsbPyYLniqeqgLdLkoTwwRiDAmTJYUHW9bcZZxOHaU8nR6vJYrqZvKXN3AWMgcaJ1vswe6Rxh7TB0aUthjjs3-naTwf08fgnGlrtsP9Ef0UunBkDJqddkteHuq2e0tXL43N1t0oHUDKmwjkpEAyWvLfAmeOql-BsbgtWCCZkp4QEK5npuNNKS1tA36neWaN_qRNLcvPfHRBxe_DDl_HH7ekD8QMowE_2</recordid><startdate>201809</startdate><enddate>201809</enddate><creator>Butorina, Natalia</creator><creator>Burkatovskaya, Yulia</creator><creator>Pakhomova, Elena</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201809</creationdate><title>Evaluation of Code-Word Subsets to Ensure the Self-Testing Property of a Checker</title><author>Butorina, Natalia ; Burkatovskaya, Yulia ; Pakhomova, Elena</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-3ff53e1ae92cd120f27c51fd4d6063035b7351d50ab2f8785d61cb7cfda8d50f3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Boolean functions</topic><topic>Built-in self-test</topic><topic>Circuit faults</topic><topic>Complexity theory</topic><topic>Detectors</topic><topic>Integrated circuit reliability</topic><toplevel>online_resources</toplevel><creatorcontrib>Butorina, Natalia</creatorcontrib><creatorcontrib>Burkatovskaya, Yulia</creatorcontrib><creatorcontrib>Pakhomova, Elena</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore (Online service)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Butorina, Natalia</au><au>Burkatovskaya, Yulia</au><au>Pakhomova, Elena</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Evaluation of Code-Word Subsets to Ensure the Self-Testing Property of a Checker</atitle><btitle>2018 IEEE East-West Design &amp; Test Symposium (EWDTS)</btitle><stitle>EWDTS</stitle><date>2018-09</date><risdate>2018</risdate><spage>1</spage><epage>6</epage><pages>1-6</pages><eissn>2472-761X</eissn><eisbn>9781538657102</eisbn><eisbn>1538657104</eisbn><abstract>The method of a self-testing (m, n)-code checker design based on the use of CLBs is considered. CLBs are supposed to be carried out in the framework of LUT-technology. To design the checker, a special expansion formula is used. The set V of checker faults includes all multiple stuck-at faults occurred at CLB inputs. The number l of code words appearing at the inputs of the checker can be less than the number of all possible code words. It implies that some faults of the self-testing checker connected to the outputs of the self-checking circuit can be undetectable. The paper establishes a property of a subset of code words, which allows us to check if a given subset provides the self-testing property of the checker. The property is used in the developed algorithm for analyzing a subset of code words.</abstract><pub>IEEE</pub><doi>10.1109/EWDTS.2018.8524847</doi><tpages>6</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier EISSN: 2472-761X
ispartof 2018 IEEE East-West Design & Test Symposium (EWDTS), 2018, p.1-6
issn 2472-761X
language eng
recordid cdi_ieee_primary_8524847
source IEEE Xplore All Conference Series
subjects Boolean functions
Built-in self-test
Circuit faults
Complexity theory
Detectors
Integrated circuit reliability
title Evaluation of Code-Word Subsets to Ensure the Self-Testing Property of a Checker
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T19%3A42%3A51IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Evaluation%20of%20Code-Word%20Subsets%20to%20Ensure%20the%20Self-Testing%20Property%20of%20a%20Checker&rft.btitle=2018%20IEEE%20East-West%20Design%20&%20Test%20Symposium%20(EWDTS)&rft.au=Butorina,%20Natalia&rft.date=2018-09&rft.spage=1&rft.epage=6&rft.pages=1-6&rft.eissn=2472-761X&rft_id=info:doi/10.1109/EWDTS.2018.8524847&rft.eisbn=9781538657102&rft.eisbn_list=1538657104&rft_dat=%3Cieee_CHZPO%3E8524847%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-3ff53e1ae92cd120f27c51fd4d6063035b7351d50ab2f8785d61cb7cfda8d50f3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=8524847&rfr_iscdi=true