대한전자공학회:학술대회논문집 (Proceedings of the IEEK Conference)

대한전자공학회 (The Institute of Electronics and Information Engineers)
권호 표지

A Novel Binary-to-Residue Conversion Algorithm for Moduli ($2^n$ - 1, $2^n$, $2^n + 2^{\alpha}$)

  • Syuto, Makoto (Department of Electrical and Electronic Engineering, Faculty of Engineering, Miyazaki University) ;
  • Satake, Eriko (Department of Electrical and Electronic Engineering, Faculty of Engineering, Miyazaki University) ;
  • Tanno, Koichi (Department of Electrical and Electronic Engineering, Faculty of Engineering, Miyazaki University) ;
  • Ishizuka, Okihiko (Department of Electrical and Electronic Engineering, Faculty of Engineering, Miyazaki University)
  • 발행 : 2002.07.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

This paper describes a novel converter to implement high-speed binary-to-residue conversion for moduli 2$^{n}$ - 1, 2$^{n}$ , 2$^{n}$ +2$^{\alpha}$/($\alpha$$\in$｛0,1,…,n-1｝) without using look-up table. In our implementation, the high-speed converter can be achieved, because of the modulo addition time is independent of the word length of operands by using the Signed-Digit (SD) adders inside the modulo adders. For a LSI implementation of residue SD number system with ordinary binary system, the proposed binary-to-residue converter is the efficient circuit.cient circuit.

키워드