A Study on the Design of Highly Parallel Multiplier using VCGM

VCGM를 사용한 고속병렬 승산기 설계에 관한 연구

  • Published : 2002.06.01

Abstract

In this paper, a new designed circuit of highly parallel multiplier using standard basis over $GF(2^m)$ is presented. Prior to construct the multiplier circuit, we provide the Vector Code Generate Module(VCGM) that generate each vector codes for multiplication. Using these VCGMs, we can get all vector codes necessary for operation and modular sum up each independent corresponding basis, respectively. Following the equations in this paper, we can design generalized multiplier to m. For the proposed circuit in this parer, we show the example in $GF(2^4)$ using VCGMs. In this paper, we build a multiplier with VCGMs, AND blocks, and EX-OR blocks. Therefore the proposed circuit is easy to generalize for m and advantageous for VLSI. Also, it need no memory element and the latency not less fewer then other circuit. We verify the proposed circuit by functional simulation and show its result. Finally, we compare the circuit composition with other works and show its result with a table.

본 논문에서는 GF($2^{m}$)상의 표준기저를 사용한 새로운 형태의 고속병렬 승산회로를 제안하였다. 승산회로의 구성에 앞서, 연산에 필요한 벡터코드들을 생성하는 벡터코드생성모듈(VCGM)을 제안하였다. 이를 통해 연산에 필요한 모든 벡터코드들을 찾을 수 있으며 이들로부터 기저들간의 독립된 모듈러 가산을 취해 승산이 이루어지도록 하였다. 이러한 과정을 수식을 통해 보임으로써, m에 대한 일반화된 회로의 설계가 가능하도록 하였으며, 간단한 형태의 승산회로구성의 예를 GF($2^4$)를 통해 보였다. 본 논문에서 제안된 승산회로는 그 구성이 VCGM, AND 블록, EX-OR 블럭을 통해 이루어짐으로 m에 대한 확장이 용이하며 VLSI에 유리하다. 또한, 회로내부에 메모리 소자를 사용하지 않고, 연산과정 중 소자에 의해 발생하는 지연시간이 적으므로 고속의 연산을 수행할 수 있다. 제안된 회로의 연산동작을 시뮬레이션을 통해 검증하였으며, 참고문헌의 승산기와 그 구성을 비교하였다.

Keywords

References

  1. IEEE Trans. Computer v.C-20 no.12 A Cellular-Array Multiplier for GF($2^m$) B.A.Laws;C.K.Rushford https://doi.org/10.1109/T-C.1971.223173
  2. IEEE Trans. Computer v.C-33 Systolic multipliers for finite field GF($2^m$) C.S.Yeh;I.S.Reed;T.K.Trung https://doi.org/10.1109/TC.1984.1676441
  3. U.S. Patent No. 4,587,627 Computational Method and Apparatus for Finite Fields J.Omura;J.Massey
  4. IEEE Trans. Comp. v.C-34 VLSI Architecture for Computing Multiplications and Inverses in GF($2^m$) C.C.Wang;T.K.Trung;H.M.Shao;L.J.Deutsch;J.K. Omura;I.S.Reed https://doi.org/10.1109/TC.1985.1676616
  5. IEEE Trans. Information Theory v.28 Bit-Serial Reed-Soloman Encoders E.R. Berlekamp https://doi.org/10.1109/TIT.1982.1056591
  6. IEEE Trans. Comp. v.45 no.3 GF($2^m$) Multiplication and Division Over the Dual Basis S.T.J.Fenn;M.Benaissa;D.Taylor
  7. IEEE Trans. Computer v.C-37 A Comparision of VLSI Architecture of Multipliers using Dual, Normal, or Standard Bases I.S.Hsu;T.K.Troung;L.J.Deutsch;I.S.Reed
  8. Proc. AAECC-6 VLSI Design for Multiplication over Finite Fields E.D.Mastrovito
  9. IEEE Trans. Computer v.38 no.10 A VLSI Architecture for Fast Inversion in GF($2^m$) G.L.Feng
  10. IEEE Trans. Computer v.47 no.3 Low-Complexity Bit Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields C.K.Koc;B.Sunar https://doi.org/10.1109/12.660172
  11. IEEE Trans. Computer v.48 no.1 Multiplexer-Based Array Multipliers Kiamal Z. Pekmestzi https://doi.org/10.1109/12.743408
  12. IEEE Trans. Comp. v.50 no.5 Bit-Parallel Systolic Multipliers for GF($2^m$) Fields Defined by All-One and Equally Spaced Polynomials C.Y.Lee;E.H.Lu;J.Y.Lee https://doi.org/10.1109/12.926154
  13. Proc. IEEE Int. Symp. Multiple-Valued Logic Multiple-valued Logic and Special Purpose Processors : Overview and Future M. Kameyama;T. Higuchi
  14. IEICE Trans v.E76-C no.7 Design of Highly Parallel Linear Digital System for ULSI Processors M. Nakajima;M. Kameyama
  15. IEICE Trans v.E82-D no.9 Design of Multiple-Valued Programmable Logic Array with Unary Function Generators Y.Hata;N.Kamiura;K.Yamato
  16. Error Correcting Coding Theory S.B.Wicker;V.K.Bharagava
  17. Error Control Coding S.Lin
  18. Linear Sequential Circuits A.Gill
  19. Elementary Linear Algebra H.Anton
  20. Advanced Engineering Mathematics 8/e E.Kreyszig