High-speed, low-complexity systolic designs of novel iterative division algorithms in GF(2m)

Chien Hsing Wu, Chien Ming Wu, Ming Der Shieh, Yin Tsung Hwang

研究成果: Article同行評審

49 引文 斯高帕斯(Scopus)

摘要

We extend the binary algorithm invented by Stein and propose novel iterative division algorithms over GF(2m) for systolic VLSI realization. While Algorithm EBg is a basic prototype with guaranteed convergence in at most 2m - 1 iterations, its variants, Algorithms EBd and EBdf, are designed for reduced complexity and fixed critical path delay, respectively. We show that Algorithms EBd and EBdf can be mapped to parallel-in parallel-out systolic circuits with low area-time complexities of O(m2 log log m) and O(m2), respectively. Compared to the systolic designs based on the extended Euclid's algorithm, our circuits exhibit significant speed and area advantages.

原文English
頁(從 - 到)375-380
頁數6
期刊IEEE Transactions on Computers
53
發行號3
DOIs
出版狀態Published - 2004 三月 1

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics

指紋 深入研究「High-speed, low-complexity systolic designs of novel iterative division algorithms in GF(2<sup>m</sup>)」主題。共同形成了獨特的指紋。

引用此