论文信息 - A VLSI Algorithm for Direct and Reverse Conversion from Weighted Binary Number System to Residue Number System

A VLSI Algorithm for Direct and Reverse Conversion from Weighted Binary Number System to Residue Number System

Residue Number Systems (RNS) are proved to be useful in many applications, as for example in signal processing. In this paper, a VLSI computing architecture is proposed for converting an integer number N from the weighted binary representation into and out a residue code based on s moduli. For this architecture a possible layout is given and its complexity is evaluated in terms of area and time. Under several hypotheses on RNS parameters, constructive upper bounds ranging from 0( n* log a) to 0( n2 loglog a) and from O(log' n) to O(log n) for area and time, respectively, have been obtained for the direct conversion. On the contrary, constructive upper bounds A = 0( n2 log n) and T = O(log* n) have been found indepen- dent of the formed hypotheses, for the reverse conversion.

Masao Iri | M. Iri

[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] Lynn Conway,et al. Introduction to VLSI systems , 1978 .

[4] A. Baraniecka,et al. On decoding techniques for residue number system realizations of digital signal processing hardware , 1978 .

[5] W. Kenneth Jenkins,et al. Techniques for residue-to-analog conversion for residue-encoded digital filters , 1978 .

[6] C. Thomborson,et al. A Complexity Theory for VLSI , 1980 .

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

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

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