Share Email Print

Proceedings Paper

A Systolic Architecture For High-Speed Two-Dimensional Convolutions In Finite-Field Arithmetic
Author(s): Harold A. Klotz
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

A two-dimensional linear-convolution algorithm is presented which couples the efficiency of the polynomial transform convolution-algorithm with the parallelism of finite-field arithmetic. This algorithm requires fewer arithmetic operations than most two-dimensional convolution algorithms, and possesses a structure which facilitates systolic architectures. Forming the polynomial transform in a finite field allows large numbers to be broken into small residues, each of which may be processed in parallel. A systolic architecture is described which may be used to evaluate two-dimensional convolutions in 0(N) processor cycles. This architecture is comprised of engagement processors, to form the polynomial transform, and pipelined processors, to form the polynomial product.

Paper Details

Date Published: 4 April 1986
PDF: 9 pages
Proc. SPIE 0696, Advanced Algorithms and Architectures for Signal Processing I, (4 April 1986); doi: 10.1117/12.936890
Show Author Affiliations
Harold A. Klotz, McDonnell Douglas Astronautics Co. (United States)
Washington University (United States)

Published in SPIE Proceedings Vol. 0696:
Advanced Algorithms and Architectures for Signal Processing I
Jeffrey M. Speiser, Editor(s)

© SPIE. Terms of Use
Back to Top