Optimal Partitioning and Redundancy Removal in Computing Partial Sums

Authors:
A. T. Fam
Affiliations:
-
Venue:
IEEE Transactions on Computers
Year:
1987

Citing 3
Cited 1

An algorithm for parallel computation of partial sums

CSC '84 Proceedings of the ACM 12th annual computer science conference on SIGCSE symposium
Computational Aspects of VLSI

Computational Aspects of VLSI
Why Systolic Architectures?

Computer

An area-efficient VLSI implementation for programmable FIR filters based on a parameterized divide and conquer approach

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	14.99

Visualization

Abstract

Two novel algorithms for simultaneous computation of a large number of partial sums are introduced, their performance assessed, and architectures for their implementation suggested. The direct computation of D operations are replaced by O(D/log D). The new approach is based on a new concept of optimal partitioning and redundancy removal in arithmetic intensive, high throughput computing that is expected to be the basis of a new class of algorithms which represent a, departure from brute force parallel computation where inherent redundancy is not detected or removed.