Citation
Abstract
Multiplication is central in the implementation of Fermat number transforms and other residue number algorithms. There is need for a good multiplication algorithm that can be realized easily on a VLSI chip. In this article, the Leibowitz multiplier is modified to realize multiplication in the ring of integers modulo a Fermat number. This new algorithm requires only a sequence of cyclic shifts and additions. The designs developed for this new multiplier are regular, simple, expandable, and, therefore, suitable for VLSI implementation.
Details
- Volume
- 42-79
- Published
- November 15, 1984
- Pages
- 136–141
- File Size
- 321.3 KB