The Area-Time Complexity of Binary Multiplication
Journal of the ACM (JACM)
Introduction to VLSI Systems
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Computer
Universality considerations in VLSI circuits
IEEE Transactions on Computers
| Hi-index | 0.00 |
The advent of VLSI technology has deeply modified the design of digital systems. The structure of special algorithms is now close to the structure of communication and computing resources on the silicon chip. Modular and regular structures allow parallel VLSI algorithms with good figures of complexity in terms of speed and size. In this paper systolic arrays of processors are used to define two new faster VLSI algorithms for solving the problem of multiplying two band matrices. The proposed algorithms are based on different area-time trade-off: they exhibit w"A . w"B processors, n steps and n^2 processors, minw"a, w"b steps respectively, compared with w"A . w"B processors, 3n steps of the previously known VLSI algorithm.