Minimum-Complexity Failure Correction in Linear Arrays via Compressive Processing

Minimum-Complexity Failure Correction in Linear Arrays via Compressive Processing

Given an array with defective elements, failure correction (FC) aims at finding a new set of weights for the working elements so that the properties of the original pattern can be recovered. Unlike several FC techniques available in the literature, which update all the working excitations, the Minim...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2021-02
Hauptverfasser: Zardi, F, Oliveri, G, Salucci, M, Massa, A
Format: Artikel
Sprache:eng
Schlagworte:
Complexity
Computer Science - Systems and Control
Excitation
Failure
Linear arrays
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Zardi, F
Oliveri, G
Salucci, M
Massa, A
description Given an array with defective elements, failure correction (FC) aims at finding a new set of weights for the working elements so that the properties of the original pattern can be recovered. Unlike several FC techniques available in the literature, which update all the working excitations, the Minimum-Complexity Failure Correction (MCFC) problem is addressed in this paper. By properly reformulating the FC problem, the minimum number of corrections of the whole excitations of the array is determined by means of an innovative Compressive Processing (CP) technique in order to afford a pattern as close as possible to the original one (i.e., the array without failures). Selected examples, from a wide set of numerical test cases, are discussed to assess the effectiveness of the proposed approach as well as to compare its performance with other competitive state-of-the-art techniques in terms of both pattern features and number of corrections.
doi_str_mv 10.48550/arxiv.2102.02728
format Article
fullrecord <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2102_02728</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2486625204</sourcerecordid><originalsourceid>FETCH-LOGICAL-a524-8802507f8882af00aeb390d1e7c55a2b1b002b1d5eacf4249510aad25fe2fd193</originalsourceid><addsrcrecordid>eNotj81Lw0AUxBdBsNT-AZ5c8Jz69mU32R5LsCpUVOg9vCQb2ZKP-rYJ7X9vPzzNHGaG-QnxoGCurTHwTHzw4xwV4BwwRXsjJhjHKrIa8U7MQtgCACYpGhNPxPeH73w7tFHWt7vGHfz-KFfkm4GdzHpmV-5930nfybXvHLFcMtMxyNGTPFfYheBHJ7-4L8-2-7kXtzU1wc3-dSo2q5dN9hatP1_fs-U6IoM6shbQQFpba5FqAHJFvIBKubQ0hrBQxelkoSrjqKw16oVRQFShqR3WlVrEU_F4nb3w5jv2LfExP3PnF-5T4uma2HH_O7iwz7f9wN3pU47aJgkaBB3_ARHHW10</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2486625204</pqid></control><display><type>article</type><title>Minimum-Complexity Failure Correction in Linear Arrays via Compressive Processing</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Zardi, F ; Oliveri, G ; Salucci, M ; Massa, A</creator><creatorcontrib>Zardi, F ; Oliveri, G ; Salucci, M ; Massa, A</creatorcontrib><description>Given an array with defective elements, failure correction (FC) aims at finding a new set of weights for the working elements so that the properties of the original pattern can be recovered. Unlike several FC techniques available in the literature, which update all the working excitations, the Minimum-Complexity Failure Correction (MCFC) problem is addressed in this paper. By properly reformulating the FC problem, the minimum number of corrections of the whole excitations of the array is determined by means of an innovative Compressive Processing (CP) technique in order to afford a pattern as close as possible to the original one (i.e., the array without failures). Selected examples, from a wide set of numerical test cases, are discussed to assess the effectiveness of the proposed approach as well as to compare its performance with other competitive state-of-the-art techniques in terms of both pattern features and number of corrections.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2102.02728</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Complexity ; Computer Science - Systems and Control ; Excitation ; Failure ; Linear arrays</subject><ispartof>arXiv.org, 2021-02</ispartof><rights>2021. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,780,881,27904</link.rule.ids><backlink>$$Uhttps://doi.org/10.1109/TAP.2020.3045511$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.2102.02728$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Zardi, F</creatorcontrib><creatorcontrib>Oliveri, G</creatorcontrib><creatorcontrib>Salucci, M</creatorcontrib><creatorcontrib>Massa, A</creatorcontrib><title>Minimum-Complexity Failure Correction in Linear Arrays via Compressive Processing</title><title>arXiv.org</title><description>Given an array with defective elements, failure correction (FC) aims at finding a new set of weights for the working elements so that the properties of the original pattern can be recovered. Unlike several FC techniques available in the literature, which update all the working excitations, the Minimum-Complexity Failure Correction (MCFC) problem is addressed in this paper. By properly reformulating the FC problem, the minimum number of corrections of the whole excitations of the array is determined by means of an innovative Compressive Processing (CP) technique in order to afford a pattern as close as possible to the original one (i.e., the array without failures). Selected examples, from a wide set of numerical test cases, are discussed to assess the effectiveness of the proposed approach as well as to compare its performance with other competitive state-of-the-art techniques in terms of both pattern features and number of corrections.</description><subject>Complexity</subject><subject>Computer Science - Systems and Control</subject><subject>Excitation</subject><subject>Failure</subject><subject>Linear arrays</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotj81Lw0AUxBdBsNT-AZ5c8Jz69mU32R5LsCpUVOg9vCQb2ZKP-rYJ7X9vPzzNHGaG-QnxoGCurTHwTHzw4xwV4BwwRXsjJhjHKrIa8U7MQtgCACYpGhNPxPeH73w7tFHWt7vGHfz-KFfkm4GdzHpmV-5930nfybXvHLFcMtMxyNGTPFfYheBHJ7-4L8-2-7kXtzU1wc3-dSo2q5dN9hatP1_fs-U6IoM6shbQQFpba5FqAHJFvIBKubQ0hrBQxelkoSrjqKw16oVRQFShqR3WlVrEU_F4nb3w5jv2LfExP3PnF-5T4uma2HH_O7iwz7f9wN3pU47aJgkaBB3_ARHHW10</recordid><startdate>20210204</startdate><enddate>20210204</enddate><creator>Zardi, F</creator><creator>Oliveri, G</creator><creator>Salucci, M</creator><creator>Massa, A</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</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>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20210204</creationdate><title>Minimum-Complexity Failure Correction in Linear Arrays via Compressive Processing</title><author>Zardi, F ; Oliveri, G ; Salucci, M ; Massa, A</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a524-8802507f8882af00aeb390d1e7c55a2b1b002b1d5eacf4249510aad25fe2fd193</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Complexity</topic><topic>Computer Science - Systems and Control</topic><topic>Excitation</topic><topic>Failure</topic><topic>Linear arrays</topic><toplevel>online_resources</toplevel><creatorcontrib>Zardi, F</creatorcontrib><creatorcontrib>Oliveri, G</creatorcontrib><creatorcontrib>Salucci, M</creatorcontrib><creatorcontrib>Massa, A</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content 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>arXiv Computer Science</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zardi, F</au><au>Oliveri, G</au><au>Salucci, M</au><au>Massa, A</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Minimum-Complexity Failure Correction in Linear Arrays via Compressive Processing</atitle><jtitle>arXiv.org</jtitle><date>2021-02-04</date><risdate>2021</risdate><eissn>2331-8422</eissn><abstract>Given an array with defective elements, failure correction (FC) aims at finding a new set of weights for the working elements so that the properties of the original pattern can be recovered. Unlike several FC techniques available in the literature, which update all the working excitations, the Minimum-Complexity Failure Correction (MCFC) problem is addressed in this paper. By properly reformulating the FC problem, the minimum number of corrections of the whole excitations of the array is determined by means of an innovative Compressive Processing (CP) technique in order to afford a pattern as close as possible to the original one (i.e., the array without failures). Selected examples, from a wide set of numerical test cases, are discussed to assess the effectiveness of the proposed approach as well as to compare its performance with other competitive state-of-the-art techniques in terms of both pattern features and number of corrections.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2102.02728</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2021-02
issn 2331-8422
language eng
recordid cdi_arxiv_primary_2102_02728
source arXiv.org; Free E- Journals
subjects Complexity
Computer Science - Systems and Control
Excitation
Failure
Linear arrays
title Minimum-Complexity Failure Correction in Linear Arrays via Compressive Processing
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T14%3A29%3A11IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Minimum-Complexity%20Failure%20Correction%20in%20Linear%20Arrays%20via%20Compressive%20Processing&rft.jtitle=arXiv.org&rft.au=Zardi,%20F&rft.date=2021-02-04&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2102.02728&rft_dat=%3Cproquest_arxiv%3E2486625204%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2486625204&rft_id=info:pmid/&rfr_iscdi=true