Sergio Bampi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Sergio Bampi has a total of 201 co-authors. Here are the top co-authors by number of shared publications:
- Guilherme Paim
Graduate Program in Microelectronics (PGMICRO), Institute of Informatics (INF), Universidade Federal do Rio Grande do Sul (UFRGS), Porto Alegre, Brazil
23 shared publications - Eduardo Antonio Cesar da Costa
Graduate Program on Electronic Engineering and Computing, Catholic University of Pelotas (UCPel), Pelotas, Brazil
21 shared publications - Luciano Agostini
UFPEL
16 shared publications - Hamilton Klimach
Universidade Federal do Rio Grande do Sul image/svg+xml
13 shared publications - Brunno Alves de Abreu
Graduate Program in Microelectronics (PGMICRO), Institute of Informatics (INF), Universidade Federal do Rio Grande do Sul (UFRGS), Porto Alegre, Brazil
9 shared publications - Bruno Zatt
Universidade Federal de Pelotas
9 shared publications
Latest Publications
- 22 July 2025
- Published by Springer Nature in Journal of Real-Time Image Processing
- Vol. 22 (4) , 1-14
Hardware accelerator for VVC/H.266 residual syntax elements: a unified and resource-efficient architecture
- 22 July 2025
- Published by Springer Nature in Journal of Real-Time Image Processing
- Vol. 22 (4) , 1-14
Hardware accelerator for VVC/H.266 residual syntax elements: a unified and resource-efficient architecture
- Open Access
- 6 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 72 (11) , 7070-7083
Improving Coding Efficiency of Massive Parallel Intra Prediction Using Alternative References
Exploring massive parallelism is a common strategy to mitigate the processing time of modern video encoding standards. Nonetheless, data dependencies challenge parallelism exploitation, especially during intra prediction, where the reconstructed adjacent blocks are used as references. Some works use the original frame samples as references to decouple adjacent blocks and allow parallelism. Still, the original samples are static and cannot model the nuances of different bitrates. In this context, this work seeks to improve the coding efficiency of parallel intra prediction implementations by using alternative reference samples based on low-pass filters that better represent the nuances of different bitrates for any partitioning structure. Variations in multiple aspects of the filters are considered, such as their dimension and also the precision and distribution of their coefficients. Experimental evaluations assessed the similarity of such alternative samples when compared to the regular ones, in addition to their impacts on coding efficiency and the processing overhead required to obtain such samples. The results from such experiments demonstrate that the alternative references improve coding efficiency when compared to the original samples, especially at lower bitrates. Furthermore, the additional filtering stage poses negligible timing overhead in most computing systems.
- 6 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 72 (11) , 7070-7083
Open AccessImproving Coding Efficiency of Massive Parallel Intra Prediction Using Alternative References
Exploring massive parallelism is a common strategy to mitigate the processing time of modern video encoding standards. Nonetheless, data dependencies challenge parallelism exploitation, especially during intra prediction, where the reconstructed adjacent blocks are used as references. Some works use the original frame samples as references to decouple adjacent blocks and allow parallelism. Still, the original samples are static and cannot model the nuances of different bitrates. In this context, this work seeks to improve the coding efficiency of parallel intra prediction implementations by using alternative reference samples based on low-pass filters that better represent the nuances of different bitrates for any partitioning structure. Variations in multiple aspects of the filters are considered, such as their dimension and also the precision and distribution of their coefficients. Experimental evaluations assessed the similarity of such alternative samples when compared to the regular ones, in addition to their impacts on coding efficiency and the processing overhead required to obtain such samples. The results from such experiments demonstrate that the alternative references improve coding efficiency when compared to the original samples, especially at lower bitrates. Furthermore, the additional filtering stage poses negligible timing overhead in most computing systems.
- Open Access
- 10 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Circuits and Systems
- Vol. 6, 120-134
End-to-End Neural Video Compression: A Review
The pervasive presence of video content has spurred the development of advanced technologies to manage, process, and deliver high-quality content efficiently. Video compression is crucial in providing high-quality video services under limited network and storage capacities, traditionally achieved through hybrid codecs. However, as these frameworks reach a performance bottleneck with compression gains becoming harder to achieve with conventional methods, Deep Neural Networks (DNNs) offer a promising alternative. By leveraging DNNs’ nonlinear representation capacity, these networks can enhance compression efficiency and visual quality. Neural Video Coding (NVC) has recently received significant attention, with Neural Image Coding models surpassing traditional codecs in compression ratios. Therefore, this survey explores the state-of-the-art in NVC, examining recent works, frameworks, and the potential of this innovative approach to revolutionize video compression. We identify that NVC models have come a long way since the first proposals and currently are on par in compression efficiency with the latest hybrid codec, VVC. Still, many improvements are required to enable the practical usage of NVC, such as hardware-friendly development to enable faster inference and execution on mobile and energy-constrained devices.
- 10 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Circuits and Systems
- Vol. 6, 120-134
Open AccessEnd-to-End Neural Video Compression: A Review
The pervasive presence of video content has spurred the development of advanced technologies to manage, process, and deliver high-quality content efficiently. Video compression is crucial in providing high-quality video services under limited network and storage capacities, traditionally achieved through hybrid codecs. However, as these frameworks reach a performance bottleneck with compression gains becoming harder to achieve with conventional methods, Deep Neural Networks (DNNs) offer a promising alternative. By leveraging DNNs’ nonlinear representation capacity, these networks can enhance compression efficiency and visual quality. Neural Video Coding (NVC) has recently received significant attention, with Neural Image Coding models surpassing traditional codecs in compression ratios. Therefore, this survey explores the state-of-the-art in NVC, examining recent works, frameworks, and the potential of this innovative approach to revolutionize video compression. We identify that NVC models have come a long way since the first proposals and currently are on par in compression efficiency with the latest hybrid codec, VVC. Still, many improvements are required to enable the practical usage of NVC, such as hardware-friendly development to enable faster inference and execution on mobile and energy-constrained devices.
- 1 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 72 (1) , 180-191
On the Efficacy and Vulnerabilities of Logic Locking in Tree-Based Machine Learning
The popularity and widespread usage of machine learning (ML) hardware have created challenges for its intellectual property (IP) protection. Logic locking is a widely used technique for IP protection but has received little attention in error-resilient applications such as ML hardware modules. This work investigates the effectiveness of logic locking when applied to tree-based ML circuits and reveals a critical vulnerability that undermines its effectiveness for single-label ML classifiers. We propose a logic locking scheme to eliminate the vulnerabilities in decision trees (DTs) and random forests (RFs) circuits. In our extensive simulation involving 16 DTs and 16 RFs, our solution consistently thwarts the vulnerability. We further evaluated the security of our approach by considering different obfuscation percentages and launching state-of-the-art oracle-less attacks on logic locking. Our method proves resilient, indicating that by fixing the identified vulnerability, we did not introduce new attack vectors. Further, our investigation indicates that DT/RF accelerators are significantly less vulnerable to oracle-less attacks compared to exact circuits. Overall, our work lays the foundation for future investigations into the effectiveness of logic locking for ML circuits.
- 1 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 72 (1) , 180-191
On the Efficacy and Vulnerabilities of Logic Locking in Tree-Based Machine Learning
The popularity and widespread usage of machine learning (ML) hardware have created challenges for its intellectual property (IP) protection. Logic locking is a widely used technique for IP protection but has received little attention in error-resilient applications such as ML hardware modules. This work investigates the effectiveness of logic locking when applied to tree-based ML circuits and reveals a critical vulnerability that undermines its effectiveness for single-label ML classifiers. We propose a logic locking scheme to eliminate the vulnerabilities in decision trees (DTs) and random forests (RFs) circuits. In our extensive simulation involving 16 DTs and 16 RFs, our solution consistently thwarts the vulnerability. We further evaluated the security of our approach by considering different obfuscation percentages and launching state-of-the-art oracle-less attacks on logic locking. Our method proves resilient, indicating that by fixing the identified vulnerability, we did not introduce new attack vectors. Further, our investigation indicates that DT/RF accelerators are significantly less vulnerable to oracle-less attacks compared to exact circuits. Overall, our work lays the foundation for future investigations into the effectiveness of logic locking for ML circuits.
- 4 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 33 (2) , 558-562
ReAdapt-II: Energy-Quality Optimizations for VLSI Adaptive Filters Through Automatic Reconfiguration and Built-In Iterative Dividers
Adaptive filters using least mean square (LMS) algorithms offer high precision, low complexity, and fast convergence, but choosing the correct algorithm can be difficult and time-consuming. In this brief, we present ReAdapt-II, a VLSI circuit that enhances energy efficiency in adaptive filters through automatic reconfiguration and built-in iterative dividers, optimizing the energy-quality (EQ) tradeoff. This design features a self-selecting, reconfigurable hardware system with four adaptive algorithms, integrating iterative-based dividers and reusing arithmetic operators. Our results show a minimum energy consumption reduction of 39.75%, a 66.61% reduction in the circuit area, and a maximum accuracy increase of 17.07% compared with the previous ReAdapt architecture.
- 4 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 33 (2) , 558-562
ReAdapt-II: Energy-Quality Optimizations for VLSI Adaptive Filters Through Automatic Reconfiguration and Built-In Iterative Dividers
Adaptive filters using least mean square (LMS) algorithms offer high precision, low complexity, and fast convergence, but choosing the correct algorithm can be difficult and time-consuming. In this brief, we present ReAdapt-II, a VLSI circuit that enhances energy efficiency in adaptive filters through automatic reconfiguration and built-in iterative dividers, optimizing the energy-quality (EQ) tradeoff. This design features a self-selecting, reconfigurable hardware system with four adaptive algorithms, integrating iterative-based dividers and reusing arithmetic operators. Our results show a minimum energy consumption reduction of 39.75%, a 66.61% reduction in the circuit area, and a maximum accuracy increase of 17.07% compared with the previous ReAdapt architecture.
- 13 August 2024
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 43 (12) , 7750-7780
Exploring Discrete Haar Wavelet and Cosine Transforms for Accuracy-and Energy-Quality VLSI Watermarking Systems Design
- 13 August 2024
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 43 (12) , 7750-7780
Exploring Discrete Haar Wavelet and Cosine Transforms for Accuracy-and Energy-Quality VLSI Watermarking Systems Design
- 26 February 2024
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 43 (6) , 3649-3678
AxRSU-$2^{m}$: Higher-Order m-Bit Approximate Encoders for Radix-$2^{m}$ Squarer Units- 26 February 2024
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 43 (6) , 3649-3678
AxRSU-$2^{m}$: Higher-Order m-Bit Approximate Encoders for Radix-$2^{m}$ Squarer Units- 21 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 71 (3) , 1000-1013
VLSI Architectures of Approximate Arithmetic Units Applied to Parallel Sensors Calibration
Approximate computing maximizes area and energy savings for a trade-off between quality and efficiency. Approximate arithmetic operators have emerged as an efficient alternative to design low-power VLSI circuits. This paper investigates the design of approximate arithmetic operator units used in the calibration procedure for radio astronomy light sensors — the so-called StEFCal (statistically efficient and fast calibration) method. The StEFCal algorithm comprises arithmetic operations like a divider, square-accumulate (SAC), and multiply-accumulate (MAC) units. The StEFCal circuit of this work explores the following arithmetic operators: i) two approximate squarer units from the literature, i.e., radix-4 (AxRSU) and SquASH, ii) two approximate iterative-based Newton-Raphson (NR) and Goldschmidt (GLD) dividers, iii) one approximate parallel prefix adder (AxPPA), and iv) a new approximate radix-4 multiplier (AxRMU), proposed in this work, explored in the StEFCal multiply-accumulate circuit design. The AxRSU utilizes the parameters $K1$ and $K2$ to represent the number of exact encoders for squarer-and conventional-partial products, respectively, subsequently replaced with approximate encoders. The same principle applies to AxRMU, where the parameter $K$ indicates the number of exact encoders for conventional-partial products, subsequently exchanged with approximate encoders. We demonstrate the efficiency of StEFCal using the approximate arithmetic operators from the Pareto-optimal front that expresses the area-and power-quality trade-off. The results show that using the AxRSU with $K1=4$ and $K2=6$ , AxRMU, and AxPPA with $K=16$ and NR with one iteration has an MSE equal to $89.98$ dB and offers up to $158\times$ energy-savings compared to the exact StEFCal, and up to $25\times$ more energy-savings and $3.33\times$ area-savings compared with our previous work, $440\times$ energy-savings compared to the accurate state-of-the-art, and $258\times$ compared with the approximate state-of-the-art.
- 21 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 71 (3) , 1000-1013
VLSI Architectures of Approximate Arithmetic Units Applied to Parallel Sensors Calibration
Approximate computing maximizes area and energy savings for a trade-off between quality and efficiency. Approximate arithmetic operators have emerged as an efficient alternative to design low-power VLSI circuits. This paper investigates the design of approximate arithmetic operator units used in the calibration procedure for radio astronomy light sensors — the so-called StEFCal (statistically efficient and fast calibration) method. The StEFCal algorithm comprises arithmetic operations like a divider, square-accumulate (SAC), and multiply-accumulate (MAC) units. The StEFCal circuit of this work explores the following arithmetic operators: i) two approximate squarer units from the literature, i.e., radix-4 (AxRSU) and SquASH, ii) two approximate iterative-based Newton-Raphson (NR) and Goldschmidt (GLD) dividers, iii) one approximate parallel prefix adder (AxPPA), and iv) a new approximate radix-4 multiplier (AxRMU), proposed in this work, explored in the StEFCal multiply-accumulate circuit design. The AxRSU utilizes the parameters $K1$ and $K2$ to represent the number of exact encoders for squarer-and conventional-partial products, respectively, subsequently replaced with approximate encoders. The same principle applies to AxRMU, where the parameter $K$ indicates the number of exact encoders for conventional-partial products, subsequently exchanged with approximate encoders. We demonstrate the efficiency of StEFCal using the approximate arithmetic operators from the Pareto-optimal front that expresses the area-and power-quality trade-off. The results show that using the AxRSU with $K1=4$ and $K2=6$ , AxRMU, and AxPPA with $K=16$ and NR with one iteration has an MSE equal to $89.98$ dB and offers up to $158\times$ energy-savings compared to the exact StEFCal, and up to $25\times$ more energy-savings and $3.33\times$ area-savings compared with our previous work, $440\times$ energy-savings compared to the accurate state-of-the-art, and $258\times$ compared with the approximate state-of-the-art.
- 6 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Emerging and Selected Topics in Circuits and Systems
- Vol. 13 (1) , 86-95
Compact CMOS-Compatible Majority Gate Using Body Biasing in FDSOI Technology
This is the first work that employs the body biasing feature, available in fully depleted silicon on insulator (FDSOI) technology nodes, to build CMOS-compatible compact majority (MAJ) and minority (MIN) logic gates. Compared to their CMOS counterpart, our novel MAJ/MIN gates exhibit considerably fewer transistors, 2.3x and 2x, respectively. The use of MAJ/MIN gates for logic synthesis has been widely investigated in the literature since any function can be realized using only these two gates. Nevertheless, the use of MAJ/MIN gates to synthesize circuits remained very limited because such gates are area hungry when implemented using conventional standard cells. Therefore, state-of-the-art research in the last decade has extensively focused on exploring beyond-CMOS technologies to build alternative MAJ/MIN gates. However, such emerging technologies are still immature and suffering considerably from variability. On the other hand, our novel FDSOI-based MAJ/MIN gates are based on mature CMOS commercial technologies. Our analysis of the proposed gates has been conducted using accurate SPICE simulations with an industry-compact transistor model, BSIM-IMG, calibrated for an industrial 14nm FDSOI technology. Using our developed MAJ/MIN synthesis and error injection framework called MAJinBoo, we demonstrate that MAJ/MIN-based circuits exhibit an outstanding resiliency against errors due to the inherent voting-based computing. This encourages the employment of our MAJ/MIN gates in safety-critical applications where reliability is a prime concern. Our MAJinBoo framework is available at https://github.com/Brunno815/MAJinBoo.
- 6 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Emerging and Selected Topics in Circuits and Systems
- Vol. 13 (1) , 86-95
Compact CMOS-Compatible Majority Gate Using Body Biasing in FDSOI Technology
This is the first work that employs the body biasing feature, available in fully depleted silicon on insulator (FDSOI) technology nodes, to build CMOS-compatible compact majority (MAJ) and minority (MIN) logic gates. Compared to their CMOS counterpart, our novel MAJ/MIN gates exhibit considerably fewer transistors, 2.3x and 2x, respectively. The use of MAJ/MIN gates for logic synthesis has been widely investigated in the literature since any function can be realized using only these two gates. Nevertheless, the use of MAJ/MIN gates to synthesize circuits remained very limited because such gates are area hungry when implemented using conventional standard cells. Therefore, state-of-the-art research in the last decade has extensively focused on exploring beyond-CMOS technologies to build alternative MAJ/MIN gates. However, such emerging technologies are still immature and suffering considerably from variability. On the other hand, our novel FDSOI-based MAJ/MIN gates are based on mature CMOS commercial technologies. Our analysis of the proposed gates has been conducted using accurate SPICE simulations with an industry-compact transistor model, BSIM-IMG, calibrated for an industrial 14nm FDSOI technology. Using our developed MAJ/MIN synthesis and error injection framework called MAJinBoo, we demonstrate that MAJ/MIN-based circuits exhibit an outstanding resiliency against errors due to the inherent voting-based computing. This encourages the employment of our MAJ/MIN gates in safety-critical applications where reliability is a prime concern. Our MAJinBoo framework is available at https://github.com/Brunno815/MAJinBoo.
- 3 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 71 (11) , 4748-4752
MAxPy: A Framework for Bridging Approximate Computing Circuits to Its Applications
This brief presents MAxPy, a framework for bridging approximate computing (AxC) circuit design to its applications. MAxPy is an application-agnostic framework able to automatically build a cycle-accurate Python model of an approximate hardware design. This model can easily be emulated and integrated as a module in Python-based applications. We are herein proposing this framework aiming to build an AxC toolbox stimulating open research in academia to promote the integration of the existing and future open-source (i) AxC benchmarks, (ii) approximate logic synthesis tools, and (iii) approximate arithmetic unit insights. In this brief, we demonstrate the use of MAxPy to explore the AxC design space of a Sobel filter hardware design as a case study exploiting a set of approximate adders combined with the data-driven approximate logic synthesis via probabilistic pruning. Then, we present a Pareto front for circuit area, energy, and delay reduction versus the application-level metrics: edge detection accuracy and structural similarity index (SSIM). The Pareto front results of the multiple AxC techniques herein explored show circuit area savings ranging from 40.4% to 59.1% for a 98.1% to 99.6% accuracy on edge detection application. MAxPy code is open source in: github.com/MAxPy-Project.
- 3 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 71 (11) , 4748-4752
MAxPy: A Framework for Bridging Approximate Computing Circuits to Its Applications
This brief presents MAxPy, a framework for bridging approximate computing (AxC) circuit design to its applications. MAxPy is an application-agnostic framework able to automatically build a cycle-accurate Python model of an approximate hardware design. This model can easily be emulated and integrated as a module in Python-based applications. We are herein proposing this framework aiming to build an AxC toolbox stimulating open research in academia to promote the integration of the existing and future open-source (i) AxC benchmarks, (ii) approximate logic synthesis tools, and (iii) approximate arithmetic unit insights. In this brief, we demonstrate the use of MAxPy to explore the AxC design space of a Sobel filter hardware design as a case study exploiting a set of approximate adders combined with the data-driven approximate logic synthesis via probabilistic pruning. Then, we present a Pareto front for circuit area, energy, and delay reduction versus the application-level metrics: edge detection accuracy and structural similarity index (SSIM). The Pareto front results of the multiple AxC techniques herein explored show circuit area savings ranging from 40.4% to 59.1% for a 98.1% to 99.6% accuracy on edge detection application. MAxPy code is open source in: github.com/MAxPy-Project.