论文信息 - Efficient VLSI networks for converting an integer from binary system to residue number system and vice versa

Efficient VLSI networks for converting an integer from binary system to residue number system and vice versa

VLSI networks for converting integers from binary to residue number systems are presented Both direct and reverse conversion are treated. The networks are improvements, with respect to area or time or both, of previously proposed solutions. >

R. Capocelli | R. Giancarlo

[1] M. Soderstrand. A high-speed low-cost recursive digital filter using residue number arithmetic , 1977, Proceedings of the IEEE.

[2] W. Kenneth Jenkins,et al. The use of residue number systems in the design of finite impulse response digital filters , 1977 .

[3] Graham A. Jullien,et al. Residue Number Scaling and Other Operations Using ROM Arrays , 1978, IEEE Transactions on Computers.

[4] H. T. Kung,et al. The chip complexity of binary arithmetic , 1980, STOC '80.

[5] H. Rauch,et al. Implementation of a fast digital processor using the residue number system , 1981 .

[6] H. T. Kung,et al. The Area-Time Complexity of Binary Multiplication , 1981, JACM.

[7] H. T. Kung,et al. A Regular Layout for Parallel Adders , 1982, IEEE Transactions on Computers.

[8] Kurt Mehlhorn,et al. Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time , 1983, Inf. Control..

[9] G. Alia,et al. A VLSI algorithm for direct and reverse conversion from weighted binary number system to residue number system , 1984 .

[10] Giuseppe Alia,et al. A Fast VLSI Conversion Between Binary and Residue Systems , 1984, Inf. Process. Lett..

[11] Kurt Mehlhorn,et al. AT2-optimal VLSI integer division and integer square rooting , 1984, Integr..