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)


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
Issue number6
Publication statusPublished - 2008



  • 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