Siavash Bayat
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
Siavash Bayat has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Ali Mohammad Afshin Hemmatyar
Department of Computer Engineering, Sharif University of Technology, Tehran, Iran
5 shared publications - Ata Khalili
Institute for Digital Communications, Friedrich-Alexander-University Erlangen-Nrnberg, Erlangen, Germany
3 shared publications - Mohammad Robat Mili
Pasargad Institute for Advanced Innovative Solutions (PIAIS), Tehran, Iran
3 shared publications - Rouhollah Amiri
Sharif University of Technology
3 shared publications - Zhu Han
University of Houston
3 shared publications - Sajad Daei
KTH Royal Institute of Technology, Stockholm, Sweden
2 shared publications
Latest Publications
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 171385-171431
EEG-Based Motor Imagery BCI Algorithms and Technologies: A Review
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 171385-171431
Open AccessEEG-Based Motor Imagery BCI Algorithms and Technologies: A Review
- 19 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74  (4) , 6795-6800
Optimal RIS Placement in Near-Field Localization Using Gray Wolf Optimizer
Reconfigurable intelligent surfaces (RISs) are a transformative technology for improving wireless communication and localization accuracy. This study focuses on optimizing RIS placement in the near-field (NF) scenario to minimize the position error bound (PEB) in single-input single-output (SISO) systems. Closed-form expressions for the fisher information matrix (FIM) and the PEB have been derived to evaluate localization performance. The analysis reveals that the RIS placement significantly affects localization accuracy. In this paper, the exhaustive search method is used to make a benchmark to test the correctness of the main problem-solving method, a meta-heuristic algorithm. This method is called gray wolf optimizer (GWO) and offers a more computationally efficient, continuous approach by imitating the behavior of gray wolves. Simulation results show that both methods effectively enhance localization accuracy, with the GWO method achieving superior performance in terms of computational efficiency and PEB minimization. The study highlights that strategic RIS placement can lead to substantial improvements in localization precision, making RIS a vital component for future wireless communication networks. This work provides a comprehensive framework for optimizing RIS deployment in NF communication scenarios, offering practical insights for enhancing localization accuracy in practical applications.
- 19 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74  (4) , 6795-6800
Optimal RIS Placement in Near-Field Localization Using Gray Wolf Optimizer
Reconfigurable intelligent surfaces (RISs) are a transformative technology for improving wireless communication and localization accuracy. This study focuses on optimizing RIS placement in the near-field (NF) scenario to minimize the position error bound (PEB) in single-input single-output (SISO) systems. Closed-form expressions for the fisher information matrix (FIM) and the PEB have been derived to evaluate localization performance. The analysis reveals that the RIS placement significantly affects localization accuracy. In this paper, the exhaustive search method is used to make a benchmark to test the correctness of the main problem-solving method, a meta-heuristic algorithm. This method is called gray wolf optimizer (GWO) and offers a more computationally efficient, continuous approach by imitating the behavior of gray wolves. Simulation results show that both methods effectively enhance localization accuracy, with the GWO method achieving superior performance in terms of computational efficiency and PEB minimization. The study highlights that strategic RIS placement can lead to substantial improvements in localization precision, making RIS a vital component for future wireless communication networks. This work provides a comprehensive framework for optimizing RIS deployment in NF communication scenarios, offering practical insights for enhancing localization accuracy in practical applications.
- 4 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 24  (2) , 1826-1836
Elliptic Localization Under Asynchronous Transmissions
This paper presents an efficient solution for the problem of elliptic object localization under asynchronous transmissions such that each measurement is subject to an unknown clock offset. The proposed method is an algebraic semi closed-form estimator which is based on three successive stages of offsets elimination, offsets estimation and refinement. The proposed method is also extended to a practical case with uncertainty in transmitters positions. Through theoretical performance analysis, the proposed estimators are shown to achieve the Cramer-Rao bound accuracy under small Gaussian noise. Numerical simulations verify the theoretical results and demonstrate a significant performance improvement of the proposed estimator compared to the state-of-the-art methods.
- 4 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 24  (2) , 1826-1836
Elliptic Localization Under Asynchronous Transmissions
This paper presents an efficient solution for the problem of elliptic object localization under asynchronous transmissions such that each measurement is subject to an unknown clock offset. The proposed method is an algebraic semi closed-form estimator which is based on three successive stages of offsets elimination, offsets estimation and refinement. The proposed method is also extended to a practical case with uncertainty in transmitters positions. Through theoretical performance analysis, the proposed estimators are shown to achieve the Cramer-Rao bound accuracy under small Gaussian noise. Numerical simulations verify the theoretical results and demonstrate a significant performance improvement of the proposed estimator compared to the state-of-the-art methods.
- 8 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21  (1) , 759-772
Interference-Aware Resource Allocation Algorithm for D2D-Enabled Cellular Networks Using Matching Theory
To enhance spectral efficiency and network throughput in Device-to-Device (D2D)-enabled cellular networks, various resource sharing methods can be utilized. However, when users in such dense and complicated networks share the same resources, co-channel interference arises. Therefore, more efficient and comprehensive frameworks should be used to accurately model the network and then decrease co-channel interference and increase resource efficiency. This work proposes a novel and practical resource allocation framework that considers more realistic assumptions based on matching theory with externalities. The goal of the proposed framework is to maximize network throughput by minimizing the interference between co-channel cellular and D2D communications. Moreover, the effect of the interference between various types of communications on the network’s quality of service is studied. The spatial positions of the users’ equipments are modeled by using the Poisson Point Process. It is shown that the proposed method results in a stable resource allocation matching after a finite number of iterations. Based on the analytical and simulation results, the proposed algorithm achieves near-optimal network performance with a low computational cost.
- 8 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21  (1) , 759-772
Interference-Aware Resource Allocation Algorithm for D2D-Enabled Cellular Networks Using Matching Theory
To enhance spectral efficiency and network throughput in Device-to-Device (D2D)-enabled cellular networks, various resource sharing methods can be utilized. However, when users in such dense and complicated networks share the same resources, co-channel interference arises. Therefore, more efficient and comprehensive frameworks should be used to accurately model the network and then decrease co-channel interference and increase resource efficiency. This work proposes a novel and practical resource allocation framework that considers more realistic assumptions based on matching theory with externalities. The goal of the proposed framework is to maximize network throughput by minimizing the interference between co-channel cellular and D2D communications. Moreover, the effect of the interference between various types of communications on the network’s quality of service is studied. The spatial positions of the users’ equipments are modeled by using the Poisson Point Process. It is shown that the proposed method results in a stable resource allocation matching after a finite number of iterations. Based on the analytical and simulation results, the proposed algorithm achieves near-optimal network performance with a low computational cost.
- 1 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. PP  (00189545) , 1-13
Advances in UAV-Assisted Localization: Joint Source and UAV Parameter Estimation
This paper presents efficient estimators to address the problem of source localization aided by unmanned aerial vehicles (UAVs) with unknown location parameters. Leveraging semidefinite relaxation technique and successive weighted least squares estimation, the source and UAV parameters are simultaneously estimated in both mixed line-of-sight/non-line-of-sight (NLOS) and NLOS scenarios. The proposed estimators are shown to approximately achieve the Cramer-Rao bound (CRB) under mild Gaussian noise conditions when the measurement noises are small compared to the associated ranges. Numerical simulations demonstrate that localization without prior UAV location information is still possible with a meter-level positioning and sub-meter per seconds velocity estimation accuracy.
- 1 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. PP  (00189545) , 1-13
Advances in UAV-Assisted Localization: Joint Source and UAV Parameter Estimation
This paper presents efficient estimators to address the problem of source localization aided by unmanned aerial vehicles (UAVs) with unknown location parameters. Leveraging semidefinite relaxation technique and successive weighted least squares estimation, the source and UAV parameters are simultaneously estimated in both mixed line-of-sight/non-line-of-sight (NLOS) and NLOS scenarios. The proposed estimators are shown to approximately achieve the Cramer-Rao bound (CRB) under mild Gaussian noise conditions when the measurement noises are small compared to the associated ranges. Numerical simulations demonstrate that localization without prior UAV location information is still possible with a meter-level positioning and sub-meter per seconds velocity estimation accuracy.
- Open Access
- 26 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 114153-114166
Optimal Multi-Objective Resource Allocation for D2D Underlaying Cellular Networks in Uplink Communications
In this paper, we study a resource allocation problem in orthogonal frequency division multiple access (OFDMA)-based Device-to-Device (D2D) communications. To this end, we propose a multi-objective optimization problem (MOOP) framework, which jointly maximizes the sum rate of D2D users (DUs) and cellular users (CUs) in uplink communications and minimizes the total transmit power. The proposed problem formulation takes into account the minimum data-rates and the maximum transmitted power budget for both DUs and CUs. We transform this MOOP into a single-objective optimization problem (SOOP) using the weighted sum method and then propose an approach to solve this SOOP via a monotonic approach yielding an efficient optimal solution. Furthermore, a suboptimal solution based on the successive convex approximation (SCA) is presented to compromise complexity and performance gain. This is done to reveal that the proposed suboptimal solution closely approaches an optimal solution through simulation analysis. Numerical results unveil an interesting tradeoff between D2Ds CUs and demonstrate the superiority of our proposed solution compared to other baseline schemes.
- 26 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 114153-114166
Open AccessOptimal Multi-Objective Resource Allocation for D2D Underlaying Cellular Networks in Uplink Communications
In this paper, we study a resource allocation problem in orthogonal frequency division multiple access (OFDMA)-based Device-to-Device (D2D) communications. To this end, we propose a multi-objective optimization problem (MOOP) framework, which jointly maximizes the sum rate of D2D users (DUs) and cellular users (CUs) in uplink communications and minimizes the total transmit power. The proposed problem formulation takes into account the minimum data-rates and the maximum transmitted power budget for both DUs and CUs. We transform this MOOP into a single-objective optimization problem (SOOP) using the weighted sum method and then propose an approach to solve this SOOP via a monotonic approach yielding an efficient optimal solution. Furthermore, a suboptimal solution based on the successive convex approximation (SCA) is presented to compromise complexity and performance gain. This is done to reveal that the proposed suboptimal solution closely approaches an optimal solution through simulation analysis. Numerical results unveil an interesting tradeoff between D2Ds CUs and demonstrate the superiority of our proposed solution compared to other baseline schemes.
- 25 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 70  (5) , 4464-4470
Multi-Objective Resource Allocation for D2D and Enabled MC-NOMA Networks by Tchebycheff Method
This paper considers a resource allocation problem in device-to-device (D2D) communications sharing the same frequency spectrum. In particular, the cellular users (CUs) utilize non-orthogonal multiple access (NOMA) while D2D users (DUs) adopt the orthogonal frequency division multiple access (OFDMA). A multi-objective optimization problem (MOOP) is formulated, which jointly maximizes the sum rate of DUs and CUs in uplink communications while taking into account the maximum transmit power budget and minimum data rate requirement for DUs and CUs. This MOOP is handled by the weighted Tchebycheff method, which converts it into a single-objective optimization (SOOP). Then, the monotonic optimization approach is employed to solve this SOOP optimally. Numerical results unveil an interesting tradeoff between D2D and CUs.
- 25 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 70  (5) , 4464-4470
Multi-Objective Resource Allocation for D2D and Enabled MC-NOMA Networks by Tchebycheff Method
This paper considers a resource allocation problem in device-to-device (D2D) communications sharing the same frequency spectrum. In particular, the cellular users (CUs) utilize non-orthogonal multiple access (NOMA) while D2D users (DUs) adopt the orthogonal frequency division multiple access (OFDMA). A multi-objective optimization problem (MOOP) is formulated, which jointly maximizes the sum rate of DUs and CUs in uplink communications while taking into account the maximum transmit power budget and minimum data rate requirement for DUs and CUs. This MOOP is handled by the weighted Tchebycheff method, which converts it into a single-objective optimization (SOOP). Then, the monotonic optimization approach is employed to solve this SOOP optimally. Numerical results unveil an interesting tradeoff between D2D and CUs.
- Open Access
Multi-objective Resource Allocation for D2D and Enabled MC-NOMA Networks by Tchebycheff Method
This paper considers a resource allocation problem in device-to-device (D2D) communications sharing the same frequency spectrum. In particular, the CUs utilize non-orthogonal multiple access (NOMA) while DUs adopt the orthogonal frequency division multiple access (OFDMA). A multi-objective optimization problem (MOOP) is formulated, which jointly maximizes the sum rate of D2D and CUs (CUs) in uplink communications while taking into account the maximum transmit power budget and minimum data rate requirement for D2D and CUs. This MOOP is handled by the weighted Tchebycheff method, which converts it into a single-objective optimization (SOOP). Then, the monotonic optimization approach is employed to solve this SOOP optimally. Numerical results unveil an interesting tradeoff between D2D and CUs.
Open AccessMulti-objective Resource Allocation for D2D and Enabled MC-NOMA Networks by Tchebycheff Method
This paper considers a resource allocation problem in device-to-device (D2D) communications sharing the same frequency spectrum. In particular, the CUs utilize non-orthogonal multiple access (NOMA) while DUs adopt the orthogonal frequency division multiple access (OFDMA). A multi-objective optimization problem (MOOP) is formulated, which jointly maximizes the sum rate of D2D and CUs (CUs) in uplink communications while taking into account the maximum transmit power budget and minimum data rate requirement for D2D and CUs. This MOOP is handled by the weighted Tchebycheff method, which converts it into a single-objective optimization (SOOP). Then, the monotonic optimization approach is employed to solve this SOOP optimally. Numerical results unveil an interesting tradeoff between D2D and CUs.
- 16 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 68  (6) , 2212-2216
Separating Radar Signals From Impulsive Noise Using Atomic Norm Minimization
We consider the problem of corrupted radar superresolution, a generalization of compressed radar super-resolution in which one aims to recover the continuous-valued delay-Doppler pairs of moving objects from a collection of corrupted and noisy measurements. The received signal in this type consists of contributions from objects, outlier and noise. While this problem is ill-posed in general, tractable recovery is possible when both the number of objects and corrupted measurements are limited. In this work, we propose an atomic norm optimization in order to find the delay-Doppler pairs and the outlier signal. The objective function of our optimization problem encourages both sparsity in the continuous delay-Doppler domain and the sparsity of perturbations in the outlier signal. We show that the associated problem can be solved via semidefinite programming (SDP). Moreover, we provide a reasonably fast and efficient algorithm for solving this SDP based on the alternating method of multipliers (ADMM). Simulations results verify the superior performance of our proposed problem and the high accuracy and low computational complexity of our algorithm.
- 16 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 68  (6) , 2212-2216
Separating Radar Signals From Impulsive Noise Using Atomic Norm Minimization
We consider the problem of corrupted radar superresolution, a generalization of compressed radar super-resolution in which one aims to recover the continuous-valued delay-Doppler pairs of moving objects from a collection of corrupted and noisy measurements. The received signal in this type consists of contributions from objects, outlier and noise. While this problem is ill-posed in general, tractable recovery is possible when both the number of objects and corrupted measurements are limited. In this work, we propose an atomic norm optimization in order to find the delay-Doppler pairs and the outlier signal. The objective function of our optimization problem encourages both sparsity in the continuous delay-Doppler domain and the sparsity of perturbations in the outlier signal. We show that the associated problem can be solved via semidefinite programming (SDP). Moreover, we provide a reasonably fast and efficient algorithm for solving this SDP based on the alternating method of multipliers (ADMM). Simulations results verify the superior performance of our proposed problem and the high accuracy and low computational complexity of our algorithm.
- Open Access
Novel Relay Selection Algorithms for Machine-to-Machine Communications with Static RF Interface Usage
Machine-to-Machine (M2M) communications have been introduced to improve the communication capacity in dense wireless networks. One of the most important concerns for network designers is maintaining the high performance of the network when the quality of connections between sources and their destinations is poor. Thus the careful selection of relays between data sources and their destinations is a very important issue. The possibility of simultaneous use of different Radio Frequency (RF) interfaces for transmitting data, which communication devices are equipped with them, can increase the capacity of data transmission over the network. In this paper, two novel M2M relay selection algorithms are proposed, named as Optimal Relay Selection Algorithm (ORSA) and Matching based Relay Selection Algorithm (MRSA). ORSA is a centralized algorithm for the optimal selection of relays by transforming the main problem to a k-cardinality assignment problem that can be solved using the Hungarian algorithm. MRSA is a distributed algorithm that leverages concepts from matching theory to provide a stable solution for the relay selection problem. In both proposed algorithms static RF interfaces usage is applied to enable simultaneous use of different interfaces for data transmission. The simulations show that ORSA is optimally solving the relay selection problem. MRSA has an optimal stable result, that when there is no restriction on the number of channels, is only about 1% lower than ORSA. Besides, MRSA provides better results than direct transmission Without any Relay Selection Algorithm (WRSA) and Random Relay Selection Algorithm (RRSA), about 15% and 98%, respectively.
Open AccessNovel Relay Selection Algorithms for Machine-to-Machine Communications with Static RF Interface Usage
Machine-to-Machine (M2M) communications have been introduced to improve the communication capacity in dense wireless networks. One of the most important concerns for network designers is maintaining the high performance of the network when the quality of connections between sources and their destinations is poor. Thus the careful selection of relays between data sources and their destinations is a very important issue. The possibility of simultaneous use of different Radio Frequency (RF) interfaces for transmitting data, which communication devices are equipped with them, can increase the capacity of data transmission over the network. In this paper, two novel M2M relay selection algorithms are proposed, named as Optimal Relay Selection Algorithm (ORSA) and Matching based Relay Selection Algorithm (MRSA). ORSA is a centralized algorithm for the optimal selection of relays by transforming the main problem to a k-cardinality assignment problem that can be solved using the Hungarian algorithm. MRSA is a distributed algorithm that leverages concepts from matching theory to provide a stable solution for the relay selection problem. In both proposed algorithms static RF interfaces usage is applied to enable simultaneous use of different interfaces for data transmission. The simulations show that ORSA is optimally solving the relay selection problem. MRSA has an optimal stable result, that when there is no restriction on the number of channels, is only about 1% lower than ORSA. Besides, MRSA provides better results than direct transmission Without any Relay Selection Algorithm (WRSA) and Random Relay Selection Algorithm (RRSA), about 15% and 98%, respectively.