dc.contributor.authorMuralidharan, Ramya
dc.contributor.authorChang, Chip Hong
dc.date.accessioned2010-08-31T01:44:14Z
dc.date.available2010-08-31T01:44:14Z
dc.date.copyright2009en_US
dc.date.issued2009
dc.identifier.citationMuralidharan, R., & Chang, C. H. (2009). Hard multiple generator for higher radix modulo 2n-1 multiplication. In proceedings of the 12th International Symposium on Integrated Circuits: Singapore, (pp.546-549).
dc.identifier.urihttp://hdl.handle.net/10220/6374
dc.description.abstractHigh-speed modulo multipliers are essential elements in RNS datapath. Booth recoding algorithm can be used to improve the performance of the multiplier by reducing the number of partial products. In radix-8 booth encoding, the number of partial products is reduced to one-third. However, the inevitable carry propagation adder required to generate the hard multiple, 3X, where X is the multiplicand, falls on the critical path of the multiplier. This paper presents an efficient modulo 2n-1 hard multiple generator based on the parallel-prefix addition. The proposed hard multiple generator employs prefix levels, making radix-8 Booth encoding a feasible choice for high-speed modulo 2n-1 multiplier design. The merit of the design is corroborated by synthesis results based on TSMC 0.18 CMOS standard-cell library.en_US
dc.format.extent4 p.en_US
dc.language.isoenen_US
dc.rights© 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.subjectDRNTU::Engineering::Electrical and electronic engineering::Electronic circuits
dc.titleHard multiple generator for higher radix modulo 2^n-1 multiplicationen_US
dc.typeConference Paper
dc.contributor.conferenceIEEE International Symposium on Integrated Circuits (12th : 2009 : Singapore)en_US
dc.contributor.researchCentre for High Performance Embedded Systemsen_US
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen_US
dc.identifier.openurlhttp://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5403941
dc.description.versionPublished versionen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record