Wang, Y.Song, X.Aboulhamid, M.Shen, H.2007-08-292007-08-292002IEEE Transactions on Signal Processing, 2002; 50(7):1772-17791053-587Xhttp://hdl.handle.net/2440/37551Copyright © 2002 IEEEBased 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 convertersenJournal article002007129610.1109/TSP.2002.10112160001766349000242-s2.0-003664803648490Shen, H. [0000-0002-3663-6591] [0000-0003-0649-0648]