Implementing algorithms for convolution on arrays of adders

Robert Michael Owens, Mary Jane Irwin

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations


The authors consider the problem of developing VLSI signal processors for computing convolutions. Convolutions can be efficiently computed by VLSI processors that consist of arrays of adders when they are stated in terms of matrices with elements consisting of only 1, 0, or -1. Unfortunately, when stated in matrix form the published algorithms have matrices with elements other than 1, 0, or -1. The authors explore why this occurs and show how it can be prevented when an algorithm is developed. If this fails, they propose a technique for addressing this problem that consists of replacing each such matrix by the product of two or more matrices whose elements are 1, 0, or -1.

Original languageEnglish (US)
Pages (from-to)1127-1130
Number of pages4
JournalICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
StatePublished - 1989
Event1989 International Conference on Acoustics, Speech, and Signal Processing - Glasgow, Scotland
Duration: May 23 1989May 26 1989

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering


Dive into the research topics of 'Implementing algorithms for convolution on arrays of adders'. Together they form a unique fingerprint.

Cite this