Design and Analysis of a Power and Delay Optimized Radix -4 Approximate Subtractor

Subtraction is a fundamental arithmetic operation used in arithmetic logic units (ALUs), digital signal processing, image processing, and machine learning applications. Conventional subtractor architectures provide exact computation but often incur high hardware complexity, power consumption, and propagation delay due to extensive borrow propagation. Although approximate computing has emerged as an effective approach for improving hardware efficiency in error-tolerant applications, most existing approximate subtractor designs are based on conventional Radix-2 architectures, offering limited reduction in the borrow critical path. To address this limitation, this work proposes accurate and approximate Radix-4 subtractor architectures that simplify the borrow-generation logic while preserving acceptable computational accuracy. The proposed approximation reduces logic depth, gate count, power consumption, and propagation delay by selectively modifying the borrow path. The architectures are implemented using Verilog HDL and implemented on tool FPGA synthesis analysis.Experimental results demonstrate that the proposed approximate Radix-4 subtractors achieve lower power consumption and delay than their accurate counterparts while maintaining a low error rate, making them suitable for error-resilient applications such as multimedia processing, image processing, and machine learning

Approximate Computing, Approximate Subtractor, Low Power VLSI, Error-Tolerant Systems, Digital Systems.

1. Ferreira, R., M. Leme, M. Corrêa, L. Agostini, C. Diniz and B. Zatt, "Approximate Subtractor Operator for Low-Power Video Coding Hardware Accelerators," 2019 26th IEEE International Conference on Electronics, Circuits and Systems (ICECS), Genoa, Italy, 2019, pp. 426-429, doi: 10.1109/ICECS46596.2019.8964783. [Google Scholar] [Crossref]

2. Gupta, V., D. Mohapatra, A. Raghunathan, and K. Roy, “Low-power digital signal processing using approximate adders,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 32, no. 1, pp. 124–137, Jan. 2013. [Google Scholar] [Crossref]

3. Han, J. and M. Orshansky, “Approximate computing: An emerging paradigm for energy-efficient design,” in Proceedings of the IEEE European Test Symposium, 2013, pp. 1–6. [Google Scholar] [Crossref]

4. Hashemi, S., R. Bahar, and S. Reda, “DRUM: A dynamic range unbiased multiplier for approximate applications,” in Proceedings of IEEE/ACM International Conference on Computer-Aided Design (ICCAD), 2015, pp. 418–425. [Google Scholar] [Crossref]

5. Jiang, H., C. Liu, J. Han, and F. Lombardi, “Approximate arithmetic circuits: A survey, characterization, and recent applications,” IEEE Access, vol. 5, pp. 20297–20317, 2017. [Google Scholar] [Crossref]

6. Kaushik, N. and B. Srinivasu, "High-Speed and Area-Efficient Serial IMPLY-Based Approximate Subtractor and Comparator for Image Processing and Neural Networks," IEEE Transactions on Nanotechnology, vol. 23, pp. 748-757, 2024, doi: 10.1109/TNANO.2024.3487223. [Google Scholar] [Crossref]

7. Liu, C., J. Han, and F. Lombardi, “A low-power approximate adder with configurable error recovery,” in Proceedings of Design, Automation & Test in Europe (DATE), 2014, pp. 1–4. [Google Scholar] [Crossref]

8. Nithyashree, R. V., et al., “Analysis of various approximate adders,” in Proceedings of IEEE International Conference on Electronics and Communication Systems, 2023, pp. 1–5. [Google Scholar] [Crossref]

9. Palem, K. V., “Energy aware computing through probabilistic switching: A study of limits,” IEEE Transactions on Computers, vol. 54, no. 9, pp. 1123–1137, Sept. 2005. [Google Scholar] [Crossref]

10. Raha, A., H. Jayakumar, and V. Raghunathan, “Input-based dynamic reconfiguration of approximate arithmetic units for video encoding,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 24, no. 3, pp. 846–857, Mar. 2016. [Google Scholar] [Crossref]

11. Rehman, S., M. Shafique, A. Kumar, and J. Henkel, “Design and analysis of approximate ripple carry adders,” in Proceedings of IEEE International Conference on Computer Design (ICCD), 2014, pp. 1–6. [Google Scholar] [Crossref]

12. Rehman, S., W. El-Harouni, M. Shafique, and J. Henkel, “Architectural-space exploration of approximate multipliers,” in Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD), 2016, pp. 1–8. [Google Scholar] [Crossref]

13. Shafique, M., S. Rehman, R. Hafiz, and J. Henkel, “Approximate computing: From circuits to systems,” in Proceedings of the Design Automation Conference (DAC), 2015, pp. 1–6. [Google Scholar] [Crossref]

14. Shafique, M., W. Ahmad, R. Hafiz, and J. Henkel, “Approximate computing: Techniques and applications,” IEEE Design & Test, vol. 33, no. 1, pp. 8–22, Feb. 2016. [Google Scholar] [Crossref]

15. Venkataramani, S., A. Sabne, V. Kozhikkottu, K. Roy, and A. Raghunathan, “SALSA: Systematic logic synthesis of approximate circuits,” in Proceedings of the 49th Design Automation Conference (DAC), 2012, pp. 796–801. [Google Scholar] [Crossref]

16. Verma, A. K., P. Brisk, and P. Ienne, “Variable latency speculative adders for approximate computing,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 27, no. 11, pp. 1874–1885, Nov. 2008. [Google Scholar] [Crossref]

17. Xu, Q., T. Mytkowicz, and N. S. Kim, “Approximate computing: A survey,” IEEE Design & Test, vol. 33, no. 1, pp. 8–22, Feb. 2016. [Google Scholar] [Crossref]