Efficient Design of Low-Complexity Bit-Parallel Systolic Hankel Multipliers to Implement Multiplication in Normal and Dual Bases of GF (2<SUP><I>m</I></SUP>)

Chiou-Yng LEE; Che-Wun CHIOU

doi:10.1093/ietfec/e88-a.11.3169

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

Chiou-Yng LEE, Che-Wun CHIOU

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E88-A No.11 pp.3169-3179

Publication Date: 2005/11/01

Publicized

Online ISSN

DOI: 10.1093/ietfec/e88-a.11.3169

Type of Manuscript: PAPER

Category: Circuit Theory

Cite this

Copy

Chiou-Yng LEE, Che-Wun CHIOU, "Efficient Design of Low-Complexity Bit-Parallel Systolic Hankel Multipliers to Implement Multiplication in Normal and Dual Bases of GF (2m)" in IEICE TRANSACTIONS on Fundamentals, vol. E88-A, no. 11, pp. 3169-3179, November 2005, doi: 10.1093/ietfec/e88-a.11.3169.
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.11.3169/_p

Copy

@ARTICLE{e88-a_11_3169,
author={Chiou-Yng LEE, Che-Wun CHIOU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient Design of Low-Complexity Bit-Parallel Systolic Hankel Multipliers to Implement Multiplication in Normal and Dual Bases of GF (2m)},
year={2005},
volume={E88-A},
number={11},
pages={3169-3179},
abstract={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.},
keywords={},
doi={10.1093/ietfec/e88-a.11.3169},
ISSN={},
month={November},}

Copy

TY - JOUR
TI - Efficient Design of Low-Complexity Bit-Parallel Systolic Hankel Multipliers to Implement Multiplication in Normal and Dual Bases of GF (2m)
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 3169
EP - 3179
AU - Chiou-Yng LEE
AU - Che-Wun CHIOU
PY - 2005
DO - 10.1093/ietfec/e88-a.11.3169
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2005
AB - 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.
ER -