Approximation of matrices by Gabor multipliers
We present a fast Fourier transform based algorithm which allows to obtain the best approximation of a given time-variant linear system by approximating its matrix (in the Hilbert-Schmidt sense) by a Gabor multiplier, using a given tight Gabor frame. We illustrate the approach by approximating the i...
Gespeichert in:
| Veröffentlicht in: | IEEE signal processing letters 2004-11, Vol.11 (11), p.883-886 |
|---|---|
| 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 | 886 |
|---|---|
| container_issue | 11 |
| container_start_page | 883 |
| container_title | IEEE signal processing letters |
| container_volume | 11 |
| creator | Feichtinger, H.G. Hampejs, M. Kracher, G. |
| description | We present a fast Fourier transform based algorithm which allows to obtain the best approximation of a given time-variant linear system by approximating its matrix (in the Hilbert-Schmidt sense) by a Gabor multiplier, using a given tight Gabor frame. We illustrate the approach by approximating the inverse of a slowly time variant filter. |
| doi_str_mv | 10.1109/LSP.2004.833581 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_LSP_2004_833581</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1343989</ieee_id><sourcerecordid>2425802291</sourcerecordid><originalsourceid>FETCH-LOGICAL-c415t-97259624cf510317d39eaac7df706f77a88088c6c9b74be1272200d89adcf4843</originalsourceid><addsrcrecordid>eNp9kMFLwzAUh4MoOKdnD16KBz21y2uS5uU4hk5hoKCeQ5qm0NGtNWnB_fdmVBA8eHrv8P1-vPcRcg00A6BqsXl7zXJKeYaMCYQTMgMhMM1ZAadxp5KmSlE8JxchbCmlCChmJFv2ve--mp0Zmm6fdHUSN99YF5LykKxN2flkN7ZD07eN8-GSnNWmDe7qZ87Jx-PD--op3bysn1fLTWo5iCFVMheqyLmtBVAGsmLKGWNlVUta1FIaRIpoC6tKyUsHuczj6RUqU9maI2dzcj_1xuM-RxcGvWuCdW1r9q4bg1YUCsFjLJJ3_5I5Ci5Zcay8_QNuu9Hv4xcakXGBAiBCiwmyvgvBu1r3PrrxBw1UHzXrqFkfNetJc0zcTInGOfdLM84UKvYNs792cA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>883458511</pqid></control><display><type>article</type><title>Approximation of matrices by Gabor multipliers</title><source>IEEE Electronic Library (IEL)</source><creator>Feichtinger, H.G. ; Hampejs, M. ; Kracher, G.</creator><creatorcontrib>Feichtinger, H.G. ; Hampejs, M. ; Kracher, G.</creatorcontrib><description>We present a fast Fourier transform based algorithm which allows to obtain the best approximation of a given time-variant linear system by approximating its matrix (in the Hilbert-Schmidt sense) by a Gabor multiplier, using a given tight Gabor frame. We illustrate the approach by approximating the inverse of a slowly time variant filter.</description><identifier>ISSN: 1070-9908</identifier><identifier>EISSN: 1558-2361</identifier><identifier>DOI: 10.1109/LSP.2004.833581</identifier><identifier>CODEN: ISPLEM</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Approximation ; Approximation algorithms ; Displays ; Fast Fourier transforms ; Filtering ; Fourier transforms ; Gabor filters ; Inverse ; Lattices ; Linear approximation ; Linear systems ; Mathematical analysis ; Matrices ; Multipliers</subject><ispartof>IEEE signal processing letters, 2004-11, Vol.11 (11), p.883-886</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2004</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c415t-97259624cf510317d39eaac7df706f77a88088c6c9b74be1272200d89adcf4843</citedby><cites>FETCH-LOGICAL-c415t-97259624cf510317d39eaac7df706f77a88088c6c9b74be1272200d89adcf4843</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1343989$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1343989$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Feichtinger, H.G.</creatorcontrib><creatorcontrib>Hampejs, M.</creatorcontrib><creatorcontrib>Kracher, G.</creatorcontrib><title>Approximation of matrices by Gabor multipliers</title><title>IEEE signal processing letters</title><addtitle>LSP</addtitle><description>We present a fast Fourier transform based algorithm which allows to obtain the best approximation of a given time-variant linear system by approximating its matrix (in the Hilbert-Schmidt sense) by a Gabor multiplier, using a given tight Gabor frame. We illustrate the approach by approximating the inverse of a slowly time variant filter.</description><subject>Algorithms</subject><subject>Approximation</subject><subject>Approximation algorithms</subject><subject>Displays</subject><subject>Fast Fourier transforms</subject><subject>Filtering</subject><subject>Fourier transforms</subject><subject>Gabor filters</subject><subject>Inverse</subject><subject>Lattices</subject><subject>Linear approximation</subject><subject>Linear systems</subject><subject>Mathematical analysis</subject><subject>Matrices</subject><subject>Multipliers</subject><issn>1070-9908</issn><issn>1558-2361</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2004</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp9kMFLwzAUh4MoOKdnD16KBz21y2uS5uU4hk5hoKCeQ5qm0NGtNWnB_fdmVBA8eHrv8P1-vPcRcg00A6BqsXl7zXJKeYaMCYQTMgMhMM1ZAadxp5KmSlE8JxchbCmlCChmJFv2ve--mp0Zmm6fdHUSN99YF5LykKxN2flkN7ZD07eN8-GSnNWmDe7qZ87Jx-PD--op3bysn1fLTWo5iCFVMheqyLmtBVAGsmLKGWNlVUta1FIaRIpoC6tKyUsHuczj6RUqU9maI2dzcj_1xuM-RxcGvWuCdW1r9q4bg1YUCsFjLJJ3_5I5Ci5Zcay8_QNuu9Hv4xcakXGBAiBCiwmyvgvBu1r3PrrxBw1UHzXrqFkfNetJc0zcTInGOfdLM84UKvYNs792cA</recordid><startdate>20041101</startdate><enddate>20041101</enddate><creator>Feichtinger, H.G.</creator><creator>Hampejs, M.</creator><creator>Kracher, G.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><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><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20041101</creationdate><title>Approximation of matrices by Gabor multipliers</title><author>Feichtinger, H.G. ; Hampejs, M. ; Kracher, G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c415t-97259624cf510317d39eaac7df706f77a88088c6c9b74be1272200d89adcf4843</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Algorithms</topic><topic>Approximation</topic><topic>Approximation algorithms</topic><topic>Displays</topic><topic>Fast Fourier transforms</topic><topic>Filtering</topic><topic>Fourier transforms</topic><topic>Gabor filters</topic><topic>Inverse</topic><topic>Lattices</topic><topic>Linear approximation</topic><topic>Linear systems</topic><topic>Mathematical analysis</topic><topic>Matrices</topic><topic>Multipliers</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Feichtinger, H.G.</creatorcontrib><creatorcontrib>Hampejs, M.</creatorcontrib><creatorcontrib>Kracher, G.</creatorcontrib><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><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE signal processing letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Feichtinger, H.G.</au><au>Hampejs, M.</au><au>Kracher, G.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Approximation of matrices by Gabor multipliers</atitle><jtitle>IEEE signal processing letters</jtitle><stitle>LSP</stitle><date>2004-11-01</date><risdate>2004</risdate><volume>11</volume><issue>11</issue><spage>883</spage><epage>886</epage><pages>883-886</pages><issn>1070-9908</issn><eissn>1558-2361</eissn><coden>ISPLEM</coden><abstract>We present a fast Fourier transform based algorithm which allows to obtain the best approximation of a given time-variant linear system by approximating its matrix (in the Hilbert-Schmidt sense) by a Gabor multiplier, using a given tight Gabor frame. We illustrate the approach by approximating the inverse of a slowly time variant filter.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/LSP.2004.833581</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1070-9908 |
| ispartof | IEEE signal processing letters, 2004-11, Vol.11 (11), p.883-886 |
| issn | 1070-9908 1558-2361 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_LSP_2004_833581 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms Approximation Approximation algorithms Displays Fast Fourier transforms Filtering Fourier transforms Gabor filters Inverse Lattices Linear approximation Linear systems Mathematical analysis Matrices Multipliers |
| title | Approximation of matrices by Gabor multipliers |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T03%3A07%3A09IST&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=Approximation%20of%20matrices%20by%20Gabor%20multipliers&rft.jtitle=IEEE%20signal%20processing%20letters&rft.au=Feichtinger,%20H.G.&rft.date=2004-11-01&rft.volume=11&rft.issue=11&rft.spage=883&rft.epage=886&rft.pages=883-886&rft.issn=1070-9908&rft.eissn=1558-2361&rft.coden=ISPLEM&rft_id=info:doi/10.1109/LSP.2004.833581&rft_dat=%3Cproquest_RIE%3E2425802291%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=883458511&rft_id=info:pmid/&rft_ieee_id=1343989&rfr_iscdi=true |