Adder Based Residue to Binary Number Converters for (2n - 1; 2n; 2n + 1)

Simple item page
dc.contributor.authorWang, Y.
dc.contributor.authorSong, X.
dc.contributor.authorAboulhamid, M.
dc.contributor.authorShen, H.
dc.date.issued2002
dc.descriptionCopyright © 2002 IEEE
dc.description.abstractBased on an algorithm derived from the new Chinese remainder theorem I, we present three new residue-to-binary converters for the residue number system (2n-1, 2n, 2n+1) designed using 2n-bit or n-bit adders with improvements on speed, area, or dynamic range compared with various previous converters. The 2n-bit adder based converter is faster and requires about half the hardware required by previous methods. For n-bit adder-based implementations, one new converter is twice as fast as the previous method using a similar amount of hardware, whereas another new converter achieves improvement in either speed, area, or dynamic range compared with previous converters
dc.description.statementofresponsibilityYuke Wang, Xiaoyu Song, Mostapha Aboulhamid and Hong Shen
dc.identifier.citationIEEE Transactions on Signal Processing, 2002; 50(7):1772-1779
dc.identifier.doi10.1109/TSP.2002.1011216
dc.identifier.issn1053-587X
dc.identifier.orcidShen, H. [0000-0002-3663-6591] [0000-0003-0649-0648]
dc.identifier.urihttp://hdl.handle.net/2440/37551
dc.language.isoen
dc.publisherIEEE-Inst Electrical Electronics Engineers Inc
dc.source.urihttps://doi.org/10.1109/tsp.2002.1011216
dc.titleAdder Based Residue to Binary Number Converters for (2n - 1; 2n; 2n + 1)
dc.typeJournal article
pubs.publication-statusPublished

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
hdl_37551.pdf
Size:
365.75 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science publications