A novel generic modulo‐2 graph with full set taxonomical conversion to parallel prefix adders

Abstract

AbstractThis paper proposes a novel generic modulo‐2 graph that can be converted to parallel prefix adders (PPA). Also, a conversion algorithm for converting the proposed graph to PPAs is proposed in this paper. The conversation algorithm can be applied on N‐bit Generic modulo‐2 graph, and this graph is converted to N‐bit PPAs. When the proposed conversion algorithm is applied to generic modulo‐2 graph, this graph is converted to Brent‐Kung, Sklansky, Kogge‐Stone, Harris, Ladner‐Fischer, Han‐Carlson, and Knowles adders. Moreover, PPAs are shown in trilinear coordinates to represent the final PPAs, which generic graph converted to them. Furthermore, the add operation is done by generic graph and also the correctness of add function of this graph is investigated by “Boolean decision diagram.”