Ehsan Moeen Taghavi
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
Ehsan Moeen Taghavi has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Ghosheh Abed Hodtani
Department of Electric and Computer Engineering, Ferdowsi University, Mashhad, Iran
5 shared publications - Matti Latva-Aho
Centre for Wireless Communications (CWC), University of Oulu, Oulu, Finland
2 shared publications - Nandana Rajatheva
University of Oulu
2 shared publications - Ramin Hashemi
Centre for Wireless Communications, University of Oulu, Oulu, Finland
2 shared publications - Alireza Alizadeh
Department of Electrical and Computer Engineering, Tufts University, Medford, MA, USA
1 shared publication - Mai Vu
Department of Electrical and Computer Engineering, Tufts University, Medford, MA, USA
1 shared publication
Latest Publications
- Open Access
- 26 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (7) , 1824-1828
Environment-Aware Joint Active/Passive Beamforming for RIS-Aided Communications Leveraging Channel Knowledge Map
Reconfigurable intelligent surface (RIS)-aided communication is a promising technology for 6G systems to reconfigure the propagation environment proactively. However, it requires efficient real-time channel training, which suffers excessive overhead. To resolve this challenge, taking advantage of sensing with radio waves and localization, we propose a novel environment-aware joint active/passive beamforming for RIS-aided wireless communication based on the new concept of channel knowledge map (CKM). In the proposed scheme, the user equipments (UEs) location information is combined with the radio environment information provided by CKM to achieve efficient beamforming without real-time training. Simulation results show the proposed scheme’s superior performance over training-based beamforming, which is also quite robust to errors related to UE’s location in practice.
- 26 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (7) , 1824-1828
Open AccessEnvironment-Aware Joint Active/Passive Beamforming for RIS-Aided Communications Leveraging Channel Knowledge Map
Reconfigurable intelligent surface (RIS)-aided communication is a promising technology for 6G systems to reconfigure the propagation environment proactively. However, it requires efficient real-time channel training, which suffers excessive overhead. To resolve this challenge, taking advantage of sensing with radio waves and localization, we propose a novel environment-aware joint active/passive beamforming for RIS-aided wireless communication based on the new concept of channel knowledge map (CKM). In the proposed scheme, the user equipments (UEs) location information is combined with the radio environment information provided by CKM to achieve efficient beamforming without real-time training. Simulation results show the proposed scheme’s superior performance over training-based beamforming, which is also quite robust to errors related to UE’s location in practice.
- Open Access
- 23 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 72 (8) , 10448-10461
Joint Active-Passive Beamforming and User Association in IRS-Assisted mmWave Cellular Networks
Intelligent reflecting surfaces (IRSs) are a promising technology for future-generation wireless networks by extending coverage region to blind spots and increasing mmWave propagation paths in non-line of sight environments. User association (UA) in dense millimeter wave (mmWave) networks is vital to characterizing connections among base stations (BSs) and mobile users for load balancing, interference management, and maximizing network utility. However, it has yet to be examined thoroughly in a multi-IRS-aided network. This paper presents a new UA scheme that takes cell interference into account for a multi-cell mmWave cellular network aided with multiple IRSs. We formulate a network spectral efficiency maximization problem by jointly optimizing active beamforming (AB) at the BSs, passive beamforming (PB) at the IRSs, and user-BS association with consideration of the impact of IRSs. We then propose a computationally efficient iterative algorithm based on alternating optimization (AO) to resolve this intractable mixed-integer non-convex problem. A fractional programming technique is used to optimize active beamforming at the BSs and passive beamforming at the IRSs, and a penalization method combined with successive convex programming is applied for UA optimization, which is shown to reach the optimal solution. Simulation results show significant performance improvements obtained by the proposed algorithm, providing higher spectral efficiency compared to several benchmark algorithms, while having a low computational complexity.
- 23 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 72 (8) , 10448-10461
Open AccessJoint Active-Passive Beamforming and User Association in IRS-Assisted mmWave Cellular Networks
Intelligent reflecting surfaces (IRSs) are a promising technology for future-generation wireless networks by extending coverage region to blind spots and increasing mmWave propagation paths in non-line of sight environments. User association (UA) in dense millimeter wave (mmWave) networks is vital to characterizing connections among base stations (BSs) and mobile users for load balancing, interference management, and maximizing network utility. However, it has yet to be examined thoroughly in a multi-IRS-aided network. This paper presents a new UA scheme that takes cell interference into account for a multi-cell mmWave cellular network aided with multiple IRSs. We formulate a network spectral efficiency maximization problem by jointly optimizing active beamforming (AB) at the BSs, passive beamforming (PB) at the IRSs, and user-BS association with consideration of the impact of IRSs. We then propose a computationally efficient iterative algorithm based on alternating optimization (AO) to resolve this intractable mixed-integer non-convex problem. A fractional programming technique is used to optimize active beamforming at the BSs and passive beamforming at the IRSs, and a penalization method combined with successive convex programming is applied for UA optimization, which is shown to reach the optimal solution. Simulation results show significant performance improvements obtained by the proposed algorithm, providing higher spectral efficiency compared to several benchmark algorithms, while having a low computational complexity.
- 14 September 2018
- Published by Wiley in International Journal of Communication Systems
- Vol. 31 (17)
Partial feedback impact on achievable rate region in multiple‐access relay channels
Summary: For discrete memoryless Slepian‐Wolf multiple‐access relay channel with relay‐sources feedback (SW‐MARC‐RSF), an achievable rate region via partial decode and forward strategy at the relay is proposed, and by extending the results to the continuous alphabet version, the corresponding achievable rate region of the Gaussian SW‐MARC‐RSF is obtained. It is shown that our results include the important previous works on multiple‐access channel (MAC) with feedback (Cover‐Leung rate region) and without feedback (Slepian‐Wolf [SW] rate region, etc) as special cases. Finally, through comparison of the achievable rate regions, with and without feedback, the impact of feedback on achievability is analyzed. The derived achievable rate region is shown to resolve the residual uncertainty at the receiver in an efficient way and demonstrates that in the partial decode and forward strategy, relay‐sources feedback increases the achievable rate region in both discrete memoryless and Gaussian multiple‐access relay channels.
- 14 September 2018
- Published by Wiley in International Journal of Communication Systems
- Vol. 31 (17)
Partial feedback impact on achievable rate region in multiple‐access relay channels
Summary: For discrete memoryless Slepian‐Wolf multiple‐access relay channel with relay‐sources feedback (SW‐MARC‐RSF), an achievable rate region via partial decode and forward strategy at the relay is proposed, and by extending the results to the continuous alphabet version, the corresponding achievable rate region of the Gaussian SW‐MARC‐RSF is obtained. It is shown that our results include the important previous works on multiple‐access channel (MAC) with feedback (Cover‐Leung rate region) and without feedback (Slepian‐Wolf [SW] rate region, etc) as special cases. Finally, through comparison of the achievable rate regions, with and without feedback, the impact of feedback on achievability is analyzed. The derived achievable rate region is shown to resolve the residual uncertainty at the receiver in an efficient way and demonstrates that in the partial decode and forward strategy, relay‐sources feedback increases the achievable rate region in both discrete memoryless and Gaussian multiple‐access relay channels.
- Open Access
- 16 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 45834-45845
Multiple Access Relay Channel With Relay-Sources Feedback
Feedback analysis on the rate region of multi-user channels is a problem of great importance in information and communication theory. In this paper, the Slepian-Wolf multiple access relay channel (SW-MARC) with relay-sources feedback is studied as a more general model of MARC where feedback outputs are taken into consideration. First, an inner bound on the capacity region of the discret alphabet and memoryless (DM) model of this channel (DM-SW-MARC) is obtained using partial decode and forward strategy. Second, an outer bound on the capacity region is derived by applying Fano's inequality. Third, the DM results are extended to the continuous alphabet version, where an inner bound on the capacity region of the Gaussian MARC (GMARC) with relay-sources feedback is derived. Fourth, it is shown that our results include the important previous works on multiple-access channel with feedback (Cover-Leung rate region) and without feedback (Slepian-Wolf (SW) rate region, etc.) as special cases. Finally, we investigate the effect of feedback and show that the presence of feedback enables the sources to understand each other's messages, which in turn allows the sources to cooperate to resolve the residual uncertainty at the receiver in an efficient way and at the same time, independent fresh information from the sources is superimposed upon the resolution information.
- 16 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 45834-45845
Open AccessMultiple Access Relay Channel With Relay-Sources Feedback
Feedback analysis on the rate region of multi-user channels is a problem of great importance in information and communication theory. In this paper, the Slepian-Wolf multiple access relay channel (SW-MARC) with relay-sources feedback is studied as a more general model of MARC where feedback outputs are taken into consideration. First, an inner bound on the capacity region of the discret alphabet and memoryless (DM) model of this channel (DM-SW-MARC) is obtained using partial decode and forward strategy. Second, an outer bound on the capacity region is derived by applying Fano's inequality. Third, the DM results are extended to the continuous alphabet version, where an inner bound on the capacity region of the Gaussian MARC (GMARC) with relay-sources feedback is derived. Fourth, it is shown that our results include the important previous works on multiple-access channel with feedback (Cover-Leung rate region) and without feedback (Slepian-Wolf (SW) rate region, etc.) as special cases. Finally, we investigate the effect of feedback and show that the presence of feedback enables the sources to understand each other's messages, which in turn allows the sources to cooperate to resolve the residual uncertainty at the receiver in an efficient way and at the same time, independent fresh information from the sources is superimposed upon the resolution information.
- 1 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 362-366
Partial Feedback Analysis on Achievable Rate in Relay Channels
For the benefit of discrete memoryless relay channel with relay-source feedback configuration, an achievable rate via partial decode and forward strategy is proposed. Moreover, by extending the discrete memoryless results to the continuous alphabet version, the achievable rate of the Gaussian relay channel with relay-source feedback will be calculated. Finally, through comparison of the achievable rates, with and without the feedback, the impact of the feedback on increasing or decreasing the achievable rate is analyzed. The derived achievable rate is shown to resolve the residual uncertainty at the receiver in an efficient way.
- 1 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 362-366
Partial Feedback Analysis on Achievable Rate in Relay Channels
For the benefit of discrete memoryless relay channel with relay-source feedback configuration, an achievable rate via partial decode and forward strategy is proposed. Moreover, by extending the discrete memoryless results to the continuous alphabet version, the achievable rate of the Gaussian relay channel with relay-source feedback will be calculated. Finally, through comparison of the achievable rates, with and without the feedback, the impact of the feedback on increasing or decreasing the achievable rate is analyzed. The derived achievable rate is shown to resolve the residual uncertainty at the receiver in an efficient way.
- 6 July 2017
- Published by Wiley in International Journal of Communication Systems
- Vol. 30 (18)
Energy‐efficient communications over multiple access relay channels
Summary: Recently, due to the importance of green communications and power‐limited systems, energy efficiency in vehicular technologies has become a hot research topic. In this paper, we analyze energy‐efficient coding schemes in multiple access relay channels. First, the coding scheme in the multiple access relay channel is introduced. At the desired source rates, 3 optimal sets of resource allocation (the total power consumption, the relay power consumption, and the source power consumption) are given in the closed form. The analysis shows that the proposed energy‐efficient schemes achieve higher data rates and significantly outperform especially by reducing the relay energy consumption, which is useful for the shared relays. Moreover, the results allow a comprehensive description of the power consumption systems and give a detailed understanding of the desired message coding and the resource dedication for every desired sum rate.
- 6 July 2017
- Published by Wiley in International Journal of Communication Systems
- Vol. 30 (18)
Energy‐efficient communications over multiple access relay channels
Summary: Recently, due to the importance of green communications and power‐limited systems, energy efficiency in vehicular technologies has become a hot research topic. In this paper, we analyze energy‐efficient coding schemes in multiple access relay channels. First, the coding scheme in the multiple access relay channel is introduced. At the desired source rates, 3 optimal sets of resource allocation (the total power consumption, the relay power consumption, and the source power consumption) are given in the closed form. The analysis shows that the proposed energy‐efficient schemes achieve higher data rates and significantly outperform especially by reducing the relay energy consumption, which is useful for the shared relays. Moreover, the results allow a comprehensive description of the power consumption systems and give a detailed understanding of the desired message coding and the resource dedication for every desired sum rate.
- Open Access
- 1 March 2016
- Published by Institution of Engineering and Technology (IET) in IET Communications
- Vol. 10 (5) , 508-524
Impact of the relay on the coverage region of multiple‐access channels
From practical and theoretical viewpoints, performance analysis of communication systems by using information‐theoretic results is important. In this study, first, the authors obtain a general achievable rate region for three‐user discrete memoryless multiple‐access relay channel (MARC) via partial decode and forward strategy and regular block Markov encoding/backward decoding. Also by extending the discrete alphabet results to the continuous alphabet channel, an inner bound for three‐user Gaussian MARC (GMARC) is achieved. Next, based on the inner bound of three‐user GMARC, they analyse the impact of a relay on the coverage region of MARC, as a basic model for uplink communications between a base station and users with the help of a relay. This analysis includes the coverage region for the multiple‐access channel and two‐user GMARC as special cases. Considering rate regions for the GMARC and fading GMARC, it is proved that in a fixed transmission rate, the relay extends coverage region of the MARC. Numerical illustrations confirm their theoretical results.
- 1 March 2016
- Published by Institution of Engineering and Technology (IET) in IET Communications
- Vol. 10 (5) , 508-524
Open AccessImpact of the relay on the coverage region of multiple‐access channels
From practical and theoretical viewpoints, performance analysis of communication systems by using information‐theoretic results is important. In this study, first, the authors obtain a general achievable rate region for three‐user discrete memoryless multiple‐access relay channel (MARC) via partial decode and forward strategy and regular block Markov encoding/backward decoding. Also by extending the discrete alphabet results to the continuous alphabet channel, an inner bound for three‐user Gaussian MARC (GMARC) is achieved. Next, based on the inner bound of three‐user GMARC, they analyse the impact of a relay on the coverage region of MARC, as a basic model for uplink communications between a base station and users with the help of a relay. This analysis includes the coverage region for the multiple‐access channel and two‐user GMARC as special cases. Considering rate regions for the GMARC and fading GMARC, it is proved that in a fixed transmission rate, the relay extends coverage region of the MARC. Numerical illustrations confirm their theoretical results.