A new approach to constructing optimal parallel prefix circuits with small depth

Publisher： Elsevier

ISSN： 0743-7315

Source： Journal of Parallel and Distributed Computing, Vol.64, Iss.1, 2004-01, pp. : 97-107

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

A fast algorithm for constructing nearly optimal prefix codes

SOFTWARE:PRACTICE AND EXPERIENCE, Vol. 46, Iss. 10, 2016-10 ,pp. : 1299-1316

John Wiley & Sons Inc

Access to resources Recommend Favorite

Optimal and Efficient Algorithms for Summing and Prefix Summing on Parallel Machines

By Santos E.E.

Journal of Parallel and Distributed Computing, Vol. 62, Iss. 4, 2002-04 ,pp. : 517-543

Academic Press

Access to resources Recommend Favorite

A Parallel Approach Eliminates Measurement Perturbations in RLC Circuits

By Akl Selim Yao Weiguang

The Journal of Supercomputing, Vol. 35, Iss. 2, 2006-02 ,pp. : 155-164

Springer Publishing Company

Access to resources Recommend Favorite

Fast parallel string prefix-matching

By Breslauer D.

Theoretical Computer Science, Vol. 137, Iss. 2, 1995-01 ,pp. : 269-278

Elsevier

Access to resources Recommend Favorite

New Models of Prefix Adder Topologies

By Burgess Neil

Journal of VLSI Signal Processing, Vol. 40, Iss. 1, 2005-05 ,pp. : 125-141

Springer Publishing Company

Access to resources Recommend Favorite