Mapping tensor products onto VLSI networks with reduced I/O

This paper presents a methodology for designing folded VLSI networks for implementing tensor-product forms. Using tensor-products leads to very efficient expressions for a large number of computations in digital signal processing and matrix arithmetic. The resulting networks can trade-off total time delay with I/O bandwidth and chip area. The main goal is to parametrize the VLSI architecture so that it can be implemented under various packaging constraints including the available number of I/O pins, available chip-area, and certain restrictions on maximum wire length. Our methods result in folded VLSI networks with optimal AT/sup 2/ trade-off for digital filtering and multidimensional transforms, where A is the total area of the VLSI circuit (or chip) and T is its total time delay.<<ETX>>

[1]  S. N. Maheshwari,et al.  Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees , 1983, IEEE Transactions on Computers.

[2]  R. Tolimieri,et al.  Algorithms for Discrete Fourier Transform and Convolution , 1989 .

[3]  Frank Thomson Leighton,et al.  Tight Bounds on the Complexity of Parallel Sorting , 1985, IEEE Trans. Computers.

[4]  Sanjit K. Mitra,et al.  Kronecker Products, Unitary Matrices and Signal Processing Applications , 1989, SIAM Rev..

[5]  Denis Trystram,et al.  Parallel algorithms and architectures , 1995 .

[6]  Franco P. Preparata,et al.  Area-Time Optimal VLSI Networks for Multiplying Matrices , 1980, Inf. Process. Lett..

[7]  Majid Sarrafzadeh,et al.  Optimal VLSI architectures for multidimensional DFT , 1989, ACM Symposium on Parallelism in Algorithms and Architectures.

[8]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .

[9]  Viktor K. Prasanna,et al.  Information Transfer in Distributed Computing with Applications to VLSI , 1984, JACM.

[10]  C. Thomborson,et al.  Area-time complexity for VLSI , 1979, STOC.

[11]  Hussein M. Alnuweiri.  Routing BPC permutations in VLSI , 1992, Proceedings Sixth International Parallel Processing Symposium.

[12]  Hussein M. Alnuweiri.  Optimal VLSI Networks for Multidimensional Transforms , 1994, IEEE Trans. Parallel Distributed Syst..

[13]  Hussein M. Alnuweiri.  A New Class of Optimal Bounded-Degree VLSI Sorting Networks , 1993, IEEE Trans. Computers.

[14]  Michael Conner,et al.  Recursive fast algorithm and the role of the tensor product , 1992, IEEE Trans. Signal Process..

[15]  C. Loan.  Computational Frameworks for the Fast Fourier Transform , 1992 .