Novel RNS structures for the moduli set (2 n −1, 2 n , 2 n +1)
暂无分享,去创建一个
[1] J. McClellan,et al. Hardware realization of a Fermat number transform , 1976 .
[2] Paul M. Chau,et al. Vlsi Signal Processing II , 1986 .
[3] A. Dhurkadas. Comments on "An efficient residue to binary converter design" by K.M. Ibrahim and S.N. Saloum , 1990 .
[4] S. Kung,et al. VLSI Array processors , 1985, IEEE ASSP Magazine.
[5] Michael A. Soderstrand,et al. Residue number system arithmetic: modern applications in digital signal processing , 1986 .
[6] Guoan Bi,et al. Fast conversion between binary and residue numbers , 1988 .
[7] S. Andraos,et al. A new efficient memoryless residue to binary converter , 1988 .
[8] A. Hiasat,et al. New memoryless, mod (2n±1) residue multiplier , 1992 .
[9] Earl E. Swartzlander,et al. Optimizing Arithmetic Elements For Signal Processing , 1992, Workshop on VLSI Signal Processing.
[10] Richard I. Tanaka,et al. Residue arithmetic and its applications to computer technology , 1967 .
[11] Salam N. Saloum,et al. An efficient residue to binary converter design , 1988 .
[12] Earl E. Swartzlander,et al. Optimizing adders for WSI , 1992, [1992] Proceedings International Conference on Wafer Scale Integration.
[13] Fred J. Taylor,et al. A VLSI Residue Arithmetic Multiplier , 1982, IEEE Transactions on Computers.