Title :
On the Design of Modulo 2^n+1 Multipliers
Author :
Efstathiou, Constantinos ; Pekmestzi, Kiamal ; Axelos, Nicholas
Author_Institution :
Dept. of Inf., Technol. & Educ. Inst. of Athens, Athens, Greece
Abstract :
In this work a new efficient modulo 2n+1 modified Booth multiplication algorithm for operands in the weighted representation is proposed. According to our algorithm [n/2]+2 partial products are derived. The resulting partial products are reduced by an inverted end around carry save adder tree to two operands, which are finally added by a diminished-1 modulo 2n+1 adder. Our design compares favorably for both area and delay to the modulo 2n+1 modified Booth multipliers previously proposed.
Keywords :
adders; multiplying circuits; trees (mathematics); Booth multiplication algorithm; carry save adder tree; modulo 2n+1 modified Booth multipliers; modulo 2n+1 multipliers; Adders; Complexity theory; Computer architecture; Delay; Encoding; Logic gates; Zinc; Booth multipliers; RNS; modulo arithmetic; residue number system;
Conference_Titel :
Digital System Design (DSD), 2011 14th Euromicro Conference on
Conference_Location :
Oulu
Print_ISBN :
978-1-4577-1048-3
DOI :
10.1109/DSD.2011.64
