Sanjeev Ramkumar
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Sanjeev Ramkumar has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Anuraj V.
National Institute of Technology Delhi
2 shared publications - Dhandapani Vaithiyanathan
National Institute of Technology Delhi, Delhi 110036, India
2 shared publications
Latest Publications
- 1 September 2026
- Published by Wiley in International Journal of Numerical Modelling: Electronic Networks, Devices and Fields
- Vol. 39 (5)
Application‐Specific Vedic Multiplier Architectures for Area and Power Efficient VLSI Implementation
Multiplication and squaring are fundamental operations in digital signal processing (DSP), image processing, and embedded computing, where hardware efficiency directly affects speed, area, and energy consumption. Conventional multipliers often introduce unnecessary complexity when operands follow specific patterns. This paper presents a systematic study of selected Vedic mathematics sutras, namely Urdhva‐Tiryakbhyam, Ekanyunena Purvena, Ekadhikena Purvena, Sopaantyadvayamantyam, Yaavadunam, and Nikhilam Navatashcaramam Dashatah, focusing on their suitability for practical computational patterns. The study examines multiplication by constants, operands near base values, and range constrained squaring relevant to DSP applications such as signal energy computation, RMS estimation, filtering, image processing, and neural networks. Corresponding general‐purpose, operand‐pattern‐optimized, fixed‐coefficient, and range‐constrained architectures are implemented and evaluated. FPGA implementations require 6‐117 LUTs with 5.144–11.012 ns delay, while ASIC implementations achieve 1408.491–19 043.73 μm 2 area and 0.565877 × 10 5 to 9.65297 × 10 5 W power. The results show that no single sutra is universally optimal; hardware efficiency depends on operand characteristics and application requirements. The proposed framework therefore enables systematic selection of Vedic multiplication architectures based on computational patterns and hardware constraints.
- 1 September 2026
- Published by Wiley in International Journal of Numerical Modelling: Electronic Networks, Devices and Fields
- Vol. 39 (5)
Application‐Specific Vedic Multiplier Architectures for Area and Power Efficient VLSI Implementation
Multiplication and squaring are fundamental operations in digital signal processing (DSP), image processing, and embedded computing, where hardware efficiency directly affects speed, area, and energy consumption. Conventional multipliers often introduce unnecessary complexity when operands follow specific patterns. This paper presents a systematic study of selected Vedic mathematics sutras, namely Urdhva‐Tiryakbhyam, Ekanyunena Purvena, Ekadhikena Purvena, Sopaantyadvayamantyam, Yaavadunam, and Nikhilam Navatashcaramam Dashatah, focusing on their suitability for practical computational patterns. The study examines multiplication by constants, operands near base values, and range constrained squaring relevant to DSP applications such as signal energy computation, RMS estimation, filtering, image processing, and neural networks. Corresponding general‐purpose, operand‐pattern‐optimized, fixed‐coefficient, and range‐constrained architectures are implemented and evaluated. FPGA implementations require 6‐117 LUTs with 5.144–11.012 ns delay, while ASIC implementations achieve 1408.491–19 043.73 μm 2 area and 0.565877 × 10 5 to 9.65297 × 10 5 W power. The results show that no single sutra is universally optimal; hardware efficiency depends on operand characteristics and application requirements. The proposed framework therefore enables systematic selection of Vedic multiplication architectures based on computational patterns and hardware constraints.
- 1 May 2026
- Published by IOP Publishing in Engineering Research Express
- Vol. 8 (10) , 105303
Gate-level error modeling of approximate 4:2 compressors for fault-resilient computing
This paper presents a systematic framework for the design of approximate multipliers (AMs) that explicitly explores the trade-off between computational accuracy and hardware efficiency at the standard cell level. The proposed methodology employs a symbolic regression model, Python symbolic regression, to estimate error characteristics arising from logic approximation, enabling informed selection of cell configurations during multiplier construction. The predictive model achieves an MAE of 2.33%, an root mean squared error of 5.07%, and explains 74% of the observed variance ( R 2 = 0.74). Leveraging this model, a family of ACOMP is developed, maintaining an identical circuit topology across configurations while offering improved error resilience and reduced hardware cost. The proposed designs are validated through FPGA prototyping and ASIC-level synthesis, and evaluated in terms of area, delay, area delay product, and power delay product. In this article, symbolic regression is inherently integrated into the design methodology to uncover an explicit and interpretable relationship between gate-level design parameters and error behavior, thereby establishing a principled foundation for data-driven approximate circuit design. By enabling early-stage error estimation, the proposed prediction equation enhances state-of-the-art methodologies for approximate logic design in error-tolerant systems. To the best of our knowledge, this is the first study to establish a direct, predictive relationship between error behavior and gate count, providing a practical guideline for the efficient design of AMs in error-tolerant computing systems.
- 1 May 2026
- Published by IOP Publishing in Engineering Research Express
- Vol. 8 (10) , 105303
Gate-level error modeling of approximate 4:2 compressors for fault-resilient computing
This paper presents a systematic framework for the design of approximate multipliers (AMs) that explicitly explores the trade-off between computational accuracy and hardware efficiency at the standard cell level. The proposed methodology employs a symbolic regression model, Python symbolic regression, to estimate error characteristics arising from logic approximation, enabling informed selection of cell configurations during multiplier construction. The predictive model achieves an MAE of 2.33%, an root mean squared error of 5.07%, and explains 74% of the observed variance ( R 2 = 0.74). Leveraging this model, a family of ACOMP is developed, maintaining an identical circuit topology across configurations while offering improved error resilience and reduced hardware cost. The proposed designs are validated through FPGA prototyping and ASIC-level synthesis, and evaluated in terms of area, delay, area delay product, and power delay product. In this article, symbolic regression is inherently integrated into the design methodology to uncover an explicit and interpretable relationship between gate-level design parameters and error behavior, thereby establishing a principled foundation for data-driven approximate circuit design. By enabling early-stage error estimation, the proposed prediction equation enhances state-of-the-art methodologies for approximate logic design in error-tolerant systems. To the best of our knowledge, this is the first study to establish a direct, predictive relationship between error behavior and gate count, providing a practical guideline for the efficient design of AMs in error-tolerant computing systems.