The refined mCBE algorithm for efficient constants multipliers architecture
暂无分享,去创建一个
In digital hardware, multiplication is frequently used for digital signal processing. We found that there are calculations which need several constants multipliers for the same data. Hence, we developed a multiplication from common binary expression (mCBE) algorithm in order to minimize the number of shifter-adder components to substitute multipliers. Actually, the first generation of the mCBE algorithm has been proposed before. However, it is optimally designed for DCT/IDCT processing. In this paper, we proposed the refined mCBE algorithm, the second generation (mCBEv2), to comply general constants multiplication characteristics. It is based on the constants binary decomposition and designed to establish an efficient multiplication architecture.
[1] Rachmad Vidya Wicaksana Putra,et al. The efficient mCBE algorithm and quantization numbers for multiplierless and low complexity DCT/IDCT Image Compression Architecture , 2011, Proceedings of the 2011 International Conference on Electrical Engineering and Informatics.
[2] Rachmad Vidya Wicaksana Putra,et al. A New RTL Design Approach for a DCT/IDCT-Based Image Compression Architecture using the mCBE Algorithm , 2012 .