Folgen
Zahra Shirmohammadi
Zahra Shirmohammadi
Sonstige Namenزهرا شیرمحمدی
Associate Professor, Computer Engineering Department of SRU
Bestätigte E-Mail-Adresse bei sru.ac.ir
Titel
Zitiert von
Zitiert von
Jahr
LAXY: A Location-Based Aging-Resilient Xy-Yx Routing Algorithm for Network on Chip
N Rohbani, Z Shirmohammadi, SG Miremadi
IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 2017
402017
A Fault-Tolerant and Energy-Aware Mechanism for Cluster-based Routing Algorithm of WSN
M Hezaveh, Z Shirmohammadi, N Rohbani, SG Miremadi
15th IFIP/IEEE International Symposium on Integrated Network Management, 659 …, 2015
212015
An Efficient Numerical-based Crosstalk Avoidance Codec Design for NoCs
Z Shirmohammadi, SG Miremadi
Journal of Microprocessor and Microsystems, 2017
202017
Crosstalk Avoidance Coding for Reliable Data Transmission of Network on Chips
Z Shirmohammadi, SG Miremadi
15th International Symposium on System-on-Chip 2013, 1-4, 2013
192013
S2AP: An Efficient Numerical-based Crosstalk Avoidance Code For Reliable Data Transfer of NoCs
Z Shirmohammadi, SG Miremadi
10th International Symposium on Reconfigurable Communication-centric Systems …, 2015
182015
3D-DyCAC: Dynamic Numerical-Based Mechanism for Reducing Crosstalk Faults in 3D ICs
Z Shirmohammadi, H Zamani Sabzi, SG Miremadi
19th IEEE International High-Level Design Validation and Test Workshop, 2017
142017
On Designing an Efficient Numerical-based Forbidden Pattern Free Crosstalk Avoidance Codec for Reliable Data Transfer of NoC
Z Shirmohammadi, SG Miremadi
Microelectronics Reliability 63, 2016
142016
PAM: A Packet Manipulation Mechanism for Mitigating Crosstalk Faults in NoCs
Z Shirmohammadi, M Ansari, SK Abharian, S Safari, SG Miremadi
15th IEEE International Conference on Autonomic and Secure Computing …, 2015
132015
Addressing NoC Reliability Through an Efficient Fibonacci-Based Crosstalk Avoidance Codec Design
Z Shirmohammadi, SG Miremadi
16th International Conference on Algorithms and Architectures for Parallel …, 2015
122015
Using Binary-Reflected Gray Coding for Crosstalk Mitigation of Network on Chip
Z Shirmohammadi, SG Miremadi
17th CSI International Symposium on Computer Architecture & Digital Systems …, 2013
122013
An Efficient and Low Power One-Lambda Crosstalk Avoidance Code Design for Network on Chips
Z Shirmohammadi, Z Mahdavi
Journal of Microprocessors and Microsystems, 2018
112018
RLS2: An energy efficient reinforcement learning-based sleep scheduling for energy harvesting WBANs
R Mohammadi, Z Shirmohammadi
Computer Networks 229, 109781, 2023
82023
SDT-free:An Efficient Crosstalk Avoidance Coding Mechanism Considering Inductance Effects
Z Shirmohammadi, SG Miremadi
7th IEEE International Conference on Computer and Knowledge Engineering, 2017
72017
Design and Implementation of a Low-Complexity Flight Controller for a Quadrotor UAV
M Mirtaba, M Jeddi, N Amirhossein, Z Shirmohammadi
International Journal of Dynamics and Control., 2022
62022
UEELC: An Ultra Energy Effiecent Lossless Compression Method for Wireless Body Area Networks
MJ Khani, Z Shirmohammadi
6th IEEE Conference on Signal Processing and Intelligent Systems (ICSPIS 2020), 2020
62020
OP-Fibo: An Efficient Forbidden Pattern Free CAC Design
Z Shirmohammadi
Integration, the VLSI Journal, 2019
62019
DR: Overhead Efficient RLC Crosstalk Avoidance Code
Z Shirmohammadi, H Zamani Sabzi
8th IEEE International Conference on Computer and Knowledge Engineering, 2018
62018
DRDC: Deep reinforcement learning based duty cycle for energy harvesting body sensor node
R Mohammadi, Z Shirmohammadi
Energy Reports 9 (0), 1707-1719, 2023
52023
A Cluster-based Energy-Aware Routing Algorithm for Wireless Sensor Networks
Z Shirmohammadi, F Mojtaba, M Mohseni, Rohbani, Nezam
Ad Hoc & Sensor Wireless Networks., 2022
52022
WiP: floating xy-yx: an efficient thermal management routing algorithm for 3D NoCs
M Safari, Z Shirmohammadi, N Rohbani, H Farbeh
2018 IEEE 16th Intl Conf on Dependable, Autonomic and Secure Computing, 16th …, 2018
52018
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20