Please use this identifier to cite or link to this item:
http://dspace.unimap.edu.my:80/xmlui/handle/123456789/7448
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Rizalafande, Che Ismail | - |
dc.contributor.author | Beckett, P | - |
dc.date.accessioned | 2010-01-01T07:12:04Z | - |
dc.date.available | 2010-01-01T07:12:04Z | - |
dc.date.issued | 2007 | - |
dc.identifier.citation | Journal of Engineering Research and Education, vol. 4, 2007, pages 30-40. | en_US |
dc.identifier.issn | 1823-2981 | - |
dc.identifier.uri | http://jere.unimap.edu.my | - |
dc.identifier.uri | http://dspace.unimap.edu.my/123456789/7448 | - |
dc.description | Link to publisher's homepage at http://jere.unimap.edu.my | en_US |
dc.description.abstract | Previously reported multiplication algorithms mainly focus on rapidly reducing the partial product rows down to final sums and carries used for the final accumulation. In this paper, an efficient approach for partial product generator is presented. The approach focuses on reducing the number of partial product rows by performing the two's complement operation even before applying partial products reduction techniques. Consequently, this directly influences the speed of the multiplication as well as the area of the circuits. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Univerisiti Malaysia Perils | en_US |
dc.subject | Multipliers (Mathematical analysis) | en_US |
dc.subject | Multiplication | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Partial product rows | en_US |
dc.title | A high speed and well-structured partial product generator for parallel multiplier | en_US |
dc.type | Article | en_US |
dc.contributor.url | rizalafande@unimap.edu.my | en_US |
Appears in Collections: | Journal of Engineering Research and Education (JERE) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
A High Speed and Well-Structured Partial.pdf | Access is limited to UniMAP community. | 6.45 MB | Adobe PDF | View/Open |
Items in UniMAP Library Digital Repository are protected by copyright, with all rights reserved, unless otherwise indicated.