AMAli Mahani

Ali Mahani

*This is an algorithmically generated author record based on publicly available information.

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


Ali Mahani has a total of 86 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    scaleTRIM: Scalable TRuncation-Based Integer Approximate Multiplier With Linearization and Compensation

    by Ebrahim Farahmand, Mohammad Javad Askarizadeh, Ali Mahani, Behnam Ghavami, Hassan Ghasemzadeh, Muhammad Abdullah Hanif, Muhammad Shafique

    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.


  • A RISC-V Accelerator for Sequence Decoding in Mobile DNA Sequencers

    by Amin Savari, Ali Mahani, Ebrahim Ghafar-Zadeh, Sebastian Magierowski

    Modern nanopore sequencers generate raw signal data at high speed, demanding low-latency and energy-efficient basecalling pipelines to enable fully portable genomic analysis. In this work, we present a hardware accelerator for the Viterbi-based connectionist temporal classification (CTC) decoding stage of basecalling—a key bottleneck in translating neural network outputs into deoxyribonucleic acid (DNA) sequences. Our design is the first pipelined CTC Viterbi decoder architecture tailored for nanopore sequencing and is implemented on a Xilinx Virtex-7 (VC707) FPGA within a Linux-capable reduced instruction set computer-fifth generation (RISC-V) system-on-chip (SoC). The accelerator processes over 23 000 DNA bases per second at 100 MHz with about $4.3~\boldsymbol {\mu }$ s per-sample latency and only 0.43-W overhead power. This corresponds to $\textbf {5.3}\times \mathbf {10^{4}}$ bases/J ( $19~\boldsymbol {\mu }$ J/base) and yields approximately 7x end-to-end speedup over a CPU baseline, while reserving the baseline read-identity accuracy. For the same CTC task, the accelerator delivers 29x higher throughput than a recent FPGA beam-search decoder. These results demonstrate the viability of dedicated decoding accelerators for real time, on-device genomic processing in power-constrained environments.


  • Open Access

    An Edge-Based WiFi Fingerprinting Indoor Localization Using Convolutional Neural Network and Convolutional Auto-Encoder

    by Amin Kargar-Barzi, Ebrahim Farahmand, Nooshin Taheri Chatrudi, Ali Mahani, Muhammad Shafique

    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

    Design and Analysis of High Performance Heterogeneous Block-based Approximate Adders

    by Ebrahim Farahmand, Ali Mahani, Muhammad Abdullah Hanif, Muhammad Shafique

    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.


  • Open Access

    Design and Analysis of High Performance Heterogeneous Block-based Approximate Adders

    by Ebrahim Farahmand, Ali Mahani, Muhammad Abdullah Hanif, Muhammad Shafique

    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 towards designing approximate adders that can offer better efficiency than conventional designs, however, at the cost of some accuracy loss. In this paper, we highlight a new class of energy-efficient approximate adders, namely Heterogeneous Block-based Approximate Adders (HBAA), 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 trade-off 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.

  • Open Access

    Strengthened 32‐bit AES implementation: Architectural error correction configuration with a new voting scheme

    by Saeideh Sheikhpur, Mahdi Taheri, Mohammad Saeed Ansari, Ali Mahani

    Digital data transmission is day by day more vulnerable to both malicious and natural faults. With an aim to assure reliability, security and privacy in communication, a low‐cost fault resilient architecture for Advanced Encryption Standard (AES) is proposed. In order not to degrade the reliability of our AES architecture, the reliability of voter is very important, for which reason we have introduced a novel voting scheme include a majority voter (named TMR voter) and an error barrier element (named DMR voter). In this paper, a reliable and secure 32‐bit data‐path AES implementation based on our robust fault resilient approach is developed. We illustrate that the proposed architecture can tolerate up to triple‐bit (byte) simultaneous faults at each pipeline stage’s logic and verify our claim through extensive error simulations. Error simulation results also show that our architecture achieves close to 100% fault‐masking capability for multiple‐bit (byte) faults. Finally, it is shown that the Application‐Specific Integrated Circuit implementation of the fault‐tolerant architectures using the composite field‐based S‐box, CFB‐AES, and ROM‐based S‐box, RB‐AES allows better area usage, throughput and fault resilience trade‐off compared to their counterparts. So, it provides the most appropriate features to be used in highly‐secure resource‐constraint applications.


  • Open Access

    Hardware acceleration of the novel two dimensional Burrows‐Wheeler Aligner algorithm with maximal exact matches seed extension kernel

    by Mahdi Taheri, Mohammad Saeed Ansari, Sebastian Magierowski, Ali Mahani

    Next‐generation sequencing techniques have dramatically increased the amount of genomic data being sequenced, which calls for the acceleration of the alignment algorithms. This article proposes an FPGA‐based accelerated implementation of the seed extension kernel of the Burrows–Wheeler alignment genomic mapping algorithm. The well‐known Smith–Waterman algorithm is used during the seed extension to find the optimum alignment between the sequences. The state‐of‐the‐art architectures in the literature use one‐dimensional (1‐D) systolic arrays to fill a similarity matrix, based on the best score out of all match combinations, mismatches and gaps are computed. The cells on the same anti‐diagonal are computed in parallel in these architectures. We propose a novel 2‐dimensional architecture in which all the cells on the same rows and the same columns are computed in parallel and, thereby, significantly accelerated the process. The similarity matrix cells are computed in two phases: (1) the calculation phase and (2) error compensation phase. The calculation phase roughly approximate the cell values and the approximation error is fixed up during the error compensation phase. Our simulation results show that the proposed architecture can be up to 718x and 1.7x faster than the software execution and the 1‐D systolic arrays, respectively.