Minimal parallel prefix circuits

The exact complexity of a minimal prefix circuit of width $m$ and depth $\lceil\log_2 m\rceil$ is obtained in the case when $m$ is a power of two. New upper bounds for the complexity of prefix circuits are obtained under various depth restrictions and separately for the circuits of XOR-gates.