The pulse sorting transform
A modification of conventional Fourier transforms is presented. This modification is called the pulse sorting transform (PST) and is useful in extracting information from signals comprised of interleaved pulse trains. A brief derivation of the PST from the conventional transform is presented, follow...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on circuits and systems 1990-10, Vol.37 (10), p.1193-1200 |
|---|---|
| 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 | 1200 |
|---|---|
| container_issue | 10 |
| container_start_page | 1193 |
| container_title | IEEE transactions on circuits and systems |
| container_volume | 37 |
| creator | Overman, K.C. Mix, D.F. Lookadoo, J.A. |
| description | A modification of conventional Fourier transforms is presented. This modification is called the pulse sorting transform (PST) and is useful in extracting information from signals comprised of interleaved pulse trains. A brief derivation of the PST from the conventional transform is presented, followed by theorems that describe the PST's properties. Several examples of how the PST can be an effective tool in digital signal processing are presented. The examples demonstrate how the PST extracts phase information from interleaved pulse trains.< > |
| doi_str_mv | 10.1109/31.103214 |
| format | Article |
| fullrecord | <record><control><sourceid>pascalfrancis_RIE</sourceid><recordid>TN_cdi_ieee_primary_103214</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>103214</ieee_id><sourcerecordid>19296132</sourcerecordid><originalsourceid>FETCH-LOGICAL-c236t-12591bbfbe9077c49c844a52684322e052e4f2f2938f1ad06ba7401e27a5fefb3</originalsourceid><addsrcrecordid>eNpNjzFPwzAQRi0EEqEwsMKShYEh5e5sJ_aIqkIrVWIpc-SYMwS1TWSHgX9PIEgw3XDve3efEJcIc0SwdxLnCJJQHYkMtTYFUlUeiwzAmkKBVafiLKV3ADDWmExcb9847z92ifPUxaE9vOZDdIcUurg_FyfBjZuL3zkTzw_L7WJVbJ4e14v7TeFJlsN4QVtsmtCwharyynqjlNNUGiWJGDSxChTIShPQvUDZuEoBMlVOBw6NnInbyetjl1LkUPex3bv4WSPU361qifXUamRvJrZ3ybtdGH_1bfoLWLIlShq5q4lrmfmf70fyBWuWUjU</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>The pulse sorting transform</title><source>IEEE Electronic Library (IEL)</source><creator>Overman, K.C. ; Mix, D.F. ; Lookadoo, J.A.</creator><creatorcontrib>Overman, K.C. ; Mix, D.F. ; Lookadoo, J.A.</creatorcontrib><description>A modification of conventional Fourier transforms is presented. This modification is called the pulse sorting transform (PST) and is useful in extracting information from signals comprised of interleaved pulse trains. A brief derivation of the PST from the conventional transform is presented, followed by theorems that describe the PST's properties. Several examples of how the PST can be an effective tool in digital signal processing are presented. The examples demonstrate how the PST extracts phase information from interleaved pulse trains.< ></description><identifier>ISSN: 0098-4094</identifier><identifier>EISSN: 1558-1276</identifier><identifier>DOI: 10.1109/31.103214</identifier><identifier>CODEN: ICSYBT</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Convolution ; Data mining ; Digital signal processing ; Exact sciences and technology ; Fourier transforms ; Frequency domain analysis ; Information, signal and communications theory ; Linear systems ; Linearity ; Signal and communications theory ; Signal processing ; Signal representation. Spectral analysis ; Signal, noise ; Sorting ; Telecommunications and information theory</subject><ispartof>IEEE transactions on circuits and systems, 1990-10, Vol.37 (10), p.1193-1200</ispartof><rights>1991 INIST-CNRS</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c236t-12591bbfbe9077c49c844a52684322e052e4f2f2938f1ad06ba7401e27a5fefb3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/103214$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/103214$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19296132$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Overman, K.C.</creatorcontrib><creatorcontrib>Mix, D.F.</creatorcontrib><creatorcontrib>Lookadoo, J.A.</creatorcontrib><title>The pulse sorting transform</title><title>IEEE transactions on circuits and systems</title><addtitle>T-CAS</addtitle><description>A modification of conventional Fourier transforms is presented. This modification is called the pulse sorting transform (PST) and is useful in extracting information from signals comprised of interleaved pulse trains. A brief derivation of the PST from the conventional transform is presented, followed by theorems that describe the PST's properties. Several examples of how the PST can be an effective tool in digital signal processing are presented. The examples demonstrate how the PST extracts phase information from interleaved pulse trains.< ></description><subject>Applied sciences</subject><subject>Convolution</subject><subject>Data mining</subject><subject>Digital signal processing</subject><subject>Exact sciences and technology</subject><subject>Fourier transforms</subject><subject>Frequency domain analysis</subject><subject>Information, signal and communications theory</subject><subject>Linear systems</subject><subject>Linearity</subject><subject>Signal and communications theory</subject><subject>Signal processing</subject><subject>Signal representation. Spectral analysis</subject><subject>Signal, noise</subject><subject>Sorting</subject><subject>Telecommunications and information theory</subject><issn>0098-4094</issn><issn>1558-1276</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1990</creationdate><recordtype>article</recordtype><recordid>eNpNjzFPwzAQRi0EEqEwsMKShYEh5e5sJ_aIqkIrVWIpc-SYMwS1TWSHgX9PIEgw3XDve3efEJcIc0SwdxLnCJJQHYkMtTYFUlUeiwzAmkKBVafiLKV3ADDWmExcb9847z92ifPUxaE9vOZDdIcUurg_FyfBjZuL3zkTzw_L7WJVbJ4e14v7TeFJlsN4QVtsmtCwharyynqjlNNUGiWJGDSxChTIShPQvUDZuEoBMlVOBw6NnInbyetjl1LkUPex3bv4WSPU361qifXUamRvJrZ3ybtdGH_1bfoLWLIlShq5q4lrmfmf70fyBWuWUjU</recordid><startdate>19901001</startdate><enddate>19901001</enddate><creator>Overman, K.C.</creator><creator>Mix, D.F.</creator><creator>Lookadoo, J.A.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>19901001</creationdate><title>The pulse sorting transform</title><author>Overman, K.C. ; Mix, D.F. ; Lookadoo, J.A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c236t-12591bbfbe9077c49c844a52684322e052e4f2f2938f1ad06ba7401e27a5fefb3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1990</creationdate><topic>Applied sciences</topic><topic>Convolution</topic><topic>Data mining</topic><topic>Digital signal processing</topic><topic>Exact sciences and technology</topic><topic>Fourier transforms</topic><topic>Frequency domain analysis</topic><topic>Information, signal and communications theory</topic><topic>Linear systems</topic><topic>Linearity</topic><topic>Signal and communications theory</topic><topic>Signal processing</topic><topic>Signal representation. Spectral analysis</topic><topic>Signal, noise</topic><topic>Sorting</topic><topic>Telecommunications and information theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Overman, K.C.</creatorcontrib><creatorcontrib>Mix, D.F.</creatorcontrib><creatorcontrib>Lookadoo, J.A.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><jtitle>IEEE transactions on circuits and systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Overman, K.C.</au><au>Mix, D.F.</au><au>Lookadoo, J.A.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The pulse sorting transform</atitle><jtitle>IEEE transactions on circuits and systems</jtitle><stitle>T-CAS</stitle><date>1990-10-01</date><risdate>1990</risdate><volume>37</volume><issue>10</issue><spage>1193</spage><epage>1200</epage><pages>1193-1200</pages><issn>0098-4094</issn><eissn>1558-1276</eissn><coden>ICSYBT</coden><abstract>A modification of conventional Fourier transforms is presented. This modification is called the pulse sorting transform (PST) and is useful in extracting information from signals comprised of interleaved pulse trains. A brief derivation of the PST from the conventional transform is presented, followed by theorems that describe the PST's properties. Several examples of how the PST can be an effective tool in digital signal processing are presented. The examples demonstrate how the PST extracts phase information from interleaved pulse trains.< ></abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/31.103214</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0098-4094 |
| ispartof | IEEE transactions on circuits and systems, 1990-10, Vol.37 (10), p.1193-1200 |
| issn | 0098-4094 1558-1276 |
| language | eng |
| recordid | cdi_ieee_primary_103214 |
| source | IEEE Electronic Library (IEL) |
| subjects | Applied sciences Convolution Data mining Digital signal processing Exact sciences and technology Fourier transforms Frequency domain analysis Information, signal and communications theory Linear systems Linearity Signal and communications theory Signal processing Signal representation. Spectral analysis Signal, noise Sorting Telecommunications and information theory |
| title | The pulse sorting transform |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-22T11%3A27%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20pulse%20sorting%20transform&rft.jtitle=IEEE%20transactions%20on%20circuits%20and%20systems&rft.au=Overman,%20K.C.&rft.date=1990-10-01&rft.volume=37&rft.issue=10&rft.spage=1193&rft.epage=1200&rft.pages=1193-1200&rft.issn=0098-4094&rft.eissn=1558-1276&rft.coden=ICSYBT&rft_id=info:doi/10.1109/31.103214&rft_dat=%3Cpascalfrancis_RIE%3E19296132%3C/pascalfrancis_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=103214&rfr_iscdi=true |