MYMuhammad Rehan Yahya

Muhammad Rehan Yahya

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Muhammad Rehan Yahya has a total of 24 co-authors. Here are the top co-authors by number of shared publications:

  • Ning Wu

    College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China

    7 shared publications
  • Fang Zhou

    College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China

    3 shared publications
  • Fen Ge

    Nanjing University of Aeronautics and Astronautics, College of Electronic and Information Engineerin

    3 shared publications
  • Jinbao Zhang

    College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China

    3 shared publications
  • Fang Zhou

    Nanjing University of Aeronautics and Astronautics, College of Electronic and Information Engineerin

    2 shared publications
  • Gaizhen Yan

    Nanjing University of Aeronautics and Astronautics, College of Electronic and Information Engineerin

    2 shared publications

Latest Publications

  • Open Access

    Optimizing Crosstalk in Optical NoC through Heuristic Fusion Mapping

    by Xinhao Shi, Ning Wu, Fen Ge, Fang Zhou, Muhammad Rehan Yahya

    Optical network-on-chip is considered to be a promising technology to solve the problems of low bandwidth and high latency in the traditional interconnection network. However, due to the inevitable leakage of optical devices, the optical signal will receive crosstalk noise during transmission. In this paper, a heuristic fusion mapping algorithm PSO_SA for crosstalk optimization is proposed. First, the initial optimal mapping is obtained by particle swarm optimization, and then the local optimization of the mapping scheme is removed by combining with simulated annealing algorithm. The experimental results show that the crosstalk optimization performance of PSO_SA algorithm is better than that of GA algorithm in 263 dec, Wavelet, DVOPD and other applications, and the maximum optimization degree is 28.7%.


  • SMOR: design of an optimized 5 × 5 nonblocking optical router for photonic NoCs constructed via silicon microring optical switch

    by Muhammad Rehan Yahya, Ning Wu, Fang Zhou, Gaizhen Yan, Fen Ge, Zain-Ul Abidin

    During the past few years, the per-chip count of processing cores has increased with the emergence of the multi/many core era to meet the high-performance requirements of on-chip processing cores. However, requirements for larger bandwidth in multi/many processors cannot be fulfilled employing traditional electrical on-chip interconnections. Optical on-chip interconnects provide a substitute to resolve this issue for high-performance computing. Optical routers/switches are one of the key components, which determine the cost and performance of optical networks-on-chip, to realize on-chip communication among cores. We present an optimized design of 5 × 5 nonblocking optical router using silicon microring-based 2 × 2 switching elements called as SMOR. The proposed five-port SMOR optical router is constructed using 10 switching elements in unoptimized design, which is further reduced to 8 switching elements via available optimization scheme. Detailed performance analysis of proposed five-port optical router in terms of cross-talk noise, insertion loss, and power consumption is furnished and discussed. In comparison to existing architectures of optical router/switches of same scale, proposed SMOR has achieved up to 68% minimization in a number of switching elements.


  • Open Access

    A Dynamic Branch Predictor Based on Parallel Structure of SRNN

    by Lei Zhang, Ning Wu, Fen Ge, Fang Zhou, Mahammad Rehan Yahya

    Branch predictor is a key component of processor, which can improve the efficiency of instruction execution. The branch predictor based on machine learning algorithm can achieve high branch prediction accuracy, but it has the disadvantages of long training time and high access delay. As a neural network algorithm, Recurrent Neural Network (RNN) is good at processing data related to time series, and can learn the correlation between data faster. Sliced Recurrent Neural Network (SRNN) parallelizes the RNN algorithm, effectively reducing the access delay of the RNN algorithm. In this paper, a dynamic branch predictor based on parallel structure of SRNN is proposed to accelerate the training time and reduces the computing delay. The optimal design parameters of predictor, which has prediction accuracy with lower source cost, are selected through a serial simulations. The experimental results show that the branch predictor proposed in this paper has higher prediction accuracy than the traditional Bimod and Gshare branch predictors under the same hardware consumption, and its branch prediction rate is 2.34% higher than the traditional Perceptron neural predictor in the short learning period.


  • Reliability and Security Challenges in Electrical/Optical On-Chip Interconnects for IoT Applications

    by Muhammad Rehan Yahya, Ning Wu, Zain Anwar Ali, Ssuet

    The evolution of internet of things (IoT) applications, cloud computing, smart cities, and 4G/5G wireless communication systems have significantly increased the demands for on chip processing. Network on chip (NoC) is a viable alternative that can provide higher processing and bandwidth for increasing demands. NoC offers better performance and more flexibility with lower communication latency and higher throughput. However, use of NoC-based IoT devices have raised concerns on security and reliability of integrated chips (IC), which is used in almost every application. IoT devices share data that becomes vulnerable to attack and can be compromised during the data transfer. Keeping in view these security challenges, a detailed survey is presented that covers the security issues and challenges focusing on NoCs along with proposed countermeasures to secure on-chip communication. This study includes on-chip security issues for electrical as well as optical on-chip interconnects.

  • Open Access

    HoneyComb ROS: A 6 × 6 Non-Blocking Optical Switch with Optimized Reconfiguration for ONoCs

    by Muhammad Rehan Yahya, Ning Wu, Gaizhen Yan, Tanveer Ahmed, Jinbao Zhang, Yuanyuan Zhang

    Silicon photonics has become a commonly used paradigm for on-chip interconnects to meet the requirements of higher bandwidth in computationally intensive applications for manycore processors. Design of an optical switch is a vital aspect while constructing an optical NoC topology which influences the performance of network. We present a HoneyComb optimized reconfigurable optical switch (HCROS), a 6 × 6 non-blocking optical switch where optimized reconfiguration of optical links utilizing the states of basic 2 × 2 optical switching elements (OSE) was achieved while keeping the input-output (I/O) interconnection intact. The proposed 6-port HCROS architecture was further optimized to reduce the number of OSEs to minimize overall power consumption. We proposed a generic algorithm to find the optimal switching combination of OSEs for a particular I/O link to minimize the insertion loss and power consumption. In comparison to other non-blocking architectures, a maximum of 66% reduction in OSEs was observed for the optimized HCROS, which consumes only 12 OSEs. Simulations were performed for all 720 I/O links in different configurations to evaluate the power consumption and insertion loss. We observed up to 92% power savings in the case of optimized HCROS as compared to un-optimized HCROS, and a 79% minimization in insertion loss was also reported as a result of optimization.


  • Open Access

    An Algorithmic Framework to Construct Optical Switch via Scaling From N-to-2N Ports for Optical Network on Chip

    by Muhammad Rehan Yahya, Ning Wu, Yan Gaizhen, Tanveer Ahmed, Yasir, Jinbao Zhang

    Optical network-on-chip (ONoC), designed with non-blocking optical switches, is gaining a significant research attention to meet the upcoming requirements of higher throughput, larger bandwidth, lower latency and reduced power consumption for manycore processors. In this work, we propose an algorithmic framework to construct non-blocking optical switches with multiple interconnection possibilities. The design is accomplished by scaling the optical switch from N-to-2N ports using two intermediate mapping matrices each of size 2N×2N. These mapping matrices are the row and column permutations of identity matrices, where 1’s represent passive interconnections among the optical switching units (OSUs). The proposed framework provides validation to the design by identifying all the non-blocking permutations of the mapping matrices, thereby, providing a flexibility to adopt any permutation as an interconnection scheme. Furthermore, it has the ability to quantify the redundancy in switching combinations which exists for any input-to-output routing, authenticates the non-blocking feature of the optical switch and to reduce the number of optical switching units while preserving the non-blocking characteristic. For the scaled 4×4 and 6×6 optical switches, we respectively identified 16 and 192 different interconnections to build multiple non-blocking switches. Moreover, a 20% reduction in OSUs is achieved by optimizing a 6×6 switch. Influence of the insertion loss, power consumption and crosstalk noise on various scaled optical switch networks are also analyzed and compared with several existing optical switch topologies.


  • Open Access

    A Countermeasure against DPA on SIMON with an Area-Efficient Structure

    by Yuanyuan Zhang, Ning Wu, Fang Zhou, Jinbao Zhang, Muhammad Rehan Yahya

    Differential power analysis (DPA) is an effective side channel attack method, which poses a critical threat to cryptographic algorithms, especially lightweight ciphers such as SIMON. In this paper, we propose an area-efficient countermeasure against DPA on SIMON based on the power randomization. Firstly, we review and analyze the architecture of SIMON algorithm. Secondly, we prove the threat of DPA attack to SIMON by launching actual DPA attack on SIMON 32/64 circuit. Thirdly, a low-cost power randomization scheme is proposed by combining fault injection with double rate technology, and the corresponding circuit design is implemented. To the best of our knowledge, this is the first scheme that applies the combination of fault injection and double rate technology to the DPA-resistance. Finally, the t-test is used to evaluate the security mechanism of the proposed designs with leakage quantification. Our experimental results show that the proposed design implements DPA-resistance of SIMON algorithm at certain overhead the cost of 47.7% LUTs utilization and 39.6% registers consumption. As compared to threshold implementation and bool mask, the proposed scheme has greater advantages in resource consumption.


  • Open Access

    A Novel Differential Fault Analysis on the Key Schedule of SIMON Family

    by Jinbao Zhang, Ning Wu, Fang Zhou, Muhammad Rehan Yahya, Jianhua Li

    As a family of lightweight block ciphers, SIMON has attracted lots of research attention since its publication in 2013. Recent works show that SIMON is vulnerable to differential fault analysis (DFA) and existing DFAs on SIMON assume the location of induced faults are on the cipher states. In this paper, a novel DFA on SIMON is proposed where the key schedule is selected as the location of induced faults. Firstly, we assume a random one-bit fault is induced in the fourth round key KT−4 to the last. Then, by utilizing the key schedule propagation properties of SIMON, we determine the exact position of induced fault and demonstrate that the proposed DFA can retrieve 4 bits of the last round key KT−1 on average using one-bit fault. Till now this is the largest number of bits that can be cracked as compared to DFAs based on random bit fault model. Furthermore, by reusing the induced fault, we prove that 2 bits of the penultimate round key KT−2 could be retrieved. To the best of our knowledge, the proposed attack is the first one which extracts a key from SIMON based upon DFA on the key schedule. Finally, correctness and validity of our proposed attack is verified through detailed simulation and analysis.


  • RoR: A low insertion loss design of rearrangeable hybrid photonic-plasmonic 6 × 6 non-blocking router for ONoCs

    by Muhammad Rehan Yahya, Ning Wu, Gaizhen Yan, Fen Ge, Tanveer Ahmed

    Optical networks on chip (ONoC) delivers a promising alternative to meet growing needs of higher bandwidth and low power consumption in manycore processors. Optical routers are the key element in ONoCs that significantly affect the performance of overall network. In this letter, we propose a rearrangeable non-blocking 6x6 router (RoR) constructed with 2x2 hybrid photonic-plasmonic switching (HPPS) elements. Router architectures with 15 HPPS elements and an optimized design using reduced HPPS elements are presented and analyzed. In optimized form, proposed design consumes only 12 HPPS elements which results in low insertion loss and crosstalk noise in comparison to the un-optimized architecture. We observe up to 50% reduction in switching elements count in comparison to other router architecture of same radix.