loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
9th EUROMICRO Conference on Digital System Design (DSD'06)
Novel Modulo 2^n + 1 Multipliers
Cavtat near Dubrovnik, Croatia
August 30-September 01
ISBN: 0-7695-2609-8
ASCII Text
x 
 
H. T. Vergos, C. Efstathiou, "Novel Modulo 2^n + 1 Multipliers," Digital Systems Design, Euromicro Symposium on, pp. 168-175, 9th EUROMICRO Conference on Digital System Design (DSD'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/DSD.2006.71,
author = {H. T. Vergos and C. Efstathiou},
title = {Novel Modulo 2^n + 1 Multipliers},
journal ={Digital Systems Design, Euromicro Symposium on},
volume = {0},
year = {2006},
isbn = {0-7695-2609-8},
pages = {168-175},
doi = {http://doi.ieeecomputersociety.org/10.1109/DSD.2006.71},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Digital Systems Design, Euromicro Symposium on
TI - Novel Modulo 2^n + 1 Multipliers
SN - 0-7695-2609-8
SP168
EP175
A1 - H. T. Vergos,
A1 - C. Efstathiou,
PY - 2006
KW - null
VL - 0
JA - Digital Systems Design, Euromicro Symposium on
ER -
 
H. T. Vergos, University of Patras, Greece
C. Efstathiou, TEI of Athens, Greece
A new modulo 2^n+1 multiplier architecture is proposed for operands in the normal representation. The novel architecture is derived 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. The proposed architecture utilizes a total of (n+1) partial products, each n bits wide and is built using an inverted end-around-carry, carry-save adder tree and a final parallel adder.
Citation:
H. T. Vergos, C. Efstathiou, "Novel Modulo 2^n + 1 Multipliers," dsd, pp.168-175, 9th EUROMICRO Conference on Digital System Design (DSD'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.