DocumentCode :
339029
Title :
Fast algorithms for running EDCT and EDST
Author :
Zeng Yonghong ; Lilun, Zhang
Author_Institution :
7th Dept., Nat. Univ. of Defense Technol., Changsha, China
fYear :
1998
fDate :
1998
Firstpage :
15
Abstract :
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
Keywords :
computational complexity; discrete cosine transforms; real-time systems; signal processing; stability; EDCT; EDST; computational complexity; even discrete cosine transform; even discrete sine transform; real-time signal processing; stability; Computational complexity; Digital signal processing; Discrete cosine transforms; Discrete transforms; Image segmentation; Joining processes; Karhunen-Loeve transforms; Kernel; Signal processing algorithms; Stability analysis;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signal Processing Proceedings, 1998. ICSP '98. 1998 Fourth International Conference on
Conference_Location :
Beijing
Print_ISBN :
0-7803-4325-5
Type :
conf
DOI :
10.1109/ICOSP.1998.770139
Filename :
770139
Link To Document :
بازگشت