A New Common Subexpression Elimination Algorithm for Constant Matrix Multiplications Over Binary Field

  • Ning Wu
  • Xiaoqiang Zhang
  • Yunfei Ye
  • Lidong Lan
Conference paper


In this work, a new multi-term common subexpression elimination (CSE) algorithm is proposed. The new algorithm aims to reduce area-delay-production (ADP) in VLSI designs of constant matrix multiplication (CMM) over binary field. For promoting delays optimization, a gate-level delay computing method is used to compute the delays based on the transformed constant matrices. The new algorithm also takes a greedy algorithm to search the minimal ADP result. The worst case computational complexities of the delay computing method and the new CSE algorithm are analyzed, respectively. Experimental results have shown that the new CSE algorithm has more efficient in ADP reduction in VLSI designs of binary CMM.


Area-delay-production Binary field Common subexpression elimination Constant matrix multiplication Critical path delay Delay computing method Greedy algorithm Multiple constants multiplication 



This work was supported by the National Natural Science Foundation of China under Grant 61376025, the Industry-academic Joint Technological Innovations Fund Project of Jiangsu under Grant BY2013003-11.


  1. 1.
    N. Chen, Z.Y. Yan, Cyclotomic FFTs with reduced additive complexities based on a novel common subexpression elimination algorithm. IEEE Trans. Signal Process. 57(3), 1010–1020 (2009)CrossRefMathSciNetGoogle Scholar
  2. 2.
    A. Chandrakasan, M. Potkonjak, R. Mehra, J. Rabaey, R.W. Brodersen, Optimizing power using transformations. IEEE Trans. Comput.-Aided Design Integr. Circuits Syst. 14(1), 12–31 (1995)Google Scholar
  3. 3.
    N. Wu, X.Q. Zhang, Y.F. Ye, L.D. Lan, in Proceedings of The World Congress on Engineering and Computer Science 2013, WCECS 2013. Improving common subexpression elimination algorithm with a new gate-level delay computing method. Lecture Notes in Engineering and Computer Science, 23–25 October. (San Francisco, USA, 2013), pp. 677–682Google Scholar
  4. 4.
    O. Gustafsson, M. Olofsson, in First International Workshop on Arithmetic of Finite Fields (WAIFI 2007). Complexity reduction of constant matrix computations over the binary field, LNCS, vol. 4547 (Springer, 2007), pp. 103–115Google Scholar
  5. 5.
    R. Paško, P. Schaumont, V. Derudder, S. Vernalde, D. Ďuračková, A new algorithm for elimination of common subexpressions. IEEE Trans. Comput.-Aided Design 18(1), 58–68 (1999)CrossRefGoogle Scholar
  6. 6.
    C. Zeng, N. Wu, X.Q. Zhang, The optimization of AES S-box circuit design based on multiple-term CSE algorithm. Acta Electronica Sinica (Chinese Edition), 42(3), (2014)Google Scholar
  7. 7.
    X. Zhang, K.K. Parhi, On the optimum constructions of composite field for the AES algorithm. IEEE Trans. Circuits Syst. II Express Briefs 53(10), 1153–1157 (2006)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2014

Authors and Affiliations

  • Ning Wu
    • 1
  • Xiaoqiang Zhang
    • 1
  • Yunfei Ye
    • 1
  • Lidong Lan
    • 1
  1. 1.College of Electrical and Information EngineeringNanjing University of Aeronautics and AstronauticsNanjingChina

Personalised recommendations