A Class of an Almost-Optimal Size-Independent Parallel Prefix Circuits

@article{ElBoghdadi2012ACO,
  title={A Class of an Almost-Optimal Size-Independent Parallel Prefix Circuits},
  author={Hatem M. El-Boghdadi},
  journal={2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum},
  year={2012},
  pages={1820-1826}
}
Prefix computation is one of the fundamental problems that can be used in many applications such as fast adders. Most proposed parallel prefix circuits assume that the circuit is of the same width as the input size. In this paper, we present a class of parallel prefix circuits that perform well when the input size, n, is more than the width of the circuit, m. That is, the proposed circuit is an almost optimal in speed when n >; m. Specifically, we derive a lower bound for the depth of the… CONTINUE READING

Figures, Tables, and Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

Fast problem-size-independent parallel prefix circuits

  • J. Parallel Distrib. Comput.
  • 2009
VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

Optimal Parallel Prefix Circuits with Fan-Ot 2 and Corresponding Parallel Algorithms

  • Neural Parallel & Scientific Comp.
  • 1999
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

I

M. Sheeran
  • Parberry, A new approach to the design of optimal parallel prefix circuits,Technical Report 2006:1, Department of Computer Science and Engineering, Chalmers University of Technology, Goteborg, Sweden
  • 2006
VIEW 1 EXCERPT