Efficient Design of Low-Complexity Bit-Parallel Systolic Hankel Multipliers to Implement Multiplication in Normal and Dual Bases of GF (2^m)(Circuit Theory)

スポンサーリンク

概要

• 論文の詳細を見る

• Normal and dual bases are two popular representation bases for elements in GF(2^m). In general, each distinct representation basis has its associated different hardware architecture. In this paper, we will present a unified systolic array multiplication architecture for both normal and dual bases, such a unified multiplication architecture is termed a Hankel multiplier. The Hankel multiplier has lower space complexity while compared with other existing normal basis multipliers and dual basis multipliers.

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

著者

• Lee Chiou‐yng

  Lunghwa Univ. Sci. And Technol. Taoyuan Twn

• Lee Chiou-yng

  Department Of Computer Information And Network Engineering Lunghwa University Of Science And Technol

• Chiou Che‐wun

  Ching Yun Univ. Twn

• CHIOU Che-Wun

  Department of Electronic Engineering, Ching Yun University

関連論文

• Efficient Design of Low-Complexity Bit-Parallel Systolic Hankel Multipliers to Implement Multiplication in Normal and Dual Bases of GF (2^m)(Circuit Theory)
• Low-Complexity Parallel Systolic Montgomery Multipliers over GF(2^m) Using Toeplitz Matrix-Vector Representation

スポンサーリンク