License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TIME.2019.1
URN: urn:nbn:de:0030-drops-113595
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/11359/
Böhlen, Michael H. ;
Saad, Muhammad
Computing the Fourier Transformation over Temporal Data Streams (Invited Talk)
Abstract
In radio astronomy the sky is continuously scanned to collect frequency information about celestial objects. The inverse 2D Fourier transformation is used to generate images of the sky from the collected frequency information. We propose an algorithm that incrementally refines images by processing frequency information as it arrives in a temporal data stream. A direct implementation of the refinement with the discrete Fourier transformation requires O(N^2) complex multiplications to process an element of the stream. We propose a new algorithm that avoids recomputations and only requires O(N) complex multiplications.
BibTeX - Entry
@InProceedings{bhlen_et_al:LIPIcs:2019:11359,
author = {Michael H. B{\"o}hlen and Muhammad Saad},
title = {{Computing the Fourier Transformation over Temporal Data Streams (Invited Talk)}},
booktitle = {26th International Symposium on Temporal Representation and Reasoning (TIME 2019)},
pages = {1:1--1:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-127-6},
ISSN = {1868-8969},
year = {2019},
volume = {147},
editor = {Johann Gamper and Sophie Pinchinat and Guido Sciavicco},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/11359},
URN = {urn:nbn:de:0030-drops-113595},
doi = {10.4230/LIPIcs.TIME.2019.1},
annote = {Keywords: Data streams, Fourier transform, time-varying data}
}
Keywords: |
|
Data streams, Fourier transform, time-varying data |
Collection: |
|
26th International Symposium on Temporal Representation and Reasoning (TIME 2019) |
Issue Date: |
|
2019 |
Date of publication: |
|
07.10.2019 |