A Simplified Design Approach for Efficient Computation of DCT
暂无分享,去创建一个
[1] M. Swamy,et al. On the algorithms for the computation of even discrete cosine transform-2 (EDCT-2) of real sequences , 1990 .
[2] N. Ahmed,et al. Discrete Cosine Transform , 1996 .
[3] Robert M. Harlick. A Storage Efficient Way to Implement the Discrete Cosine Transform , 1976, IEEE Trans. Computers.
[4] Jack E. Volder. The CORDIC Trigonometric Computing Technique , 1959, IRE Trans. Electron. Comput..
[5] Omar A. Nasr,et al. A CORDIC-friendly FFT architecture , 2014, 2014 International Wireless Communications and Mobile Computing Conference (IWCMC).
[6] Liang-Gee Chen,et al. High throughput CORDIC-based systolic array design for the discrete cosine transform , 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.
[7] G.S. Moschytz,et al. Practical fast 1-D DCT algorithms with 11 multiplications , 1989, International Conference on Acoustics, Speech, and Signal Processing,.
[8] Earl E. Swartzlander,et al. A scaled DCT architecture with the CORDIC algorithm , 2002, IEEE Trans. Signal Process..
[9] Shanq-Jang Ruan,et al. Low-power and high-quality Cordic-based Loeffler DCT for signal processing , 2007, IET Circuits Devices Syst..
[10] M. J. Narasimha,et al. On the Computation of the Discrete Cosine Transform , 1978, IEEE Trans. Commun..
[11] Weiping Li,et al. A new algorithm to compute the DCT and its inverse , 1991, IEEE Trans. Signal Process..
[12] Haralick. A Storage Efficient Way to Implement the Discrete Cosine Transform , 1976, IEEE Transactions on Computers.