유한체 GF(2<SUP>m</SUP>)상의 기약다항식의 모든 계수가 1을 갖는 고속 병렬 승산기의 설계

다국어 초록 (Multilingual Abstract)

In this paper, we propose a new multiplication algorithm for two polynomials using primitive polynomial with all 1 of coefficient on finite fields GF(2<SUP>m</SUP>), and design the multiplier with high-speed parallel input-output module structure using the presented multiplication algorithm. The proposed multiplier is designed ㎡ same basic cells that have a 2-input XOR gate and a 2-input AND gate. Since the basic cell have no a latch circuit, the multiplicative circuit is very simple and is short the delay time D<SUB>A</SUB)+ D<SUB>X</SUB) 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.