Article

A Family of Parallel-Pre.x Modulo 2n - 1 Adders

Dept. of Comput. Eng. & Informatics, Patras Univ., Greece
International Conference on Application-Specific Systems, Architectures and Processors, Proceedings 07/2003; DOI: 10.1109/ASAP.2003.1212856
Source: IEEE Xplore

ABSTRACT

In this paper we at .rst reveal the cyclic nature of idempotency in the case of modulo 2n - 1 addition. Then based on this property, we derive for each n, a family of minimum logic depth modulo 2n- 1 adders, which allows several trade-offs between the number of operators, the internal wire length, and the fanout of internal nodes. Performance data, gathered using static CMOS implementations, reveal that the proposed architectures outperform all previously reported ones in terms of area and/or operation speed.

  • [Show abstract] [Hide abstract]
    ABSTRACT: Squarers modulo M are useful design blocks for digital signal processors that internally use a residue number system and for implementing the exponentiators required in cryptographic algorithms. In these applications, some of the most commonly used moduli are those of the form 2n + 1. To avoid using (n + 1)-bit circuits, the diminished-1 number system can be effectively used in modulo 2n + 1 arithmetic applications. In this paper, for the first time in the open literature, we formally derive modulo 2n + 1 squarers that adopt the diminished-1 number system. The resulting implementations are built using only full- or half-adders and a final diminished-1 adder and can therefore be pipelined straightforwardly.
    No preview · Conference Paper · Jan 2004
  • [Show abstract] [Hide abstract]
    ABSTRACT: Numerous architectures have been recently proposed for residue arithmetic components, each with its own speed, area and power consumption characteristics. In this paper, we present KoVer, a novel software tool that gives a designer the opportunity to explore several architectures for implementing his residue arithmetic blocks, select the one that best suits his goals and instantly get the HDL level description of the selected architecture.
    No preview · Conference Paper · Jul 2005
  • [Show abstract] [Hide abstract]
    ABSTRACT: Squarers modulo M are useful design blocks for digital signal processors that internally use a residue number system and for implementing the exponentiators required in cryptographic algorithms. In these applications, some of the most commonly used moduli are those of the form 2<sup>n</sup>+1. To avoid using (n+1)-bit circuits, the diminished-1 number system can be effectively used in modulo 2<sup>n</sup>+1 arithmetic applications. In the paper, for the first time in the open literature, the authors formally derive modulo 2<sup>n</sup>+1 squarers that adopt the diminished-1 number system. The resulting implementations are built using only full-and half-adders and a final diminished-1 adder and can therefore be pipelined straightforwardly.
    No preview · Article · Oct 2005 · IEE Proceedings - Computers and Digital Techniques
Show more

We use cookies to give you the best possible experience on ResearchGate. Read our cookies policy to learn more.