Paper
23 March 1995 Parallel decomposition algorithm using decimation operation for two-dimensional discrete convolution operation
Shinping Robert Wang, Pepe Siy
Author Affiliations +
Proceedings Volume 2421, Image and Video Processing III; (1995) https://doi.org/10.1117/12.205483
Event: IS&T/SPIE's Symposium on Electronic Imaging: Science and Technology, 1995, San Jose, CA, United States
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.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Shinping Robert Wang and Pepe Siy "Parallel decomposition algorithm using decimation operation for two-dimensional discrete convolution operation", Proc. SPIE 2421, Image and Video Processing III, (23 March 1995); https://doi.org/10.1117/12.205483
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Convolution

Matrices

Algorithm development

Reconstruction algorithms

Very large scale integration

Radon

Signal processing

RELATED CONTENT

Learning sparsifying filter banks
Proceedings of SPIE (August 24 2015)
Fast RNS algorithm for computational geometry problems
Proceedings of SPIE (November 20 2001)
Some improvements on RNS Montgomery modular multiplication
Proceedings of SPIE (November 13 2000)
Alternative To The SVD: Rank Revealing QR-Factorizations
Proceedings of SPIE (April 04 1986)

Back to Top