A VLSI Algorithm for Division in GF(2^m) Based on Extended Binary GCD Algorithm

5 Citations 6 References

Search this article

Abstract

A VLSI algorithm for division in GF(2^m ) with the canonical basis representation is proposed. It is based on the extended Binary GCD algorithm for GF(2^m ) and performs division through iteration of simple operations, such as shifts and bitwise exclusive-OR operations. A divider in GF(2^m ) based on the algorithm has a linear array structure with a bit-slice feature and carries out division in 2m clock cycles. The amount of hardware of the divider is proportional to m and the depth is a constant independent of m.

Journal

  • IEICE Trans. Fundamentals, A

    IEICE Trans. Fundamentals, A 85 (5), 994-999, 2002-05-01

    The Institute of Electronics, Information and Communication Engineers

Citations (5)*help

See more

References(6)*help

See more

Keywords

Details 詳細情報について

  • CRID
    1574231877100484352
  • NII Article ID
    110003209115
  • NII Book ID
    AA10826239
  • ISSN
    09168508
  • Text Lang
    en
  • Data Source
    • CiNii Articles

Report a problem

Back to top