Advertisement

Systolic architectures for multiplication over finite field GF(2m)

  • Menouer Diab
Submitted Contributions Algorithms And Designs For Symbolic And Algebraic Computation
Part of the Lecture Notes in Computer Science book series (LNCS, volume 508)

Abstract

In this paper, we develop two systolic architectures for the productsum computation P=AB+C in the finite field GF(2m). The multipliers consist of m basic cells arranged into a serial-in, serial-out one-dimensional systolic array. They need only one control signal. The first multiplier is semi-serial (coefficient B is input in parallel), and performs simultaneously two product-sum computations P=AB+C and P′=A′B+C′. The bits of the coefficients A, C, A′, C′ are received serially. The bits of the results P and P' are generated serially. The second multiplier is serial (coefficients A, B, and C are input serially), and performs one product-sum computation at a time. The bits of the coefficients A, B, and C are received serially. The bits of the result P are generated serially. In all the cases, the architectures are simple, regular, and possess the properties of concurrency and modularity. As a consequence, they are well suited for VLSI design.

Keywords

Basic Cell Control Signal Clock Cycle Dependence Graph Systolic Array 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    T.C. Bartee and D.I. Schneider, Computation in finite fields, Inform. contr. vol.6, (1963) 79–98.Google Scholar
  2. [2]
    E.R. Berlekamp, Algebraic coding theory (New York:Mc Graw-Hill, 1968).Google Scholar
  3. [3]
    E.R. Berlekamp, Bit-Serial Reed-Solomon Encoders, IEEE Trans. Inform. Theory, vol.IT-28, no.6 (1982) 869–874.Google Scholar
  4. [4]
    R.G. Gallagher, Information theory and reliable communication, (New York:Wiley, 1968).Google Scholar
  5. [5]
    H.T. Kung, Why systolic architectures?, IEEE Trans. on comp., vol.C-15, (1982) 37–48.Google Scholar
  6. [6]
    K.Y. Liu, Architecture for VLSI design of Reed-Solomon Encoders, IEEE Trans. on comp., vol.C-31, no.2, (1982) 170–175.Google Scholar
  7. [7]
    P.J.Mac Williams and N.J.A Sloane, the theory of error-correcting codes, (North-Holland, Amsterdam, 1978).Google Scholar
  8. [8]
    A.Poli et L.Huguet, CODES CORRECTEURS Théorie et applications, (MASSON 1989).Google Scholar
  9. [9]
    P.Quinton, INTRODUCTION AUX ARCHITECTURES SYSTOLIQUES, IRISA, Publication interne no.319 (1986) 1–11.Google Scholar
  10. [10]
    P.Quinton et Y.Robert, ALGORITHMES ET ARCHITECTURES SYSTOLIQUES, (MASSON 1989).Google Scholar
  11. [11]
    I.S. Reed and T.K. Truong, The use of finite fields to compute convolutions, IEEE Trans. Inform. Theory, vol.IT-21, no.2, (1975) 208–213.Google Scholar
  12. [12]
    H.M. Shao, T.K. Truong, L.J. Deutsch, J.H. Yuen, and I.S. Reed, A VLSI design of a pipeline Reed-Solomon Decoder, IEEE Trans. on comp., vol.C-34, no.5, (1985) 393–403.Google Scholar
  13. [13]
    C.C.Wang, T.K.Truong, H.M.Shao, L.J.Deutsch, J.K.Omura, and I.S.Reed, VLSI architectures for computing multiplications and inverses in GF(2m), TDA progress report (1983).Google Scholar
  14. [14]
    C.S. Yeh, I.S. Reed and T.K. Truong, Systolic multipliers for finite fields GF(2m), IEEE Trans. on comp., vol.C-33, no.4, (1984) 357–360.Google Scholar
  15. [15]
    B.B. Zhou, A New Bit-serial systolic Multiplier over GF(2m), IEEE Trans. on comp., vol.C-37, no.6, (1988) 749–751.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Menouer Diab
    • 1
  1. 1.Laboratoire AAECC/LSI, IRITUniversité Paul SabatierToulouse cedexFrance

Personalised recommendations