Ali H. Abdollahi Bafghi

Mr. Ali H. Abdollahi Bafghi

Sharif University of Technology, Tehran, Tehrān, Iran
orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 March 2022 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
ABAli H. Abdollahi Bafghi
Ali H. Abdollahi Bafghi
VJVahid Jamali
Vahid Jamali
MNMasoumeh Nasiri-Kenari
Masoumeh Nasiri-Kenari
RSRobert Schober
Robert Schober
In this paper, we study the degrees of freedom (DoF) region and sum DoF of the time-selective $K$ -user interference channel in the presence of intelligent reflecting surfaces (IRSs). We consider both active and passive IRSs. While both types of IRS can attenuate the amplitude and change the phase of a reflected electromagnetic wave, active IRSs are also capable of amplifying the wave. We derive inner and outer bounds for the DoF region and lower and upper bounds for the sum DoF of the $K$ -user interference channel in the presence of an active IRS and prove that the maximum value of $K$ for the sum DoF can be achieved if the number of IRS elements exceeds a certain finite value. The analysis framework developed for active IRSs forms the basis for our analysis of passive IRS-assisted systems. In particular, we present probabilistic inner and outer bounds for the DoF region and probabilistic lower and upper bounds for the sum DoF of the $K$ -user interference channel in the presence of a passive IRS and prove that the lower bound for the sum DoF asymptotically approaches $K$ as the number of IRS elements grows large.

6 April 2022 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
ANArash Nasri
Arash Nasri
ABAli H. Abdollahi Bafghi
Ali H. Abdollahi Bafghi
MNMasoumeh Nasiri-Kenari
Masoumeh Nasiri-Kenari
In this letter, we examine the positioning in wireless networks in the presence of IRSs. We show that IRSs can be used to localize the user when there are not enough transmitters (Base Station). To this end, we consider a network of one transmitter, few IRSs, and one receiver, whose location should be determined. Our results indicate that we can achieve the accuracy required in the localization by controlling the number of elements of IRSs and properly selecting the location of IRSs for a given region.

16 March 2020 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
ABAli H. Abdollahi Bafghi
Ali H. Abdollahi Bafghi
MMMahtab Mirmohseni
Mahtab Mirmohseni
FAFarid Ashtiani
Farid Ashtiani
MNMasoumeh Nasiri-Kenari
Masoumeh Nasiri-Kenari
In this letter, we consider a cache-enabled cloud radio access network with single-antenna base stations and single-antenna mobile users. Each base station can access the central processor of the network via a separate backhaul link with limited capacity. We utilize the interference alignment scheme as the transmission strategy between base stations and users into the wireless link. By assuming a block transmission scheme, we define a related data transmission delay. We derive the transmission delay and the network power consumption. At last, we solve the problem of joint optimization of data transmission delay and network power consumption using DC programming algorithm. In our numerical results, we investigate the trade-off between the delay and the power consumption, and compare the results with that of prior work, which does not take the transmission delay into account in its optimization problem.

