AAAli Afzali-Kusha

Ali Afzali-Kusha

*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 Afzali-Kusha has a total of 128 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    GEMA+: A Hardware Accelerator for Exact Sequence Mapping Using Learned Indexing with Reduced Sensitivity to Read Length

    by Mohaddeseh Sharei, Mehdi Kamal, Ali Afzali-Kusha, Massoud Pedram

    This article presents the GEMA+ sequence mapping technique, characterized by its minimal sensitivity to the length of input read sequences. Unlike previously proposed methods, including GEMA and other similar learned index mapping techniques, GEMA+ effectively addresses the challenge of non-uniformity in the ascending trend of the mapping speed with the increasing read length. This challenge is tackled by our innovative process that eliminates the need for padding, which has traditionally been a source of performance variability. GEMA+ retains the efficient data structures of the original GEMA, ensuring no additional memory overhead. Additionally, we propose modifications to the hardware architecture of GEMA, resulting in an efficient implementation of GEMA+ on FPGA devices. The performance of the proposed technique is evaluated through post place-and-route simulations, which reveal that GEMA+ achieves a consistent and uniform increase in mapping speed as read length increases. By reducing performance sensitivity to input sequence length, GEMA+ demonstrates an average performance improvement of 42.5% for short reads and 11.8% for long reads, compared with the original GEMA.

  • Enabling Memory-Augmented Neural Networks for Efficient Edge Applications

    by Elias Khatami Zenozian, Mehdi Kamal, Ali Afzali-Kusha, Massoud Pedram


  • GEMA: A Genome Exact Mapping Accelerator Based on Learned Indexes

    by Mohaddeseh Sharei, Mehdi Kamal, Ali Afzali-Kusha, Massoud Pedram

    In this article, we introduce GEMA, a genome exact mapping accelerator based on learned indexes, specifically designed for FPGA implementation. GEMA utilizes a machine learning (ML) algorithm to precisely locate the exact position of read sequences within the original sequence. To enhance the accuracy of the trained ML model, we incorporate data augmentation and data-distribution-aware partitioning techniques. Additionally, we present an efficient yet low-overhead error recovery technique. To map long reads more efficiently, we propose a speculative prefetching approach, which reduces the required memory bandwidth. Furthermore, we suggest an FPGA-based architecture for implementing the proposed mapping accelerator, optimizing the accesses to off-chip memory. Our studies demonstrate that GEMA achieves up to 1.36 × higher speed for short reads compared to the corresponding results reported in recently published exact mapping accelerators. Moreover, GEMA achieves up to ∼22 × faster mapping of long reads compared to the available results for the longest mapped reads using these accelerators.


  • Open Access

    Memristive-based Mixed-signal CGRA for Accelerating Deep Neural Network Inference

    by Reza Kazerooni-Zand, Mehdi Kamal, Ali Afzali-Kusha, Massoud Pedram

    In this paper, a mixed-signal coarse-grained reconfigurable architecture (CGRA) for accelerating inference in deep neural networks (DNNs) is presented. It is based on performing dot-product computations using analog computing to achieve a considerable speed improvement. Other computations are performed digitally. In the proposed structure (called MX-CGRA), analog tiles consisting of memristor crossbars are employed. To reduce the overhead of converting the data between analog and digital domains, we utilize a proper interface between the analog and digital tiles. In addition, the structure benefits from an efficient memory hierarchy where the data is moved as close as possible to the computing fabric. Moreover, to fully utilize the tiles, we define a set of micro instructions to configure the analog and digital domains. Corresponding context words used in the CGRA are determined by these instructions (generated by a companion compiler tool). The efficacy of the MX-CGRA is assessed by modeling the execution of state-of-the-art DNN architectures on this structure. The architectures are used to classify images of the ImageNet dataset. Simulation results show that, compared to the previous mixed-signal DNN accelerators, on average, a higher throughput of 2.35 × is achieved.


  • H2C-TM: A Hybrid High Coverage Test Method for Improving the Detection of HtD Faults in STT-MRAMs

    by Shiva Taghipour, Mehdi Kamal, Rahebeh Niaraki Asli, Ali Afzali-Kusha

    This paper proposes a design-for-testability (DFT) scheme and a test method to improve the detection of hard-to-detect (HtD) faults of STT-MRAMs. The proposed DFT scheme considers HtD faults which are undefined state faults (USFs). These states do not always lead to incorrect functionality during the test process resulting in test escapes. The proposed DFT scheme, which can be deployed as a standalone technique, is called USFA-DFT (an undefined state fault-aware design-for-testability technique). In this scheme, the USF detection is achieved through using a weak write before reading the cell. The weak write overwrites defective cells, causing an incorrect read output, without flipping the content of defect-free cells. To avoid test escapes or yield loss (over-testing) caused by process variation (PV) effects, we make use of a post-silicon calibration scheme. Next, to improve the detectability of HtD faults in STT-MRAMs, we suggest a hybrid high coverage test method (called H2C-TM) which enhances the previous method called LCHC-DFT (a low-cost high-coverage design-for-testability technique) by combining it with USFA-DFT. This test method improves the HtD fault detection, by applying the weak write (controlled by USFA-DFT) before the stressed read operation (controlled by LCHC-DFT). This hybrid approach has a negligible area overhead (3.18% for a 1 kbit array). The results for the performance evaluation of the H2C-TM scheme show that for intra-cell and inter-cell defects, on average, the improvements of 14.4% and 11.3% of HtD fault coverage, compared to those of LCHC-DFT, are achieved. Also, for intra-cell and inter-cell defects, the proposed hybrid approach outperforms USFA-DFT by 49.8% and 49.3% respectively. Finally, in the presence of the process variation, the proposed test method guarantees a robust DFT with only a maximum deviation of 10% from the nominal value.

  • Ultralow-Power Implementation of Neural Networks Using Inverter-Based Memristive Crossbars

    by Shaghayegh Vahdat, Mehdi Kamal, Ali Afzali-Kusha, Massoud Pedram

  • Open Access

    Accuracy Configurable Adders with Negligible Delay Overhead in Exact Operating Mode

    by Farhad Ebrahimi-Azandaryani, Omid Akbari, Mehdi Kamal, Ali Afzali-Kusha, Massoud Pedram

    In this paper, two accuracy configurable adders capable of operating in approximate and exact modes are proposed. In the adders, which include a block-based carry propagate and a parallel prefix structure, the carry chains are cut off in the approximate mode limiting the carry chain depth to two blocks. In the case of parallel prefix adder, we propose a special carry generate tree equipped with a power gating means. In both of the proposed structures, the critical paths of the adders are not increased in the exact operating mode. Thus, the main objective of proposing these approximate adder structures is to present an accuracy configurable adder structure whose delay in the exact mode is almost the same as an exact adder. The efficacies of the proposed accuracy configurable adders are compared with some state-of-the-art adder structures using a 15nm CMOS technology. In addition, their efficacies are evaluated in two error-resilient applications. These studies show that the proposed carry-propagate adder has 22% (51%) lower energy consumption (error rate) compared to the best prior works. Also, the proposed parallel prefix adder provides, on average, 20% lower energy consumption compared to the exact parallel prefix adders.


  • LCHC-DFT: A Low-Cost High-Coverage Design-for-Testability Technique to Detect Hard-to-Detect Faults in STT-MRAMs in the Presence of Process Variations

    by Shiva Taghipour, Mehdi Kamal, Rahebeh Niaraki Asli, Ali Afzali-Kusha, Massoud Pedram

    This paper proposes a low-cost yet high-coverage design-for-testability (DFT) scheme for improving the detection of hard-to-detect (HtD) faults in STT-MRAMs. It is based on introducing a voltage mismatch in the sense amplifier (SA). This mismatch along with the defects in the cell may bias the SA, leading to an incorrect read output which in turn make the HtD faults detectable. The efficacy of the proposed scheme is evaluated by calculating its detection capability in the presence of resistive defects. Evaluation results obtained for a 20nm STT-MRAM memory design show that the proposed scheme provides HtD fault coverage of 81.8% and 86.5%, on average, for intra-cell and inter-cell defects, respectively, with a negligible area overhead (1.1% for a 2Kbit array). In comparison with conventional March tests, which only detect easy-to-detect (EtD) faults, the proposed DFT technique covers both HtD and EtD faults with a faster approach, namely by using a single read operation. Furthermore, to guarantee that the cells affected by HtD faults trigger an incorrect read output under process variation (PV), a timing strategy based on modifying the control unit of the proposed DFT is suggested. The strategy controls the stress introduced by the DFT unit by altering the timing of DFT control signals. The timing alteration enables the detection of HtD faults in the devices with higher deviations from the nominal one due to PV, avoiding yield loss or test escapes.


  • Posit Process Element for Using in Energy-Efficient DNN Accelerators

    by Mohamadreza Zolfagharinejad, Mehdi Kamal, Ali Afzali-Khusha, Massoud Pedram

    In this work, we present an energy-efficient posit processing element (PE) for utilization in array-based deep neural network (DNN) accelerators along with an approximation method for further reducing the energy consumption of the unit. The posit arithmetic used in the proposed PE provides high precision for the considered data widths even when approximation is used for operations. Using some modification/simplification approaches and proposing a speculative posit adder (SPA) unit, we reduce the complexity of the employed posit multiply–accumulator (MAC) in the proposed PE. The effectiveness of the proposed PE is studied using a 45-nm CMOS technology. The results reveal $3.5\times $ and 92% improvements in the delay and energy consumption, respectively, compared to those of the state-of-the-art posit PE. To assess the efficacy of the proposed PE, we have modeled an 8-bit DNN accelerator and employed it for the implementation of some DNN architectures. The results indicate that the proposed PE and its approximate one provide, on average, 19.3% and 29.6% lower energy consumptions compared to that of the latest prior work when providing 10.6% and 5.8% higher accuracies, respectively.


  • SySCIM: SystemC-AMS Simulation of Memristive Computation In-Memory

    by Seyed Hossein Hashemi Shadmehri, Ali BanaGozar, Mehdi Kamal, Sander Stuijk, Ali Afzali-Kusha, Massoud Pedram, Henk Corporaal

    Computation-in-memory (CIM) is one of the most appealing computing paradigms, especially for implementing artificial neural networks. Non-volatile memories like ReRAMs, PCMs, etc., have proven to be promising candidates for the realization of CIM processors. However, these devices and their driving circuits are subject to non-idealities. This paper presents a comprehensive platform, named SysCIM, for simulating memristor-based CIM systems. SySCIM considers the impact of the non-idealities of the CIM components, including memristor device, memristor crossbar (interconnects), analog-to-digital converter, and transimpedance amplifier, on the vector-matrix multiplication performed by the CIM unit. The CIM modules are described in SystemC and SystemC-AMS to reach a higher simulation speed while maintaining high simulation accuracy. Experiments under different crossbar sizes show SySCIM performs simulations up to 117 x faster than HSPICE with less than 4% accuracy loss. The modular design of SySCIM provides researchers with an easy design-space exploration tool to investigate the effects of various non-idealities.