Share Email Print
cover

Proceedings Paper

Parallel decomposition algorithm using decimation operation for 2D discrete convolution operation
Author(s): Shinping Robert Wang; Pepe Siy
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The proposed decomposition algorithm follows the divide-and-conquer approach. Specifically, operands of discrete convolution operation are decomposed into smaller units, computed separately, and then combined for the final result. The decomposition of the operands is based on integer modular arithmetic from Number Theory. Operands are treated as ordered set, and integer modular arithmetic is used to partition these sets into congruent subsets. It is basically a Decimation by p operation, where p is the common factor of the operands' sizes. Since the proposed decomposition algorithm is an isomorphism, the decomposed convolution operation is equivalent to the original one. Processing speed is increased by implementing these decomposed convolution operations in parallel. The proposed algorithm is similar to the well- known Block convolution except that it is more suitable for parallel implementation. Because the decomposed operations are highly regular and independent, it is also suitable for VLSI implementation.

Paper Details

Date Published: 23 March 1995
PDF: 12 pages
Proc. SPIE 2421, Image and Video Processing III, (23 March 1995); doi: 10.1117/12.205483
Show Author Affiliations
Shinping Robert Wang, Wayne State Univ. (United States)
Pepe Siy, Wayne State Univ. (United States)


Published in SPIE Proceedings Vol. 2421:
Image and Video Processing III
Robert L. Stevenson; Sarah A. Rajala, Editor(s)

© SPIE. Terms of Use
Back to Top