## 摘要

The operations of the cyclic shifting and the inner proadct are defined based on the properties of irreducible all one polynomials. With the two operations, an effective algorithm for computing multiplications over a class of GF(2^{m}) was developed in this paper. The low-complexity bit-parallel systolic multiplier is presented. The multiplier is the latency of m/2+2 clock cycles. The multiplier has very low latency, which makes them very fast. Moreover the architectures of the multiplier can also be applied to compute multiplications over the class of GF(2^{m}) in which the elements are represented with the root of an irreducible equally spaced polynomial of degree m.

原文 | 英語 |
---|---|

頁（從 - 到） | IV578-IV581 |

期刊 | Materials Research Society Symposium - Proceedings |

卷 | 626 |

出版狀態 | 已出版 - 2001 |

事件 | Thermoelectric Materials 2000-The Next Generation Materials for Small-Scale Refrigeration and Power Generation Applications - San Francisco, CA, 美國 持續時間: 24 04 2000 → 27 04 2000 |

## 指紋

深入研究「New bit-parallel systolic multipliers for a class of GF(2^{m})」主題。共同形成了獨特的指紋。