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.
|Number of pages
|ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
|Published - Jan 1 1988
All Science Journal Classification (ASJC) codes
- Signal Processing
- Electrical and Electronic Engineering