A Low Complexity and a Low Latency Bit Parallel Systolic Multiplier over GF(2m) Using an Optimal Normal Basis of Type II
نویسنده
چکیده
Using the self duality of an optimal normal basis (ONB) of type II, we present a bit parallel systolic multiplier over GF (2) which has a low hardware complexity and a low latency. We show that our multiplier has a latency m + 1 and the basic cell of our circuit design needs 5 latches (flip-flops). On the other hand, most of other multipliers of the same type have latency 3m and the basic cell of each multiplier needs 7 latches. Comparing the gates areas in each basic cell, we find that the hardware complexity of our multiplier is 25 percent reduced from the multipliers with 7 latches.
منابع مشابه
Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملLow-Complexity Parallel Systolic Montgomery Multipliers over GF(2m) Using Toeplitz Matrix-Vector Representation
In this paper, a generalized Montgomery multiplication algorithm in GF(2m) using the Toeplitz matrix-vector representation is presented. The hardware architectures derived from this algorithm provide low-complexity bit-parallel systolic multipliers with trinomials and pentanomials. The results reveal that our proposed multipliers reduce the space complexity of approximately 15% compared with an...
متن کاملA New Construction of Massey-Omura Parallel Multiplier over GF(2m)
ÐThe Massey-Omura multiplier of GF 2m uses a normal basis and its bit parallel version is usually implemented using m identical combinational logic blocks whose inputs are cyclically shifted from one another. In the past, it was shown that, for a class of finite fields defined by irreducible all-one polynomials, the parallel Massey-Omura multiplier had redundancy and a modified architecture o...
متن کاملEfficient Bit - Parallel Systolic Multiplier over GF ( 2 m )
A bit parallel systolic multiplier in the finite field GF(2) over the polynomial basis where irreducible polynomial generate the field GF(2) is presented. The complexity of the proposed multiplier is compared in terms of area, latency and speed. The proposed multiplier has high throughput as compared with the traditional systolic multiplier. Moreover, this multiplier is highly regular, modular,...
متن کاملAn Efficient Optimal Normal Basis Type II Multiplier
ÐThis paper presents a new parallel multiplier for the Galois field GF 2m whose elements are represented using the optimal normal basis of type II. The proposed multiplier requires 1:5 m2 ÿm XOR gates, as compared to 2 m2 ÿm XOR gates required by the Massey-Omura multiplier. The time complexities of the proposed and the Massey-Omura multipliers are similar. Index TermsÐGalois field, optimal...
متن کامل