Research on Pattern Synthesis of Time Modulated Sparse Array Based on Discrete Variable Convex Optimization
Effective resource utilization is an important problem in the application of array, especially for the new time modulated array. Considering the problem of full utilization of array elements in time modulated array, a sparse optimization algorithm based on discrete variable convex optimization is pr...
Gespeichert in:
| Veröffentlicht in: | Wireless communications and mobile computing 2021, Vol.2021 (1) |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | 1 |
| container_start_page | |
| container_title | Wireless communications and mobile computing |
| container_volume | 2021 |
| creator | Tan, Jing Hu, Jiawen Dong, Xikuan Li, Hailin Zhou, Jianjiang |
| description | Effective resource utilization is an important problem in the application of array, especially for the new time modulated array. Considering the problem of full utilization of array elements in time modulated array, a sparse optimization algorithm based on discrete variable convex optimization is proposed in this paper. The pattern optimization of equal excitation time modulation array is realized in two stages: In the first stage, the number of working array elements is as low as possible under the condition of suppressing the sidelobe of the central frequency. In the second stage, the sideband is suppressed by iterative convex optimization. The numerical simulation results are compared with other methods to verify the effectiveness of the proposed method in pattern optimization of equal excitation time modulation array. Finally, the optimization performance of the algorithm with different array parameters is verified. |
| doi_str_mv | 10.1155/2021/6622168 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2514162738</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2514162738</sourcerecordid><originalsourceid>FETCH-LOGICAL-c337t-9b4623c74a86496073c5a56014868be99c491880d812c666328f2a543852adc63</originalsourceid><addsrcrecordid>eNp90E1PAjEQBuDGaCKiN39AE4-60o9tt3tE8CvBYAS9boZuNxRhu7ZFxV_vEohHTzOZPDOTvAidU3JNqRA9RhjtSckYleoAdajgJFEyyw7_epkfo5MQFoQQ3uIOen8xwYDXc-xq_AwxGl_jyaaOcxNswK7CU7sy-MmV6yVEU-JJAz4Y3PceNvgGQjtqN4c2aG-iwW_gLcyWBg9c_Wm-8biJdmV_IFpXn6KjCpbBnO1rF73e3U4HD8lofP846I8SzXkWk3yWSsZ1loKSaS5JxrUAIQlNlVQzk-c6zalSpFSUaSklZ6piIFKuBINSS95FF7u7jXcfaxNisXBrX7cvCyZoSiXLuGrV1U5p70Lwpioab1fgNwUlxTbOYhtnsY-z5Zc7Prd1CV_2f_0LPzty8g</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2514162738</pqid></control><display><type>article</type><title>Research on Pattern Synthesis of Time Modulated Sparse Array Based on Discrete Variable Convex Optimization</title><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><source>Wiley Online Library (Open Access Collection)</source><source>Alma/SFX Local Collection</source><creator>Tan, Jing ; Hu, Jiawen ; Dong, Xikuan ; Li, Hailin ; Zhou, Jianjiang</creator><contributor>Cai, Zhipeng ; Zhipeng Cai</contributor><creatorcontrib>Tan, Jing ; Hu, Jiawen ; Dong, Xikuan ; Li, Hailin ; Zhou, Jianjiang ; Cai, Zhipeng ; Zhipeng Cai</creatorcontrib><description>Effective resource utilization is an important problem in the application of array, especially for the new time modulated array. Considering the problem of full utilization of array elements in time modulated array, a sparse optimization algorithm based on discrete variable convex optimization is proposed in this paper. The pattern optimization of equal excitation time modulation array is realized in two stages: In the first stage, the number of working array elements is as low as possible under the condition of suppressing the sidelobe of the central frequency. In the second stage, the sideband is suppressed by iterative convex optimization. The numerical simulation results are compared with other methods to verify the effectiveness of the proposed method in pattern optimization of equal excitation time modulation array. Finally, the optimization performance of the algorithm with different array parameters is verified.</description><identifier>ISSN: 1530-8669</identifier><identifier>EISSN: 1530-8677</identifier><identifier>DOI: 10.1155/2021/6622168</identifier><language>eng</language><publisher>Oxford: Hindawi</publisher><subject>Algorithms ; Antennas ; Arrays ; Computational geometry ; Convex analysis ; Convexity ; Excitation ; Iterative methods ; Modulation ; Optimization ; Optimization algorithms ; Resource utilization ; Satellite communications ; Sidelobe reduction ; Sidelobes</subject><ispartof>Wireless communications and mobile computing, 2021, Vol.2021 (1)</ispartof><rights>Copyright © 2021 Jing Tan et al.</rights><rights>Copyright © 2021 Jing Tan et al. This work is licensed under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c337t-9b4623c74a86496073c5a56014868be99c491880d812c666328f2a543852adc63</citedby><cites>FETCH-LOGICAL-c337t-9b4623c74a86496073c5a56014868be99c491880d812c666328f2a543852adc63</cites><orcidid>0000-0003-3593-9985 ; 0000-0003-0006-9967 ; 0000-0002-6699-3610 ; 0000-0003-0172-2294</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,4024,27923,27924,27925</link.rule.ids></links><search><contributor>Cai, Zhipeng</contributor><contributor>Zhipeng Cai</contributor><creatorcontrib>Tan, Jing</creatorcontrib><creatorcontrib>Hu, Jiawen</creatorcontrib><creatorcontrib>Dong, Xikuan</creatorcontrib><creatorcontrib>Li, Hailin</creatorcontrib><creatorcontrib>Zhou, Jianjiang</creatorcontrib><title>Research on Pattern Synthesis of Time Modulated Sparse Array Based on Discrete Variable Convex Optimization</title><title>Wireless communications and mobile computing</title><description>Effective resource utilization is an important problem in the application of array, especially for the new time modulated array. Considering the problem of full utilization of array elements in time modulated array, a sparse optimization algorithm based on discrete variable convex optimization is proposed in this paper. The pattern optimization of equal excitation time modulation array is realized in two stages: In the first stage, the number of working array elements is as low as possible under the condition of suppressing the sidelobe of the central frequency. In the second stage, the sideband is suppressed by iterative convex optimization. The numerical simulation results are compared with other methods to verify the effectiveness of the proposed method in pattern optimization of equal excitation time modulation array. Finally, the optimization performance of the algorithm with different array parameters is verified.</description><subject>Algorithms</subject><subject>Antennas</subject><subject>Arrays</subject><subject>Computational geometry</subject><subject>Convex analysis</subject><subject>Convexity</subject><subject>Excitation</subject><subject>Iterative methods</subject><subject>Modulation</subject><subject>Optimization</subject><subject>Optimization algorithms</subject><subject>Resource utilization</subject><subject>Satellite communications</subject><subject>Sidelobe reduction</subject><subject>Sidelobes</subject><issn>1530-8669</issn><issn>1530-8677</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>RHX</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp90E1PAjEQBuDGaCKiN39AE4-60o9tt3tE8CvBYAS9boZuNxRhu7ZFxV_vEohHTzOZPDOTvAidU3JNqRA9RhjtSckYleoAdajgJFEyyw7_epkfo5MQFoQQ3uIOen8xwYDXc-xq_AwxGl_jyaaOcxNswK7CU7sy-MmV6yVEU-JJAz4Y3PceNvgGQjtqN4c2aG-iwW_gLcyWBg9c_Wm-8biJdmV_IFpXn6KjCpbBnO1rF73e3U4HD8lofP846I8SzXkWk3yWSsZ1loKSaS5JxrUAIQlNlVQzk-c6zalSpFSUaSklZ6piIFKuBINSS95FF7u7jXcfaxNisXBrX7cvCyZoSiXLuGrV1U5p70Lwpioab1fgNwUlxTbOYhtnsY-z5Zc7Prd1CV_2f_0LPzty8g</recordid><startdate>2021</startdate><enddate>2021</enddate><creator>Tan, Jing</creator><creator>Hu, Jiawen</creator><creator>Dong, Xikuan</creator><creator>Li, Hailin</creator><creator>Zhou, Jianjiang</creator><general>Hindawi</general><general>Hindawi Limited</general><scope>RHU</scope><scope>RHW</scope><scope>RHX</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7XB</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope><orcidid>https://orcid.org/0000-0003-3593-9985</orcidid><orcidid>https://orcid.org/0000-0003-0006-9967</orcidid><orcidid>https://orcid.org/0000-0002-6699-3610</orcidid><orcidid>https://orcid.org/0000-0003-0172-2294</orcidid></search><sort><creationdate>2021</creationdate><title>Research on Pattern Synthesis of Time Modulated Sparse Array Based on Discrete Variable Convex Optimization</title><author>Tan, Jing ; Hu, Jiawen ; Dong, Xikuan ; Li, Hailin ; Zhou, Jianjiang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c337t-9b4623c74a86496073c5a56014868be99c491880d812c666328f2a543852adc63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Antennas</topic><topic>Arrays</topic><topic>Computational geometry</topic><topic>Convex analysis</topic><topic>Convexity</topic><topic>Excitation</topic><topic>Iterative methods</topic><topic>Modulation</topic><topic>Optimization</topic><topic>Optimization algorithms</topic><topic>Resource utilization</topic><topic>Satellite communications</topic><topic>Sidelobe reduction</topic><topic>Sidelobes</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Tan, Jing</creatorcontrib><creatorcontrib>Hu, Jiawen</creatorcontrib><creatorcontrib>Dong, Xikuan</creatorcontrib><creatorcontrib>Li, Hailin</creatorcontrib><creatorcontrib>Zhou, Jianjiang</creatorcontrib><collection>Hindawi Publishing Complete</collection><collection>Hindawi Publishing Subscription Journals</collection><collection>Hindawi Publishing Open Access</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</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>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</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>Computing Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Access via ProQuest (Open Access)</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>ProQuest Central Basic</collection><jtitle>Wireless communications and mobile computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Tan, Jing</au><au>Hu, Jiawen</au><au>Dong, Xikuan</au><au>Li, Hailin</au><au>Zhou, Jianjiang</au><au>Cai, Zhipeng</au><au>Zhipeng Cai</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Research on Pattern Synthesis of Time Modulated Sparse Array Based on Discrete Variable Convex Optimization</atitle><jtitle>Wireless communications and mobile computing</jtitle><date>2021</date><risdate>2021</risdate><volume>2021</volume><issue>1</issue><issn>1530-8669</issn><eissn>1530-8677</eissn><abstract>Effective resource utilization is an important problem in the application of array, especially for the new time modulated array. Considering the problem of full utilization of array elements in time modulated array, a sparse optimization algorithm based on discrete variable convex optimization is proposed in this paper. The pattern optimization of equal excitation time modulation array is realized in two stages: In the first stage, the number of working array elements is as low as possible under the condition of suppressing the sidelobe of the central frequency. In the second stage, the sideband is suppressed by iterative convex optimization. The numerical simulation results are compared with other methods to verify the effectiveness of the proposed method in pattern optimization of equal excitation time modulation array. Finally, the optimization performance of the algorithm with different array parameters is verified.</abstract><cop>Oxford</cop><pub>Hindawi</pub><doi>10.1155/2021/6622168</doi><orcidid>https://orcid.org/0000-0003-3593-9985</orcidid><orcidid>https://orcid.org/0000-0003-0006-9967</orcidid><orcidid>https://orcid.org/0000-0002-6699-3610</orcidid><orcidid>https://orcid.org/0000-0003-0172-2294</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1530-8669 |
| ispartof | Wireless communications and mobile computing, 2021, Vol.2021 (1) |
| issn | 1530-8669 1530-8677 |
| language | eng |
| recordid | cdi_proquest_journals_2514162738 |
| source | Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals; Wiley Online Library (Open Access Collection); Alma/SFX Local Collection |
| subjects | Algorithms Antennas Arrays Computational geometry Convex analysis Convexity Excitation Iterative methods Modulation Optimization Optimization algorithms Resource utilization Satellite communications Sidelobe reduction Sidelobes |
| title | Research on Pattern Synthesis of Time Modulated Sparse Array Based on Discrete Variable Convex Optimization |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T06%3A42%3A23IST&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=Research%20on%20Pattern%20Synthesis%20of%20Time%20Modulated%20Sparse%20Array%20Based%20on%20Discrete%20Variable%20Convex%20Optimization&rft.jtitle=Wireless%20communications%20and%20mobile%20computing&rft.au=Tan,%20Jing&rft.date=2021&rft.volume=2021&rft.issue=1&rft.issn=1530-8669&rft.eissn=1530-8677&rft_id=info:doi/10.1155/2021/6622168&rft_dat=%3Cproquest_cross%3E2514162738%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2514162738&rft_id=info:pmid/&rfr_iscdi=true |