TY - GEN
T1 - A Novel 4-Bit CMOS Based Full Adder for Low-Power IoT and Edge Computing Applications
AU - Vishwakarma, Vikash
AU - Mittal, Amit
AU - Gupta, Brij Bhooshan
AU - Chui, Kwok Tai
AU - Vishvakarma, Santosh Kumar
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025
Y1 - 2025
N2 - This work introduces a new 4-bit CMOS adder design that uses only 31 transistors, a significant reduction from 75 transistors needed for traditional static CMOS implementations. Through careful transistor sizing and circuit-level improvements, the suggested adder greatly reduces silicon area and power consumption while preserving competitive speed and signal integrity by utilizing an optimized pass-transistor logic topology. We also show that this little 4-bit adder can be expanded to build effective compressor circuits, which are essential for cutting down on adder tree stages in multi-operand addition processes. Particularly well-suited for incorporation into Compute-in-Memory (CIM) frameworks, the suggested compressor architecture allows for in-situ arithmetic processing, which significantly minimizes data travel and boosts computational throughput. This work's average power consumption of 138.2 μW and propagation delays are 0.666 ns for the sum output (S), 0.0302 ns for carry-out C1, and 0.03227 ns for carry-out C2. This design pushes the boundaries of arithmetic circuit efficiency in cutting-edge CMOS technologies and provides a convincing solution for next-generation low-power, area-constrained system-on-chip (SoC) scenarios.
AB - This work introduces a new 4-bit CMOS adder design that uses only 31 transistors, a significant reduction from 75 transistors needed for traditional static CMOS implementations. Through careful transistor sizing and circuit-level improvements, the suggested adder greatly reduces silicon area and power consumption while preserving competitive speed and signal integrity by utilizing an optimized pass-transistor logic topology. We also show that this little 4-bit adder can be expanded to build effective compressor circuits, which are essential for cutting down on adder tree stages in multi-operand addition processes. Particularly well-suited for incorporation into Compute-in-Memory (CIM) frameworks, the suggested compressor architecture allows for in-situ arithmetic processing, which significantly minimizes data travel and boosts computational throughput. This work's average power consumption of 138.2 μW and propagation delays are 0.666 ns for the sum output (S), 0.0302 ns for carry-out C1, and 0.03227 ns for carry-out C2. This design pushes the boundaries of arithmetic circuit efficiency in cutting-edge CMOS technologies and provides a convincing solution for next-generation low-power, area-constrained system-on-chip (SoC) scenarios.
KW - Adder Tree
KW - Compressor
KW - Edge AI
KW - Full Adder
UR - https://www.scopus.com/pages/publications/105033147775
U2 - 10.1109/ISOCC66390.2025.11329980
DO - 10.1109/ISOCC66390.2025.11329980
M3 - Conference contribution
AN - SCOPUS:105033147775
T3 - International SoC Design Conference 2025, ISOCC 2025 - Proceedings of Technical Papers
BT - International SoC Design Conference 2025, ISOCC 2025 - Proceedings of Technical Papers
T2 - 22nd International SoC Design Conference, ISOCC 2025
Y2 - 15 October 2025 through 18 October 2025
ER -