DocumentCode
927257
Title
Residue-to-binary decoder for an enhanced moduli set
Author
Hiasat, A. ; Sweidan, A.
Author_Institution
Electron. & Comput. Eng. Dept., Princess Sumaya Univ. for Technol., Amman, Jordan
Volume
151
Issue
2
fYear
2004
fDate
3/19/2004 12:00:00 AM
Firstpage
127
Lastpage
130
Abstract
Previous publications have given the moduli set (2n, 2n-1, 2n+1) considerable attention. In the residue number system literature this moduli set was referred to as the popular set. However, the dynamic range of this set is limited to 3n bits. A new moduli set (22n, 2n-1, 2n+1) is proposed with a dynamic range of 4n bits. This enhanced set enjoys the same features of the popular one. Also proposed are closed forms for multiplicative inverses for the set and an algorithm for decoding the residue digits into their binary equivalent. Although it increases the dynamic range by 33%, the residue-to-binary decoder of the new set requires the same hardware and time complexity as the popular one.
Keywords
computational complexity; decoding; residue number systems; set theory; binary decoder; moduli set; residue number system; time complexity;
fLanguage
English
Journal_Title
Computers and Digital Techniques, IEE Proceedings -
Publisher
iet
ISSN
1350-2387
Type
jour
DOI
10.1049/ip-cdt:20040033
Filename
1274029
Link To Document