Low-complexity multiplier for gf (2m) based on all-one polynomials

Author: 
Pardhasarathy, T. and Vijayabhaskar, C.
Abstract: 

This paper presents an area-time-efficient systolic structure for multiplication over GF(2m) based on irreducible all-one polynomial(AOP). We have used a novel cut-set retiming to reduce the duration of the critical-path to one XOR gate delay. It is further shown that the systolic structure can be decomposed into two or more parallel systolic branches, where the pair of parallel systolic branches has the same input operand, and they can share the same input operand registers. From the application-specific integrated circuit and field-programmable gate array synthesis results we find that the proposed design provides significantly less area-delay and power-delay complexities over the best of the existing designs.

Download PDF: 
Certificate: 

CHIEF EDITOR

  

           Prof. Dr. Bilal BİLGİN

Call for Papers - 2017

    submit your paper now

   Vol. 07, Issue 02, February 2017

CURRENT ISSUE

 

Article Tracking

IMPACT FACTOR 2016

          4.753

Get your Certificate

Copyright © 2016 International Journal Development Research. All Rights Reserved.