Browse > Article
http://dx.doi.org/10.6109/jkiice.2011.15.3.510

Construction of High-Speed Parallel Multiplier on Finite Fields GF(3m)  

Choi, Yong-Seok (상지대학교 컴퓨터정보공학부)
Park, Seung-Yong (재능대학 컴퓨터정보과)
Seong, Hyeon-Kyeong (상지대학교 컴퓨터정보공학부)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.15, no.3, 2011 , pp. 510-520 More about this Journal
Abstract
In this paper, we propose a new multiplication algorithm for primitive polynomial with all 1 of coefficient in case that m is odd and even on finite fields $GF(3^m)$, and compose the multiplier with parallel input-output module structure using the presented multiplication algorithm. The proposed multiplier is designed $(m+1)^2$ same basic cells that have a mod(3) addition gate and a mod(3) multiplication gate. Since the basic cells have no a latch circuit, the multiplicative circuit is very simple and is short the delay time $T_A+T_X$ per cell unit. The proposed multiplier is easy to extend the circuit with large m having regularity and modularity by cell array, and is suitable to the implementation of VLSI circuit.
Keywords
Finite fields; Multiplicative algorithm; Parallel multiplier; Primitive polynomials;
Citations & Related Records
연도 인용수 순위
  • Reference
1 N. Iliev, J. E. Stine and N. Jachimiec, " Parallel Programmable Finite Field $GF(2^m)$ Multiplier," in Proc. IEEE Int. Symp. VLSI Emerging Trends in VLSI Systems Design, Sept. 2004.
2 H. M. Shao, T. K. Truong, L. J. Deutsch, J. H. Yaeh and I. S. Reed, "A VLSI Design of a Pipelining Reed-Solomon Decoder," IEEE Trans. Computers, vol. C-34, pp. 393-403, May. 1985.   DOI   ScienceOn
3 C. C. Wang, T. K. Truong, H. M. Shao, L. J. Deutsch, J. K. Omuro, and I. S. Reed, "VLSI Architecture for Computing Multiplications and Inverses in $GF(2^m)$," IEEE Trans. Computers, vol. C-34, pp. 707-717, Aug. 1985.
4 P. E. Scott, S. E. Tavares, L. E. Peppard, "A Fast VLSI Multiplier for $GF(2^m)$," IEEE Journal Selected Areas in Comunications, SAL-4, no. 1, pp. 62-65, Jan. 1986.
5 A. Halbutogullari and C. K. Koc, "Mastrovito Multiplier for General Irreducible Polynomials," IEEE Trans. Computers, vol. 49, no. 5, pp. 503-518, May 2000.   DOI   ScienceOn
6 C. Y. Lee, E.H. Lu, and J. Y. Lee, "Bit Parallel Systolic Multipliers for $GF(2^m)$ Fields Defined by All-One and Equally Spaced Polynomials," IEEE Trans. Computers, vol. 50, no. 5, pp. 385-392, May 2001.   DOI   ScienceOn
7 C. S. Yeh, I. S. Reed, and T. K. Truong, "Systolic Multipliers for Finite Fields $GF(2^m)$," IEEE Trans. Computers, vol. 33, no. 4, pp. 357-360, Apr. 1984.
8 T, Itoh and S. Tsujii, "Structure of Parallel Multipliers for a Class of Fields $GF(2^m)$," Inform. Comp., vol. 83, pp. 21-40, 1989.   DOI
9 C. L. Wang and J. L. Lin, "Systolic Array Implementation of Multipliers for Finite Fields $GF(2^m)$," IEEE Trans. Circuits and Systems, vol. 38, no. 7, July 1991.
10 S. W. Wei, "A Systolic Power-Sum Circuit for $GF(2^m)$," IEEE Trans. Computers, vol. 43, no. 2, pp. 226-229, Feb. 1994.   DOI   ScienceOn