Fast algorithms for orthogonal and biorthogonal modulated lapped transforms
暂无分享,去创建一个
[1] M. Vetterli,et al. Simple FFT and DCT algorithms with reduced number of operations , 1984 .
[2] B. Lee. A new algorithm to compute the discrete cosine Transform , 1984 .
[3] John Princen,et al. Subband/Transform coding using filter bank designs based on time domain aliasing cancellation , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.
[4] P. Yip,et al. Discrete Cosine Transform: Algorithms, Advantages, Applications , 1990 .
[5] Pierre Duhamel,et al. A fast algorithm for the implementation of filter banks based on 'time domain aliasing cancellation' , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.
[6] P. Vaidyanathan. Multirate Systems And Filter Banks , 1992 .
[7] Henrique S. Malvar,et al. Signal processing with lapped transforms , 1992 .
[8] D. Sevic,et al. A new efficient implementation of the oddly stacked Princen-Bradley filter bank , 1994, IEEE Signal Processing Letters.
[9] Alan B. Bradley,et al. Filter bank design based on time domain aliasing cancellation with non-identical windows , 1994, Proceedings of ICASSP '94. IEEE International Conference on Acoustics, Speech and Signal Processing.
[10] Seymour Shlien,et al. The modulated lapped transform, its time-varying forms, and its applications to audio coding standards , 1997, IEEE Trans. Speech Audio Process..
[11] Chi-Wah Kok,et al. Fast algorithm for computing discrete cosine transform , 1997, IEEE Trans. Signal Process..
[12] Henrique S. Malvar. Biorthogonal and nonuniform lapped transforms for transform coding with reduced blocking and ringing artifacts , 1998, IEEE Trans. Signal Process..