@inbook {IOPORT.05195360,
    author       = {Kim, Wu Woan and Jang, Sang-Dong},
    title        = {Multiplier with parallel CSA using CRT's specific moduli $(2^{k }-1, 2^{k } , 2^{k }+1)$.},
    year         = {2004},
    booktitle    = {Computational science and its applications --- ICCSA 2004. International conference, Assisi, Italy, May 14--17, 2004. Proceedings, Part II.},
    isbn         = {3-540-22056-9},
    pages        = {216-225},
    publisher    = {Berlin: Springer},
    doi          = {10.1007/b98051},
    abstract     = {Summary: Recently, RNS has received increased attention due to its ability to support high-speed concurrent arithmetic. Applications such as fast Fourier transform, digital filtering, and image processing utilize the efficiencies of RNS arithmetics in addition and multiplication; they do not require the difficult RNS operations such as division and magnitude comparison of digital signal processor. RNS have computational advantages since operation on residue digits are performed independently and so these processes can be performed in parallel. There are basically two methods that are used for residue to binary conversion. The first approach uses the mixed radix conversion algorithm, and the second approach is based on the Chinese remainder theorem. In this paper, the new design of CRT conversion is presented. This is a derived method using an overlapped multiple-bit scanning method in the process of CRT conversion. This is achieved by a general moduli form $(2^{k }-1, 2^{k } , 2^{k }+1)$. Then, it simulates the implementation using an overlapped multiple-bit scanning method in the process of CRT conversion, In conclusion, the simulation shows that the CRT method which is adopted in this research, performs arithmetic operations faster that the traditional approaches, due to advantages of parallel processing and carry-free arithmetic operation.},
    identifier   = {05195360},
}