DOI QR코드

DOI QR Code

A Study on the Construction of Parallel Multiplier over GF2m)

GF(2m) 상에서의 병렬 승산기 설계에 관한 연구

  • Han, Sung-Il (Dept. of Information & Telecommunication, Induk College)
  • Received : 2011.09.29
  • Accepted : 2012.01.12
  • Published : 2012.03.30

Abstract

A low-complexity Multiplication over GF(2m) and multiplier circuit has been proposed by using cyclic-shift coefficients and the irreducible trinomial. The proposed circuit has the parallel input/output architecture and shows the lower-complexity than others with the characteristics of the cyclic-shift coefficients and the irreducible trinomial modular computation. The proposed multiplier is composed of $2m^2$ 2-input AND gates and m (m+2) 2-input XOR gates without the memories and switches. And the minimum propagation delay is $T_A+(2+{\lceil}log_2m{\rceil})T_X$. The Proposed circuit architecture is well suited to VLSI implementation because it is simple, regular and modular.

본 논문에서는 계수순환과 기약 삼항식을 적용하여 시스템 복잡도를 개선한 GF($2^m$)상의 승산기 구성방법과 구현회로를 제안하였다. 제안된 회로는 병렬 입출력 구조를 가지며, 승산항의 계수 순환과 기약 삼항식을 적용한 모듈로 연산을 하는 회로 구성의 특성상 기존의 타 논문에 비해 회로 복잡도가 감소함을 보였다. 본 논문에서 제안한 회로의 시스템 복잡도는 $2m^2$개의 2-입력 AND 게이트, m (m+2)개의 2-입력 XOR 게이트의 회로복잡도이며, 메모리나 스위치 등의 별도의 소자는 필요하지 않다. 연산에 소요되는 최대 지연시간은 $T_A+(2+{\lceil}log_2m{\rceil})T_X$ 이다. 본 논문에서 제안한 회로는 간단하고, 정규성을 보이며, 모듈구성이 가능하기 때문에 VLSI 회로구성에 상대적으로 적합하다.

Keywords

References

  1. H.M. Shao, T.K.Truong, L.J. Deutsch, J.H. Yaeh and I.S. Reed, " A VLSI design of a pipeling reed-solomon decoder," IEEE Trans. Comput., vol. C-34, pp. 393-403, May 1985. https://doi.org/10.1109/TC.1985.1676579
  2. K.C Smith. "The prospect for multivalued logic : A technology and applications view." IEEE Trans. Comput., vol. C-30, pp. 619-634, Sept. 1981. https://doi.org/10.1109/TC.1981.1675860
  3. I.S. Hsu, T.K. Troun, "A Comparison of VLSI Architecture of Multipliers using Dual, Normal or Standard Bases," IEEE Trans. Comput., vol. C-37, pp. 735-739, 1988.
  4. H. Okano and H. Imai, "A Construction method of high-speed decoders using ROM's for Bose Chaudhuri Hocquenghem and Reed Solomon codes," IEEE Trans. Comput. vol. C-36, pp. 1165-1171, 1987. https://doi.org/10.1109/TC.1987.1676857
  5. C.S. Yeh, I.S Reed and T.K. Truong, "Systolic multipliers for finite field GF(2m)," IEEE Trans. Comput., vol. C-33, pp. 357-360, Apr. 1984. https://doi.org/10.1109/TC.1984.1676441
  6. P.A. Scott, S.E. Tarvares and L.E. Peppard, "A fast multiplier for GF(2m)," IEEE J.Select. Areas Commun., vol. SAC-4, Jan. 1986.
  7. C.C. Wang, T.K. Truong, H.M. Shao, L.J. Deutsch, J.K. Omura and I.S. Reed, "VZLSI architecture for computing multiplications and inverses in GF(2m,)," IEEE Trans. Comput.,. vol. C-34, pp. 709-717, Aug. 1985. https://doi.org/10.1109/TC.1985.1676616
  8. E.D. Mastrovito, "VLSI Architectures for Computation in Galois Fields," PhD thesis, Linkoping Univ., Dept. of Electrical Eng., Linkoping, Sweden, 1991.
  9. B. Sunar and C. K. Koc, "Mastrovito Multiplier for All Trinomials," IEEE Trans. Computers, vol. 48, no. 5, pp.522-527, May 1999. https://doi.org/10.1109/12.769434
  10. S.W. Wei, "A Systolic power-sum circuit for GF(2m)," IEEE Trans. Comput., vol. 43, pp. 226-229, Feb. 1994. https://doi.org/10.1109/12.262128
  11. C. L. Wang and J. H. Guo, "New systolic arrays for C+AB2, inversion, and division in GF(2m)," IEEE Trans. Comput., vol. 49, pp. 1120-1125, Oct. 2000. https://doi.org/10.1109/12.888047
  12. C. Y. Lee, E. H. Lu, and L. F. Sun, "Low-Complexity Bit-Parallel Systolic Architecture for Computing AB2+C in a class of Finite Field GF(2m)," IEEE Trans. Circuit & Systems-II : Analog and Digital Signal Processing, vol. 48, no. 5, pp. 519-523, May 2001. https://doi.org/10.1109/82.938363
  13. Gi-Young Byun and Heung-Soo Kim, "Low System Complexity Bit-Parallel Architecture for Computing AB2+C in a Class of Finite Fields GF(2m)," Journal of The Institute of Electronics Engineers, Vol. 40, No. 6, pp.378-384, Nov. 2003.
  14. K.M. Ku, K.J. Ha and K.Y.Yoo, "Design of new AB2 multiplier over GF(2m) using cellular automata," IEE Proc.-Circuits Devices Syst., Vol. 151, No. 2, April 2004.