Best implementations of quaternary adders

TL;DR

This paper compares various implementations of quaternary adders, demonstrating that simple binary-based approaches are more efficient in power, area, and transistor count than more complex quaternary designs.

Contribution

It provides a comparative analysis showing that simple binary-based quaternary adders outperform more complex implementations in efficiency.

Findings

Simple binary-based quaternary adder outperforms other implementations in power and area.

Interface circuits between quaternary and binary are overhead but manageable.

Quaternary adders generally require more transistors and power than binary adders.

Abstract

The implementation of a quaternary 1-digit adder composed of a 2-bit binary adder, quaternary to binary decoders and binary to quaternary encoders is compared with several recent implementations of quaternary adders. This simple implementation outperforms all other implementations using only one power supply. It is equivalent to the best other implementation using three power supplies. The best quaternary adder using a 2-bit binary adder, the interface circuits between quaternary and binary levels are just overhead compared to the binary adder. This result shows that the quaternary approach for adders use more transistors, more chip area and more power dissipation than the corresponding binary ones.