Ebrahim Farahmand
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
Research Subjects
Ebrahim Farahmand has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Ali Mahani
Department of Electrical Engineering, Shahid Bahonar University of Kerman, Kerman, Iran
4 shared publications - Hassan Ghasemzadeh
Arizona State University
3 shared publications - Muhammad Shafique
New York University Abu Dhabi (NYUAD)
3 shared publications - Muhammad Abdullah Hanif
New York University Abu Dhabi (NYUAD)
2 shared publications - Nooshin Taheri Chatrudi
Arizona State University
2 shared publications - Shovito Barua Soumma
Arizona State University
2 shared publications
Latest Publications
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (9) , 14737-14753
Hybrid Attention Model Using Feature Decomposition and Knowledge Distillation for Blood Glucose Forecasting
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (9) , 14737-14753
Hybrid Attention Model Using Feature Decomposition and Knowledge Distillation for Blood Glucose Forecasting
- Open Access
- 27 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 51108-51125
scaleTRIM: Scalable TRuncation-Based Integer Approximate Multiplier With Linearization and Compensation
In this paper, we propose a scalable approximate multiplier design, scaleTRIM, that approximates the multiplication operation using fitted linear functions, also referred to as linearization. We show that multiplication operations can be completely replaced by low-cost addition and bit-wise shift operations by exploiting linearization. Moreover, our proposed design utilizes a lookup table (LUT)-based compensation unit as a novel error-reduction method. In essence, input operands are truncated to a reduced bit-width representation (i.e., h bits) based on their leading-one positions. Then, a curve-fitting method is employed to map the product term to a linear function. Additionally, a piecewise constant error-correction term is used to reduce the approximation error. To compute the piecewise constant, we divide the function space into M segments and average the errors within each segment. In particular, our multiplier supports various degrees of truncation and error compensation to offer a range of accuracy-efficiency trade-offs. The proposed multiplier improves the Mean Relative Error Distance (MRED) by about 15.2% while satisfying the efficiency constraint and improves the Power Delay Product (PDP) by about 22.8% while satisfying the accuracy and efficiency constraints compared to different state-of-the-art approximate multipliers. From a usability perspective, our evaluation of the proposed design for image classification using Deep Neural Networks (DNNs) demonstrates that scaleTRIM offers a better accuracy-efficiency trade-off than state-of-the-art approximate multiplier designs.
- 27 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 51108-51125
Open AccessscaleTRIM: Scalable TRuncation-Based Integer Approximate Multiplier With Linearization and Compensation
In this paper, we propose a scalable approximate multiplier design, scaleTRIM, that approximates the multiplication operation using fitted linear functions, also referred to as linearization. We show that multiplication operations can be completely replaced by low-cost addition and bit-wise shift operations by exploiting linearization. Moreover, our proposed design utilizes a lookup table (LUT)-based compensation unit as a novel error-reduction method. In essence, input operands are truncated to a reduced bit-width representation (i.e., h bits) based on their leading-one positions. Then, a curve-fitting method is employed to map the product term to a linear function. Additionally, a piecewise constant error-correction term is used to reduce the approximation error. To compute the piecewise constant, we divide the function space into M segments and average the errors within each segment. In particular, our multiplier supports various degrees of truncation and error compensation to offer a range of accuracy-efficiency trade-offs. The proposed multiplier improves the Mean Relative Error Distance (MRED) by about 15.2% while satisfying the efficiency constraint and improves the Power Delay Product (PDP) by about 22.8% while satisfying the accuracy and efficiency constraints compared to different state-of-the-art approximate multipliers. From a usability perspective, our evaluation of the proposed design for image classification using Deep Neural Networks (DNNs) demonstrates that scaleTRIM offers a better accuracy-efficiency trade-off than state-of-the-art approximate multiplier designs.
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Engineering in Medicine and Biology
- Vol. 7, 241-249
Time-Aware Multimodal Sensor Fusion for Blood Glucose Forecasting in Non-Diabetic Adults
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Engineering in Medicine and Biology
- Vol. 7, 241-249
Open AccessTime-Aware Multimodal Sensor Fusion for Blood Glucose Forecasting in Non-Diabetic Adults
- 27 October 2025
- Published by Elsevier in Future Generation Computer Systems
- Vol. 176
Robust DCNN: The impact of approximate multipliers in defending against adversarial attacks
- 27 October 2025
- Published by Elsevier in Future Generation Computer Systems
- Vol. 176
Robust DCNN: The impact of approximate multipliers in defending against adversarial attacks
- Open Access
- 11 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 85050-85060
An Edge-Based WiFi Fingerprinting Indoor Localization Using Convolutional Neural Network and Convolutional Auto-Encoder
With the ongoing development of Indoor Location-Based Services, the location information of users in indoor environments has been a challenging issue in recent years. Due to the widespread use of WiFi networks, WiFi fingerprinting has become one of the most practical methods of locating mobile users. In addition to localization accuracy, some other critical factors such as latency, and users’ privacy should be considered in indoor localization systems. In this study, we propose a light Convolutional Neural Network-based method for edge devices (e.g. smartphones) to overcome the above issues by eliminating the need for a cloud/server in the localization system. The proposed method is evaluated for three different open datasets, i.e., UJIIndoorLoc, Tampere and UTSIndoorLoc, as well as for our collected dataset named SBUK-D to verify its scalability. We also evaluate performance efficiency of our localization method on an Android smartphone to demonstrate its applicability to edge devices. For UJIIndoorLoc dataset, our model obtains approximately 99% building accuracy, over 90% floor accuracy, and 9.5 m positioning mean error with the model size and inference time of 0.5 MB and 51 μs, respectively, which demonstrate high accuracy in range of state of the art works as well as amenability to the resource-constrained edge devices.
- 11 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 85050-85060
Open AccessAn Edge-Based WiFi Fingerprinting Indoor Localization Using Convolutional Neural Network and Convolutional Auto-Encoder
With the ongoing development of Indoor Location-Based Services, the location information of users in indoor environments has been a challenging issue in recent years. Due to the widespread use of WiFi networks, WiFi fingerprinting has become one of the most practical methods of locating mobile users. In addition to localization accuracy, some other critical factors such as latency, and users’ privacy should be considered in indoor localization systems. In this study, we propose a light Convolutional Neural Network-based method for edge devices (e.g. smartphones) to overcome the above issues by eliminating the need for a cloud/server in the localization system. The proposed method is evaluated for three different open datasets, i.e., UJIIndoorLoc, Tampere and UTSIndoorLoc, as well as for our collected dataset named SBUK-D to verify its scalability. We also evaluate performance efficiency of our localization method on an Android smartphone to demonstrate its applicability to edge devices. For UJIIndoorLoc dataset, our model obtains approximately 99% building accuracy, over 90% floor accuracy, and 9.5 m positioning mean error with the model size and inference time of 0.5 MB and 51 μs, respectively, which demonstrate high accuracy in range of state of the art works as well as amenability to the resource-constrained edge devices.
- Open Access
- 9 November 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 22 (6) , 1-32
Design and Analysis of High Performance Heterogeneous Block-based Approximate Adders
Approximate computing is an emerging paradigm to improve the power and performance efficiency of error-resilient applications. As adders are one of the key components in almost all processing systems, a significant amount of research has been carried out toward designing approximate adders that can offer better efficiency than conventional designs; however, at the cost of some accuracy loss. In this article, we highlight a new class of energy-efficient approximate adders, namely, Heterogeneous Block-based Approximate Adders (HBAAs), and propose a generic configurable adder model that can be configured to represent a particular HBAA configuration. An HBAA, in general, is composed of heterogeneous sub-adder blocks of equal length, where each sub-adder can be an approximate sub-adder and have a different configuration. The sub-adders are mainly approximated through inexact logic and carry truncation. Compared to the existing design space, HBAAs provide additional design points that fall on the Pareto-front and offer a better quality-efficiency tradeoff in certain scenarios. Furthermore, to enable efficient design space exploration based on user-defined constraints, we propose an analytical model to efficiently evaluate the Probability Mass Function (PMF) of approximation error and other error metrics, such as Mean Error Distance (MED), Normalized Mean Error Distance (NMED), and Error Rate (ER) of HBAAs. The results show that HBAA configurations can provide around 15% reduction in area and up to 17% reduction in energy compared to state-of-the-art approximate adders.
- 9 November 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 22 (6) , 1-32
Open AccessDesign and Analysis of High Performance Heterogeneous Block-based Approximate Adders
Approximate computing is an emerging paradigm to improve the power and performance efficiency of error-resilient applications. As adders are one of the key components in almost all processing systems, a significant amount of research has been carried out toward designing approximate adders that can offer better efficiency than conventional designs; however, at the cost of some accuracy loss. In this article, we highlight a new class of energy-efficient approximate adders, namely, Heterogeneous Block-based Approximate Adders (HBAAs), and propose a generic configurable adder model that can be configured to represent a particular HBAA configuration. An HBAA, in general, is composed of heterogeneous sub-adder blocks of equal length, where each sub-adder can be an approximate sub-adder and have a different configuration. The sub-adders are mainly approximated through inexact logic and carry truncation. Compared to the existing design space, HBAAs provide additional design points that fall on the Pareto-front and offer a better quality-efficiency tradeoff in certain scenarios. Furthermore, to enable efficient design space exploration based on user-defined constraints, we propose an analytical model to efficiently evaluate the Probability Mass Function (PMF) of approximation error and other error metrics, such as Mean Error Distance (MED), Normalized Mean Error Distance (NMED), and Error Rate (ER) of HBAAs. The results show that HBAA configurations can provide around 15% reduction in area and up to 17% reduction in energy compared to state-of-the-art approximate adders.
- 24 September 2020
- Published by World Scientific Pub Co Pte Ltd in International Journal of Computational Intelligence and Applications
- Vol. 19 (03)
A Novel Energy-Efficient Clustering Protocol Using Two-Stage Genetic Algorithm for Improving the Lifetime of Wireless Sensor Networks
Wireless sensor networks (WSNs) are beginning to be deployed at an accelerated pace, and they have attracted significant attention in a broad spectrum of applications. WSNs encompass a large number of sensor nodes enabling a base station (BS) to sense and transmit data over the area where WSN is spread. As most sensor nodes have a limited energy capacity and at the same time transmit critical information, enhancing the lifetime and the reliability of WSNs are essential factors in designing these networks. Among many approaches, clustering of sensor nodes has proved to be an effective method of reducing energy consumption and increasing lifetime of WSNs. In this paper, a new energy-efficient clustering protocol is implemented using a two-step Genetic Algorithm (GA). In the first step of GA, cluster heads (CHs) are selected, and in the second step, cluster members are chosen based on their distance to the selected CHs. Compared to other clustering protocols, the lifetime of WSNs in the proposed clustering is improved. This improvement is the consequence of the fact that this clustering considers energy efficient parameters in clustering protocol.
- 24 September 2020
- Published by World Scientific Pub Co Pte Ltd in International Journal of Computational Intelligence and Applications
- Vol. 19 (03)
A Novel Energy-Efficient Clustering Protocol Using Two-Stage Genetic Algorithm for Improving the Lifetime of Wireless Sensor Networks
Wireless sensor networks (WSNs) are beginning to be deployed at an accelerated pace, and they have attracted significant attention in a broad spectrum of applications. WSNs encompass a large number of sensor nodes enabling a base station (BS) to sense and transmit data over the area where WSN is spread. As most sensor nodes have a limited energy capacity and at the same time transmit critical information, enhancing the lifetime and the reliability of WSNs are essential factors in designing these networks. Among many approaches, clustering of sensor nodes has proved to be an effective method of reducing energy consumption and increasing lifetime of WSNs. In this paper, a new energy-efficient clustering protocol is implemented using a two-step Genetic Algorithm (GA). In the first step of GA, cluster heads (CHs) are selected, and in the second step, cluster members are chosen based on their distance to the selected CHs. Compared to other clustering protocols, the lifetime of WSNs in the proposed clustering is improved. This improvement is the consequence of the fact that this clustering considers energy efficient parameters in clustering protocol.