Universitätsbibliothek Erlangen Zur Homepage der Universitätsbibliothek Erlangen
Zur Homepage der Universität Erlangen

Eingang zum Volltext in OPUS


Hinweis zum Urheberrecht

Aufsatz zugänglich unter
URN: urn:nbn:de:bvb:29-opus-31258
URL: http://www.opus.ub.uni-erlangen.de/opus/volltexte/2012/3125/


A fast algorithm for selective signal extrapolation with arbitrary basis functions

Seiler, Jürgen ; Kaup, Andre

Lehrstuhl für Multimediakommunikation und Signalverarbeitung

Originalveröffentlichung: (2011) EURASIP Journal on Advances in Signal Processing 2011.Jan (2011): 22.03.2012 <http://asp.eurasipjournals.com/content/2011/1/495394>
pdf-Format:
Dokument 1.pdf (928 KB)


SWD-Schlagwörter: -
Collection: Universität Erlangen-Nürnberg / Von der FAU geförderte Open Access Artikel / 2011
Fakultät: Technische Fakultät
DDC-Sachgruppe: Informatik
Dokumentart: Aufsatz
Sprache: Englisch
Erstellungsjahr: 2011
Publikationsdatum: 22.03.2012
Kurzfassung in Englisch: Signal extrapolation is an important task in digital signal processing for extending known signals into unknown areas. The Selective
Extrapolation is a very effective algorithmto achieve this. Thereby, the extrapolation is obtained by generating a model of the signal
to be extrapolated as weighted superposition of basis functions. Unfortunately, this algorithm is computationally very expensive
and, up to now, efficient implementations exist only for basis function sets that emanate from discrete transforms.Within the scope
of this contribution, a novel efficient solution for Selective Extrapolation is presented for utilization with arbitrary basis functions.
The proposed algorithm mathematically behaves identically to the original Selective Extrapolation but is several decades faster.
Furthermore, it is able to outperform existent fast transform domain algorithms which are limited to basis function sets that
belong to the corresponding transform.With that, the novel algorithm allows for an efficient use of arbitrary basis functions, even
if they are only numerically defined


Home | Suchen | Veröffentlichen
 Sie benötigen weitere Informationen? Fragen Sie uns!


Letzte Änderung: 01.11.10