Comprehensive Analysis of Input Order Invariant Approximate 4-2 Compressors for Binary Multipliers

Approximate arithmetic circuits sacrifice computing accuracy in exchange for improvements in power, area, and speed. Many approximate binary multipliers that use 4-2 compressors have been proposed but most of the proposals have error performances that depend on the order in which the inputs are connected to the compressors. This complicates the design and prevents a fair comparison among different approximate multipliers. The paper proposes the input order invariant approximate 4-2 compressors, whose behavior remains consistent regardless of the order of input signals. We derive the complete set of such compressors and utilize them to synthesize 8-bit multipliers. Our analysis reveals that only a limited subset of input order invariant approximate 4-2 compressors offers an optimal balance between error and power savings. Furthermore, we demonstrate that this optimal set of 4-2 compressors can be strategically distributed within the columns of the multiplier to further enhance the trade-off between error and power efficiency. The proposed circuits, once implemented in a 14 nm FinFET standard cell technology, favorably compare against the state of the art.