Completely-pipelined architectures for digital signal processing

A class of completely-pipelined VLSI architectures is defined. Two topologies are then described: leaf-connected trees and mesh-connected trees. The leaf-connected tree structure is used to construct a completely-pipelined bit-serial multiplier and a completely-pipelined word-serial, bit-serial convolver. The mesh-connected tree structure is used to implement completely-pipelined bit-parallel multiplication and completely-pipelined word-parallel bit-parallel convolution. Layouts are described that are within log factors of asymptotic optimality. It is shown that, asymptotically, the area required for power distribution actually dominates the rest of the area for a wide class of structures. This illustrates the importance of studying the constants of proportionality in evaluating area, time, and energy requirements, and suggests that the choice of topologies may very well depend on the fabrication technology. The importance of parameterized and high-level design is stressed throughout. Also stressed is the idea of applying sound architectural technique at all levels of information organization, including, in particular, the bit level.

[1]  F. Leighton New lower bound techniques for VLSI , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[2]  Andrea S. LaPaugh,et al.  A polynomial time algorithm for optimal routing around a rectangle , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[3]  Jean Vuillemin,et al.  A combinatorial limit to the computing power of V.L.S.I. circuits , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[4]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[5]  Peter R. Cappello,et al.  Optimal choice of intermediate latching to maximize throughput in VLSI circuits , 1983, ICASSP.

[6]  Richard J. Lipton,et al.  Programming aspects of VLSI: (preliminary version) , 1982, POPL '82.

[7]  Sun-Yuan Kung,et al.  Highly parallel architectures for solving linear equations , 1981, ICASSP.

[8]  John V. McCanny,et al.  BIT-LEVEL SYSTOLIC ARRAYS. , 1984 .

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

[10]  Peter R. Cappello,et al.  A VLSI layout for a pipelined Dadda multiplier , 1983, TOCS.

[11]  Peter R. Cappello,et al.  Some intractable problems in digital signal processing , 1981, ICASSP.

[12]  Jean Vuillemin,et al.  A Combinatorial Limit to the Computing Power of VLSI Circuits , 1983, IEEE Transactions on Computers.

[13]  H. T. Kung VLSI Systems and Computations , 1982 .

[14]  Charles E. Leiserson,et al.  Area-Efficient Graph Layouts (for VLSI) , 1980, FOCS.

[15]  Richard J. Lipton,et al.  Programming Aspects of VLSI. , 1982 .

[16]  C. Rader Discrete Fourier transforms when the number of data samples is prime , 1968 .