dc.contributor.authorHe, Yajuan
dc.contributor.authorChang, Chip Hong
dc.date.accessioned2010-04-30T07:19:25Z
dc.date.available2010-04-30T07:19:25Z
dc.date.copyright2009en_US
dc.date.issued2009
dc.identifier.citation© 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. http://www.ieee.org/portal/site This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.en_US
dc.identifier.issn1549-8328en_US
dc.identifier.urihttp://hdl.handle.net/10220/6242
dc.description.abstractThe use of redundant binary (RB) arithmetic in the design of high-speed digital multipliers is beneficial due to its high modularity and carry-free addition. To reduce the number of partial products, a high-radix-modified Booth encoding algorithm is desired. However, its use is hampered by the complexity of generating the hard multiples and the overheads resulting from negative multiples and normal binary (NB) to RB number conversion. This paper proposes a new RB Booth encoding scheme to circumvent these problems. The idea is to polarize two adjacent Booth encoded digits to directly form an RB partial product to avoid the hard multiple of high-radix Booth encoding without incurring any correction vector. The proposed method leads to lower encoding and decoding complexity than the recently proposed RB Booth encoder. Synthesis results using Artisan TSMC 0.18- m standard-cell library show that the RB multipliers designed with our proposed Booth encoding algorithm exhibit on average 14% higher speed and 17% less energy-delay product than the existing multiplication algorithms for a gamut of power-of-two word lengths from 8 to 64 b.en_US
dc.format.extent10 p.en_US
dc.language.isoenen_US
dc.relation.ispartofseriesIEEE transactions on circuits and systems—Ien_US
dc.rightsHe, Y., & Chang, C. H. (2009). New Redundant Binary Booth Encoding for Fast 2^n-bit Multiplier Design. IEEE Transactions On Circuits And Systems—I. 56(6), 1192-1201.en_US
dc.subjectDRNTU::Engineering::Electrical and electronic engineering
dc.titleA new redundant binary Booth encoding for fast 2^n-bit multiplier designen_US
dc.typeJournal Article
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen_US
dc.identifier.doihttp://dx.doi.org/10.1109/TCSI.2008.2008503
dc.description.versionPublished versionen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record