Skip to main content

2014 | OriginalPaper | Buchkapitel

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

verfasst von : Ning Wu, Xiaoqiang Zhang, Yunfei Ye, Lidong Lan

Erschienen in: Transactions on Engineering Technologies

Verlag: Springer Netherlands

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat 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)CrossRefMathSciNet 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)CrossRefMathSciNet
2.
Zurück zum Zitat 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) 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)
3.
Zurück zum Zitat 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–682 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–682
4.
Zurück zum Zitat 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–115 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–115
5.
Zurück zum Zitat 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)CrossRef 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)CrossRef
6.
Zurück zum Zitat 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) 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)
7.
Zurück zum Zitat 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)CrossRef 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)CrossRef
Metadaten
Titel
A New Common Subexpression Elimination Algorithm for Constant Matrix Multiplications Over Binary Field
verfasst von
Ning Wu
Xiaoqiang Zhang
Yunfei Ye
Lidong Lan
Copyright-Jahr
2014
Verlag
Springer Netherlands
DOI
https://doi.org/10.1007/978-94-017-9115-1_11

Neuer Inhalt