{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:00:25Z","timestamp":1761807625041},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,11,23]],"date-time":"2010-11-23T00:00:00Z","timestamp":1290470400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2011,1]]},"DOI":"10.1007\/s11432-010-4133-3","type":"journal-article","created":{"date-parts":[[2010,11,23]],"date-time":"2010-11-23T14:35:33Z","timestamp":1290522933000},"page":"70-78","source":"Crossref","is-referenced-by-count":5,"title":["Efficient CRT-based residue-to-binary converter for the arbitrary moduli set"],"prefix":"10.1007","volume":"54","author":[{"given":"JianWen","family":"Chen","sequence":"first","affiliation":[]},{"given":"RuoHe","family":"Yao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,23]]},"reference":[{"key":"4133_CR1","volume-title":"Residue Arithmetic and Its Applications to Computer Technology","author":"N. S. Szabo","year":"1967","unstructured":"Szabo N S, Tanaka R I. Residue Arithmetic and Its Applications to Computer Technology. New York: McGraw-Hill, 1967"},{"key":"4133_CR2","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/MC.1984.1659138","volume":"17","author":"F. J. Taylor","year":"1984","unstructured":"Taylor F J. Residue arithmetic: a tutorial with examples. IEEE Comput, 1984, 17: 50\u201362","journal-title":"IEEE Comput"},{"key":"4133_CR3","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1137\/0215070","volume":"15","author":"P. W. Beame","year":"1986","unstructured":"Beame P W, Cook S A, Hoover H J. Log depth circuits for division and related problems. SIAM J Comput, 1986, 15: 994\u20131003","journal-title":"SIAM J Comput"},{"key":"4133_CR4","volume-title":"Residue Number System Arithmetic: Modern Applications in Digital Signal Processing","author":"M. A. Soderstrand","year":"1986","unstructured":"Soderstrand M A, Jenkins W K, Jullien G A, et al. Residue Number System Arithmetic: Modern Applications in Digital Signal Processing. New York: IEEE Press, 1986"},{"key":"4133_CR5","volume-title":"Introduction to Parallel Algorithms and Architectures: Array, Trees, Hypercubes","author":"T. Leighton","year":"1992","unstructured":"Leighton T. Introduction to Parallel Algorithms and Architectures: Array, Trees, Hypercubes. San Mateo, CA: Morgan Kaufmann, 1992"},{"key":"4133_CR6","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/82.749106","volume":"46","author":"K. P. Lim","year":"1999","unstructured":"Lim K P, Premkumar A B. A modular approach to the computation of convolution sum using distributed arithmetic principles. IEEE Trans Circuits Syst II, 1999, 46: 92\u201396","journal-title":"IEEE Trans Circuits Syst II"},{"key":"4133_CR7","volume-title":"Computer Arithmetic Algorithms","author":"I. Koren","year":"2002","unstructured":"Koren I. Computer Arithmetic Algorithms. 2nd ed. Massachusetts: AK Peters Natick, 2002","edition":"2nd ed."},{"key":"4133_CR8","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1007\/s11432-008-0097-y","volume":"51","author":"S. Ma","year":"2008","unstructured":"Ma S, Hu J H, Zhang L, et al. An efficient RNS parity checker for moduli set 2n \u2212 1, 2n + 1, 22n + 1 and its applications. Sci China Ser F-Inf Sci, 2008, 51: 1563\u20131571","journal-title":"Sci China Ser F-Inf Sci"},{"key":"4133_CR9","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1109\/82.826745","volume":"47","author":"Y. K. Wang","year":"2000","unstructured":"Wang Y K. Residue-to-binary converters based on new Chinese remainder theorems. IEEE Trans Circuits Syst II, 2000, 47: 197\u2013205","journal-title":"IEEE Trans Circuits Syst II"},{"key":"4133_CR10","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1016\/j.camwa.2007.04.028","volume":"55","author":"A. Hariri","year":"2008","unstructured":"Hariri A, Navi K, Rastegar R. A new high dynamic range moduli set with efficient reverse converter. Comput Math Appl, 2008, 55: 660\u2013668","journal-title":"Comput Math Appl"},{"key":"4133_CR11","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1109\/TCSI.2007.890623","volume":"54","author":"B. Cao","year":"2007","unstructured":"Cao B, Chang C H, Srikanthan. A residue-to-binary converter for a new five-moduli set. IEEE Trans Circuits Syst I, 2007, 54: 1041\u20131049","journal-title":"IEEE Trans Circuits Syst I"},{"key":"4133_CR12","doi-asserted-by":"crossref","first-page":"1576","DOI":"10.1109\/82.899659","volume":"47","author":"W. Wang","year":"2000","unstructured":"Wang W, Swamy M, Ahmad M. A high-speed residue-to-binary converter for three-moduli (2k, 2k \u2212 1, 2 k\u22121 \u2212 1) RNS and a scheme for its VLSI implementation. IEEE Trans Circuits Syst II, 2000, 47: 1576\u20131581","journal-title":"IEEE Trans Circuits Syst II"},{"key":"4133_CR13","doi-asserted-by":"crossref","first-page":"1581","DOI":"10.1016\/S0898-1221(02)00280-8","volume":"44","author":"E. Al-Radadi","year":"2002","unstructured":"Al-Radadi E, Siy P. Four-moduli set (2, 2n \u2212 1, 2n + 2 n \u2212 1 \u2212 1, 2 n+1 + 2n \u2212 1) simplifies the residue to binary converters based on CRT II. Comput Math Appl, 2002, 44: 1581\u20131587","journal-title":"Comput Math Appl"},{"key":"4133_CR14","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1109\/TCSI.2007.895515","volume":"54","author":"P. V. A. Mohan","year":"2007","unstructured":"Mohan P V A, Premkumar A B. RNS-to-binary converters for two four-moduli sets 2n \u2212 1, 2n, 2n + 1, 2 n+1 \u2212 1 and 2n \u2212 1, 2n, 2n + 1, 2 n+1 + 1. IEEE Trans Circuits Syst I, 2007, 54: 1245\u20131254","journal-title":"IEEE Trans Circuits Syst I"},{"key":"4133_CR15","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1109\/12.156545","volume":"41","author":"M. Lu","year":"1992","unstructured":"Lu M, Chiang J. A novel division algorithm for the residue number system. IEEE Trans Comput, 1992, 41: 1026\u20131032","journal-title":"IEEE Trans Comput"},{"key":"4133_CR16","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1109\/12.223680","volume":"42","author":"G. Dimauro","year":"1993","unstructured":"Dimauro G, Impdedovo S, Pirlo G. A new technique for fast number comparison in the residue number systems. IEEE Trans Comput, 1993, 42: 608\u2013612","journal-title":"IEEE Trans Comput"},{"key":"4133_CR17","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1109\/TC.2003.1197124","volume":"52","author":"R. Conway","year":"2003","unstructured":"Conway R, Nelson J. New CRT-based RNS converter using restricted moduli set. IEEE Trans Comput, 2003, 52: 572\u2013578","journal-title":"IEEE Trans Comput"},{"key":"4133_CR18","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1109\/31.55037","volume":"37","author":"S. Meehan","year":"1990","unstructured":"Meehan S, O\u2019neil S, Vaccaro J. An universal input and output RNS converter. IEEE Trans Circuits Syst, 1990, 37: 799\u2013803","journal-title":"IEEE Trans Circuits Syst"},{"key":"4133_CR19","volume-title":"The Foundation of Number Theory","author":"M. J. Deng","year":"2000","unstructured":"Deng M J, Tan Y H, Sun Y Q. The Foundation of Number Theory. Harbin: Harbin Publishing House, 2000"},{"key":"4133_CR20","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1006\/jsco.1993.1030","volume":"15","author":"C. N. Zhang","year":"1993","unstructured":"Zhang C N, Shirazi B, Yun D. An efficient algorithm and parallel implementations for binary and residue number systems. J Symb Comput, 1993, 15: 451\u2013462","journal-title":"J Symb Comput"},{"key":"4133_CR21","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1109\/82.136572","volume":"39","author":"K. Elleithy","year":"1992","unstructured":"Elleithy K, Bayoumi M. Fast and flexible architectures for RNS arithmetic decoding. IEEE Trans Circuits Syst, 1992, 39: 226\u2013235","journal-title":"IEEE Trans Circuits Syst"},{"key":"4133_CR22","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1109\/31.101324","volume":"38","author":"J. Kim","year":"1991","unstructured":"Kim J, Park K, Lee H. Efficient residue-to-binary conversion technique with rounding error compensation. IEEE Trans Circuits Syst, 1991, 38: 315\u2013317","journal-title":"IEEE Trans Circuits Syst"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-010-4133-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-010-4133-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-010-4133-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T11:36:08Z","timestamp":1559388968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-010-4133-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,23]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["4133"],"URL":"https:\/\/doi.org\/10.1007\/s11432-010-4133-3","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,23]]}}}