Show simple item record

dc.contributor.authorPremkumar, A. B.en_US
dc.contributor.authorAng, E. L.en_US
dc.contributor.authorLai, Edmund M-K.en_US
dc.date.accessioned2007-05-21T23:25:54Zen_US
dc.date.accessioned2016-03-06T22:24:32Z
dc.date.accessioned2016-09-07T13:57:03Z
dc.date.available2006en_US
dc.date.available2016-03-06T22:24:32Z
dc.date.available2016-09-07T13:57:03Z
dc.date.issued2006-02-01en_US
dc.identifier.issn1549-7747
dc.identifier.urihttp://hdl.handle.net/10179/9618
dc.description.abstractThe residue number system (RNS) is suitable for DSP architectures because of its ability to perform fast carry-free arithmetic. However, this advantage is over-shadowed by the complexity involved in the conversion of numbers between binary and RNS representations. Although the reverse conversion (RNS to binary) is more complex, the forward transformation is not simple either. Most forward converters make use of look-up tables (memory). Recently, a memoryless forward converter architecture for arbitrary moduli sets was proposed by Premkumar in 2002. In this paper, we present an extension to that architecture which results in 44% less hardware for parallel conversion and achieves 43% improvement in speed for serial conversions. It makes use of the periodicity properties of residues obtained using modular exponentiation.
dc.format.mediumapplication/pdfen_US
dc.publisherMassey University.en_US
dc.relation.isbasedonIEEE Transactions on Circuits and Systems Part II: Express Briefs, Vol. 53, No. 2, September-October 2005, pp. 133-137en_US
dc.subject.classificationResidue number systemen_US
dc.subject.classificationForward converteren_US
dc.subject.classificationDigital signal processingen_US
dc.titleImproved Memoryless RNS Forward Converter Based on the Periodicity of Residuesen_US
dc.typeJournal Articleen_US
dc.citation.volume53
dc.identifier.harvestedMassey_Dark
dc.identifier.harvestedMassey_Dark


Files in this item

Icon

This item appears in the following Collection(s)

Show simple item record