Optimal array pattern synthesis using semidefinite programming
We present algorithms for the solution of two problems in array pattern synthesis. The first is the design of nonuniform arrays with a desired magnitude response. The second is that of robust design, i.e., design in the presence of uncertainties. Constraints such as power limitation can be addressed...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on signal processing 2003-05, Vol.51 (5), p.1172-1183 |
|---|---|
| Hauptverfasser: | , , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1183 |
|---|---|
| container_issue | 5 |
| container_start_page | 1172 |
| container_title | IEEE transactions on signal processing |
| container_volume | 51 |
| creator | Fan Wang Balakrishnan, V. Zhou, P.Y. Chen, J.J. Yang, R. Frank, C. |
| description | We present algorithms for the solution of two problems in array pattern synthesis. The first is the design of nonuniform arrays with a desired magnitude response. The second is that of robust design, i.e., design in the presence of uncertainties. Constraints such as power limitation can be addressed with both problems. The algorithms that we present are based on semidefinite programming, for which efficient software is readily available. We present examples that illustrate the effectiveness of our approach. |
| doi_str_mv | 10.1109/TSP.2003.810308 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_pascalfrancis_primary_14696290</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1194408</ieee_id><sourcerecordid>2428619621</sourcerecordid><originalsourceid>FETCH-LOGICAL-c379t-649107abddf64738261c15d60ef823140b4d5b777b24fc72cf260a296d87e1993</originalsourceid><addsrcrecordid>eNp9kU1LAzEQhhdRsFbPHrwsgnradibJ5uMiSPELChWs4C2ku9masrutye6h_96UFgQPniYwz7zDPEmSS4QRIqjx_P1tRADoSCJQkEfJABXDDJjgx_ENOc1yKT5Pk7MQVgDImOKD5H626Vxj6tR4b7bpxnSd9W0atm33ZYMLaR9cu0yDbVxpK9e6zqYbv1560zSxcZ6cVKYO9uJQh8nH0-N88pJNZ8-vk4dpVlChuowzhSDMoiwrzgSVhGOBecnBVpJQZLBgZb4QQiwIqwpBiopwMETxUgqLStFhcrfPjbu_exs63bhQ2Lo2rV33QStALjiyHXn7L0lkzhhyGcHrP-Bq3fs2XqGlZCgpRYzQeA8Vfh2Ct5Xe-KjLbzWC3mnXUbveadd77XHi5hBrQmHqypu2cOF3jHHFiYLIXe05Z639bcc_YzHlB4HMicQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>884183311</pqid></control><display><type>article</type><title>Optimal array pattern synthesis using semidefinite programming</title><source>IEEE Electronic Library (IEL)</source><creator>Fan Wang ; Balakrishnan, V. ; Zhou, P.Y. ; Chen, J.J. ; Yang, R. ; Frank, C.</creator><creatorcontrib>Fan Wang ; Balakrishnan, V. ; Zhou, P.Y. ; Chen, J.J. ; Yang, R. ; Frank, C.</creatorcontrib><description>We present algorithms for the solution of two problems in array pattern synthesis. The first is the design of nonuniform arrays with a desired magnitude response. The second is that of robust design, i.e., design in the presence of uncertainties. Constraints such as power limitation can be addressed with both problems. The algorithms that we present are based on semidefinite programming, for which efficient software is readily available. We present examples that illustrate the effectiveness of our approach.</description><identifier>ISSN: 1053-587X</identifier><identifier>EISSN: 1941-0476</identifier><identifier>DOI: 10.1109/TSP.2003.810308</identifier><identifier>CODEN: ITPRED</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Algorithms ; Antenna arrays ; Antennas ; Applied sciences ; Arrays ; Computer programs ; Directive antennas ; Error correction ; Exact sciences and technology ; Linear antenna arrays ; Nonuniform ; Optimization ; Phased arrays ; Programming ; Radiocommunications ; Signal design ; Signal processing algorithms ; Signal synthesis ; Software ; Symmetric matrices ; Synthesis ; Telecommunications ; Telecommunications and information theory ; Transmission line matrix methods</subject><ispartof>IEEE transactions on signal processing, 2003-05, Vol.51 (5), p.1172-1183</ispartof><rights>2003 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2003</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c379t-649107abddf64738261c15d60ef823140b4d5b777b24fc72cf260a296d87e1993</citedby><cites>FETCH-LOGICAL-c379t-649107abddf64738261c15d60ef823140b4d5b777b24fc72cf260a296d87e1993</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1194408$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1194408$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=14696290$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Fan Wang</creatorcontrib><creatorcontrib>Balakrishnan, V.</creatorcontrib><creatorcontrib>Zhou, P.Y.</creatorcontrib><creatorcontrib>Chen, J.J.</creatorcontrib><creatorcontrib>Yang, R.</creatorcontrib><creatorcontrib>Frank, C.</creatorcontrib><title>Optimal array pattern synthesis using semidefinite programming</title><title>IEEE transactions on signal processing</title><addtitle>TSP</addtitle><description>We present algorithms for the solution of two problems in array pattern synthesis. The first is the design of nonuniform arrays with a desired magnitude response. The second is that of robust design, i.e., design in the presence of uncertainties. Constraints such as power limitation can be addressed with both problems. The algorithms that we present are based on semidefinite programming, for which efficient software is readily available. We present examples that illustrate the effectiveness of our approach.</description><subject>Algorithms</subject><subject>Antenna arrays</subject><subject>Antennas</subject><subject>Applied sciences</subject><subject>Arrays</subject><subject>Computer programs</subject><subject>Directive antennas</subject><subject>Error correction</subject><subject>Exact sciences and technology</subject><subject>Linear antenna arrays</subject><subject>Nonuniform</subject><subject>Optimization</subject><subject>Phased arrays</subject><subject>Programming</subject><subject>Radiocommunications</subject><subject>Signal design</subject><subject>Signal processing algorithms</subject><subject>Signal synthesis</subject><subject>Software</subject><subject>Symmetric matrices</subject><subject>Synthesis</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Transmission line matrix methods</subject><issn>1053-587X</issn><issn>1941-0476</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp9kU1LAzEQhhdRsFbPHrwsgnradibJ5uMiSPELChWs4C2ku9masrutye6h_96UFgQPniYwz7zDPEmSS4QRIqjx_P1tRADoSCJQkEfJABXDDJjgx_ENOc1yKT5Pk7MQVgDImOKD5H626Vxj6tR4b7bpxnSd9W0atm33ZYMLaR9cu0yDbVxpK9e6zqYbv1560zSxcZ6cVKYO9uJQh8nH0-N88pJNZ8-vk4dpVlChuowzhSDMoiwrzgSVhGOBecnBVpJQZLBgZb4QQiwIqwpBiopwMETxUgqLStFhcrfPjbu_exs63bhQ2Lo2rV33QStALjiyHXn7L0lkzhhyGcHrP-Bq3fs2XqGlZCgpRYzQeA8Vfh2Ct5Xe-KjLbzWC3mnXUbveadd77XHi5hBrQmHqypu2cOF3jHHFiYLIXe05Z639bcc_YzHlB4HMicQ</recordid><startdate>20030501</startdate><enddate>20030501</enddate><creator>Fan Wang</creator><creator>Balakrishnan, V.</creator><creator>Zhou, P.Y.</creator><creator>Chen, J.J.</creator><creator>Yang, R.</creator><creator>Frank, C.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20030501</creationdate><title>Optimal array pattern synthesis using semidefinite programming</title><author>Fan Wang ; Balakrishnan, V. ; Zhou, P.Y. ; Chen, J.J. ; Yang, R. ; Frank, C.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c379t-649107abddf64738261c15d60ef823140b4d5b777b24fc72cf260a296d87e1993</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Algorithms</topic><topic>Antenna arrays</topic><topic>Antennas</topic><topic>Applied sciences</topic><topic>Arrays</topic><topic>Computer programs</topic><topic>Directive antennas</topic><topic>Error correction</topic><topic>Exact sciences and technology</topic><topic>Linear antenna arrays</topic><topic>Nonuniform</topic><topic>Optimization</topic><topic>Phased arrays</topic><topic>Programming</topic><topic>Radiocommunications</topic><topic>Signal design</topic><topic>Signal processing algorithms</topic><topic>Signal synthesis</topic><topic>Software</topic><topic>Symmetric matrices</topic><topic>Synthesis</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Transmission line matrix methods</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Fan Wang</creatorcontrib><creatorcontrib>Balakrishnan, V.</creatorcontrib><creatorcontrib>Zhou, P.Y.</creatorcontrib><creatorcontrib>Chen, J.J.</creatorcontrib><creatorcontrib>Yang, R.</creatorcontrib><creatorcontrib>Frank, C.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science 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>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on signal processing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Fan Wang</au><au>Balakrishnan, V.</au><au>Zhou, P.Y.</au><au>Chen, J.J.</au><au>Yang, R.</au><au>Frank, C.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal array pattern synthesis using semidefinite programming</atitle><jtitle>IEEE transactions on signal processing</jtitle><stitle>TSP</stitle><date>2003-05-01</date><risdate>2003</risdate><volume>51</volume><issue>5</issue><spage>1172</spage><epage>1183</epage><pages>1172-1183</pages><issn>1053-587X</issn><eissn>1941-0476</eissn><coden>ITPRED</coden><abstract>We present algorithms for the solution of two problems in array pattern synthesis. The first is the design of nonuniform arrays with a desired magnitude response. The second is that of robust design, i.e., design in the presence of uncertainties. Constraints such as power limitation can be addressed with both problems. The algorithms that we present are based on semidefinite programming, for which efficient software is readily available. We present examples that illustrate the effectiveness of our approach.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TSP.2003.810308</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1053-587X |
| ispartof | IEEE transactions on signal processing, 2003-05, Vol.51 (5), p.1172-1183 |
| issn | 1053-587X 1941-0476 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_14696290 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms Antenna arrays Antennas Applied sciences Arrays Computer programs Directive antennas Error correction Exact sciences and technology Linear antenna arrays Nonuniform Optimization Phased arrays Programming Radiocommunications Signal design Signal processing algorithms Signal synthesis Software Symmetric matrices Synthesis Telecommunications Telecommunications and information theory Transmission line matrix methods |
| title | Optimal array pattern synthesis using semidefinite programming |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T06%3A51%3A30IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimal%20array%20pattern%20synthesis%20using%20semidefinite%20programming&rft.jtitle=IEEE%20transactions%20on%20signal%20processing&rft.au=Fan%20Wang&rft.date=2003-05-01&rft.volume=51&rft.issue=5&rft.spage=1172&rft.epage=1183&rft.pages=1172-1183&rft.issn=1053-587X&rft.eissn=1941-0476&rft.coden=ITPRED&rft_id=info:doi/10.1109/TSP.2003.810308&rft_dat=%3Cproquest_RIE%3E2428619621%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=884183311&rft_id=info:pmid/&rft_ieee_id=1194408&rfr_iscdi=true |