 
Summary: On the Construction of ZeroDeficiency
Parallel Prefix Circuits with Minimum Depth
HAIKUN ZHU, CHUNGKUAN CHENG, and RONALD GRAHAM
University of California, San Diego
A parallel prefix circuit has n inputs x1, x2, . . . , xn, and computes the n outputs yi = xi · xi1 · · · · ·
x1, 1 i n, in parallel, where · is an arbitrary binary associative operator. Snir proved that the
depth t and size s of any parallel prefix circuit satisfy the inequality t +s 2n2. Hence, a parallel
prefix circuit is said to be of zerodeficiency if equality holds. In this article, we provide a different
proof for Snir's theorem by capturing the structural information of zerodeficiency prefix circuits.
Following our proof, we propose a new kind of zerodeficiency prefix circuit Z(d) by constructing
a prefix circuit as wide as possible for a given depth d. It is proved that the Z(d) circuit has the
minimal depth among all possible zerodeficiency prefix circuits.
Categories and Subject Descriptors: B.6.1 [Logic Design]: Design StylesParallel circuits
General Terms: Algorithms, Design, Theory
Additional Key Words and Phrases: Zerodeficiency, parallel prefix circuits, depthsize tradeoff
1. INTRODUCTION
1.1 Problem Definition
The prefix problem, which mostly gains research attention with the emergence
of parallel computing, is actually the abstraction of many practical applications
such as binary addition, radix sort, linear recurrences solving, polynomial eval