25 May 2023 in IEEE Open Journal of the Communications Society
Verified
Journal Article
Open access
ABAli H. Abdollahi Bafghi
Ali H. Abdollahi Bafghi
VJVahid Jamali
Vahid Jamali
MMMahtab Mirmohseni
Mahtab Mirmohseni
MNMasoumeh Nasiri-Kenari
Masoumeh Nasiri-Kenari
In this paper, we study the DoF of the time-selective M×N wireless X-network assisted by an IRS. It is well-known that the DoF of the M×N wireless X-network is MNM+N-1. We show that the maximum DoF of M,N can be achieved when the IRS has enough elements. We consider two kinds of active and passive IRSs. We also consider two different scenarios, where the channel coefficients for IRS elements are either independent or correlated. For the M×N wireless X-network assisted by an active IRS with independent channel coefficients, we derive the inner and outer bounds on the DoF region and the lower and upper bounds on the sum DoF. We show that the maximum value for the sum DoF, i.e., (M,N), is achievable if the number of elements is more than a threshold for the active IRS, which is equal to the approximate capacity of M,Nlog(ρ+1)+o(log(ρ)) for the IRS-assisted X-network, where ρ is the transmission power. For the M×N wireless X-network assisted by a passive IRS with the assumption of independent and correlated channel coefficients for IRS elements, we introduce probabilistic inner and outer bounds on the DoF region, and the probabilistic lower and upper bounds on the sum DoF and show that the proposed lower bound for the sum DoF asymptotically approaches (M,N) with an order of at least O(1Q) for independent channel coefficients (i.e., the sum DoF is M,N(1-O(1Q))), which is equal to the approximate capacity of M,N(1-O(1Q))log(ρ+1)+o(log(ρ)) and O(1Q) for correlated channel coefficients (i.e., the sum DoF is M,N(1-O(1Q)), which is equal to the approximate capacity of M,N(1-O(1Q))log(ρ+1)+o(log(ρ))), where Q is the number of IRS elements. Thus, this decrement in the order of convergence shows the performance loss for correlated IRS elements. In addition, we extend the lower bound of the sum DoF proposed for the active IRS with independent channel coefficients to the scenario with correlated channel coefficients, i.e., the sum DoF is the same as independent IRS elements for M,N≤5 and Q≤20, and for other cases, the sum DoF converges to M,N with an order of at least O(1Q).

4 August 2022 in Entropy
Verified
Journal Article
Open access
PDF file
ABAli H. Abdollahi Bafghi
Ali H. Abdollahi Bafghi
MMMahtab Mirmohseni
Mahtab Mirmohseni
MNMasoumeh Nasiri-Kenari
Masoumeh Nasiri-Kenari
In this paper, we study the degrees of freedom (DoF) of a frequency-selective K-user interference channel in the presence of an instantaneous relay (IR) with multiple receiving and transmitting antennas. We investigate two scenarios based on the IR antennas’ cooperation ability. First, we assume that the IR receiving and transmitting antennas can coordinate with each other and that the transmitted signal of each transmitting antenna can depend on the received signals of all receiving antennas, and we derive lower and upper bounds for the sum DoF of this model. In an interference alignment scheme, we divide receivers into two groups called clean and dirty receivers. We design our scheme such that a part of the messages of clean receivers can be de-multiplexed at the IR. Thus, the IR can use these message streams for an interference cancellation at the clean receivers. Next, we consider an IR, the antennas of which do not have coordination with each other and where the transmitted signal of each transmitting antenna depends only on the received signal of its corresponding receiving antenna. We also derive lower and upper bounds for the sum DoF for this model of IR. We show that the achievable sum DoF decreases considerably compared with the coordinated case. In both of these models, our schemes achieve the maximum K sum DoF if the number of transmitting and receiving antennas is more than a finite threshold.

27 March 2026 in IEEE Journal on Selected Areas in Information Theory
Verified
Journal Article
Closed access
ACAbolfazl Changizi
Abolfazl Changizi
ABAli H. Abdollahi Bafghi
Ali H. Abdollahi Bafghi
MMMahtab Mirmohseni
Mahtab Mirmohseni
MNMasoumeh Nasiri-Kenari
Masoumeh Nasiri-Kenari
This paper studies cache-aided wireless networks in the presence of active intelligent reflecting surfaces (IRSs) from an information-theoretic perspective. Specifically, we investigate interference management in a cache-aided wireless network assisted by an active IRS to enhance the achievable degrees of freedom (DoF). To this end, we jointly design the content placement, delivery phase, and IRS coefficients, and propose a one-shot achievability scheme. Our scheme exploits transmitters’ cooperation, cache contents, interference alignment, and IRS capabilities, based on the network parameters. We derive the achievable one-shot sum-DoF for different cache sizes, network configurations, and numbers of IRS elements, followed by an upper bound. Our results highlight the potential of deploying an IRS in cache-aided wireless communication systems. In particular, they underscore the enhancement of achievable DoF for various parameter regimes, especially when cache sizes are inadequate. Notably, we show that access to an IRS with a sufficient number of elements enables the achievement of the maximum possible DoF for various parameter regimes of interest.