LOW-COMPLEXITY MULTIPLIER FOR GF (2m) BASED ON ALL-ONE POLYNOMIALS

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 field-programmable gate array synthesis results we find that the proposed design provides extensively less area-delay and Power-delay complexities over the best of the existing designs.

  • Project Category : IEEE Projects
  • Project Year : 2013-2014
  • Department
  • B.E(Electronics and Communication), B.Tech, M.E(VLSI), M.Tech,
  • Domain
  • VLSI,
  • Technology
  • RTL-Verilog/VHDL,
  • Avilable city
  • Hyderabad,

Center Photos

Map

Saved times

how does finalsem help you?

  • Projects have been clearly classified.
  • Projects have been specified with title and description.
  • Projects have been uploaded along with real time video and real time project lab photos.
  • Project location can be spotted through google maps.
  • Your contact information shall be shared at the quickest possible.

Project Status

Views :559
Applied :0
Friends Share :0
Bookmarked :0