A VLSI Algorithm for Division in GF(2^m ) Based on Extended Binary GCD Algorithm(Special Section on Discrete Mathematics and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人電子情報通信学会の論文
• 2002-05-01

著者

• Takagi Kazuyoshi

  The Authors Are With The Department Of Information Engineering Nagoya University

• WATANABE Yasuaki

  The authors are with the Department of Information Engineering, Nagoya University

• TAKAGI Naofumi

  The authors are with the Department of Information Engineering, Nagoya University

• Takagi Naofumi

  The Authors Are With The Department Of Information Engineering Nagoya University

• Watanabe Yasuaki

  The Authors Are With The Department Of Information Engineering Nagoya University

関連論文

• A VLSI Algorithm for Division in GF(2^m ) Based on Extended Binary GCD Algorithm(Special Section on Discrete Mathematics and Its Applications)

スポンサーリンク