Abstract
Systolic implementation of multiplication over GF(2m) is usually very efficient in area-time complexity, but its latency is usually very large. Thus, two low latency systolic multipliers over GF(2m) based on general irreducible polynomials and irreducible pentanomials are presented. First, a signal flow graph (SFG) is used to represent the algorithm for multiplication over GF(2m). Then, the two low latency systolic structures for multiplications over GF(2m) based on general irreducible polynomials and pentanomials are presented from the SFG by suitable cut-set retiming, respectively. Analysis indicates that the proposed two low latency designs involve at least one-third less area-delay product when compared with the existing designs. To the authors’ knowledge, the time-complexity of the structures is the lowest found in literature for systolic GF(2m) multipliers based on general irreducible polynomials and pentanomials. The proposed low latency designs are regular and modular, and therefore they are suitable for many time critical applications.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
DESCHAMPS J P, IMANA J L, SUTTER G D. Hardware implementation of finite field arithmetic [M]. New York: McGraw-Hill, 2009: 45–49.
BLAKE I, SEROUSSI G, SMART N P. Elliptic curves in cryptography, ser [M]. London Mathematical Society Lecture Note Series Cambridge, UK: Cambridge Univ Press, 1999: 75–78.
CHEN S H, YAN H Z, MING X Z. Analysis and modeling of error of spiral bevel gear grinder based on multi-body system theory [J]. Journal of Central South University of Technology, 2008, 15(5): 706–711.
JIANG A H, MEI C, E J Q. Nonlinear combined forecasting model based on fuzzy adaptive variable weight and its application [J]. Journal of Central South University of Technology, 2010, 17(4): 863–867.
LEE S H, WANG Y Q, SONG J I. Fourier and wavelet transformations application to fault diction of induction motor with stator current [J]. Journal of Central South University of Technology, 2010, 17(1): 93–101.
WU J S, SHU H Z, WANG L, SENHADJI L. Fast algorithms for the computation of sliding sequency-ordered complex hadamard transform [J]. IEEE Trans Signal Process, 2010, 58(11): 5901–5909.
YEH C S, REED I S, TRUONG T K. Systolic multipliers for finite fields GF(2m) [J]. IEEE Trans. Computers, 1984, 33(4): 357–360.
WANG C L, LIN J L. Systolic array implementation of multipliers for finite fields GF(2m) [J]. IEEE Trans Circuits Syst, 1991, 38(7): 796–800.
SUNAR B, KOC C K. Mastrovito multiplier for all trinomials[J] IEEE Trans Comput, 1999, 48(5): 522–527.
SONG L, PARHI K K, KURODA I, NISHITANI T. Hardware/software code sign of finite field data path for low-energy Reed-Solomn codes [J]. IEEE Trans Very Large Scale Integr (VLSI) Syst, 2000, 8(2): 160–172.
LEE C Y, LU E H, LEE J Y. Bit-parallel systolic multipliers for GF(2m) fields defined by all-one and equally spaced polynomials [J]. IEEE Trans Comput, 2001, 50(6): 385–393.
LEE C Y. Low complexity bit-parallel systolic multiplier over GF(2m) using irreducible trinomials [J]. IEE Proc Comput Digit Tech, 2003, 150(1): 39–42.
LEE C Y, CHIOU C W, LIN J M, CHANG C C. Scalable and systolic Montgomery multiplier over GF(2m) generated by trinomials [J]. IET Circuits Devices Syst, 2007, 1(6): 477–484.
LEE C Y, HORNG J S, JOU I C, LU E H. Low-complexity bit-parallel systolic Montgomery multipliers for special classes of GF(2m) [J]. IEEE Trans Comput, 2005, 54(9): 1061–1070.
JAIN S K, SONG L, PARHI K K. Efficient semisystolic architectures for finite field arithmetic [J]. IEEE Trans Very Large Scale Integr (VLSI) Syst, 1998, 6(1): 734–749.
SARMADI S B, HASAN ANWAR M. Concurrent error detection in finite-field arithmetic operations using pipelined and systolic architectures [J]. IEEE Trans Comput, 2009, 58(11): 1553–1567.
MEHER P K. Systolic and non-systolic scalable modular designs of finite field multipliers for Reed-Solomon codes [J]. IEEE Trans Very Large Scale Integr (VLSI) Syst, 2009, 17(6): 747–757.
MAO Z, SHOU G, HU Y, GUO Z. Design of multipliers for GF(2m) [J]. Electron Lett, 2010, 46(6): 419–420.
FAN H N, HASAN M A. Alternative to the Karatsuba algorithm for software implementations of GF(2n) multiplications [J]. IET Information Security, 2009, 3(2): 60–65.
PARHI K K, VLSI digital signal processing systems: Design and implementation [M]. New York: Wiley, 1999: 189–223.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: Project(61174132) supported by the National Natural Science Foundation of China; Project (09JJ6098) supported by the Natural Science Foundation of Hunan Province, China
Rights and permissions
About this article
Cite this article
Xie, Jf., He, Jj. & Gui, Wh. Low latency systolic multipliers for finite field GF (2m) based on irreducible polynomials. J. Cent. South Univ. Technol. 19, 1283–1289 (2012). https://doi.org/10.1007/s11771-012-1140-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11771-012-1140-0