Share Email Print
cover

Proceedings Paper

Parallel algorithms for binary polynomial transforms and their realization with a unified series of processors
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

Efficient algorithms with various level of parallelism are proposed for the recently introduced class of Binary Polynomial Transforms (BPT) including Walsh and conjunctive (Reed-Muller) transforms. A unique generic algorithm is proposed for the class of BPT. For each level of parallelism this algorithm is optimal for most of BPT with regard to speedup factor, including Walsh-Hadamard and conjunctive transforms. A family of processors realizing the proposed algorithms is also suggested. The processors can be implemented using a varying number of processor elements of unified architecture. They are universal, i.e. a class of binary polynomial transforms is effectively realized in the processor. Although the processors are universal, their area-time complexities are comparable with the complexities of known Hadamard processors. Processors from the proposed family can be included as blocks in construction of a signal/image processing system.

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.205485
Show Author Affiliations
Jaakko T. Astola, Tampere Univ. of Technology (Finland)
Sos S. Agaian, Tufts Univ. (United States)
David Zaven Gevorkian, Tampere Univ. of Technology (Finland)
Karen O. Egiazarian, Tampere Univ. of Technology (Finland)


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