Separation of Interleaved Pulse Stream based on Directed Acyclic Graphs
In pulse deinterleaving, the search procedure may fail because of missing pulses and pulse repetition interval (PRI) jitter. This study proposes a search method based on the directed acyclic graph (DAG). In this graph, pulses are vertices and the extracted pulse pairs are arcs. The greater the lengt...
Gespeichert in:
| Veröffentlicht in: | IEEE signal processing letters 2023-01, Vol.30, p.1-5 |
|---|---|
| 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 | 5 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | IEEE signal processing letters |
| container_volume | 30 |
| creator | Xie, Min Zhao, Chuang Han, Xiao Wang, Zewen Hu, Dexiu |
| description | In pulse deinterleaving, the search procedure may fail because of missing pulses and pulse repetition interval (PRI) jitter. This study proposes a search method based on the directed acyclic graph (DAG). In this graph, pulses are vertices and the extracted pulse pairs are arcs. The greater the length of the "path", the higher is the confidence level of the corresponding pulse sequence. Therefore, this problem is transformed into a problem associated with the extraction of the longest "path" from DAG. Since pulse segments have more confidence than individual pulses, the proposed method may have important implications and broad application prospects. |
| doi_str_mv | 10.1109/LSP.2023.3254439 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_LSP_2023_3254439</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>10064114</ieee_id><sourcerecordid>2821718444</sourcerecordid><originalsourceid>FETCH-LOGICAL-c245t-4748e119b9616c384690598d742e2d2fd28fb2c81f53402713df630eb6dd35683</originalsourceid><addsrcrecordid>eNpNkE1LAzEQhoMoWKt3Dx4WPG-dydcmx1K1FgoWqueQTbK4pe2uyVbw35vSHjzNy_DMDPMQco8wQQT9tFyvJhQomzAqOGf6goxQCFVSJvEyZ6ig1BrUNblJaQMACpUYkfk69Dbaoe32RdcUi_0Q4jbYn-CL1WGbQrEeYrC7orYptzL03Mbghpyn7tdtW1fMo-2_0i25amzm7851TD5fXz5mb-Xyfb6YTZelo1wMJa-4Coi61hKlY4pLDUIrX3EaqKeNp6qpqVPYCMaBVsh8IxmEWnrPhFRsTB5Pe_vYfR9CGsymO8R9Pmmoolih4vn7MYET5WKXUgyN6WO7s_HXIJijLpN1maMuc9aVRx5OI20I4R8OkiNy9gdIqWQo</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2821718444</pqid></control><display><type>article</type><title>Separation of Interleaved Pulse Stream based on Directed Acyclic Graphs</title><source>IEEE Electronic Library (IEL)</source><creator>Xie, Min ; Zhao, Chuang ; Han, Xiao ; Wang, Zewen ; Hu, Dexiu</creator><creatorcontrib>Xie, Min ; Zhao, Chuang ; Han, Xiao ; Wang, Zewen ; Hu, Dexiu</creatorcontrib><description>In pulse deinterleaving, the search procedure may fail because of missing pulses and pulse repetition interval (PRI) jitter. This study proposes a search method based on the directed acyclic graph (DAG). In this graph, pulses are vertices and the extracted pulse pairs are arcs. The greater the length of the "path", the higher is the confidence level of the corresponding pulse sequence. Therefore, this problem is transformed into a problem associated with the extraction of the longest "path" from DAG. Since pulse segments have more confidence than individual pulses, the proposed method may have important implications and broad application prospects.</description><identifier>ISSN: 1070-9908</identifier><identifier>EISSN: 1558-2361</identifier><identifier>DOI: 10.1109/LSP.2023.3254439</identifier><identifier>CODEN: ISPLEM</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Apexes ; Benchmark testing ; Confidence intervals ; Directed acyclic graph ; Graph theory ; Histograms ; Jitter ; path ; pulse pair ; Pulse repetition interval ; Search methods ; Search problems ; sequence search ; Signal processing algorithms ; Switches ; TOA deinterleaving ; Transforms</subject><ispartof>IEEE signal processing letters, 2023-01, Vol.30, p.1-5</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c245t-4748e119b9616c384690598d742e2d2fd28fb2c81f53402713df630eb6dd35683</cites><orcidid>0000-0002-6139-6489 ; 0000-0002-0990-1513 ; 0000-0001-9436-2456 ; 0000-0003-3932-8786</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/10064114$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/10064114$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Xie, Min</creatorcontrib><creatorcontrib>Zhao, Chuang</creatorcontrib><creatorcontrib>Han, Xiao</creatorcontrib><creatorcontrib>Wang, Zewen</creatorcontrib><creatorcontrib>Hu, Dexiu</creatorcontrib><title>Separation of Interleaved Pulse Stream based on Directed Acyclic Graphs</title><title>IEEE signal processing letters</title><addtitle>LSP</addtitle><description>In pulse deinterleaving, the search procedure may fail because of missing pulses and pulse repetition interval (PRI) jitter. This study proposes a search method based on the directed acyclic graph (DAG). In this graph, pulses are vertices and the extracted pulse pairs are arcs. The greater the length of the "path", the higher is the confidence level of the corresponding pulse sequence. Therefore, this problem is transformed into a problem associated with the extraction of the longest "path" from DAG. Since pulse segments have more confidence than individual pulses, the proposed method may have important implications and broad application prospects.</description><subject>Apexes</subject><subject>Benchmark testing</subject><subject>Confidence intervals</subject><subject>Directed acyclic graph</subject><subject>Graph theory</subject><subject>Histograms</subject><subject>Jitter</subject><subject>path</subject><subject>pulse pair</subject><subject>Pulse repetition interval</subject><subject>Search methods</subject><subject>Search problems</subject><subject>sequence search</subject><subject>Signal processing algorithms</subject><subject>Switches</subject><subject>TOA deinterleaving</subject><subject>Transforms</subject><issn>1070-9908</issn><issn>1558-2361</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpNkE1LAzEQhoMoWKt3Dx4WPG-dydcmx1K1FgoWqueQTbK4pe2uyVbw35vSHjzNy_DMDPMQco8wQQT9tFyvJhQomzAqOGf6goxQCFVSJvEyZ6ig1BrUNblJaQMACpUYkfk69Dbaoe32RdcUi_0Q4jbYn-CL1WGbQrEeYrC7orYptzL03Mbghpyn7tdtW1fMo-2_0i25amzm7851TD5fXz5mb-Xyfb6YTZelo1wMJa-4Coi61hKlY4pLDUIrX3EaqKeNp6qpqVPYCMaBVsh8IxmEWnrPhFRsTB5Pe_vYfR9CGsymO8R9Pmmoolih4vn7MYET5WKXUgyN6WO7s_HXIJijLpN1maMuc9aVRx5OI20I4R8OkiNy9gdIqWQo</recordid><startdate>20230101</startdate><enddate>20230101</enddate><creator>Xie, Min</creator><creator>Zhao, Chuang</creator><creator>Han, Xiao</creator><creator>Wang, Zewen</creator><creator>Hu, Dexiu</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>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0002-6139-6489</orcidid><orcidid>https://orcid.org/0000-0002-0990-1513</orcidid><orcidid>https://orcid.org/0000-0001-9436-2456</orcidid><orcidid>https://orcid.org/0000-0003-3932-8786</orcidid></search><sort><creationdate>20230101</creationdate><title>Separation of Interleaved Pulse Stream based on Directed Acyclic Graphs</title><author>Xie, Min ; Zhao, Chuang ; Han, Xiao ; Wang, Zewen ; Hu, Dexiu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c245t-4748e119b9616c384690598d742e2d2fd28fb2c81f53402713df630eb6dd35683</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Apexes</topic><topic>Benchmark testing</topic><topic>Confidence intervals</topic><topic>Directed acyclic graph</topic><topic>Graph theory</topic><topic>Histograms</topic><topic>Jitter</topic><topic>path</topic><topic>pulse pair</topic><topic>Pulse repetition interval</topic><topic>Search methods</topic><topic>Search problems</topic><topic>sequence search</topic><topic>Signal processing algorithms</topic><topic>Switches</topic><topic>TOA deinterleaving</topic><topic>Transforms</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Xie, Min</creatorcontrib><creatorcontrib>Zhao, Chuang</creatorcontrib><creatorcontrib>Han, Xiao</creatorcontrib><creatorcontrib>Wang, Zewen</creatorcontrib><creatorcontrib>Hu, Dexiu</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>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><jtitle>IEEE signal processing letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Xie, Min</au><au>Zhao, Chuang</au><au>Han, Xiao</au><au>Wang, Zewen</au><au>Hu, Dexiu</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Separation of Interleaved Pulse Stream based on Directed Acyclic Graphs</atitle><jtitle>IEEE signal processing letters</jtitle><stitle>LSP</stitle><date>2023-01-01</date><risdate>2023</risdate><volume>30</volume><spage>1</spage><epage>5</epage><pages>1-5</pages><issn>1070-9908</issn><eissn>1558-2361</eissn><coden>ISPLEM</coden><abstract>In pulse deinterleaving, the search procedure may fail because of missing pulses and pulse repetition interval (PRI) jitter. This study proposes a search method based on the directed acyclic graph (DAG). In this graph, pulses are vertices and the extracted pulse pairs are arcs. The greater the length of the "path", the higher is the confidence level of the corresponding pulse sequence. Therefore, this problem is transformed into a problem associated with the extraction of the longest "path" from DAG. Since pulse segments have more confidence than individual pulses, the proposed method may have important implications and broad application prospects.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/LSP.2023.3254439</doi><tpages>5</tpages><orcidid>https://orcid.org/0000-0002-6139-6489</orcidid><orcidid>https://orcid.org/0000-0002-0990-1513</orcidid><orcidid>https://orcid.org/0000-0001-9436-2456</orcidid><orcidid>https://orcid.org/0000-0003-3932-8786</orcidid></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1070-9908 |
| ispartof | IEEE signal processing letters, 2023-01, Vol.30, p.1-5 |
| issn | 1070-9908 1558-2361 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_LSP_2023_3254439 |
| source | IEEE Electronic Library (IEL) |
| subjects | Apexes Benchmark testing Confidence intervals Directed acyclic graph Graph theory Histograms Jitter path pulse pair Pulse repetition interval Search methods Search problems sequence search Signal processing algorithms Switches TOA deinterleaving Transforms |
| title | Separation of Interleaved Pulse Stream based on Directed Acyclic Graphs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T17%3A46%3A41IST&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=Separation%20of%20Interleaved%20Pulse%20Stream%20based%20on%20Directed%20Acyclic%20Graphs&rft.jtitle=IEEE%20signal%20processing%20letters&rft.au=Xie,%20Min&rft.date=2023-01-01&rft.volume=30&rft.spage=1&rft.epage=5&rft.pages=1-5&rft.issn=1070-9908&rft.eissn=1558-2361&rft.coden=ISPLEM&rft_id=info:doi/10.1109/LSP.2023.3254439&rft_dat=%3Cproquest_RIE%3E2821718444%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=2821718444&rft_id=info:pmid/&rft_ieee_id=10064114&rfr_iscdi=true |