Ayad M. Dalloo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Ayad M. Dalloo has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Alberto Garcia-Ortiz
ITEM, University of Bremen, Bremen, Germany
2 shared publications Amjad J. Humaidi
2 shared publications- Ammar K. Al Mhdawi
School of Engineering and Sustainable Development, Electrical, Electronics and Mechatronics Group, De Montfort University, LE1 9BH Leicester, United Kingdom
2 shared publications - Hamed Al-Raweshidy
Department of Electronic and Electrical Engineering, College of Engineering, Design and Physical Sciences, Brunel University of London, Uxbridge, U.K.
2 shared publications - Sulaf Waiss
M. Sc in Electrical communication Eng., Bremen, Germany
2 shared publications Abdulkareem Sh. Mahdi Al-Obaidi
1 shared publication
Latest Publications
- Open Access
- 8 January 2026
- Published by Elsevier in Franklin Open
- Vol. 15
An Optimized Twofold LUT architecture for fast function approximation
- 8 January 2026
- Published by Elsevier in Franklin Open
- Vol. 15
Open AccessAn Optimized Twofold LUT architecture for fast function approximation
- Open Access
- 19 November 2024
- Published by Elsevier in Results in Engineering
- Vol. 24
Optimizing Machine Learning Models with Data-level Approximate Computing: The Role of Diverse Sampling, Precision Scaling, Quantization and Feature Selection Strategies
- 19 November 2024
- Published by Elsevier in Results in Engineering
- Vol. 24
Open AccessOptimizing Machine Learning Models with Data-level Approximate Computing: The Role of Diverse Sampling, Precision Scaling, Quantization and Feature Selection Strategies
- Top Cited PapersOpen Access
- 25 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 146022-146088
Approximate Computing: Concepts, Architectures, Challenges, Applications, and Future Directions
The unprecedented progress in computational technologies led to a substantial proliferation of artificial intelligence applications, notably in the era of big data and IoT devices. In the face of exponential data growth and complex computations, conventional computing encounters substantial obstacles pertaining to energy efficiency, computational speed, and area. Due to the diminishing advantages of technology scaling and increased demands from computing workloads, novel design techniques are required to increase performance and decrease power consumption. Approximate computing, nowadays considered a promising paradigm, achieves considerable improvements in overhead cost reduction (i.e., energy, area, and latency) at the expense of a modest (i.e., still acceptable) deterioration in application accuracy. Therefore, approximate computing at different levels (Data, Circuit, Architecture, and Software) has been attracted by the research and industrial communities. This paper presents a comprehensive review of the major research areas of different levels of approximate computing by exploring their underlying principles, potential benefits, and associated trade-offs. This is a burgeoning field that seeks to balance computational efficiency with acceptable accuracy. The paper highlights opportunities where these techniques can be effectively applied, such as in applications where perfect accuracy is not a strict requirement. This paper presents assessments of applying approximate computing techniques in various applications, especially machine learning algorithms (ML) and IoT. Furthermore, this review underscores the challenges encountered in implementing approximate computing techniques and highlights potential future research avenues. The anticipation is that this survey will stimulate further discourse and underscore the necessity for continued research and development to fully exploit the potential of approximate computing.
- 25 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 146022-146088
Top Cited PapersOpen AccessApproximate Computing: Concepts, Architectures, Challenges, Applications, and Future Directions
The unprecedented progress in computational technologies led to a substantial proliferation of artificial intelligence applications, notably in the era of big data and IoT devices. In the face of exponential data growth and complex computations, conventional computing encounters substantial obstacles pertaining to energy efficiency, computational speed, and area. Due to the diminishing advantages of technology scaling and increased demands from computing workloads, novel design techniques are required to increase performance and decrease power consumption. Approximate computing, nowadays considered a promising paradigm, achieves considerable improvements in overhead cost reduction (i.e., energy, area, and latency) at the expense of a modest (i.e., still acceptable) deterioration in application accuracy. Therefore, approximate computing at different levels (Data, Circuit, Architecture, and Software) has been attracted by the research and industrial communities. This paper presents a comprehensive review of the major research areas of different levels of approximate computing by exploring their underlying principles, potential benefits, and associated trade-offs. This is a burgeoning field that seeks to balance computational efficiency with acceptable accuracy. The paper highlights opportunities where these techniques can be effectively applied, such as in applications where perfect accuracy is not a strict requirement. This paper presents assessments of applying approximate computing techniques in various applications, especially machine learning algorithms (ML) and IoT. Furthermore, this review underscores the challenges encountered in implementing approximate computing techniques and highlights potential future research avenues. The anticipation is that this survey will stimulate further discourse and underscore the necessity for continued research and development to fully exploit the potential of approximate computing.
- Open Access
- 9 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 24151-24163
Low-Power and Low-Latency Hardware Implementation of Approximate Hyperbolic and Exponential Functions for Embedded System Applications
The hyperbolic and exponential functions are widely used in various applications in engineering fields such as machine learning, IoT, signal processing, etc. To fulfill the needs of future applications effectively, this paper proposes a low-latency, low-power, acceptable accuracy and low-cost architecture for computing the approximate exponential function e ±x and, the hyperbolic functions sinh(x) and cosh(x) using a table-driven algorithm, named by Approximate Composited-Stair Function (ApproxCSF). By adopting a FPGA, the proposed design is realized and demonstrates significant improvements in terms of latency, hardware cost, power consumption, and MSE by 91%, 96%, 74%, and 99%, respectively, compared to the state-of-the-art. Xilinx Virtex-5/7 FPGAs have been employed throughout the functional verification and prototype processes. Compared to related works, it shows that the proposed architectures are much better for low-cost, and low-latency computations of exponential, hyperbolic functions than CORDIC, stochastic computation, and the Look-Up Table approaches. The source code is publicly available online.
- 9 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 24151-24163
Open AccessLow-Power and Low-Latency Hardware Implementation of Approximate Hyperbolic and Exponential Functions for Embedded System Applications
The hyperbolic and exponential functions are widely used in various applications in engineering fields such as machine learning, IoT, signal processing, etc. To fulfill the needs of future applications effectively, this paper proposes a low-latency, low-power, acceptable accuracy and low-cost architecture for computing the approximate exponential function e ±x and, the hyperbolic functions sinh(x) and cosh(x) using a table-driven algorithm, named by Approximate Composited-Stair Function (ApproxCSF). By adopting a FPGA, the proposed design is realized and demonstrates significant improvements in terms of latency, hardware cost, power consumption, and MSE by 91%, 96%, 74%, and 99%, respectively, compared to the state-of-the-art. Xilinx Virtex-5/7 FPGAs have been employed throughout the functional verification and prototype processes. Compared to related works, it shows that the proposed architectures are much better for low-cost, and low-latency computations of exponential, hyperbolic functions than CORDIC, stochastic computation, and the Look-Up Table approaches. The source code is publicly available online.
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Enhance the Segmentation Principle in Approximate Computing
Exploiting the trade-off between accuracy and hardware cost has a tremendous potential to improve the efficiency of integrated systems. Using this concept, numerous approximate adders have been proposed in the literature. This work generalizes and systematically optimizes an architectural template for approximate adders through the conception of Enhanced Segmentation Principle. The outcome, called optimized lower part constant-OR Feedback adder (OFLOCA). Furthermore, a new architecture of approximate adder is proposed which outperforms the all existing Segmented adders which the architecture called Feedback adder (FbA). Through the proposed template, all approximate adders are enhanced and optimized. For example, a 16-bit OFLOCA approximate adder implemented with precise in the higher-part improves the mean squared error and the mean absolute error by 30% and 11% respectively respect to the previously reported best architecture. Furthermore, the enhanced approximate adders outperform their original existing architectures. For functional verification and prototyping, a Xilinx Virtex-5 FPGA have been utilized. The synthesizable RTLs of all approximate adders in generic form are made open-source.
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Enhance the Segmentation Principle in Approximate Computing
Exploiting the trade-off between accuracy and hardware cost has a tremendous potential to improve the efficiency of integrated systems. Using this concept, numerous approximate adders have been proposed in the literature. This work generalizes and systematically optimizes an architectural template for approximate adders through the conception of Enhanced Segmentation Principle. The outcome, called optimized lower part constant-OR Feedback adder (OFLOCA). Furthermore, a new architecture of approximate adder is proposed which outperforms the all existing Segmented adders which the architecture called Feedback adder (FbA). Through the proposed template, all approximate adders are enhanced and optimized. For example, a 16-bit OFLOCA approximate adder implemented with precise in the higher-part improves the mean squared error and the mean absolute error by 30% and 11% respectively respect to the previously reported best architecture. Furthermore, the enhanced approximate adders outperform their original existing architectures. For functional verification and prototyping, a Xilinx Virtex-5 FPGA have been utilized. The synthesizable RTLs of all approximate adders in generic form are made open-source.
- Top Cited Papers
- 19 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 26 (8) , 1595-1599
Systematic Design of an Approximate Adder: The Optimized Lower Part Constant-OR Adder
Exploiting the tradeoff between accuracy and hardware cost has a tremendous potential to improve the efficiency of integrated systems. Using this concept, numerous approximate adders have been proposed in the last ten years. Although conceptually different, all previous architectures have been obtained with an ad hoc and nonsystematic methodology. Instead, this brief generalizes and systematically optimizes an architectural template for approximate adders. The outcome, called optimized lower part constant-OR adder (LOCA), outperforms previous approaches in terms of accuracy and hardware cost. For example, an 8-bit approximate adder implemented with our new approach improves the mean squared error by 58.5%, while simultaneously reducing the cost by 7.2% with respect to the previously reported best architecture.
- 19 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 26 (8) , 1595-1599
Top Cited PapersSystematic Design of an Approximate Adder: The Optimized Lower Part Constant-OR Adder
Exploiting the tradeoff between accuracy and hardware cost has a tremendous potential to improve the efficiency of integrated systems. Using this concept, numerous approximate adders have been proposed in the last ten years. Although conceptually different, all previous architectures have been obtained with an ad hoc and nonsystematic methodology. Instead, this brief generalizes and systematically optimizes an architectural template for approximate adders. The outcome, called optimized lower part constant-OR adder (LOCA), outperforms previous approaches in terms of accuracy and hardware cost. For example, an 8-bit approximate adder implemented with our new approach improves the mean squared error by 58.5%, while simultaneously reducing the cost by 7.2% with respect to the previously reported best architecture.
- 1 March 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
High-resolution ECG automated analysis and diagnosis
Electrocardiogram (ECG) recording is prone to complications, on analysis by physicians, due to noise and artifacts, thus creating ambiguity leading to possible error of diagnosis. Such drawbacks may be overcome with the advent of high resolution Methods, such as Discrete Wavelet Analysis and Digital Signal Processing (DSP) techniques. This ECG signal analysis is implemented in three stages: ECG preprocessing, features extraction and classification with the aim of realizing high resolution ECG diagnosis and improved detection of abnormal conditions in the heart. The preprocessing stage involves removing spurious artifacts (noise), due to such factors as muscle contraction, motion, respiration, etc. ECG features are extracted by applying DSP and suggested sloping method techniques. These measured features represent peak amplitude values and intervals of P, Q, R, S, R', and T waves on ECG, and other features such as ST elevation, QRS width, heart rate, electrical axis, QR and QT intervals. The classification is preformed using these extracted features and the criteria for cardiovascular diseases. The ECG diagnostic system is successfully applied to 12-lead ECG recordings for 12 cases. The system is provided with information to enable it diagnoses 15 different diseases. Physician's and computer's diagnoses are compared with 90% agreement, with respect to physician diagnosis, and the time taken for diagnosis is 2 seconds. All of these operations are programmed in Matlab environment.
- 1 March 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
High-resolution ECG automated analysis and diagnosis
Electrocardiogram (ECG) recording is prone to complications, on analysis by physicians, due to noise and artifacts, thus creating ambiguity leading to possible error of diagnosis. Such drawbacks may be overcome with the advent of high resolution Methods, such as Discrete Wavelet Analysis and Digital Signal Processing (DSP) techniques. This ECG signal analysis is implemented in three stages: ECG preprocessing, features extraction and classification with the aim of realizing high resolution ECG diagnosis and improved detection of abnormal conditions in the heart. The preprocessing stage involves removing spurious artifacts (noise), due to such factors as muscle contraction, motion, respiration, etc. ECG features are extracted by applying DSP and suggested sloping method techniques. These measured features represent peak amplitude values and intervals of P, Q, R, S, R', and T waves on ECG, and other features such as ST elevation, QRS width, heart rate, electrical axis, QR and QT intervals. The classification is preformed using these extracted features and the criteria for cardiovascular diseases. The ECG diagnostic system is successfully applied to 12-lead ECG recordings for 12 cases. The system is provided with information to enable it diagnoses 15 different diseases. Physician's and computer's diagnoses are compared with 90% agreement, with respect to physician diagnosis, and the time taken for diagnosis is 2 seconds. All of these operations are programmed in Matlab environment.
- 1 June 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
A programmable and reconfigurable core for binary image processing
Binary-image processing cores are extremely useful in many image and video applications such as object recognition, tracking, motion detection, and identification. To address the variety of applications and binary-image kernels, we propose an FPGA-based intellectual property core with enhanced flexibility: it is programmable, reconfigurable, and parameterizable. The core performs single binary image kernels (morphological operations) and even complete algorithms composed by sequences of operations; the algorithms' control does not require an external processor as in previous approaches. The reconfiguration features allow adapting the image size, structuring element, and even image parallelism for some operations at run-time. Finally, the parameterization allows defining the maximum image, feature, and command-buffer sizes as well as the number of pixel processing units at compile time. The careful combination of programmability, reconfigurability, and parameterization produces a flexible yet efficient binary-image processing architecture. A detailed experimental validation using a Virtex 5 platform assesses the advantages of the proposed architecture versus previous approaches. The results show that the core can process about 1500 frames per second for 32 operations for a 1024 × 1024 image and 5×5 structure-element at 100MHz frequency. The results demonstrate that the core is suitable for real-time binary image processing applications.
- 1 June 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
A programmable and reconfigurable core for binary image processing
Binary-image processing cores are extremely useful in many image and video applications such as object recognition, tracking, motion detection, and identification. To address the variety of applications and binary-image kernels, we propose an FPGA-based intellectual property core with enhanced flexibility: it is programmable, reconfigurable, and parameterizable. The core performs single binary image kernels (morphological operations) and even complete algorithms composed by sequences of operations; the algorithms' control does not require an external processor as in previous approaches. The reconfiguration features allow adapting the image size, structuring element, and even image parallelism for some operations at run-time. Finally, the parameterization allows defining the maximum image, feature, and command-buffer sizes as well as the number of pixel processing units at compile time. The careful combination of programmability, reconfigurability, and parameterization produces a flexible yet efficient binary-image processing architecture. A detailed experimental validation using a Virtex 5 platform assesses the advantages of the proposed architecture versus previous approaches. The results show that the core can process about 1500 frames per second for 32 operations for a 1024 × 1024 image and 5×5 structure-element at 100MHz frequency. The results demonstrate that the core is suitable for real-time binary image processing applications.