Anusha Gorantla
Research Subjects
Anusha Gorantla has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Ahilan Appathurai
PSN college of Engineering and Technology
4 shared publications - Dinesh Ramachandran
Excel Engineering College
4 shared publications - Jabez Daniel Vincent David Michael
Dr. Sivanthi Aditanar College of Engineering
3 shared publications - Vamsidhar Anagani
Raghu Engineering College
3 shared publications P. Deepa
2 shared publications- Venkata Sridhar Gummadidala
Dadi Institute of Engineering and Technology
2 shared publications
Latest Publications
- Open Access
- 1 December 2026
- Published by Institute of Advanced Engineering and Science in International Journal of Informatics and Communication Technology (IJ-ICT)
- Vol. 15 (4) , 1624-1634
Approximate computing circuits for error-tolerant applications with low energy consumption
Energy efficiency is a crucial factor in very large-scale integrated (VLSI) circuit design, and traditional methods offer limited solutions to power intensive circuits. Recently, approximate computing techniques have emerged, enhancing key design parameters like power consumption, propagation delay, and area, albeit with a compromise in accuracy. These techniques are especially suitable for high-performance computing, as they offer reduced energy consumption while compromising some accuracy, making them ideal for use in arithmetic circuits. This paper introduces enhanced versions of approximate adders (AxAs) and subtractors (AxSCs) for fundamental operations. Building upon these designs, approximate multipliers using the Wallace tree multiplier (AxWTM) and approximate dividers (AxDs) have been developed, and their performances have been compared regarding power consumed, spatial requirements, delay time, and error frequency. Many digital image and video processing applications, along with other multimedia tools, can function effectively even with slight inaccuracies in their output results. The existing and proposed designs were applied to image squaring, image multiplication, image subtraction, and image division applications, and peak signal-to-noise ratio (PSNR) was obtained. It is found that the suggested approximate designs achieved a better PSNR for all image applications, and the results were superior to those of their counterparts.
- 1 December 2026
- Published by Institute of Advanced Engineering and Science in International Journal of Informatics and Communication Technology (IJ-ICT)
- Vol. 15 (4) , 1624-1634
Open AccessApproximate computing circuits for error-tolerant applications with low energy consumption
Energy efficiency is a crucial factor in very large-scale integrated (VLSI) circuit design, and traditional methods offer limited solutions to power intensive circuits. Recently, approximate computing techniques have emerged, enhancing key design parameters like power consumption, propagation delay, and area, albeit with a compromise in accuracy. These techniques are especially suitable for high-performance computing, as they offer reduced energy consumption while compromising some accuracy, making them ideal for use in arithmetic circuits. This paper introduces enhanced versions of approximate adders (AxAs) and subtractors (AxSCs) for fundamental operations. Building upon these designs, approximate multipliers using the Wallace tree multiplier (AxWTM) and approximate dividers (AxDs) have been developed, and their performances have been compared regarding power consumed, spatial requirements, delay time, and error frequency. Many digital image and video processing applications, along with other multimedia tools, can function effectively even with slight inaccuracies in their output results. The existing and proposed designs were applied to image squaring, image multiplication, image subtraction, and image division applications, and peak signal-to-noise ratio (PSNR) was obtained. It is found that the suggested approximate designs achieved a better PSNR for all image applications, and the results were superior to those of their counterparts.
- 2 September 2026
- Published by Springer Nature
- p. 249-260
Assistive Technology for Individuals with Physical Disabilities: A Head Movement Vehicle System
- 2 September 2026
- Published by Springer Nature
- p. 249-260
Assistive Technology for Individuals with Physical Disabilities: A Head Movement Vehicle System
- 22 April 2026
- Published by World Scientific Pub Co Pte Ltd in Journal of Circuits, Systems and Computers
Emulation and mitigation of Multiple Bit Upset in SRAM memories using Interleaved Counter Matrix code
Multiple cell upsets are causing major problems with the reliability of memories exposed to radiation environments (MCUs). More complicated error correction codes (ECCs) are frequently employed to safeguard memory and stop MCUs from corrupting data, but their primary drawback is that increasing delay overhead is necessary. Recently, various ECC codes have been introduced however, the primary issue is that only two-to-five-bit errors are corrected faults can be corrected. To overcome these challenges, a novel Contiguous Multiple Bit Upset Mitigation (CMBUM) model has been proposed for data protection in SRAM memories. The proposed CMBUM model utilized Interleaved Counter Matrix (ICM) code which uses a combinational ones counter and parity generator to reduce delay overhead and improve memory reliability. CMBUM achieves maximal correction coverage by performing parallel 8-bit error correcting considerably. The proposed ICM code integrates the ICM code into the decoder and uses 32-bit data as input to the encoder in order to reduce the number of superfluous bits. The proposed method is implemented using a 45-nm library, and it is compared to the current approach, which provides better error protection with minimal redundancy and low overhead. Evaluation findings show notable reductions in area, power, and delay when comparing the proposed CMBUM technique to the existing technique, which can correct double and 8-adjacent faults.
- 22 April 2026
- Published by World Scientific Pub Co Pte Ltd in Journal of Circuits, Systems and Computers
Emulation and mitigation of Multiple Bit Upset in SRAM memories using Interleaved Counter Matrix code
Multiple cell upsets are causing major problems with the reliability of memories exposed to radiation environments (MCUs). More complicated error correction codes (ECCs) are frequently employed to safeguard memory and stop MCUs from corrupting data, but their primary drawback is that increasing delay overhead is necessary. Recently, various ECC codes have been introduced however, the primary issue is that only two-to-five-bit errors are corrected faults can be corrected. To overcome these challenges, a novel Contiguous Multiple Bit Upset Mitigation (CMBUM) model has been proposed for data protection in SRAM memories. The proposed CMBUM model utilized Interleaved Counter Matrix (ICM) code which uses a combinational ones counter and parity generator to reduce delay overhead and improve memory reliability. CMBUM achieves maximal correction coverage by performing parallel 8-bit error correcting considerably. The proposed ICM code integrates the ICM code into the decoder and uses 32-bit data as input to the encoder in order to reduce the number of superfluous bits. The proposed method is implemented using a 45-nm library, and it is compared to the current approach, which provides better error protection with minimal redundancy and low overhead. Evaluation findings show notable reductions in area, power, and delay when comparing the proposed CMBUM technique to the existing technique, which can correct double and 8-adjacent faults.
- Open Access
- 1 December 2025
- Published by Institute of Advanced Engineering and Science in IAES International Journal of Robotics and Automation (IJRA)
- Vol. 14 (4)
Design of low-power, high-speed approximate 4:2 compressors for efficient partial product reduction in multipliers
Partial product reduction becomes the main task in the multiplication process. Therefore, the partial product stages of multipliers are reduced with the usage of compressors, by using compressors in the multiplier. Using compressors in the multiplier circuit significantly impacts multiplier performance. Approximate compressors are crucial for achieving better design metrics in parallel multipliers. This paper proposes to create various new approximate 4:2 compressor circuits. A trade-off is made between the performance and accuracy of this approximate circuit design approach. The proposed designs have been implemented using XOR-XNOR gates with a 2-to-1 multiplexer, and also XOR-XNOR gates with transmission gates. All these circuits have been simulated using Cadence in different technological nodes. Compared with the existing technique, the proposed 4:2 approximation compressor provides 51.4% power reduction and 26.45% delay reduction for 45 nm equipment.
- 1 December 2025
- Published by Institute of Advanced Engineering and Science in IAES International Journal of Robotics and Automation (IJRA)
- Vol. 14 (4)
Open AccessDesign of low-power, high-speed approximate 4:2 compressors for efficient partial product reduction in multipliers
Partial product reduction becomes the main task in the multiplication process. Therefore, the partial product stages of multipliers are reduced with the usage of compressors, by using compressors in the multiplier. Using compressors in the multiplier circuit significantly impacts multiplier performance. Approximate compressors are crucial for achieving better design metrics in parallel multipliers. This paper proposes to create various new approximate 4:2 compressor circuits. A trade-off is made between the performance and accuracy of this approximate circuit design approach. The proposed designs have been implemented using XOR-XNOR gates with a 2-to-1 multiplexer, and also XOR-XNOR gates with transmission gates. All these circuits have been simulated using Cadence in different technological nodes. Compared with the existing technique, the proposed 4:2 approximation compressor provides 51.4% power reduction and 26.45% delay reduction for 45 nm equipment.
- Open Access
- 1 December 2025
- Published by Institute of Advanced Engineering and Science in IAES International Journal of Robotics and Automation (IJRA)
- Vol. 14 (4) , 459-467
Design of low-power, high-speed approximate 4:2 compressors for efficient partial product reduction in multipliers
Partial product reduction becomes the main task in the multiplication process. Therefore, the partial product stages of multipliers are reduced with the usage of compressors, by using compressors in the multiplier. Using compressors in the multiplier circuit significantly impacts multiplier performance. Approximate compressors are crucial for achieving better design metrics in parallel multipliers. This paper proposes to create various new approximate 4:2 compressor circuits. A trade-off is made between the performance and accuracy of this approximate circuit design approach. The proposed designs have been implemented using XOR-XNOR gates with a 2-to-1 multiplexer, and also XOR-XNOR gates with transmission gates. All these circuits have been simulated using Cadence in different technological nodes. Compared with the existing technique, the proposed 4:2 approximation compressor provides 51.4% power reduction and 26.45% delay reduction for 45 nm equipment.
- 1 December 2025
- Published by Institute of Advanced Engineering and Science in IAES International Journal of Robotics and Automation (IJRA)
- Vol. 14 (4) , 459-467
Open AccessDesign of low-power, high-speed approximate 4:2 compressors for efficient partial product reduction in multipliers
Partial product reduction becomes the main task in the multiplication process. Therefore, the partial product stages of multipliers are reduced with the usage of compressors, by using compressors in the multiplier. Using compressors in the multiplier circuit significantly impacts multiplier performance. Approximate compressors are crucial for achieving better design metrics in parallel multipliers. This paper proposes to create various new approximate 4:2 compressor circuits. A trade-off is made between the performance and accuracy of this approximate circuit design approach. The proposed designs have been implemented using XOR-XNOR gates with a 2-to-1 multiplexer, and also XOR-XNOR gates with transmission gates. All these circuits have been simulated using Cadence in different technological nodes. Compared with the existing technique, the proposed 4:2 approximation compressor provides 51.4% power reduction and 26.45% delay reduction for 45 nm equipment.
- Open Access
- 1 December 2025
- Published by Institute of Advanced Engineering and Science in IAES International Journal of Robotics and Automation (IJRA)
- Vol. 14 (3) , 459-467
Design of low-power, high-speed approximate 4:2 compressors for efficient partial product reduction in multipliers
Partial product reduction becomes the main task in the multiplication process. Therefore, the partial product stages of multipliers are reduced with the usage of compressors, by using compressors in the multiplier. Using compressors in the multiplier circuit significantly impacts multiplier performance. Approximate compressors are crucial for achieving better design metrics in parallel multipliers. This paper proposes to create various new approximate 4:2 compressor circuits. A trade-off is made between the performance and accuracy of this approximate circuit design approach. The proposed designs have been implemented using XOR-XNOR gates with a 2-to-1 multiplexer, and also XOR-XNOR gates with transmission gates. All these circuits have been simulated using Cadence in different technological nodes. Compared with the existing technique, the proposed 4:2 approximation compressor provides 51.4% power reduction and 26.45% delay reduction for 45 nm equipment.
- 1 December 2025
- Published by Institute of Advanced Engineering and Science in IAES International Journal of Robotics and Automation (IJRA)
- Vol. 14 (3) , 459-467
Open AccessDesign of low-power, high-speed approximate 4:2 compressors for efficient partial product reduction in multipliers
Partial product reduction becomes the main task in the multiplication process. Therefore, the partial product stages of multipliers are reduced with the usage of compressors, by using compressors in the multiplier. Using compressors in the multiplier circuit significantly impacts multiplier performance. Approximate compressors are crucial for achieving better design metrics in parallel multipliers. This paper proposes to create various new approximate 4:2 compressor circuits. A trade-off is made between the performance and accuracy of this approximate circuit design approach. The proposed designs have been implemented using XOR-XNOR gates with a 2-to-1 multiplexer, and also XOR-XNOR gates with transmission gates. All these circuits have been simulated using Cadence in different technological nodes. Compared with the existing technique, the proposed 4:2 approximation compressor provides 51.4% power reduction and 26.45% delay reduction for 45 nm equipment.
- Open Access
- 1 August 2025
- Published by Institute of Advanced Engineering and Science in International Journal of Informatics and Communication Technology (IJ-ICT)
- Vol. 14 (2) , 382-392
An improved approximate parallel prefix adder for high performance computing applications: a comparative analysis
Binary adders are fundamental in digital circuit designs, including digital signal processors and microprocessor data path units. Consequently, significant research has focused on improving adders’ power-delay efficiency. The carry tree adder (CTA) is alternatively referred to as the parallel prefix adder (PPA), is among the fastest adders, achieving superior performance in very large scale integrated (VLSI) implementations through efficient concurrent carry generation and propagation. This study introduces approximate PPAs (AxPPAs) by applying approximations in prefix operators (POs). Four types of AxPPAs approximate kogge-stone, approximate brent-kung, approximate ladner fischer, and approximate sparse kogge-stone-were designed and implemented on FPGA with bit widths up to 64-bit. Delay measurements from static timing analysis using Xilinx ISE design suite version 14.7 indicate that AxPPAs exhibit better latency performance than traditional PPAs. The AxPPA sparse kogge-stone, in particular, demonstrated superior area and speed performance, achieving a delay of 2.501ns for a 16-bit addition.
- 1 August 2025
- Published by Institute of Advanced Engineering and Science in International Journal of Informatics and Communication Technology (IJ-ICT)
- Vol. 14 (2) , 382-392
Open AccessAn improved approximate parallel prefix adder for high performance computing applications: a comparative analysis
Binary adders are fundamental in digital circuit designs, including digital signal processors and microprocessor data path units. Consequently, significant research has focused on improving adders’ power-delay efficiency. The carry tree adder (CTA) is alternatively referred to as the parallel prefix adder (PPA), is among the fastest adders, achieving superior performance in very large scale integrated (VLSI) implementations through efficient concurrent carry generation and propagation. This study introduces approximate PPAs (AxPPAs) by applying approximations in prefix operators (POs). Four types of AxPPAs approximate kogge-stone, approximate brent-kung, approximate ladner fischer, and approximate sparse kogge-stone-were designed and implemented on FPGA with bit widths up to 64-bit. Delay measurements from static timing analysis using Xilinx ISE design suite version 14.7 indicate that AxPPAs exhibit better latency performance than traditional PPAs. The AxPPA sparse kogge-stone, in particular, demonstrated superior area and speed performance, achieving a delay of 2.501ns for a 16-bit addition.
- 1 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 72, 52-56
Developments of Approximate Computing: From Algorithm Level to System Level
Low power is one of the critical parameters in the Very Large Scale Integration (VLSI) circuits design. In recent years, approximate computing techniques have improved the design metrics delay, area, and power or energy with a tradeoff inaccuracy. Computational intensive and error-tolerant applications are more suitable to adopt approximation Methods. Approximate computing is an emerging computing paradigm in low power VLSI design. It provides low power consumption at the cost of accuracy. This paper presents an introduction, applications, and developments in approximate computing.
- 1 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 72, 52-56
Developments of Approximate Computing: From Algorithm Level to System Level
Low power is one of the critical parameters in the Very Large Scale Integration (VLSI) circuits design. In recent years, approximate computing techniques have improved the design metrics delay, area, and power or energy with a tradeoff inaccuracy. Computational intensive and error-tolerant applications are more suitable to adopt approximation Methods. Approximate computing is an emerging computing paradigm in low power VLSI design. It provides low power consumption at the cost of accuracy. This paper presents an introduction, applications, and developments in approximate computing.
- 1 February 2020
- Published by Elsevier in Microprocessors and Microsystems
- Vol. 72
Design of approximate adders and multipliers for error tolerant image processing
- 1 February 2020
- Published by Elsevier in Microprocessors and Microsystems
- Vol. 72
Design of approximate adders and multipliers for error tolerant image processing
- 28 November 2019
- Published by Springer Nature in Advances in Intelligent Systems and Computing
- p. 341-351
ASIC Implementation of Fixed-Point Iterative, Parallel, and Pipeline CORDIC Algorithm
- 28 November 2019
- Published by Springer Nature in Advances in Intelligent Systems and Computing
- p. 341-351
ASIC Implementation of Fixed-Point Iterative, Parallel, and Pipeline CORDIC Algorithm