A New Common Subexpression Elimination Algorithm for Constant Matrix Multiplications Over Binary Field
作者： Ning Wu , Xiaoqiang Zhang , Yunfei Ye , Lidong Lan
DOI: 10.1007/978-94-017-9115-1_11
关键词:
摘要: In this work, a new multi-term common subexpression elimination (CSE) algorithm is proposed. The aims to reduce area-delay-production (ADP) in VLSI designs of constant matrix multiplication (CMM) over binary field. For promoting delays optimization, gate-level delay computing method used compute the based on transformed matrices. also takes greedy search minimal ADP result. worst case computational complexities and CSE are analyzed, respectively. Experimental results have shown that has more efficient reduction CMM.
springer.com
sci-hub.st 参考文章(5)
Ning Chen, Zhiyuan Yan, Cyclotomic FFTs With Reduced Additive Complexities Based on a Novel Common Subexpression Elimination Algorithm IEEE Transactions on Signal Processing. ,vol. 57, pp. 1010- 1020 ,(2009) , 10.1109/TSP.2008.2009891
R. Pasko, P. Schaumont, V. Derudder, S. Vernalde, D. Durackova, A new algorithm for elimination of common subexpressions IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. ,vol. 18, pp. 58- 68 ,(1999) , 10.1109/43.739059
X. Zhang, K.K. Parhi, On the Optimum Constructions of Composite Field for the AES Algorithm IEEE Transactions on Circuits and Systems Ii-express Briefs. ,vol. 53, pp. 1153- 1157 ,(2006) , 10.1109/TCSII.2006.882217
Oscar Gustafsson, Mikael Olofsson, Complexity Reduction of Constant Matrix Computations over the Binary Field Arithmetic of Finite Fields. pp. 103- 115 ,(2007) , 10.1007/978-3-540-73074-3_9
A.P. Chandrakasan, M. Potkonjak, R. Mehra, J. Rabaey, R.W. Brodersen, Optimizing power using transformations IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. ,vol. 14, pp. 12- 31 ,(1995) , 10.1109/43.363126