Corpus ID: 17155763

Faster Modulo 2 n + 1 Multipliers without Booth Recoding

  title={Faster Modulo 2 n + 1 Multipliers without Booth Recoding},
  author={R. Chaves and L. Sousa},
This paper proposes an improvement to the fastest modulo 2 + 1 multiplier already published, without Booth recoding. Results show that by manipulating the partial products and modulo reduction terms and by inserting them adequately in the multiplication matrix, the performance of multiplication units can be improved more than 20%. This improvement is obtained at the expense of some extra circuit area, which can be disregarded for operands with sufficient length. 
Novel Modulo 2^n + 1 Multipliers
A new modulo 2n+1 multiplier architecture is proposed for operands in the normal representation by showing that all required correction factors can be merged into a single constant one and by treating this, partly as a partial product and partly by the final parallel adder. Expand
Design of efficient modulo 2n+1 multipliers
Qualitative and quantitative comparisons indicate that the proposed multipliers compare favourably with the earlier solutions. Expand
A Fast Low-Power Modulo 2 ^ n + 1 Multiplier
Modulo 2+1 multiplier is one of the critical components in applications in the area of digital signal processing, data encryption and residue arithmetic that demand high-speed and low-powerExpand
Improving residue number system multiplication with more balanced moduli sets and enhanced modular arithmetic structures
Two complementary approaches have been proposed to improve the efficiency of RNS based on triple moduli sets: enhancing multipliers modulo 2n+1, which perform the most complex arithmetic operation, and overloading the binary channel in order to obtain a more balanced moduli set. Expand
Fast Low-Power Modulo 2 n + 1 Squarer Hardware for Efficient Data Processing
Modulo 2+1 multiplier and squarer are critical components in various applications such as secure communications in networked instrumentation and distributed measurement systems, data encryption andExpand
Efficient multiply-add unit specified for DSPs utilizing low-power pipeline modulo 2n+1 multiplier
In this work, a new efficient pipeline structure for modulo 2n+1 modified booth multiplier is proposed. Furthermore, the same structure is extended to design new pipeline modulo 2n+1 MAC (MultiplyExpand
Ef fi cient Modulo Multipliers
  • 2011


An efficient tree architecture for modulo 2n+1 multiplication
This paper proposes a parallel fine-grained architecture, based on a Wallace tree, for modulo (2n+1) multiplication which does not require any conversions; the use of a Wallace Tree considerably improves the speed of the multiplier. Expand
A Simplified Architecture for Modulo (2n + 1) Multiplication
The modulo (2n + 1) multiplication is widely used in the computation of convolutions and in RNS arithmetic and, thus, it is important to reduce the calculation delay. This paper presents a concept ...
Efficient VLSI implementation of modulo (2/sup n//spl plusmn/1) addition and multiplication
  • R. Zimmermann
  • Mathematics, Computer Science
  • Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336)
  • 1999
It is shown that the parallel-prefix adder architecture is well suited to realize fast end-around-carry adders used for modulo addition, and a high-performance modulo multiplier-adder for the IDEA block cipher is presented. Expand
A universal architecture for designing efficient modulo 2/sup n/+1 multipliers
  • L. Sousa, R. Chaves
  • Computer Science, Mathematics
  • IEEE Transactions on Circuits and Systems I: Regular Papers
  • 2005
The proposed architecture is comprehensive, providing modulo (2/sup n/+1) multipliers with similar performance and cost both for the ordinary and for the diminished-1 number representations, and is the only one taking advantage of this recoding to obtain faster multiplier with a significant reduction in hardware. Expand
A Suggestion for a Fast Multiplier
The author develops an adder tree to sum this set when t= 1 the maximum number of regions intersections of n t-flats and shows that a tree will be dependent on both t and n. Expand
A Reduced-Area Scheme for Carry-Select Adders
  • A. Tyagi
  • Computer Science
  • IEEE Trans. Computers
  • 1993
The author introduces a scheme to generate carry bits with block-carry-in 1 from the carries of a block withBlock- Carry-in 0 to derive a more area-efficient implementation for both the carry-select and parallel-prefix adders. Expand
Efficient VLSI implementation of modulo (2 n ± 1) addition and multiplication
  • Proc. IEEE Symp. on Computer Arithmetic
  • 1999
RDSP: A digital signal processor with suport for residue arithmetic
  • Master’s thesis, Instituto Superior Tecnico, Lisboa, 2003. written in portuguese.
  • 2003
Regular VLSI architecture for multiplication modulo (2 n + 1)
  • IEEE Journal of Solid-State Circuits
  • 1991