Efstratios Zacharelos
Efstratios Zacharelos has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Antonio Giuseppe Maria Strollo
Department of Electrical Engineering and Information Technology, University of Naples Federico II, Napoli, Italy
5 shared publications - Ettore Napoli
Department of Electrical Engineering and Applied Mathematics, University of Salerno, Fisciano, Italy
5 shared publications - Mauro D'Arco
Department of Information Technology and Electrical Engineering (DIETI), University of Naples Federico II, Naples, Italy
3 shared publications Ettore Napoli
2 shared publications- Gennaro Di Meo
Department of Electrical Engineering and Information Technologies, University of Naples Federico II, Via Claudio, 21, I-80125 Naples, Italy
2 shared publications Antonio G.M. Strollo
1 shared publication
Latest Publications
- Open Access
- 30 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 3026-3039
Analytical Error Evaluation and Hardware Implementation of Approximate Negation Circuits
Inexact arithmetic units trade precision for improvements in energy efficiency, silicon area, and speed. Most existing designs focus on non-negative numbers and, when used in real applications, rely on Sign and Magnitude (SM) transformations to deal with signed values mitigating most of the advantages obtained in the first place. This work investigates circuits for the approximate negation of numbers in two’s complement (2’sC) format that offer a middle ground in terms of error and energy efficiency when compared to the exact 2’sC negation and the more aggressive one’s complement (1’sC) negation method, thus obtaining a general purpose tool for approximate computing that can be seamlessly integrated into existing designs. The paper demonstrates that by using this tool it is possible to exploit unsigned approximate arithmetic circuits in signed applications, achieving slightly lower error with no additional power compared to the commonly used 1’sC approximation, or significantly reduced error, while still lowering power dissipation relative to exact 2’sC negation. We derive analytical expressions for error characteristics and present a hardware implementation. The resulting versatile technique can be exploited to compute absolute values or to convert SM representations into 2’sC format.We incorporate the investigated circuits into several approximate architectures using a 14 nm FinFET standard cell library. The resulting designs, when compared with 1’sC negation, are able to improve accuracy (achieving up to 30% error reduction in approximate multipliers and 10dB PSNR gain in H.264 video compression) while still reducing the power dissipation.
- 30 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 3026-3039
Open AccessAnalytical Error Evaluation and Hardware Implementation of Approximate Negation Circuits
Inexact arithmetic units trade precision for improvements in energy efficiency, silicon area, and speed. Most existing designs focus on non-negative numbers and, when used in real applications, rely on Sign and Magnitude (SM) transformations to deal with signed values mitigating most of the advantages obtained in the first place. This work investigates circuits for the approximate negation of numbers in two’s complement (2’sC) format that offer a middle ground in terms of error and energy efficiency when compared to the exact 2’sC negation and the more aggressive one’s complement (1’sC) negation method, thus obtaining a general purpose tool for approximate computing that can be seamlessly integrated into existing designs. The paper demonstrates that by using this tool it is possible to exploit unsigned approximate arithmetic circuits in signed applications, achieving slightly lower error with no additional power compared to the commonly used 1’sC approximation, or significantly reduced error, while still lowering power dissipation relative to exact 2’sC negation. We derive analytical expressions for error characteristics and present a hardware implementation. The resulting versatile technique can be exploited to compute absolute values or to convert SM representations into 2’sC format.We incorporate the investigated circuits into several approximate architectures using a 14 nm FinFET standard cell library. The resulting designs, when compared with 1’sC negation, are able to improve accuracy (achieving up to 30% error reduction in approximate multipliers and 10dB PSNR gain in H.264 video compression) while still reducing the power dissipation.
- Top Cited PapersOpen Access
- 18 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 136054-136072
Approximate Full-Adders: A Comprehensive Analysis
Approximate computing is a technique that sacrifices the accuracy of the result for an advantage in terms of power, area, and speed. It is useful for error-tolerant applications such as image and video processing. Many approximate arithmetic circuits can be devised using approximate versions of the basic binary full adder that simply adds three bits to generate carry and sum. Therefore, the approximate full adder has been the subject of extensive investigation in recent years. In this paper we present a comprehensive analysis of approximate full adders, by synthesizing in a FinFET 14 nm technology the whole set of possible designs, achievable by modifying one or more entries of the full adder truth-table. Our exhaustive analysis shows that only a few out of the many thousands of synthesized circuits perform reasonably well as approximate full adders. Our analysis re-discovers the approximate full adders already proposed in the literature and identifies some new ones. Examples of using the newly discovered approximate full adders in typical error resilient applications are provided, showing the performance and the usefulness of approximate arithmetic circuit designs in the real-world.
- 18 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 136054-136072
Top Cited PapersOpen AccessApproximate Full-Adders: A Comprehensive Analysis
Approximate computing is a technique that sacrifices the accuracy of the result for an advantage in terms of power, area, and speed. It is useful for error-tolerant applications such as image and video processing. Many approximate arithmetic circuits can be devised using approximate versions of the basic binary full adder that simply adds three bits to generate carry and sum. Therefore, the approximate full adder has been the subject of extensive investigation in recent years. In this paper we present a comprehensive analysis of approximate full adders, by synthesizing in a FinFET 14 nm technology the whole set of possible designs, achievable by modifying one or more entries of the full adder truth-table. Our exhaustive analysis shows that only a few out of the many thousands of synthesized circuits perform reasonably well as approximate full adders. Our analysis re-discovers the approximate full adders already proposed in the literature and identifies some new ones. Examples of using the newly discovered approximate full adders in typical error resilient applications are provided, showing the performance and the usefulness of approximate arithmetic circuit designs in the real-world.
- Open Access
- 24 February 2023
- Published by Elsevier in Integration
- Vol. 91, 35-42
Approximate squaring circuits exploiting recursive architectures
- 24 February 2023
- Published by Elsevier in Integration
- Vol. 91, 35-42
Open AccessApproximate squaring circuits exploiting recursive architectures
- Open Access
- 30 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computing
- Vol. 10 (3) , 1315-1330
Approximate Recursive Multipliers Using Low Power Building Blocks
Approximate computing, frequently used in error tolerant applications, aims to achieve higher circuit performances by allowing the possibility of inaccurate results, rather than guaranteeing a correct outcome. Many contributions target the binary multiplier aiming to minimize the complexity of this common yet power-hungry circuit. Approximate recursive multipliers are low-power designs that exploit approximate building blocks to scale up to their final size. In this paper, we present two novel 4x4 approximate multipliers obtained by carry manipulation. They are used to compose 8x8 designs with different error-precision trade-off. The final circuits exhibit a competitive behavior in terms of error while reducing the power dissipation when compared to state-of-the-art proposals. The proposed multipliers and state-of-the-art designs found in the literature, have been synthesized targeting a 14nm FinFET technology to determine the electrical characteristics. Compared with an exact 8×8 multiplier, the least dissipative design proposed in this paper reduces power consumption and silicon area by 46%, and minimum delay by 21%. It also consumes 14% less power than the least power-hungry recursive circuit found in the literature, while offering 81% higher accuracy. Ιmage processing applications and a convolutional neural network are shown to demonstrate the effectiveness of the proposed multipliers.
- 30 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computing
- Vol. 10 (3) , 1315-1330
Open AccessApproximate Recursive Multipliers Using Low Power Building Blocks
Approximate computing, frequently used in error tolerant applications, aims to achieve higher circuit performances by allowing the possibility of inaccurate results, rather than guaranteeing a correct outcome. Many contributions target the binary multiplier aiming to minimize the complexity of this common yet power-hungry circuit. Approximate recursive multipliers are low-power designs that exploit approximate building blocks to scale up to their final size. In this paper, we present two novel 4x4 approximate multipliers obtained by carry manipulation. They are used to compose 8x8 designs with different error-precision trade-off. The final circuits exhibit a competitive behavior in terms of error while reducing the power dissipation when compared to state-of-the-art proposals. The proposed multipliers and state-of-the-art designs found in the literature, have been synthesized targeting a 14nm FinFET technology to determine the electrical characteristics. Compared with an exact 8×8 multiplier, the least dissipative design proposed in this paper reduces power consumption and silicon area by 46%, and minimum delay by 21%. It also consumes 14% less power than the least power-hungry recursive circuit found in the literature, while offering 81% higher accuracy. Ιmage processing applications and a convolutional neural network are shown to demonstrate the effectiveness of the proposed multipliers.
- Open Access
Enabling Fine Sample Rate Settings in DSOs with Time-Interleaved ADCs
The time-base used by digital storage oscilloscopes allows limited selections of the sample rate, namely constrained to a few integer submultiples of the maximum sample rate. This limitation offers the advantage of simplifying the data transfer from the analog-to-digital converter to the acquisition memory, and of assuring stability performances, expressed in terms of absolute jitter, that are independent of the chosen sample rate. On the counterpart, it prevents an optimal usage of the memory resources of the oscilloscope and compels to post processing operations in several applications. A time-base that allows selecting the sample rate with very fine frequency resolution, in particular as a rational submultiple of the maximum rate, is proposed. The proposal addresses the oscilloscopes with time-interleaved converters, that require a dedicated and multifaceted approach with respect to architectures where a single monolithic converter is in charge of signal digitization. The proposed time-base allows selecting with fine frequency resolution sample rate values up to 200 GHz and beyond, still assuring jitter performances independent of the sample rate selection.
Open AccessEnabling Fine Sample Rate Settings in DSOs with Time-Interleaved ADCs
The time-base used by digital storage oscilloscopes allows limited selections of the sample rate, namely constrained to a few integer submultiples of the maximum sample rate. This limitation offers the advantage of simplifying the data transfer from the analog-to-digital converter to the acquisition memory, and of assuring stability performances, expressed in terms of absolute jitter, that are independent of the chosen sample rate. On the counterpart, it prevents an optimal usage of the memory resources of the oscilloscope and compels to post processing operations in several applications. A time-base that allows selecting the sample rate with very fine frequency resolution, in particular as a rational submultiple of the maximum rate, is proposed. The proposal addresses the oscilloscopes with time-interleaved converters, that require a dedicated and multifaceted approach with respect to architectures where a single monolithic converter is in charge of signal digitization. The proposed time-base allows selecting with fine frequency resolution sample rate values up to 200 GHz and beyond, still assuring jitter performances independent of the sample rate selection.
- Open Access
- 13 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 68 (10) , 4142-4155
Real-Time Downsampling in Digital Storage Oscilloscopes With Multichannel Architectures
Digital Storage Oscilloscopes (DSOs) conjugate high performance with large number of features and flexibility. The basic structure, based on fast Analog to Digital Converter (ADC) and memory, is augmented with several components for channel matching and bandwidth improvement, and processors that provide visualization, frequency processing, jitter and stability measurement, etc. Unfortunately, fine resolution in sample rate selection is not available, such that for several applications the user must run complex measurement procedures that require data download and offline processing. The paper proposes a dedicated digital circuit that offers fine control of the time-base by real time downsampling the input stream at an almost arbitrary sampling rate. The proposed circuit implements a series of operations involving real-time data filtering, defragmentation and packing, which are not considered by alternative approaches, like those based on polyphase filters, that offer very limited choices for the sampling rate. The circuit is designed to work in conjunction with the highest performance DSOs that use a multichannel architecture. Design rules for circuit design are provided together with implementation results in 14nm FinFET technology. When designed for an architecture with 64 channels with 8bit input samples the circuit works in real time with a sampling rate of 220 GSps running at 3.42 GHz, with a silicon footprint of 0.17 mm² and a power dissipation of 0.85W.
- 13 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 68 (10) , 4142-4155
Open AccessReal-Time Downsampling in Digital Storage Oscilloscopes With Multichannel Architectures
Digital Storage Oscilloscopes (DSOs) conjugate high performance with large number of features and flexibility. The basic structure, based on fast Analog to Digital Converter (ADC) and memory, is augmented with several components for channel matching and bandwidth improvement, and processors that provide visualization, frequency processing, jitter and stability measurement, etc. Unfortunately, fine resolution in sample rate selection is not available, such that for several applications the user must run complex measurement procedures that require data download and offline processing. The paper proposes a dedicated digital circuit that offers fine control of the time-base by real time downsampling the input stream at an almost arbitrary sampling rate. The proposed circuit implements a series of operations involving real-time data filtering, defragmentation and packing, which are not considered by alternative approaches, like those based on polyphase filters, that offer very limited choices for the sampling rate. The circuit is designed to work in conjunction with the highest performance DSOs that use a multichannel architecture. Design rules for circuit design are provided together with implementation results in 14nm FinFET technology. When designed for an architecture with 64 channels with 8bit input samples the circuit works in real time with a sampling rate of 220 GSps running at 3.42 GHz, with a silicon footprint of 0.17 mm² and a power dissipation of 0.85W.
- Open Access
Digital Circuit for Seamless Resampling ADC Output Streams
Fine resolution selection of the sample rate is not available in digital storage oscilloscopes (DSOs), so the user has to rely on offline processing to cope with such need. The paper first discusses digital signal processing based methods that allow changing the sampling rate by means of digital resampling approaches. Then, it proposes a digital circuit that, if included in the acquisition channel of a digital storage oscilloscope, between the internal analog-to-digital converter (ADC) and the acquisition memory, allows the user to select any sampling rate lower than the maximum one with fine resolution. The circuit relies both on the use of a short digital filter with dynamically generated coefficients and on a suitable memory management strategy. The output samples produced by the digital circuit are characterized by a sampling rate that can be incoherent with the clock frequency regulating the memory access. Both a field programmable gate array (FPGA) implementation and an application specific integrated circuit (ASIC) design of the proposed circuit are evaluated.
Open AccessDigital Circuit for Seamless Resampling ADC Output Streams
Fine resolution selection of the sample rate is not available in digital storage oscilloscopes (DSOs), so the user has to rely on offline processing to cope with such need. The paper first discusses digital signal processing based methods that allow changing the sampling rate by means of digital resampling approaches. Then, it proposes a digital circuit that, if included in the acquisition channel of a digital storage oscilloscope, between the internal analog-to-digital converter (ADC) and the acquisition memory, allows the user to select any sampling rate lower than the maximum one with fine resolution. The circuit relies both on the use of a short digital filter with dynamically generated coefficients and on a suitable memory management strategy. The output samples produced by the digital circuit are characterized by a sampling rate that can be incoherent with the clock frequency regulating the memory access. Both a field programmable gate array (FPGA) implementation and an application specific integrated circuit (ASIC) design of the proposed circuit are evaluated.