Design of Systolic Multipliers in GF(2^m) Using an Irreducible All One Polynomial 


Vol. 29,  No. 8, pp. 1047-1054, Aug.  2004


PDF
  Abstract

In this paper, we present two systolic arrays to computing multiplications in GF(2^m) generated by an irreducible all one polynomial (AOP) The proposed two systolic complexity of O(I) In order words, the multiplier consists of m(m+1)/2 identical cells and produces multiplication results at a rate of one every 1 clock cycle, after an initial delay of m/2+1 cycles Compared with the previously proposed related multiplier using AOP, our design has 12 percent reduced hardware complexity and 50 percent reduced computation delay tie The other systolic multiplier, designed for cryptographic applications, has area complexity of O(m) and tie complexity of O(m), ic, it is composed of m+1 identical cells and produces, multiplication results at a rate of one every m/2+1 clock cycles Compared wit other linear systolic multiplier, we find that our design as at least 43 percent reduced hardware complexity, 83 percent reduced computation delay time, and has twice higher throughput rate Furthermore, since the proposed two architectures have a high regularity and modularity, they are well suited to VLSI implementations Therefore, when the proposed architectures are used for GF(2^m) applications, one can achieve maximum throughput performance with least hardware requirements.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

S. Kwon, C. H. Kim, C. P. Hong, "Design of Systolic Multipliers in GF(2^m) Using an Irreducible All One Polynomial," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 8, pp. 1047-1054, 2004. DOI: .

[ACM Style]

Soonhak Kwon, Chang Hoon Kim, and Chun Pyo Hong. 2004. Design of Systolic Multipliers in GF(2^m) Using an Irreducible All One Polynomial. The Journal of Korean Institute of Communications and Information Sciences, 29, 8, (2004), 1047-1054. DOI: .

[KICS Style]

Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong, "Design of Systolic Multipliers in GF(2^m) Using an Irreducible All One Polynomial," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 8, pp. 1047-1054, 8. 2004.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880