On the Lower Bound to the VLSI Complexity of Number Conversion from Weighted to Residue Representation

IEEE Transactions on Computers

Volumn 42, Issue 8, 1993, Pages 962-967

  Alia, Giuseppe ^a   Martinelli, Enrico ^b  

^a UNIVERSITY OF PISA   (Italy)

^b ISTI CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CMOS INTEGRATED CIRCUITS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; EQUIVALENCE CLASSES; NUMBER THEORY; OPTIMAL SYSTEMS; TABLE LOOKUP; VLSI CIRCUITS;

AREA TIME COMPLEXITY; NUMBER CONVERSION; POSITIONAL TO RESIDUE CONVERSION; RESIDUE NUMBER SYSTEMS; VLSI COMPLEXITY; WEIGHTED TO RESIDUE REPRESENTATION;

PIPELINE PROCESSING SYSTEMS;

EID: 0027646103     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.238486     Document Type: Article

References (11)

1. R. M. Capocelli and R. Giancarlo, “Efficient VLSI networks for converting an integer from binary to residue numbers and vice versa,” IEEE Trans. Circuits Syst., vol. CAS-35, no. 11, pp. 1425–1430, 1988.
2. G. Alia and E. Martinelli, “A VLSI structure for x(modm) operation,” J. VLSI Signal Processing, vol. 1, pp. 257–264, 1990.
3. G. Alia and E. Martinelli, “VLSI binary-residue converters for pipelined processing,” Comput. J., vol. 33, no. 5, pp. 473-475, 1990.
4. C. D. Thompson, “A complexity theory for VLSI,” Ph.D. dissertation, Dept. of Comput. Science, Carnegie-Mellon University, Rept. CMU-CS-80-140, 1980.
5. N. S. Szabo and R. J. Tanaka, Residue Arithmetic and its Applications to Computer Technology. New York: McGraw-Hill, 1967.
6. G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 4th ed. London: Oxford, 1975.
7. G. Bilardi and F. P. Preparata, “Area-time lower-bound techniques with applications to sorting,” Algorithmica, vol. 1, 1986.
8. K. Mehlhom, “AT 2-optimal VLSI integer division and integer square rooting,” Integration, vol. 2, pp. 163–167, 1984.
9. K. Mehlhorn and F. P. Preparata, “Area-time optimal VLSI integer multiplier with minimum computation time,” Inform. Contr., vol. 58, pp. 137–156, 1983.
10. G. Alia and E. Martinelli, “A VLSI modulo m multiplier,” IEEE Trans. Comput., vol. C-40, no. 7, pp. 873–878, 1991.
11. R. P. Brent and H. T. Kung, “A regular layout for parallel adders,” IEEE Trans. Comput., vol. C-31, no. 3, pp. 260–264, 1982.