mirage

Hard multiple generator for higher radix modulo 2^n-1 multiplication.

DSpace/Manakin Repository

 

Search DR-NTU


Advanced Search Subject Search

Browse

My Account

Hard multiple generator for higher radix modulo 2^n-1 multiplication.

Show full item record

Title: Hard multiple generator for higher radix modulo 2^n-1 multiplication.
Author: Muralidharan, Ramya.; Chang, Chip Hong.
Copyright year: 2009
Abstract: High-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.
Subject: DRNTU::Engineering::Electrical and electronic engineering::Electronic circuits.
Type: Conference Paper
Conference name: IEEE International Symposium on Integrated Circuits (12th : 2009 : Singapore)
School: School of Electrical and Electronic Engineering
Research Centre: Centre for High Performance Embedded Systems
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.
Version: Published version

Files in this item

Files Size Format View
Hard multiple g ... o 2^n-1 multiplication.pdf 434.8Kb PDF View/Open
   

SFX Query

- Get published version (via NTU subscribed resources)
   

This item appears in the following Collection(s)

Show full item record

Statistics

Total views

All Items Views
Hard multiple generator for higher radix modulo 2^n-1 multiplication. 503

Total downloads

All Bitstreams Views
Hard multiple generator for higher radix modulo 2^n-1 multiplication.pdf 261

Top country downloads

Country Code Views
United States of America 73
India 61
China 46
Singapore 34
Japan 5

Top city downloads

city Views
Mountain View 52
Singapore 34
Beijing 25
Hyderabad 9
New Delhi 8

Downloads / month

  2014-02 2014-03 2014-04 total
Hard multiple generator for higher radix modulo 2^n-1 multiplication.pdf 0 0 9 9