Fast custom instruction identification algorithm based on basic convex pattern model for supporting asip automated design

Kang Zhao, Jinian Bian, Sheqin Dong, Yang Song, Satoshi Goto

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In this paper, a generalized Montgomery multiplication algorithm in GF(2m) using the Toeplitz matrix-vector representation is presented. The hardware architectures derived from this algorithm provide low-complexity bit-parallel systolic multipliers with trinomials and pen-tanomials. The results reveal that our proposed multipliers reduce the space complexity of approximately 15% compared with an existing systolic Montgomery multiplier for trinomials. Moreover, the proposed architectures have the features of regularity, modularity, and local interconnection. Accordingly, they are well suited to VLSI implementation.

Original languageEnglish
Pages (from-to)1478-1487
Number of pages10
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE91-A
Issue number6
DOIs
Publication statusPublished - 2008

Fingerprint

Multiplier
Identification (control systems)
Montgomery multiplication
Algorithm Complexity
Hardware Architecture
Toeplitz matrix
Space Complexity
Modularity
Hardware
Interconnection
Low Complexity
Regularity
Model
Design
Architecture

Keywords

  • Application specific instruction-set processor (ASIP)
  • Basic convex pattern (BCP)
  • Custom instruction identification
  • System-on-a-chip (SoC)

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics
  • Signal Processing

Cite this

Fast custom instruction identification algorithm based on basic convex pattern model for supporting asip automated design. / Zhao, Kang; Bian, Jinian; Dong, Sheqin; Song, Yang; Goto, Satoshi.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E91-A, No. 6, 2008, p. 1478-1487.

Research output: Contribution to journalArticle

@article{f5a1664cd3ec4b79b5867a5f860dfbeb,
title = "Fast custom instruction identification algorithm based on basic convex pattern model for supporting asip automated design",
abstract = "In this paper, a generalized Montgomery multiplication algorithm in GF(2m) using the Toeplitz matrix-vector representation is presented. The hardware architectures derived from this algorithm provide low-complexity bit-parallel systolic multipliers with trinomials and pen-tanomials. The results reveal that our proposed multipliers reduce the space complexity of approximately 15{\%} compared with an existing systolic Montgomery multiplier for trinomials. Moreover, the proposed architectures have the features of regularity, modularity, and local interconnection. Accordingly, they are well suited to VLSI implementation.",
keywords = "Application specific instruction-set processor (ASIP), Basic convex pattern (BCP), Custom instruction identification, System-on-a-chip (SoC)",
author = "Kang Zhao and Jinian Bian and Sheqin Dong and Yang Song and Satoshi Goto",
year = "2008",
doi = "10.1093/ietfec/e91-a.6.1478",
language = "English",
volume = "E91-A",
pages = "1478--1487",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "6",

}

TY - JOUR

T1 - Fast custom instruction identification algorithm based on basic convex pattern model for supporting asip automated design

AU - Zhao, Kang

AU - Bian, Jinian

AU - Dong, Sheqin

AU - Song, Yang

AU - Goto, Satoshi

PY - 2008

Y1 - 2008

N2 - In this paper, a generalized Montgomery multiplication algorithm in GF(2m) using the Toeplitz matrix-vector representation is presented. The hardware architectures derived from this algorithm provide low-complexity bit-parallel systolic multipliers with trinomials and pen-tanomials. The results reveal that our proposed multipliers reduce the space complexity of approximately 15% compared with an existing systolic Montgomery multiplier for trinomials. Moreover, the proposed architectures have the features of regularity, modularity, and local interconnection. Accordingly, they are well suited to VLSI implementation.

AB - In this paper, a generalized Montgomery multiplication algorithm in GF(2m) using the Toeplitz matrix-vector representation is presented. The hardware architectures derived from this algorithm provide low-complexity bit-parallel systolic multipliers with trinomials and pen-tanomials. The results reveal that our proposed multipliers reduce the space complexity of approximately 15% compared with an existing systolic Montgomery multiplier for trinomials. Moreover, the proposed architectures have the features of regularity, modularity, and local interconnection. Accordingly, they are well suited to VLSI implementation.

KW - Application specific instruction-set processor (ASIP)

KW - Basic convex pattern (BCP)

KW - Custom instruction identification

KW - System-on-a-chip (SoC)

UR - http://www.scopus.com/inward/record.url?scp=78049345748&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78049345748&partnerID=8YFLogxK

U2 - 10.1093/ietfec/e91-a.6.1478

DO - 10.1093/ietfec/e91-a.6.1478

M3 - Article

VL - E91-A

SP - 1478

EP - 1487

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 6

ER -