### Abstract

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.

Original language | English (US) |
---|---|

Pages (from-to) | 749-752 |

Number of pages | 4 |

Journal | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |

State | Published - Jan 1 1988 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Software
- Signal Processing
- Electrical and Electronic Engineering

### Cite this

*ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings*, 749-752.

}

*ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings*, pp. 749-752.

**MULTIDIMENSIONAL ALGORITHMS FOR VLSI PROCESSORS.** / Owens, Robert Michael; Irwin, Mary Jane.

Research output: Contribution to journal › Conference article

TY - JOUR

T1 - MULTIDIMENSIONAL ALGORITHMS FOR VLSI PROCESSORS.

AU - Owens, Robert Michael

AU - Irwin, Mary Jane

PY - 1988/1/1

Y1 - 1988/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0023671988&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023671988&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0023671988

SP - 749

EP - 752

JO - Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing

JF - Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing

SN - 0736-7791

ER -