Tree-based VLSI architecture with applications to signal processing
S.K. Basu, Jai Gupta, Ravish Gupta · 1991
A VLSI architecture called ring connected trees is presented. Multiprocessing with pipelining is utilized to achieve lower computation time. Parallel algorithms for a number of computational problems from the signal processing domain are given for execution on the proposed machine. The layout of the structure for VLSI implementation is considered. It has an area complexity of O(N log N) for O(N) processing elements under the grid model of C.D. Thompson (1984). This structure requires less area compared to that of the mesh-of-tree by a logarithmic factor. By using this structure for digital signal processing computations, it is found that most of these signal processing computations could be run in linear time. >