Semidefinite Programming Solutions for Elliptic Localization in Asynchronous Radar Networks
In this article, semidefinite programming (SDP) solutions are proposed for the elliptic localization problem in asynchronous radar networks, where the transmitters are subject to clock offsets. Relaxing the nonconvex problem into different convex forms, we design tight SDP (TSDP) and global SDP (GSD...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on aerospace and electronic systems 2022-08, Vol.58 (4), p.3385-3398 |
|---|---|
| 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 | 3398 |
|---|---|
| container_issue | 4 |
| container_start_page | 3385 |
| container_title | IEEE transactions on aerospace and electronic systems |
| container_volume | 58 |
| creator | Wu, Xiaoping Shen, Yana Zhu, Xuefen Lin, Qinman |
| description | In this article, semidefinite programming (SDP) solutions are proposed for the elliptic localization problem in asynchronous radar networks, where the transmitters are subject to clock offsets. Relaxing the nonconvex problem into different convex forms, we design tight SDP (TSDP) and global SDP (GSDP) solutions for this problem. The TSDP solution includes several SDP cones to solve the problem, and the correlation is not considered. Hence, the TSDP solution performs poorly in the presence of correlated noise. We further put forward the GSDP solution to improve the performance by introducing a new GSDP form, which includes only one SDP cone to handle the correlated noise. We also theoretically prove that the GSDP problem is tight enough so that its performance is able to sufficiently approach the Cramér–Rao lower bound (CRLB) accuracy. The simulated results show that the TSDP solution can provide the comparable performance with the GSDP in the absence of related noise. The performance of the GSDP solution can almost attain the CRLB accuracy using less receivers. |
| doi_str_mv | 10.1109/TAES.2022.3149855 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TAES_2022_3149855</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9709102</ieee_id><sourcerecordid>2700413931</sourcerecordid><originalsourceid>FETCH-LOGICAL-c293t-a79a2158688a854d6b75e2acc8a0aa138f08d42aae06de46b3bc2d07155f61063</originalsourceid><addsrcrecordid>eNo9kN9LwzAQx4MoOKd_gPgS8LnzkjRt8jjG_AFDxc0nH0KWpjOzbWbSIvOvt2XDp-O4z_eO-yB0TWBCCMi71XS-nFCgdMJIKgXnJ2hEOM8TmQE7RSMAIhJJOTlHFzFu-zYVKRuhj6WtXWFL17jW4tfgN0HXtWs2eOmrrnW-ibj0Ac-ryu1aZ_DCG125Xz2MsGvwNO4b8xl847uI33ShA3627Y8PX_ESnZW6ivbqWMfo_X6-mj0mi5eHp9l0kRgqWZvoXGpKuMiE0IKnRbbOuaXaGKFBa8JECaJIqdYWssKm2ZqtDS0g798rMwIZG6Pbw95d8N-dja3a-i40_UlFc4CUMMlIT5EDZYKPMdhS7YKrddgrAmpwqAaHanCojg77zM0h46y1_7zMQRKg7A-RhW5R</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2700413931</pqid></control><display><type>article</type><title>Semidefinite Programming Solutions for Elliptic Localization in Asynchronous Radar Networks</title><source>IEEE Electronic Library (IEL)</source><creator>Wu, Xiaoping ; Shen, Yana ; Zhu, Xuefen ; Lin, Qinman</creator><creatorcontrib>Wu, Xiaoping ; Shen, Yana ; Zhu, Xuefen ; Lin, Qinman</creatorcontrib><description>In this article, semidefinite programming (SDP) solutions are proposed for the elliptic localization problem in asynchronous radar networks, where the transmitters are subject to clock offsets. Relaxing the nonconvex problem into different convex forms, we design tight SDP (TSDP) and global SDP (GSDP) solutions for this problem. The TSDP solution includes several SDP cones to solve the problem, and the correlation is not considered. Hence, the TSDP solution performs poorly in the presence of correlated noise. We further put forward the GSDP solution to improve the performance by introducing a new GSDP form, which includes only one SDP cone to handle the correlated noise. We also theoretically prove that the GSDP problem is tight enough so that its performance is able to sufficiently approach the Cramér–Rao lower bound (CRLB) accuracy. The simulated results show that the TSDP solution can provide the comparable performance with the GSDP in the absence of related noise. The performance of the GSDP solution can almost attain the CRLB accuracy using less receivers.</description><identifier>ISSN: 0018-9251</identifier><identifier>EISSN: 1557-9603</identifier><identifier>DOI: 10.1109/TAES.2022.3149855</identifier><identifier>CODEN: IEARAX</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Asynchronous radar network ; clock offset ; Clocks ; Correlation ; Cramer-Rao bounds ; elliptic localization ; Localization ; Location awareness ; Lower bounds ; MIMO radar ; Performance enhancement ; Programming ; Radar ; Radar networks ; Receivers ; Semidefinite programming ; semidefinite programming (SDP) ; Transmitters</subject><ispartof>IEEE transactions on aerospace and electronic systems, 2022-08, Vol.58 (4), p.3385-3398</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c293t-a79a2158688a854d6b75e2acc8a0aa138f08d42aae06de46b3bc2d07155f61063</citedby><cites>FETCH-LOGICAL-c293t-a79a2158688a854d6b75e2acc8a0aa138f08d42aae06de46b3bc2d07155f61063</cites><orcidid>0000-0002-9150-791X ; 0000-0002-3588-9001</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9709102$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27903,27904,54736</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9709102$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Wu, Xiaoping</creatorcontrib><creatorcontrib>Shen, Yana</creatorcontrib><creatorcontrib>Zhu, Xuefen</creatorcontrib><creatorcontrib>Lin, Qinman</creatorcontrib><title>Semidefinite Programming Solutions for Elliptic Localization in Asynchronous Radar Networks</title><title>IEEE transactions on aerospace and electronic systems</title><addtitle>T-AES</addtitle><description>In this article, semidefinite programming (SDP) solutions are proposed for the elliptic localization problem in asynchronous radar networks, where the transmitters are subject to clock offsets. Relaxing the nonconvex problem into different convex forms, we design tight SDP (TSDP) and global SDP (GSDP) solutions for this problem. The TSDP solution includes several SDP cones to solve the problem, and the correlation is not considered. Hence, the TSDP solution performs poorly in the presence of correlated noise. We further put forward the GSDP solution to improve the performance by introducing a new GSDP form, which includes only one SDP cone to handle the correlated noise. We also theoretically prove that the GSDP problem is tight enough so that its performance is able to sufficiently approach the Cramér–Rao lower bound (CRLB) accuracy. The simulated results show that the TSDP solution can provide the comparable performance with the GSDP in the absence of related noise. The performance of the GSDP solution can almost attain the CRLB accuracy using less receivers.</description><subject>Asynchronous radar network</subject><subject>clock offset</subject><subject>Clocks</subject><subject>Correlation</subject><subject>Cramer-Rao bounds</subject><subject>elliptic localization</subject><subject>Localization</subject><subject>Location awareness</subject><subject>Lower bounds</subject><subject>MIMO radar</subject><subject>Performance enhancement</subject><subject>Programming</subject><subject>Radar</subject><subject>Radar networks</subject><subject>Receivers</subject><subject>Semidefinite programming</subject><subject>semidefinite programming (SDP)</subject><subject>Transmitters</subject><issn>0018-9251</issn><issn>1557-9603</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kN9LwzAQx4MoOKd_gPgS8LnzkjRt8jjG_AFDxc0nH0KWpjOzbWbSIvOvt2XDp-O4z_eO-yB0TWBCCMi71XS-nFCgdMJIKgXnJ2hEOM8TmQE7RSMAIhJJOTlHFzFu-zYVKRuhj6WtXWFL17jW4tfgN0HXtWs2eOmrrnW-ibj0Ac-ryu1aZ_DCG125Xz2MsGvwNO4b8xl847uI33ShA3627Y8PX_ESnZW6ivbqWMfo_X6-mj0mi5eHp9l0kRgqWZvoXGpKuMiE0IKnRbbOuaXaGKFBa8JECaJIqdYWssKm2ZqtDS0g798rMwIZG6Pbw95d8N-dja3a-i40_UlFc4CUMMlIT5EDZYKPMdhS7YKrddgrAmpwqAaHanCojg77zM0h46y1_7zMQRKg7A-RhW5R</recordid><startdate>20220801</startdate><enddate>20220801</enddate><creator>Wu, Xiaoping</creator><creator>Shen, Yana</creator><creator>Zhu, Xuefen</creator><creator>Lin, Qinman</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>H8D</scope><scope>L7M</scope><orcidid>https://orcid.org/0000-0002-9150-791X</orcidid><orcidid>https://orcid.org/0000-0002-3588-9001</orcidid></search><sort><creationdate>20220801</creationdate><title>Semidefinite Programming Solutions for Elliptic Localization in Asynchronous Radar Networks</title><author>Wu, Xiaoping ; Shen, Yana ; Zhu, Xuefen ; Lin, Qinman</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c293t-a79a2158688a854d6b75e2acc8a0aa138f08d42aae06de46b3bc2d07155f61063</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Asynchronous radar network</topic><topic>clock offset</topic><topic>Clocks</topic><topic>Correlation</topic><topic>Cramer-Rao bounds</topic><topic>elliptic localization</topic><topic>Localization</topic><topic>Location awareness</topic><topic>Lower bounds</topic><topic>MIMO radar</topic><topic>Performance enhancement</topic><topic>Programming</topic><topic>Radar</topic><topic>Radar networks</topic><topic>Receivers</topic><topic>Semidefinite programming</topic><topic>semidefinite programming (SDP)</topic><topic>Transmitters</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wu, Xiaoping</creatorcontrib><creatorcontrib>Shen, Yana</creatorcontrib><creatorcontrib>Zhu, Xuefen</creatorcontrib><creatorcontrib>Lin, Qinman</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Aerospace Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE transactions on aerospace and electronic systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Wu, Xiaoping</au><au>Shen, Yana</au><au>Zhu, Xuefen</au><au>Lin, Qinman</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Semidefinite Programming Solutions for Elliptic Localization in Asynchronous Radar Networks</atitle><jtitle>IEEE transactions on aerospace and electronic systems</jtitle><stitle>T-AES</stitle><date>2022-08-01</date><risdate>2022</risdate><volume>58</volume><issue>4</issue><spage>3385</spage><epage>3398</epage><pages>3385-3398</pages><issn>0018-9251</issn><eissn>1557-9603</eissn><coden>IEARAX</coden><abstract>In this article, semidefinite programming (SDP) solutions are proposed for the elliptic localization problem in asynchronous radar networks, where the transmitters are subject to clock offsets. Relaxing the nonconvex problem into different convex forms, we design tight SDP (TSDP) and global SDP (GSDP) solutions for this problem. The TSDP solution includes several SDP cones to solve the problem, and the correlation is not considered. Hence, the TSDP solution performs poorly in the presence of correlated noise. We further put forward the GSDP solution to improve the performance by introducing a new GSDP form, which includes only one SDP cone to handle the correlated noise. We also theoretically prove that the GSDP problem is tight enough so that its performance is able to sufficiently approach the Cramér–Rao lower bound (CRLB) accuracy. The simulated results show that the TSDP solution can provide the comparable performance with the GSDP in the absence of related noise. The performance of the GSDP solution can almost attain the CRLB accuracy using less receivers.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TAES.2022.3149855</doi><tpages>14</tpages><orcidid>https://orcid.org/0000-0002-9150-791X</orcidid><orcidid>https://orcid.org/0000-0002-3588-9001</orcidid></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9251 |
| ispartof | IEEE transactions on aerospace and electronic systems, 2022-08, Vol.58 (4), p.3385-3398 |
| issn | 0018-9251 1557-9603 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_TAES_2022_3149855 |
| source | IEEE Electronic Library (IEL) |
| subjects | Asynchronous radar network clock offset Clocks Correlation Cramer-Rao bounds elliptic localization Localization Location awareness Lower bounds MIMO radar Performance enhancement Programming Radar Radar networks Receivers Semidefinite programming semidefinite programming (SDP) Transmitters |
| title | Semidefinite Programming Solutions for Elliptic Localization in Asynchronous Radar Networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T12%3A32%3A31IST&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=Semidefinite%20Programming%20Solutions%20for%20Elliptic%20Localization%20in%20Asynchronous%20Radar%20Networks&rft.jtitle=IEEE%20transactions%20on%20aerospace%20and%20electronic%20systems&rft.au=Wu,%20Xiaoping&rft.date=2022-08-01&rft.volume=58&rft.issue=4&rft.spage=3385&rft.epage=3398&rft.pages=3385-3398&rft.issn=0018-9251&rft.eissn=1557-9603&rft.coden=IEARAX&rft_id=info:doi/10.1109/TAES.2022.3149855&rft_dat=%3Cproquest_RIE%3E2700413931%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=2700413931&rft_id=info:pmid/&rft_ieee_id=9709102&rfr_iscdi=true |