Mervat Mohamed Adel Mahmoud
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mervat Mohamed Adel Mahmoud has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Nahla Elazab Elashker
Microelectronics Department, Electronics Research Institute, Cairo, Egypt
4 shared publications - Hebatullah H. Draz
Microelectronics Department, Electronics Research Institute, Cairo, Egypt
2 shared publications - Abeer Farouk Ali
Electronics Research Institute, Cairo, Egypt
1 shared publication - Ahmed Fawzy
Nanotechnology Central Lab, Electronics Research Institute, Elbahth Elelmly St. from Joseph Tito, El Nozha El Gedida, Cairo 11843, Egypt
1 shared publication - Ahmed Matar
Electronics and Electrical Communications Engineering Cairo University Giza Egypt
1 shared publication - Dalia A. El-Dib
Electronic Research Institute, Cairo, Egypt
1 shared publication
Latest Publications
- 5 September 2026
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 82 (14) , 695
PipSORE: pipelined AES hardware design with shared one-round key expansion
- 5 September 2026
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 82 (14) , 695
PipSORE: pipelined AES hardware design with shared one-round key expansion
- Open Access
- 21 June 2026
- Published by Springer Nature in Scientific Reports
- Vol. 16 (1)
A scalable security co-processor design for IoT applications
The development and implementation of scalable and efficient security solutions have become a critical area of focus in cybersecurity research and practice. This trend is receiving more attention lately due to the increasing frequency and sophistication of cyber threats to Internet of Things (IoT) networks. This paper proposes a novel cryptographic co-processor architecture based on RISC-V, designed to offer both high efficiency and flexibility for IoT applications. The design introduces a generic interface for cipher blocks, supports parallel execution of cipher operations, and avoids custom modifications to the RISC-V instruction set architecture. The proposed design extends the RISC-V architecture without new instruction sets to support AES-128 and SHA-256 operations, demonstrating its capabilities through these ciphering blocks. The new processor architecture ensures efficient data transfers between memory and cipher units, without delaying the processor pipeline, by utilizing Memory-Mapped I/O (MMIO) and Direct Memory Access (DMA) modules to optimize data handling. The proposed design is implemented and verified on the Xilinx ZCU-102 FPGA board using the Vivado 2022.2 tool. The proposed design achieves throughput rates of 8.2 Gbps for the AES-128 cipher block and 482 Mbps for the SHA-256 cipher block, operating at a relatively low system clock frequency of 64 MHz. The throughput is calculated based on the core cycle count of each algorithm, as this metric is commonly adopted in the literature. Nevertheless, the total end-to-end cycles of the proposed design equal the core cycles plus the serializer and deserializer cycles. The cycle count of the serializer/deserializer depends only on the processor’s data bus width. Also, the total power consumption of the proposed design is 1.575 watts. Achieving such high throughput at this reduced frequency is significant as it helps designers better minimize the power consumption, thereby enhancing the overall energy efficiency and performance of the system.
- 21 June 2026
- Published by Springer Nature in Scientific Reports
- Vol. 16 (1)
Open AccessA scalable security co-processor design for IoT applications
The development and implementation of scalable and efficient security solutions have become a critical area of focus in cybersecurity research and practice. This trend is receiving more attention lately due to the increasing frequency and sophistication of cyber threats to Internet of Things (IoT) networks. This paper proposes a novel cryptographic co-processor architecture based on RISC-V, designed to offer both high efficiency and flexibility for IoT applications. The design introduces a generic interface for cipher blocks, supports parallel execution of cipher operations, and avoids custom modifications to the RISC-V instruction set architecture. The proposed design extends the RISC-V architecture without new instruction sets to support AES-128 and SHA-256 operations, demonstrating its capabilities through these ciphering blocks. The new processor architecture ensures efficient data transfers between memory and cipher units, without delaying the processor pipeline, by utilizing Memory-Mapped I/O (MMIO) and Direct Memory Access (DMA) modules to optimize data handling. The proposed design is implemented and verified on the Xilinx ZCU-102 FPGA board using the Vivado 2022.2 tool. The proposed design achieves throughput rates of 8.2 Gbps for the AES-128 cipher block and 482 Mbps for the SHA-256 cipher block, operating at a relatively low system clock frequency of 64 MHz. The throughput is calculated based on the core cycle count of each algorithm, as this metric is commonly adopted in the literature. Nevertheless, the total end-to-end cycles of the proposed design equal the core cycles plus the serializer and deserializer cycles. The cycle count of the serializer/deserializer depends only on the processor’s data bus width. Also, the total power consumption of the proposed design is 1.575 watts. Achieving such high throughput at this reduced frequency is significant as it helps designers better minimize the power consumption, thereby enhancing the overall energy efficiency and performance of the system.
- Open Access
FPGA-based Lane Detection System incorporating Temperature and Light Control Units
Intelligent vehicles are one of the most important outcomes gained from the world tendency toward automation. Applications of IVs, whether in urban roads or robot tracks, do prioritize lane path detection. This paper proposes an FPGA-based Lane Detector Vehicle LDV architecture that relies on the Sobel algorithm for edge detection. Operating on 416 x 416 images and 150 MHz, the system can generate a valid output every 1.17 ms. The valid output consists of the number of present lanes, the current lane index, as well as its right and left boundaries. Additionally, the automated light and temperature control units in the proposed system enhance its adaptability to the surrounding environmental conditions.
Open AccessFPGA-based Lane Detection System incorporating Temperature and Light Control Units
Intelligent vehicles are one of the most important outcomes gained from the world tendency toward automation. Applications of IVs, whether in urban roads or robot tracks, do prioritize lane path detection. This paper proposes an FPGA-based Lane Detector Vehicle LDV architecture that relies on the Sobel algorithm for edge detection. Operating on 416 x 416 images and 150 MHz, the system can generate a valid output every 1.17 ms. The valid output consists of the number of present lanes, the current lane index, as well as its right and left boundaries. Additionally, the automated light and temperature control units in the proposed system enhance its adaptability to the surrounding environmental conditions.
- 20 February 2025
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 44 (7) , 4774-4795
Precise Hardware Implementation of Directional Median Filter with Energy-Saving
- 20 February 2025
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 44 (7) , 4774-4795
Precise Hardware Implementation of Directional Median Filter with Energy-Saving
- Open Access
Accelerating Deep Learning-Based Morphological Biometric Recognition with Field-Programmable Gate Arrays
Convolutional neural networks (CNNs) are increasingly recognized as an important and potent artificial intelligence approach, widely employed in many computer vision applications, such as facial recognition. Their importance resides in their capacity to acquire hierarchical features, which is essential for recognizing complex patterns. Nevertheless, the intricate architectural design of CNNs leads to significant computing requirements. To tackle these issues, it is essential to construct a system based on field-programmable gate arrays (FPGAs) to speed up CNNs. FPGAs provide fast development capabilities, energy efficiency, decreased latency, and advanced reconfigurability. A facial recognition solution by leveraging deep learning and subsequently deploying it on an FPGA platform is suggested. The system detects whether a person has the necessary authorization to enter/access a place. The FPGA is responsible for processing this system with utmost security and without any internet connectivity. Various facial recognition networks are accomplished, including AlexNet, ResNet, and VGG-16 networks. The findings of the proposed method prove that the GoogLeNet network is the best fit due to its lower computational resource requirements, speed, and accuracy. The system was deployed on three hardware kits to appraise the performance of different programming approaches in terms of accuracy, latency, cost, and power consumption. The software programming on the Raspberry Pi-3B kit had a recognition accuracy of around 70–75% and relied on a stable internet connection for processing. This dependency on internet connectivity increases bandwidth consumption and fails to meet the required security criteria, contrary to ZYBO-Z7 board hardware programming. Nevertheless, the hardware/software co-design on the PYNQ-Z2 board achieved an accuracy rate of 85% to 87%. It operates independently of an internet connection, making it a standalone system and saving costs.
Open AccessAccelerating Deep Learning-Based Morphological Biometric Recognition with Field-Programmable Gate Arrays
Convolutional neural networks (CNNs) are increasingly recognized as an important and potent artificial intelligence approach, widely employed in many computer vision applications, such as facial recognition. Their importance resides in their capacity to acquire hierarchical features, which is essential for recognizing complex patterns. Nevertheless, the intricate architectural design of CNNs leads to significant computing requirements. To tackle these issues, it is essential to construct a system based on field-programmable gate arrays (FPGAs) to speed up CNNs. FPGAs provide fast development capabilities, energy efficiency, decreased latency, and advanced reconfigurability. A facial recognition solution by leveraging deep learning and subsequently deploying it on an FPGA platform is suggested. The system detects whether a person has the necessary authorization to enter/access a place. The FPGA is responsible for processing this system with utmost security and without any internet connectivity. Various facial recognition networks are accomplished, including AlexNet, ResNet, and VGG-16 networks. The findings of the proposed method prove that the GoogLeNet network is the best fit due to its lower computational resource requirements, speed, and accuracy. The system was deployed on three hardware kits to appraise the performance of different programming approaches in terms of accuracy, latency, cost, and power consumption. The software programming on the Raspberry Pi-3B kit had a recognition accuracy of around 70–75% and relied on a stable internet connection for processing. This dependency on internet connectivity increases bandwidth consumption and fails to meet the required security criteria, contrary to ZYBO-Z7 board hardware programming. Nevertheless, the hardware/software co-design on the PYNQ-Z2 board achieved an accuracy rate of 85% to 87%. It operates independently of an internet connection, making it a standalone system and saving costs.
- Open Access
- 1 January 2025
- Published by Wiley in Journal of Electrical and Computer Engineering
- Vol. 2025 (1)
Binary Search‐Based Division (BSBD): A Technique for Efficient Division in Hardware
The division techniques play a key role in several computer‐implemented algorithms and applications; regrettably, they impose significant implementation constraints that hinder parallelization. The proposed binary search‐based division (BSBD) technique is inherited from the variable latency dividers, which have the potential to adjust the quotient bit’s retirement rate or the execution time in specific iterations, resulting in different conversion times across various dividend and divisor sets. This technique aims to accelerate the simple paper‐and‐pencil division by achieving significant latency reduction. This is accomplished by scanning more than one digit per iteration using the binary search algorithm on a sorted array due to the positional representation of a number. Binary search on an array is based on the divide‐and‐conquer concept, which breaks a problem into smaller subproblems that are addressed independently. A flowchart and a block diagram describing the sequence of the algorithm are included. The design is verified through simulation using the Vivado tool. Subsequently, it is synthesized and implemented on the contemporary field programmable gate array (FPGA) version, Virtex UltraScale VCU108, with extracting its performance metrics. Additionally, the design is synthesized on Synopsys and Cadence tools for its application‐specific integrated circuit (ASIC) implementation using UMC 45 nm technology. Furthermore, it is synthesized using Virtex‐4 and Kintex‐7 FPGAs to evaluate its performance against the state‐of‐the‐art, considering the utilization of the identical FPGA chips, referenced in the literature. In this context, the comparisons reveal a significant improvement in division speed. The results also suggest that an integrated processing unit is the optimal environment for this division approach. The suggested hardware implementation technique for the division operation can achieve a latency of 1.3 ns and a chip area of 2,352 μm 2 using 45 nm UMC ASIC technology, operating at a frequency range of 0.769 GHz. This makes the BSBD technique suitable for high‐speed applications. On the other hand, for the FPGA implementation, the average area reduction by the BSBD technique represents a remarkable 93.98% compared to a recent novel design in the literature. With respect to the latency, the average latency reduction achieved by the BSBD design is 140.14 ns, which represents a 58.86% decrease compared to the recent divider in the literature.
- 1 January 2025
- Published by Wiley in Journal of Electrical and Computer Engineering
- Vol. 2025 (1)
Open AccessBinary Search‐Based Division (BSBD): A Technique for Efficient Division in Hardware
The division techniques play a key role in several computer‐implemented algorithms and applications; regrettably, they impose significant implementation constraints that hinder parallelization. The proposed binary search‐based division (BSBD) technique is inherited from the variable latency dividers, which have the potential to adjust the quotient bit’s retirement rate or the execution time in specific iterations, resulting in different conversion times across various dividend and divisor sets. This technique aims to accelerate the simple paper‐and‐pencil division by achieving significant latency reduction. This is accomplished by scanning more than one digit per iteration using the binary search algorithm on a sorted array due to the positional representation of a number. Binary search on an array is based on the divide‐and‐conquer concept, which breaks a problem into smaller subproblems that are addressed independently. A flowchart and a block diagram describing the sequence of the algorithm are included. The design is verified through simulation using the Vivado tool. Subsequently, it is synthesized and implemented on the contemporary field programmable gate array (FPGA) version, Virtex UltraScale VCU108, with extracting its performance metrics. Additionally, the design is synthesized on Synopsys and Cadence tools for its application‐specific integrated circuit (ASIC) implementation using UMC 45 nm technology. Furthermore, it is synthesized using Virtex‐4 and Kintex‐7 FPGAs to evaluate its performance against the state‐of‐the‐art, considering the utilization of the identical FPGA chips, referenced in the literature. In this context, the comparisons reveal a significant improvement in division speed. The results also suggest that an integrated processing unit is the optimal environment for this division approach. The suggested hardware implementation technique for the division operation can achieve a latency of 1.3 ns and a chip area of 2,352 μm 2 using 45 nm UMC ASIC technology, operating at a frequency range of 0.769 GHz. This makes the BSBD technique suitable for high‐speed applications. On the other hand, for the FPGA implementation, the average area reduction by the BSBD technique represents a remarkable 93.98% compared to a recent novel design in the literature. With respect to the latency, the average latency reduction achieved by the BSBD design is 140.14 ns, which represents a 58.86% decrease compared to the recent divider in the literature.
- Open Access
- 5 July 2024
- Published by Science Publishing Group in Applied and Computational Mathematics
- Vol. 13 (4) , 83-93
Novel Integer Division for Embedded Systems: Generic Algorithm Optimal for Large Divisors
The integer Constant Division (ICD) is the type of integer division in which the divisor is known in advance, enabling pre-computing operations to be included. Therefore, it can be more efficient regarding computing resources and time. However, most ICD techniques are restricted by a few values or narrow boundaries for the divisor. On the other hand, the main approaches of the division algorithms, where the divisor is variable, are digit-by-digit and convergence methods. The first techniques are simple and have less sophisticated conversion logic for the quotient but also have the problem of taking significantly long latency. On the contrary, the convergence techniques rely on multiplication rather than subtraction. They estimate the quotient of division providing the quotient with minimal latency at the expense of precision. This article suggests a precise, generic, and novel integer division algorithm based on sequential recursion with fewer iterations. The suggested methodology relies on extracting the division results for non-powers-of-two divisors from those for the closest power-of-two divisors, which are obtained simply using the right bit shifting. To the authors’ best knowledge of the state-of-the-art, the number of iterations in the recurrent variable division is half the divisor bit size, and the Sweeney, Robertson, and Tocher (SRT) division, which is named after its developers, involves log 2 (n) iterations. The suggested algorithm has an [(m/(n-1))-1] number of recursive iterations, where m and n are the number of bits of the dividend and the divisor, respectively. The design is simulated in the Vivado tool for validation and implemented with a Zynq UltraScale FPGA. The technique performance depends on the number of nested divisions and the size of a LUT. The two factors change according to the value of the divisor. Nevertheless, the size of the LUT is proportional to the range and the number of bits of the divisor. Furthermore, the equation that controls the number of nested blocks is illustrated in the manuscript. The proposed technique applies to both constant and variable divisors with a compact hardware area in the case of constant division. The hardware implementation of constant division has unlimited values for dividends and divisors with a compact hardware area in the case of large divisors. However, using the design in the hardware implementation of variable division is up to 64-bit dividend and 12-bit divisor. The result analysis demonstrates that this algorithm is more efficient for constant division for large numbers.
- 5 July 2024
- Published by Science Publishing Group in Applied and Computational Mathematics
- Vol. 13 (4) , 83-93
Open AccessNovel Integer Division for Embedded Systems: Generic Algorithm Optimal for Large Divisors
The integer Constant Division (ICD) is the type of integer division in which the divisor is known in advance, enabling pre-computing operations to be included. Therefore, it can be more efficient regarding computing resources and time. However, most ICD techniques are restricted by a few values or narrow boundaries for the divisor. On the other hand, the main approaches of the division algorithms, where the divisor is variable, are digit-by-digit and convergence methods. The first techniques are simple and have less sophisticated conversion logic for the quotient but also have the problem of taking significantly long latency. On the contrary, the convergence techniques rely on multiplication rather than subtraction. They estimate the quotient of division providing the quotient with minimal latency at the expense of precision. This article suggests a precise, generic, and novel integer division algorithm based on sequential recursion with fewer iterations. The suggested methodology relies on extracting the division results for non-powers-of-two divisors from those for the closest power-of-two divisors, which are obtained simply using the right bit shifting. To the authors’ best knowledge of the state-of-the-art, the number of iterations in the recurrent variable division is half the divisor bit size, and the Sweeney, Robertson, and Tocher (SRT) division, which is named after its developers, involves log 2 (n) iterations. The suggested algorithm has an [(m/(n-1))-1] number of recursive iterations, where m and n are the number of bits of the dividend and the divisor, respectively. The design is simulated in the Vivado tool for validation and implemented with a Zynq UltraScale FPGA. The technique performance depends on the number of nested divisions and the size of a LUT. The two factors change according to the value of the divisor. Nevertheless, the size of the LUT is proportional to the range and the number of bits of the divisor. Furthermore, the equation that controls the number of nested blocks is illustrated in the manuscript. The proposed technique applies to both constant and variable divisors with a compact hardware area in the case of constant division. The hardware implementation of constant division has unlimited values for dividends and divisors with a compact hardware area in the case of large divisors. However, using the design in the hardware implementation of variable division is up to 64-bit dividend and 12-bit divisor. The result analysis demonstrates that this algorithm is more efficient for constant division for large numbers.
- Open Access
- 4 March 2024
- Published by Akademia Baru Publishing in Journal of Advanced Research in Applied Sciences and Engineering Technology
- Vol. 41 (1) , 168-178
Implementing Deep Reinforcement Learning in Autonomous Control Systems
Developing a safe and reliable autonomous vehicle has been a significant focus in recent years. Supervised learning methods require large amounts of labelled data for training, making it expensive. The performance of these agents is limited to the data provided in training and the inability to generalize performance in different environments. In addition, some driving situations, such as near-accident scenarios, are difficult to cover in the training data. As a result, the autonomous driving agent may behave unexpectedly in safety-critical situations, making it unreliable for safe transportation. Reinforcement learning is a potential solution for these issues. This research paper explores the potential of applying deep reinforcement learning techniques to autonomous driving, with a spotlight on comparing two popular deep reinforcement learning algorithms: Deep Q-Network (DQN) and Deep Deterministic Policy Gradient (DDPG). The study uses the CARLA simulator, which provides a realistic environment and conditions for testing autonomous driving algorithms. The study finds that DDPG outperforms DQN regarding average reward, but DQN performs better regarding collision rate.
- 4 March 2024
- Published by Akademia Baru Publishing in Journal of Advanced Research in Applied Sciences and Engineering Technology
- Vol. 41 (1) , 168-178
Open AccessImplementing Deep Reinforcement Learning in Autonomous Control Systems
Developing a safe and reliable autonomous vehicle has been a significant focus in recent years. Supervised learning methods require large amounts of labelled data for training, making it expensive. The performance of these agents is limited to the data provided in training and the inability to generalize performance in different environments. In addition, some driving situations, such as near-accident scenarios, are difficult to cover in the training data. As a result, the autonomous driving agent may behave unexpectedly in safety-critical situations, making it unreliable for safe transportation. Reinforcement learning is a potential solution for these issues. This research paper explores the potential of applying deep reinforcement learning techniques to autonomous driving, with a spotlight on comparing two popular deep reinforcement learning algorithms: Deep Q-Network (DQN) and Deep Deterministic Policy Gradient (DDPG). The study uses the CARLA simulator, which provides a realistic environment and conditions for testing autonomous driving algorithms. The study finds that DDPG outperforms DQN regarding average reward, but DQN performs better regarding collision rate.
- Open Access
- 17 April 2023
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 42 (9) , 5545-5558
Optimized Algorithms and Hardware Implementation of Median Filter for Image Processing
Image processing algorithms are essential for clarifying the image and improving the ability to recognize distinct characteristics of the image. The field of digital image processing is widespread in several research and technology applications. In many of these applications, the existence of impulsive noise in the obtained images is one of the most frequent problems. The median filter is a strong method to remove the impulsive noise; it effectively eliminates salt and pepper noise from the image. The main target of this paper is to investigate efficient median filter units to be connected to a general-purpose processor (GPP) for FPGA-based embedded systems. The paper exposes three novel techniques, two of them specially for median filtering techniques and the third one is used to get the maximum number of any 9 elements array. The proposed algorithms are inspired by the Median Of Median (MOM) algorithm. The first two techniques are tested for filtering $$3 \times 3$$ image windows and optimized for producing the expected result in high accuracy, short time, and reduced number of comparisons. The last technique is tested for a 9 elements array for extracting the maximum number in same high efficiency manner. Furthermore, the three proposed techniques are implemented leveraging the advantage of the parallel processing and the FPGA flexible resources to satisfy the real-time processing constraints. A comparison between the first two proposed filtering units and their counterparts in the literature is included. The comparison reveals the superiority of the first technique in terms of accuracy with fewer comparators than previously published techniques. Besides, the paper illustrates how the concept beyond the proposed techniques can be used to perform the maximum pooling for convolution neural networks.- 17 April 2023
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 42 (9) , 5545-5558
Open AccessOptimized Algorithms and Hardware Implementation of Median Filter for Image Processing
Image processing algorithms are essential for clarifying the image and improving the ability to recognize distinct characteristics of the image. The field of digital image processing is widespread in several research and technology applications. In many of these applications, the existence of impulsive noise in the obtained images is one of the most frequent problems. The median filter is a strong method to remove the impulsive noise; it effectively eliminates salt and pepper noise from the image. The main target of this paper is to investigate efficient median filter units to be connected to a general-purpose processor (GPP) for FPGA-based embedded systems. The paper exposes three novel techniques, two of them specially for median filtering techniques and the third one is used to get the maximum number of any 9 elements array. The proposed algorithms are inspired by the Median Of Median (MOM) algorithm. The first two techniques are tested for filtering $$3 \times 3$$ image windows and optimized for producing the expected result in high accuracy, short time, and reduced number of comparisons. The last technique is tested for a 9 elements array for extracting the maximum number in same high efficiency manner. Furthermore, the three proposed techniques are implemented leveraging the advantage of the parallel processing and the FPGA flexible resources to satisfy the real-time processing constraints. A comparison between the first two proposed filtering units and their counterparts in the literature is included. The comparison reveals the superiority of the first technique in terms of accuracy with fewer comparators than previously published techniques. Besides, the paper illustrates how the concept beyond the proposed techniques can be used to perform the maximum pooling for convolution neural networks. - Open Access
- 19 March 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 28 (3) , 1-21
Low-energy Pipelined Hardware Design for Approximate Medium Filter
Image and video processing algorithms are currently crucial for many applications. Hardware implementation of these algorithms provides higher speed for large computation applications. Removing noise is often a typical pre-processing step to enhance the results of later analysis and processing. Median filter is a typical nonlinear filter that is very commonly used for impulse noise elimination in digital image processing. This article suggests a low-energy median filter hardware design for battery-based hardware applications. An approximate solution with high accuracy is investigated to speed up the filtering operation, reduce the area, and consume less power/energy. Pipelining and parallelism are used to optimize the speed and power of this technique. Non-pipelined, two different pipelined structures, and two parallel architectures versions are designed. The design versions are implemented first with a Virtex-5 LX110T FPGA and then using the UMC 130nm standard cell ASIC technology. The selection and the even-odd sorting-based median filters are also implemented for an equitable comparison with the standard median filtering techniques. The suggested non-pipelined median filter design enhances the throughput 35% more than the highest investigated state of the art. The pipelining enhances the throughput to more than twice its value. Additionally, the parallel architecture decreases the area and the consumed power by around 40%. The simulation results reveal that one of the suggested designs significantly decreases the area, with the same speed as the fastest design in the literature, without noticeably degrading the accuracy, and a significant decrease in energy consumption by about 60%.
- 19 March 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 28 (3) , 1-21
Open AccessLow-energy Pipelined Hardware Design for Approximate Medium Filter
Image and video processing algorithms are currently crucial for many applications. Hardware implementation of these algorithms provides higher speed for large computation applications. Removing noise is often a typical pre-processing step to enhance the results of later analysis and processing. Median filter is a typical nonlinear filter that is very commonly used for impulse noise elimination in digital image processing. This article suggests a low-energy median filter hardware design for battery-based hardware applications. An approximate solution with high accuracy is investigated to speed up the filtering operation, reduce the area, and consume less power/energy. Pipelining and parallelism are used to optimize the speed and power of this technique. Non-pipelined, two different pipelined structures, and two parallel architectures versions are designed. The design versions are implemented first with a Virtex-5 LX110T FPGA and then using the UMC 130nm standard cell ASIC technology. The selection and the even-odd sorting-based median filters are also implemented for an equitable comparison with the standard median filtering techniques. The suggested non-pipelined median filter design enhances the throughput 35% more than the highest investigated state of the art. The pipelining enhances the throughput to more than twice its value. Additionally, the parallel architecture decreases the area and the consumed power by around 40%. The simulation results reveal that one of the suggested designs significantly decreases the area, with the same speed as the fastest design in the literature, without noticeably degrading the accuracy, and a significant decrease in energy consumption by about 60%.