On unlimited parallelism of DSP arithmetic computations

Authors:
Miodrag Potkonjak;Jan Rabaey
Affiliations:
C&C Research Laboratories, NEC USA, Princeton, NJ;Dept. of EECS, University of California, Berkeley, CA
Venue:
ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: plenary, special, audio, underwater acoustics, VLSI, neural networks - Volume I
Year:
1993

Citing 9
Cited 0

Dynamic parallel complexity of computational circuits

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Efficient parallel evaluation of straight-line code and arithmetic circuits

SIAM Journal on Computing
Theoretical aspects of parallel computation

VLSI and parallel computation
Maximally fast and arbitrarily fast implementation of linear computations

ICCAD '92 1992 IEEE/ACM international conference proceedings on Computer-aided design
A Fast Direct Solution of Poisson's Equation Using Fourier Analysis

Journal of the ACM (JACM)
An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations

Journal of the ACM (JACM)
The Parallel Evaluation of General Arithmetic Expressions

Journal of the ACM (JACM)
Restructuring of Arithmetic Expressions For Parallel Evaluation

Journal of the ACM (JACM)
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a conceptually simple and practical technique which identifies necessary and sufficient conditions for achieving unlimited improvement in the throughput of a general DSP arithmetic computation (DAC). For the cases when necessary conditions are fulfilled, this technique is a basis for an approach which transforms an arbitrary DAC so that unlimited parallelism is realized. An important special case, linear computations, is addressed using a specially tuned version of the general algorithm so that the introduced latency and hardware overhead are minimized. The effectiveness of the new approach is demonstrated on several real life examples.