Empirical evaluation of two Deterministic Sparse Fourier Transforms

This paper empirically evaluates a recently proposed Deterministic Sparse Fourier Transform algorithm (hereafter called DSFT) for the first time. Our experiments indicate that DSFT is capable of guaranteed general frequency-sparse signal recovery using subNyquist sampling for realistic bandwidth val...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Iwen, M.A.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithms Bandwidth Discrete Fourier transforms Fast Fourier transforms Fourier transforms Frequency Image reconstruction Runtime Sampling methods Signal Processing Signal processing algorithms Wideband
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	896
container_issue
container_start_page	893
container_title
container_volume
creator	Iwen, M.A.
description	This paper empirically evaluates a recently proposed Deterministic Sparse Fourier Transform algorithm (hereafter called DSFT) for the first time. Our experiments indicate that DSFT is capable of guaranteed general frequency-sparse signal recovery using subNyquist sampling for realistic bandwidth values. Furthermore, we show that both variants of DSFT have fast reconstruction runtimes. In fact, the sublinear-time DSFT variant is shown to be faster than a traditional Fast Fourier Transform (FFT) for highly-sparse wideband signals.
doi_str_mv	10.1109/CISS.2009.5054843
format	Conference Proceeding
fullrecord	<record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5054843</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5054843</ieee_id><sourcerecordid>5054843</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-9c857ae74891dfe81a85e76e9299bf9ba73d0bfb5e048a36f46ffae8e9e6653c3</originalsourceid><addsrcrecordid>eNo1kMtKAzEYhSNS0NZ5AHGTF5gx10n-pYxtLRRcTF2XzPQPROZGMlV8ewvWszl8cPgWh5BHzgrOGTxXu7ouBGNQaKaVVfKGLLkSSgkjlbklGRj7z9IuyPKytcBKBuKOZCl9skuUFiDlPanW_RRiaF1H8ct1ZzeHcaCjp_P3SF9xxtiHIaQ5tLSeXExIN-M5Boz0EN2Q_Bj79EAW3nUJs2uvyMdmfaje8v37dle97PPAjZ5zaK02Do2ywE8eLXdWoykRBEDjoXFGnljjG41MWSdLr0rvHVoELEstW7kiT3_egIjHKYbexZ_j9QT5C6HOTtY</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Empirical evaluation of two Deterministic Sparse Fourier Transforms</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Iwen, M.A.</creator><creatorcontrib>Iwen, M.A.</creatorcontrib><description>This paper empirically evaluates a recently proposed Deterministic Sparse Fourier Transform algorithm (hereafter called DSFT) for the first time. Our experiments indicate that DSFT is capable of guaranteed general frequency-sparse signal recovery using subNyquist sampling for realistic bandwidth values. Furthermore, we show that both variants of DSFT have fast reconstruction runtimes. In fact, the sublinear-time DSFT variant is shown to be faster than a traditional Fast Fourier Transform (FFT) for highly-sparse wideband signals.</description><identifier>ISBN: 9781424427338</identifier><identifier>ISBN: 1424427339</identifier><identifier>EISBN: 1424427347</identifier><identifier>EISBN: 9781424427345</identifier><identifier>DOI: 10.1109/CISS.2009.5054843</identifier><identifier>LCCN: 2008906092</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithms ; Bandwidth ; Discrete Fourier transforms ; Fast Fourier transforms ; Fourier transforms ; Frequency ; Image reconstruction ; Runtime ; Sampling methods ; Signal Processing ; Signal processing algorithms ; Wideband</subject><ispartof>2009 43rd Annual Conference on Information Sciences and Systems, 2009, p.893-896</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5054843$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5054843$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Iwen, M.A.</creatorcontrib><title>Empirical evaluation of two Deterministic Sparse Fourier Transforms</title><title>2009 43rd Annual Conference on Information Sciences and Systems</title><addtitle>CISS</addtitle><description>This paper empirically evaluates a recently proposed Deterministic Sparse Fourier Transform algorithm (hereafter called DSFT) for the first time. Our experiments indicate that DSFT is capable of guaranteed general frequency-sparse signal recovery using subNyquist sampling for realistic bandwidth values. Furthermore, we show that both variants of DSFT have fast reconstruction runtimes. In fact, the sublinear-time DSFT variant is shown to be faster than a traditional Fast Fourier Transform (FFT) for highly-sparse wideband signals.</description><subject>Algorithms</subject><subject>Bandwidth</subject><subject>Discrete Fourier transforms</subject><subject>Fast Fourier transforms</subject><subject>Fourier transforms</subject><subject>Frequency</subject><subject>Image reconstruction</subject><subject>Runtime</subject><subject>Sampling methods</subject><subject>Signal Processing</subject><subject>Signal processing algorithms</subject><subject>Wideband</subject><isbn>9781424427338</isbn><isbn>1424427339</isbn><isbn>1424427347</isbn><isbn>9781424427345</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1kMtKAzEYhSNS0NZ5AHGTF5gx10n-pYxtLRRcTF2XzPQPROZGMlV8ewvWszl8cPgWh5BHzgrOGTxXu7ouBGNQaKaVVfKGLLkSSgkjlbklGRj7z9IuyPKytcBKBuKOZCl9skuUFiDlPanW_RRiaF1H8ct1ZzeHcaCjp_P3SF9xxtiHIaQ5tLSeXExIN-M5Boz0EN2Q_Bj79EAW3nUJs2uvyMdmfaje8v37dle97PPAjZ5zaK02Do2ywE8eLXdWoykRBEDjoXFGnljjG41MWSdLr0rvHVoELEstW7kiT3_egIjHKYbexZ_j9QT5C6HOTtY</recordid><startdate>200903</startdate><enddate>200903</enddate><creator>Iwen, M.A.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200903</creationdate><title>Empirical evaluation of two Deterministic Sparse Fourier Transforms</title><author>Iwen, M.A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-9c857ae74891dfe81a85e76e9299bf9ba73d0bfb5e048a36f46ffae8e9e6653c3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Algorithms</topic><topic>Bandwidth</topic><topic>Discrete Fourier transforms</topic><topic>Fast Fourier transforms</topic><topic>Fourier transforms</topic><topic>Frequency</topic><topic>Image reconstruction</topic><topic>Runtime</topic><topic>Sampling methods</topic><topic>Signal Processing</topic><topic>Signal processing algorithms</topic><topic>Wideband</topic><toplevel>online_resources</toplevel><creatorcontrib>Iwen, M.A.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Iwen, M.A.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Empirical evaluation of two Deterministic Sparse Fourier Transforms</atitle><btitle>2009 43rd Annual Conference on Information Sciences and Systems</btitle><stitle>CISS</stitle><date>2009-03</date><risdate>2009</risdate><spage>893</spage><epage>896</epage><pages>893-896</pages><isbn>9781424427338</isbn><isbn>1424427339</isbn><eisbn>1424427347</eisbn><eisbn>9781424427345</eisbn><abstract>This paper empirically evaluates a recently proposed Deterministic Sparse Fourier Transform algorithm (hereafter called DSFT) for the first time. Our experiments indicate that DSFT is capable of guaranteed general frequency-sparse signal recovery using subNyquist sampling for realistic bandwidth values. Furthermore, we show that both variants of DSFT have fast reconstruction runtimes. In fact, the sublinear-time DSFT variant is shown to be faster than a traditional Fast Fourier Transform (FFT) for highly-sparse wideband signals.</abstract><pub>IEEE</pub><doi>10.1109/CISS.2009.5054843</doi><tpages>4</tpages></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISBN: 9781424427338
ispartof	2009 43rd Annual Conference on Information Sciences and Systems, 2009, p.893-896
issn
language	eng
recordid	cdi_ieee_primary_5054843
source	IEEE Electronic Library (IEL) Conference Proceedings
subjects	Algorithms Bandwidth Discrete Fourier transforms Fast Fourier transforms Fourier transforms Frequency Image reconstruction Runtime Sampling methods Signal Processing Signal processing algorithms Wideband
title	Empirical evaluation of two Deterministic Sparse Fourier Transforms
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-23T03%3A46%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Empirical%20evaluation%20of%20two%20Deterministic%20Sparse%20Fourier%20Transforms&rft.btitle=2009%2043rd%20Annual%20Conference%20on%20Information%20Sciences%20and%20Systems&rft.au=Iwen,%20M.A.&rft.date=2009-03&rft.spage=893&rft.epage=896&rft.pages=893-896&rft.isbn=9781424427338&rft.isbn_list=1424427339&rft_id=info:doi/10.1109/CISS.2009.5054843&rft_dat=%3Cieee_6IE%3E5054843%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1424427347&rft.eisbn_list=9781424427345&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5054843&rfr_iscdi=true