<title>Parallel algorithms for binary polynomial transforms and their realization with a unified series of processors</title>
Lists
Only you see this
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.
BibTeX
@inproceedings{astola1995lt,
author = {Jaakko Astola and Sos С. Agaian and D. Gevorkian and Karen Egiazarian},
title = {{\<title\>Parallel algorithms for binary polynomial transforms and their realization with a unified series of processors\</title\>}},
booktitle = {Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE},
year = {1995},
doi = {10.1117/12.205485},
}Loading related content...