By Topic

VLSI design for diminished-1 multiplication of integers modulo a Fermat number

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Benaissa, M. ; Dept. of Electr. & Electron. Eng., Newcastle-upon-Tyne Univ., UK ; Pajayakrit, A. ; Dlay, S.S. ; Holt, A.G.J.

The paper presents two new multiplication algorithms for Fermat number transforms which have improved speed, and in which both the algorithm and the hardware circuitry are simplified. These advantages arise from the properties of the diminished-1 addition, which allow the need to generate a rather complicated initial state to be eliminated. Also, a number represented in the diminished-1 number scheme is always one less than its normal binary value, thus enabling the translation step to be avoided by considering the least significant bit (LSB) of the multiplier as a special case having the value LSB+1. One of the algorithms has already been realised using NMOS VLSI technology. The circuit has been designed hierarchically and uses regular structures and is expandable, which makes it very suitable for VLSI implementation. A logic diagram for realisation of the second algorithm is also given and this it to be implemented using CMOS technology. It is estimated that the time taken to complete modulo F4 multiplication would be 1 mu s.

Published in:

Computers and Digital Techniques, IEE Proceedings E  (Volume:135 ,  Issue: 3 )