Loading…
On Reducing Test Data Volume for Circular Scan Architecture Using Modified Shuffled Shepherd Optimization
In this manuscript, a novel test data compression (TDC) system is proposes for reducing a test data volume (TDV) for circular scan (CS) architecture. A modified version of meta-heuristic population based optimization approach, hence it is called shuffled shepherd optimization (SSO) and it is used to...
Saved in:
Published in: | Journal of electronic testing 2021-12, Vol.37 (5-6), p.577-592 |
---|---|
Main Authors: | , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c319t-c38c220821458c443ccd38985e33cace78b987c713011f548bea96ed9e4fd6703 |
---|---|
cites | cdi_FETCH-LOGICAL-c319t-c38c220821458c443ccd38985e33cace78b987c713011f548bea96ed9e4fd6703 |
container_end_page | 592 |
container_issue | 5-6 |
container_start_page | 577 |
container_title | Journal of electronic testing |
container_volume | 37 |
creator | Jayabalan, Muralidharan Srinivas, E. Shajin, Francis H. Rajesh, P. |
description | In this manuscript, a novel test data compression (TDC) system is proposes for reducing a test data volume (TDV) for circular scan (CS) architecture. A modified version of meta-heuristic population based optimization approach, hence it is called shuffled shepherd optimization (SSO) and it is used to optimize the conflicting bit minimization (CBM) problem. In CS framework, TDC is reached by upgrading only the conflicting bits among template pattern, real test pattern. Reduced test data volume and test application time are achieved by diminishing the Hamming distance between the currently captured response and the subsequent test vector. The CBM issue is formulated by a traveling salesman problem (TSP). Here, the test vectors are assumed by cities, the HD among test vectors a pair is assumed by distance of interurban. A modified version of the SSO algorithm called as MSSO is applied in combination using mutation operator for solving the issue of CBM. Experimental outcomes display the proposed TDC method using MSSO achieves an average development of 8.36% in compression ratio (CR) as well as 6.77% in TAT is attained by reducing a TDV. This proposed approach outperforms other state-of-art test data compression schemes by providing improved CR, TAT reduction and TDV reduction. |
doi_str_mv | 10.1007/s10836-021-05975-9 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2627006818</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2627006818</sourcerecordid><originalsourceid>FETCH-LOGICAL-c319t-c38c220821458c443ccd38985e33cace78b987c713011f548bea96ed9e4fd6703</originalsourceid><addsrcrecordid>eNp9kD1PwzAQhi0EEqXwB5gsMQf8kcT2iMqnVFSJtqyW65xbV20S7GSAX4_bILGx3N3wPne6B6FrSm4pIeIuUiJ5mRFGM1IoUWTqBI1oIXhGBBOnaEQU45mkIj9HFzFuSYJYUY6Qn9X4Hare-nqNFxA7_GA6gz-aXb8H7JqAJz7YfmcCnltT4_tgN74D2_UB8DIeqLem8s5Dheeb3rndcYB2A6HCs7bze_9tOt_Ul-jMmV2Eq98-Rsunx8XkJZvOnl8n99PMcqq6VKVljEhG80LaPOfWVlwqWQDn1lgQcqWksIJyQqkrcrkCo0qoFOSuKgXhY3Qz7G1D89mnj_S26UOdTmpWMkFIKalMKTakbGhiDOB0G_zehC9NiT4o1YNSnZTqo1KtEsQHKKZwvYbwt_of6geosXl2</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2627006818</pqid></control><display><type>article</type><title>On Reducing Test Data Volume for Circular Scan Architecture Using Modified Shuffled Shepherd Optimization</title><source>Springer Nature</source><creator>Jayabalan, Muralidharan ; Srinivas, E. ; Shajin, Francis H. ; Rajesh, P.</creator><creatorcontrib>Jayabalan, Muralidharan ; Srinivas, E. ; Shajin, Francis H. ; Rajesh, P.</creatorcontrib><description>In this manuscript, a novel test data compression (TDC) system is proposes for reducing a test data volume (TDV) for circular scan (CS) architecture. A modified version of meta-heuristic population based optimization approach, hence it is called shuffled shepherd optimization (SSO) and it is used to optimize the conflicting bit minimization (CBM) problem. In CS framework, TDC is reached by upgrading only the conflicting bits among template pattern, real test pattern. Reduced test data volume and test application time are achieved by diminishing the Hamming distance between the currently captured response and the subsequent test vector. The CBM issue is formulated by a traveling salesman problem (TSP). Here, the test vectors are assumed by cities, the HD among test vectors a pair is assumed by distance of interurban. A modified version of the SSO algorithm called as MSSO is applied in combination using mutation operator for solving the issue of CBM. Experimental outcomes display the proposed TDC method using MSSO achieves an average development of 8.36% in compression ratio (CR) as well as 6.77% in TAT is attained by reducing a TDV. This proposed approach outperforms other state-of-art test data compression schemes by providing improved CR, TAT reduction and TDV reduction.</description><identifier>ISSN: 0923-8174</identifier><identifier>EISSN: 1573-0727</identifier><identifier>DOI: 10.1007/s10836-021-05975-9</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; CAE) and Design ; Circuits and Systems ; Compression ratio ; Compression tests ; Computer-Aided Engineering (CAD ; Data compression ; Electrical Engineering ; Engineering ; Heuristic methods ; Mutation ; Optimization ; Reduction ; Traveling salesman problem</subject><ispartof>Journal of electronic testing, 2021-12, Vol.37 (5-6), p.577-592</ispartof><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021</rights><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c319t-c38c220821458c443ccd38985e33cace78b987c713011f548bea96ed9e4fd6703</citedby><cites>FETCH-LOGICAL-c319t-c38c220821458c443ccd38985e33cace78b987c713011f548bea96ed9e4fd6703</cites><orcidid>0000-0002-0055-6338</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Jayabalan, Muralidharan</creatorcontrib><creatorcontrib>Srinivas, E.</creatorcontrib><creatorcontrib>Shajin, Francis H.</creatorcontrib><creatorcontrib>Rajesh, P.</creatorcontrib><title>On Reducing Test Data Volume for Circular Scan Architecture Using Modified Shuffled Shepherd Optimization</title><title>Journal of electronic testing</title><addtitle>J Electron Test</addtitle><description>In this manuscript, a novel test data compression (TDC) system is proposes for reducing a test data volume (TDV) for circular scan (CS) architecture. A modified version of meta-heuristic population based optimization approach, hence it is called shuffled shepherd optimization (SSO) and it is used to optimize the conflicting bit minimization (CBM) problem. In CS framework, TDC is reached by upgrading only the conflicting bits among template pattern, real test pattern. Reduced test data volume and test application time are achieved by diminishing the Hamming distance between the currently captured response and the subsequent test vector. The CBM issue is formulated by a traveling salesman problem (TSP). Here, the test vectors are assumed by cities, the HD among test vectors a pair is assumed by distance of interurban. A modified version of the SSO algorithm called as MSSO is applied in combination using mutation operator for solving the issue of CBM. Experimental outcomes display the proposed TDC method using MSSO achieves an average development of 8.36% in compression ratio (CR) as well as 6.77% in TAT is attained by reducing a TDV. This proposed approach outperforms other state-of-art test data compression schemes by providing improved CR, TAT reduction and TDV reduction.</description><subject>Algorithms</subject><subject>CAE) and Design</subject><subject>Circuits and Systems</subject><subject>Compression ratio</subject><subject>Compression tests</subject><subject>Computer-Aided Engineering (CAD</subject><subject>Data compression</subject><subject>Electrical Engineering</subject><subject>Engineering</subject><subject>Heuristic methods</subject><subject>Mutation</subject><subject>Optimization</subject><subject>Reduction</subject><subject>Traveling salesman problem</subject><issn>0923-8174</issn><issn>1573-0727</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><recordid>eNp9kD1PwzAQhi0EEqXwB5gsMQf8kcT2iMqnVFSJtqyW65xbV20S7GSAX4_bILGx3N3wPne6B6FrSm4pIeIuUiJ5mRFGM1IoUWTqBI1oIXhGBBOnaEQU45mkIj9HFzFuSYJYUY6Qn9X4Hare-nqNFxA7_GA6gz-aXb8H7JqAJz7YfmcCnltT4_tgN74D2_UB8DIeqLem8s5Dheeb3rndcYB2A6HCs7bze_9tOt_Ul-jMmV2Eq98-Rsunx8XkJZvOnl8n99PMcqq6VKVljEhG80LaPOfWVlwqWQDn1lgQcqWksIJyQqkrcrkCo0qoFOSuKgXhY3Qz7G1D89mnj_S26UOdTmpWMkFIKalMKTakbGhiDOB0G_zehC9NiT4o1YNSnZTqo1KtEsQHKKZwvYbwt_of6geosXl2</recordid><startdate>20211201</startdate><enddate>20211201</enddate><creator>Jayabalan, Muralidharan</creator><creator>Srinivas, E.</creator><creator>Shajin, Francis H.</creator><creator>Rajesh, P.</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7QF</scope><scope>7QQ</scope><scope>7SC</scope><scope>7SE</scope><scope>7SP</scope><scope>7SR</scope><scope>7TA</scope><scope>7TB</scope><scope>7U5</scope><scope>7XB</scope><scope>88I</scope><scope>88K</scope><scope>8AO</scope><scope>8BQ</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>F28</scope><scope>FR3</scope><scope>GNUQQ</scope><scope>H8D</scope><scope>H8G</scope><scope>HCIFZ</scope><scope>JG9</scope><scope>JQ2</scope><scope>KR7</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M2P</scope><scope>M2T</scope><scope>M7S</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>S0W</scope><orcidid>https://orcid.org/0000-0002-0055-6338</orcidid></search><sort><creationdate>20211201</creationdate><title>On Reducing Test Data Volume for Circular Scan Architecture Using Modified Shuffled Shepherd Optimization</title><author>Jayabalan, Muralidharan ; Srinivas, E. ; Shajin, Francis H. ; Rajesh, P.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c319t-c38c220821458c443ccd38985e33cace78b987c713011f548bea96ed9e4fd6703</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>CAE) and Design</topic><topic>Circuits and Systems</topic><topic>Compression ratio</topic><topic>Compression tests</topic><topic>Computer-Aided Engineering (CAD</topic><topic>Data compression</topic><topic>Electrical Engineering</topic><topic>Engineering</topic><topic>Heuristic methods</topic><topic>Mutation</topic><topic>Optimization</topic><topic>Reduction</topic><topic>Traveling salesman problem</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Jayabalan, Muralidharan</creatorcontrib><creatorcontrib>Srinivas, E.</creatorcontrib><creatorcontrib>Shajin, Francis H.</creatorcontrib><creatorcontrib>Rajesh, P.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Aluminium Industry Abstracts</collection><collection>Ceramic Abstracts</collection><collection>Computer and Information Systems Abstracts</collection><collection>Corrosion Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Engineered Materials Abstracts</collection><collection>Materials Business File</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Solid State and Superconductivity Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Science Database (Alumni Edition)</collection><collection>Telecommunications (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><collection>ProQuest Central Student</collection><collection>Aerospace Database</collection><collection>Copper Technical Reference Library</collection><collection>SciTech Premium Collection</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Science Database</collection><collection>Telecommunications Database</collection><collection>Engineering Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><collection>DELNET Engineering & Technology Collection</collection><jtitle>Journal of electronic testing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Jayabalan, Muralidharan</au><au>Srinivas, E.</au><au>Shajin, Francis H.</au><au>Rajesh, P.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On Reducing Test Data Volume for Circular Scan Architecture Using Modified Shuffled Shepherd Optimization</atitle><jtitle>Journal of electronic testing</jtitle><stitle>J Electron Test</stitle><date>2021-12-01</date><risdate>2021</risdate><volume>37</volume><issue>5-6</issue><spage>577</spage><epage>592</epage><pages>577-592</pages><issn>0923-8174</issn><eissn>1573-0727</eissn><abstract>In this manuscript, a novel test data compression (TDC) system is proposes for reducing a test data volume (TDV) for circular scan (CS) architecture. A modified version of meta-heuristic population based optimization approach, hence it is called shuffled shepherd optimization (SSO) and it is used to optimize the conflicting bit minimization (CBM) problem. In CS framework, TDC is reached by upgrading only the conflicting bits among template pattern, real test pattern. Reduced test data volume and test application time are achieved by diminishing the Hamming distance between the currently captured response and the subsequent test vector. The CBM issue is formulated by a traveling salesman problem (TSP). Here, the test vectors are assumed by cities, the HD among test vectors a pair is assumed by distance of interurban. A modified version of the SSO algorithm called as MSSO is applied in combination using mutation operator for solving the issue of CBM. Experimental outcomes display the proposed TDC method using MSSO achieves an average development of 8.36% in compression ratio (CR) as well as 6.77% in TAT is attained by reducing a TDV. This proposed approach outperforms other state-of-art test data compression schemes by providing improved CR, TAT reduction and TDV reduction.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10836-021-05975-9</doi><tpages>16</tpages><orcidid>https://orcid.org/0000-0002-0055-6338</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0923-8174 |
ispartof | Journal of electronic testing, 2021-12, Vol.37 (5-6), p.577-592 |
issn | 0923-8174 1573-0727 |
language | eng |
recordid | cdi_proquest_journals_2627006818 |
source | Springer Nature |
subjects | Algorithms CAE) and Design Circuits and Systems Compression ratio Compression tests Computer-Aided Engineering (CAD Data compression Electrical Engineering Engineering Heuristic methods Mutation Optimization Reduction Traveling salesman problem |
title | On Reducing Test Data Volume for Circular Scan Architecture Using Modified Shuffled Shepherd Optimization |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T13%3A57%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20Reducing%20Test%20Data%20Volume%20for%20Circular%20Scan%20Architecture%20Using%20Modified%20Shuffled%20Shepherd%20Optimization&rft.jtitle=Journal%20of%20electronic%20testing&rft.au=Jayabalan,%20Muralidharan&rft.date=2021-12-01&rft.volume=37&rft.issue=5-6&rft.spage=577&rft.epage=592&rft.pages=577-592&rft.issn=0923-8174&rft.eissn=1573-0727&rft_id=info:doi/10.1007/s10836-021-05975-9&rft_dat=%3Cproquest_cross%3E2627006818%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c319t-c38c220821458c443ccd38985e33cace78b987c713011f548bea96ed9e4fd6703%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2627006818&rft_id=info:pmid/&rfr_iscdi=true |