Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/28262
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBriani, Matteoen_UK
dc.contributor.authorCuyt, Annieen_UK
dc.contributor.authorLee, Wen-shinen_UK
dc.contributor.editorGerdt, VPen_UK
dc.contributor.editorKoepf, Wen_UK
dc.contributor.editorSeiler, WMen_UK
dc.contributor.editorVorozhtsov, EVen_UK
dc.date.accessioned2018-11-21T01:03:18Z-
dc.date.available2018-11-21T01:03:18Z-
dc.date.issued2017-12-31en_UK
dc.identifier.urihttp://hdl.handle.net/1893/28262-
dc.description.abstractIn signal processing, the Fourier transform is a popular method to analyze the frequency content of a signal, as it decomposes the signal into a linear combination of complex exponentials with integer frequencies. A fast algorithm to compute the Fourier transform is based on a binary divide and conquer strategy. In computer algebra, sparse interpolation is well-known and closely related to Prony's method of exponential fitting, which dates back to 1795. In this paper we develop a divide and conquer algorithm for sparse interpolation and show how it is a generalization of the FFT algorithm. In addition, when considering an analog as opposed to a discrete version of our divide and conquer algorithm, we can establish a connection with digital filter theory.en_UK
dc.language.isoenen_UK
dc.publisherSpringer International Publishingen_UK
dc.relationBriani M, Cuyt A & Lee W (2017) Sparse interpolation, the FFT algorithm and FIR filters. In: Gerdt V, Koepf W, Seiler W & Vorozhtsov E (eds.) Computer Algebra in Scientific Computing - 19th International Workshop, CASC 2017, Beijing, China, September 18-22, 2017, Proceedings. Lecture Notes in Computer Science (LNCS), 10490. 19th International Workshop on Computer Algebra in Scientific Computing, Beijing, China, 18.09.2017-22.09.2017. Cham, Switzerland: Springer International Publishing, pp. 27-39. https://doi.org/10.1007/978-3-319-66320-3en_UK
dc.relation.ispartofseriesLecture Notes in Computer Science (LNCS), 10490en_UK
dc.rightsThe publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.en_UK
dc.titleSparse interpolation, the FFT algorithm and FIR filtersen_UK
dc.typeConference Paperen_UK
dc.rights.embargodate2999-12-31en_UK
dc.rights.embargoreason[ch3.pdf] The publisher does not allow this work to be made publicly available in this Repository therefore there is an embargo on the full text of the work.en_UK
dc.identifier.doi10.1007/978-3-319-66320-3en_UK
dc.citation.jtitleLNCSen_UK
dc.citation.issn1611-3349en_UK
dc.citation.issn0302-9743en_UK
dc.citation.spage27en_UK
dc.citation.epage39en_UK
dc.citation.publicationstatusPublisheden_UK
dc.type.statusVoR - Version of Recorden_UK
dc.contributor.funderUniversity of Antwerpen_UK
dc.contributor.funderResearch Foundation - Flandersen_UK
dc.author.emailwen-shin.lee@stir.ac.uken_UK
dc.citation.btitleComputer Algebra in Scientific Computing - 19th International Workshop, CASC 2017, Beijing, China, September 18-22, 2017, Proceedingsen_UK
dc.citation.conferencedates2017-09-18 - 2017-09-22en_UK
dc.citation.conferencelocationBeijing, Chinaen_UK
dc.citation.conferencename19th International Workshop on Computer Algebra in Scientific Computingen_UK
dc.citation.date30/08/2017en_UK
dc.citation.isbn9783319663197; 9783319663203en_UK
dc.publisher.addressCham, Switzerlanden_UK
dc.contributor.affiliationUniversity of Antwerpen_UK
dc.contributor.affiliationUniversity of Antwerpen_UK
dc.contributor.affiliationUniversity of Antwerpen_UK
dc.identifier.wtid983825en_UK
dc.contributor.orcid0000-0002-2808-3739en_UK
dc.date.accepted2017-06-22en_UK
dc.description.refREF Eligible with Permitted Exceptionen_UK
Appears in Collections:Computing Science and Mathematics Conference Papers and Proceedings

Files in This Item:
File Description SizeFormat 
ch3.pdfFulltext - Published Version422.58 kBAdobe PDFUnder Permanent Embargo    Request a copy


This item is protected by original copyright



Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.