Computation of AB^2 Multiplier in GF(2^m)Using an Efficient Low-Complexity Cellular Architecture

概要

論文の詳細を見る
This study presents two new bit-parallel cellular multipliers based on an irreducible all one polynomial(AOP) over the finite field GF(2^m). Using the property of the AOP, this work also presents an efficient algorithm of inner-product multiplication for computing AB^2 multiplications is proposed, with a structure that can simplify the time and space complexity for hardware implementations. The first structure employs the new inner-product multiplication algorithm to construct the bit-parallel cellular architecture. The designed multiplier only requires the computational delays of (m+1) (T_<AND>+T<XOR>). The second proposed structure is a modification of the first structure, and it requires (m+2) T_<XOR> delays. Moreover, the proposed multipliers can perform A^<2^i>B^<2^j> computations by shuffling the coefficients to make i and j integers. For the computing multiplication in GF(2^m), the novel multipliers turn out to be efficient as they simplify architecture and accelerate computation. The two novel architectures are highly regular, simpler, and have shorter computation delays than the conventional cellular multipliers.
社団法人電子情報通信学会の論文
2000-12-25