Fast algorithms for running EDCT and EDST

Fast algorithms for running the even discrete cosine transform (EDCT) and the even discrete sine transform (EDST) are presented in this paper. The computational complexity and stability are analyzed. The algorithms given here gain considerable computational savings compared with the direct algorithm...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Zeng Yonghong, Zhang Lilun
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Computational complexity Digital signal processing Discrete cosine transforms Discrete transforms Image segmentation Joining processes Karhunen-Loeve transforms Kernel Signal processing algorithms Stability analysis
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Fast algorithms for running the even discrete cosine transform (EDCT) and the even discrete sine transform (EDST) are presented in this paper. The computational complexity and stability are analyzed. The algorithms given here gain considerable computational savings compared with the direct algorithms, thus can effectively find applications in real-time signal processing.
DOI:	10.1109/ICOSP.1998.770139