Multidimensional algorithms for VLSI processors

Several algorithms are presented for the l-dimensional cyclic convolution of n points. It is shown how these algorithms can be executed on a VLSI processor called the arithmetic cube, which has regular layout, simple control, and a bounded length and number of interconnects. It is also shown how changing the dimensionality of a transform can be used to efficiently compute an arbitrary problem on an arithmetic cube of given size. Finally, area and time bounds are developed for the arithmetic cube