A Family of Modulo (2[power]n + 1) Multipliers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2004

A Family of Modulo (2[power]n + 1) Multipliers

Abstract

In this paper, we first describe a novel modulo $(2^n+1)$ addition algorithm suited to FPGA and ASIC implementations, and discuss several architectures of multioperand modulo $(2^n+1)$ adders. Then, we propose three implementations of a modulo $(2^n+1)$ multiplication algorithm based on a paper by A. Wrzyszcz and D. Milford. The first operator is based on an $n\times n$ multiplication and a subsequent modulo $(2^n+1)$ correction, and takes advantage of the arithmetic logic embedded in Spartan or Virtex FPGAs. The second operator computes a sum of modulo-reduced partial products by means of a multioperand modulo $(2^n+1)$ adder. Then, radix-$4$ modified Booth recoding reduces the number of partial products, while making their generation more complex. Finally, we provide a comparison of this family of algorithms with existing solutions.
Fichier principal
Vignette du fichier
RR-5316.pdf (341.27 Ko) Télécharger le fichier
RR2004-39.pdf (547.84 Ko) Télécharger le fichier

Dates and versions

inria-00070684 , version 1 (19-05-2006)

Identifiers

  • HAL Id : inria-00070684 , version 1

Cite

Jean-Luc Beuchat. A Family of Modulo (2[power]n + 1) Multipliers. [Research Report] RR-5316, LIP RR-2004-39, INRIA, LIP. 2004, pp.16. ⟨inria-00070684⟩
119 View
644 Download

Share

Gmail Facebook X LinkedIn More