Logo image
A systolic architecture for computing inverses in finite fields GF (2m)
會議論文集

A systolic architecture for computing inverses in finite fields GF (2m)

C.-L. Wang 和 J.-L. Lin
International Symposium on VLSI Technology, Systems, and Applications, Proceedings, 頁碼.312-316
1991

摘要

Clocks Computation theory Logic design Systolic arrays VLSI circuits Logic circuit design Nearest neighbors Primitive polynomials Related systems Speed performance Systolic architecture Throughput rate VLSI implementation Computer circuits
In this paper, a new serial-in serial-out systolic array is presented for fast inversion in finite fields GF(2m) with the standard basis representation. The architecture is highly regular, modular, nearest neighbor connected, and thus well suited to VLSI implementation. It has a latency of 7m-3 clock cycles and a throughput rate of one result per 2m-1 clock cycles. This speed performance is much better than those in the related systems described previously. Moreover, its logic circuit design is independent of the primitive polynomial used to generate the field. As a consequence, the proposed system is useful for a wide range of applications. © 1991 IEEE.

檔案與連結 (1)

url
https://www.scopus.com/inward/record.uri?eid=2-s2.0-20144376307&doi=10.1109%2fVTSA.1991.246741&partnerID=40&md5=cd9f322a7b0bb396e7b7e65cfa20805b檢視

相關連結

指標

1 檢視次數

詳細資料

Logo image