On the design of modulo 2n+1 multipliers

Efstathiou, C; Pekmestzi, K; Axelos, N

dc.contributor.author	Efstathiou, C	en
dc.contributor.author	Pekmestzi, K	en
dc.contributor.author	Axelos, N	en
dc.date.accessioned	2014-03-01T02:47:26Z
dc.date.available	2014-03-01T02:47:26Z
dc.date.issued	2011	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33145
dc.subject	Booth multipliers	en
dc.subject	Modulo arithmetic	en
dc.subject	Residue number system	en
dc.subject	RNS	en
dc.subject.other	Booth multiplication	en
dc.subject.other	Booth multipliers	en
dc.subject.other	Carry save adder	en
dc.subject.other	Modified booth multipliers	en
dc.subject.other	Modulo 2	en
dc.subject.other	Modulo arithmetic	en
dc.subject.other	Partial product	en
dc.subject.other	Residue number system	en
dc.subject.other	RNS	en
dc.subject.other	Adders	en
dc.subject.other	Algorithms	en
dc.subject.other	Electron multipliers	en
dc.subject.other	Numbering systems	en
dc.subject.other	Systems analysis	en
dc.subject.other	Design	en
dc.title	On the design of modulo 2n+1 multipliers	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/DSD.2011.64	en
heal.identifier.secondary	http://dx.doi.org/10.1109/DSD.2011.64	en
heal.identifier.secondary	6037448	en
heal.publicationDate	2011	en
heal.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."" © 2011 IEEE.	en
heal.journalName	Proceedings - 2011 14th Euromicro Conference on Digital System Design: Architectures, Methods and Tools, DSD 2011	en
dc.identifier.doi	10.1109/DSD.2011.64	en
dc.identifier.spage	453	en
dc.identifier.epage	459	en