MDMohammad Javad Dehghani

Mohammad Javad Dehghani

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Mohammad Javad Dehghani has a total of 76 co-authors. Here are the top co-authors by number of shared publications:

  • Mohammad Sadegh Helfroush

    Shiraz University of Technology, Shiraz, Iran

    6 shared publications
  • Kamran Kazemi

    Shiraz University of Technology, Shiraz, Iran

    5 shared publications
  • Ashkan Tashk

    Department of Applied Mathematics and Computer Science, Section for Cognitive Systems, Denmark Technical University, Kgs. Lyngby, Denmark

    3 shared publications
  • Assieh Shahimaeen

    Department of Electrical and Electronics Engineering Shiraz University of Technology Shiraz Iran

    3 shared publications
  • Hamed Ghodrati

    Department of Telecommunication Engineering, Shiraz University of Technology, Shiraz, Iran

    3 shared publications
  • Keyvan Kasiri

    Department of Electrical and Electronics Engineering, Shiraz University of Technology, Shiraz, Iran

    3 shared publications

Latest Publications

  • Open Access

    Auto-Calibration and 2D-DOA Estimation in UCAs via an Integrated Wideband Dictionary

    by Zavareh Bozorgasl, Hao Chen, Mohammad J. Dehghani

    In this paper, we present a novel auto-calibration scheme for the joint estimation of the two-dimensional (2-D) direction-of-arrival (DOA) and the mutual coupling matrix (MCM) for a signal measured using uniform circular arrays. The method employs an integrated wideband dictionary to mitigate the detrimental effects of the discretization of the continuous parameter space over the considered azimuth and elevation angles. This leads to a reduction of the computational complexity and obtaining of more accurate DOA estimates. Given the more reliable DOA estimates, the method also allows for the estimation of more accurate mutual coupling coefficients. The method utilizes an integrated dictionary in order to iteratively refine the active parameter space, thereby reducing the required computational complexity without reducing the overall performance. The complexity is further reduced by employing only the dominant subspace of the measured signal. Furthermore, the proposed method does not require a constraint on the prior knowledge of the number of nonzero coupling coefficients nor suffer from ambiguity problems. Moreover, a simple formulation for 2-D non-numerical integration is presented. Simulation results show the effectiveness of the proposed method.

  • Open Access

    Deep Reinforcement Learning-Based Sum Rate Fairness Trade-Off for Cell-Free mMIMO

    by Mostafa Rahmani, Manijeh Bashar, Mohammad Javad Dehghani, Ali Akbari, Pei Xiao, Rahim Tafazolli, Mérouane Debbah

    The uplink of a cell-free massive multiple-input multiple-output with maximum-ratio combining (MRC) and zero-forcing (ZF) schemes are investigated. A power allocation optimization problem is considered, where two conflicting metrics, namely the sum rate and fairness, are jointly optimized. As there is no closed-form expression for the achievable rate in terms of the large scale-fading (LSF) components, the sum rate fairness trade-off optimization problem cannot be solved by using known convex optimization methods. To alleviate this problem, we propose two new approaches. For the first approach, a use-and-then-forget scheme is utilized to derive a closed-form expression for the achievable rate. Then, the fairness optimization problem is iteratively solved through the proposed sequential convex approximation (SCA) scheme. For the second approach, we exploit LSF coefficients as inputs of a twin delayed deep deterministic policy gradient (TD3), which efficiently solves the non-convex sum rate fairness trade-off optimization problem. Next, the complexity and convergence properties of the proposed schemes are analyzed. Numerical results demonstrate the superiority of the proposed approaches over conventional power control algorithms in terms of the sum rate and minimum user rate for both the ZF and MRC receivers. Moreover, the proposed TD3-based power control achieves better performance than the proposed SCA-based approach as well as the fractional power scheme.


  • Pricing‐based power allocation in cloud radio access network with multiple access technology selection

    by Ali Asghar Ansari, Mohsen Eslami, Mohammad Javad Dehghani

    In this article, we consider an uplink economy‐efficient resource allocation framework in a multicellular cloud radio access network (C‐RAN) architecture with network virtualization, where a mobile network operator (MNO) interacts with a number of mobile virtual network operators (MVNOs) with a predetermined business model. OFDMA and Massive MIMO multiple access technologies have been assumed to be available for each MVNO at two different prices. In this setup, we propose a multi‐access technology selection approach (MATSA) with the objective of maximizing delivered rate to end users, reducing operation costs and maximizing MVNOs' profit subject to a set of constraints, which leads to a nonconvex resource allocation problem with very high computational complexity. The utility function is defined as the difference between the total throughput and the utilization cost for each technology. To tackle this problem, we apply complementary geometric programming (CGP) and successive convex approximation (SCA), that results in a two‐step iterative solution. Simulation results demonstrate superiority of the proposed approach compared to a similar scenario with predetermined multi‐access technology, especially for large numbers of users.


  • Open Access

    Multi-Agent Reinforcement Learning-Based Pilot Assignment for Cell-Free Massive MIMO Systems

    by Mostafa Rahmani, Mohammad Javad Dehghani, Pei Xiao, Manijeh Bashar, Merouane Debbah

    Cell-free massive multiple-input multiple-output (CF-mMIMO) has been considered as one of the potential technologies for beyond-5G and 6G to meet the demand for higher data capacity and uniform service rate for user equipment. However, reusing the same pilot signals by several users, owing to limited pilot resources, can result in the so-called pilot contamination problem, which can prevent CF-mMIMO from unlocking its full performance potential. It is challenging to employ classical pilot assignment (PA) methods to serve many users simultaneously with low complexity; therefore, a scalable and distributed PA scheme is required. In this paper, we utilize a learning-based approach to handle the pilot contamination problem by formulating PA as a multi-agent static game, developing a two-level hierarchical learning algorithm to mitigate the effects of pilot contamination, and presenting an efficient yet scalable PA strategy. We first model a PA problem as a static multi-agent game with P teams (agents), in which each team is represented by a specific pilot. We then define a multi-agent structure that can automatically determine the most appropriate PA policy in a distributed manner. The numerical results demonstrate that the proposed PA algorithm outperforms previous suboptimal algorithms in terms of the per-user spectral efficiency (SE). In particular, the proposed approach can increase the average SE and 95%-likely SE by approximately 2.2% and 3.3%, respectively, compared to the best state-of-the-art solution.


  • Underwater sound speed profile parameters estimation in asynchronous network

    by Rahman Zandi, Mohammad Javad Dehghani, Vali Kavoosi

    The technology of underwater wireless acoustic sensor networks (UWSNs) plays an important role in many commercial and military applications in underwater. In UWSNs, there exist many challenges posed by the specific characteristics of underwater acoustic channel, such as sound propagation speed is a function of depth with unknown parameters. Besides, time synchronization of anchor nodes is a crucial part of the applicable network. Time synchronization of anchor nodes as well as estimation of sound speed parameters considering an isogradient profile is explored here. While the previous efforts do not take into account these factors, this article assumes only one synchronized anchor node in the network and enables joint synchronization of the other anchor nodes and the estimation of the propagation delays between the anchor nodes using a weighted linear least square solution. Then, it uses the estimated propagation delays to estimate the unknown parameters of the sound speed profile using a conventional Gauss‐Newton algorithm with approximately three iterations to converge. Validation of the proposed method is done by the numerical simulations and to demonstrate the effectiveness of the proposed method we compare the results with Cramer‐Rao bound average.


  • Multistage direction‐of‐arrival estimation approach for noncoherent and multigroup coherent signals

    by Assieh Shahimaeen, Mohammad Javad Dehghani

    A new multistage direction estimation (MSDE) method using two parallel uniform linear arrays (ULAs) is proposed, which estimates two‐dimensional (2D) direction‐of‐arrivals (DOAs) of a mixture of noncoherent and multigroup of coherent signals, sequentially. At first, we estimate 2‐D DOAs of noncoherent signals, next, utilize an iterative procedure to make the estimation accuracy better, then omit the effect of noncoherent signals by the oblique projectors. Now, to estimate the 2D DOAs of each group separately, the group with the minimum coherent signals is decorrelated by the forward spatial smoothing, then an initial 2D DOA estimation is calculated and the estimation accuracy of this group is improved by using an iterative procedure. Afterward, the information of the signals whose DOAs are estimated, is omitted by oblique projectors. We repeat in the same way until the 2D DOAs of all coherent groups are estimated. It is shown in the simulation results section that the proposed method has good performance.

  • Two‐dimensional DOA estimation for noncoherent and coherent signals using subspace approach

    by Assieh Shahimaeen, Mohammad Javad Dehghani, Mahdi Dodangeh

    This paper focuses on the problem of two‐dimensional (2D) direction‐of‐arrival (DOA) estimation for a mixture of noncoherent and coherent signals impinging on two parallel uniform linear arrays. It adopts the principal‐eigenvector utilization for modal analysis (PUMA)–based algorithm. The algorithm offers a closed‐form solution for updating the 2D DOA estimation and pairs the estimated angles automatically as well as has mild computational complexity. Finally, simulation results confirm that our PUMA‐based algorithm has good performance in handling 2D DOA estimation even in the presence of coherent signals.


  • Two‐dimensional DOA estimation for coherent signals using a novel covariance‐like matrix

    by Assieh Shahimaeen, Mohamad Javad Dehghani

    This paper addresses a two‐dimensional (2‐D) direction of arrival (DOA) estimation of coherent signals problem. To do so, we first reconstruct a covariance‐like matrix, and then apply forward and backward spatial smoothing (FBSS) method as a preprocessor to remedy the rank deficiency problem. By utilizing the covariance‐like matrix instead of outputs sensors in the FBSS method, the noise and small fading factor influences are reduced in the DOA estimation problem. Afterward, two matrix pencil pairs are exploited to extract 2‐D DOA of impinging signals. This two matrix pencil pairs method can estimate 2‐D DOA with repeated eigenvalues efficiently and also pair the estimated parameters automatically. The proposed algorithm not only has all the privileges of the estimation of signal parameters via rotational invariant techniques (ESPRIT)‐like algorithm but also increases the array aperture. By mathematical tractability, we derive Cramer‐Rao bounds for azimuth and elevation angles for coherent signals received by uniform rectangular array to compare the performance of the estimation algorithms with a lower bound. Simulation results show that the proposed algorithm outperforms the symmetric configuration of uniform rectangular array (SC‐URA), the FBSS–multiple‐signal classification (FBSS‐MUSIC) and the ESPRIT‐like algorithms in terms of root mean squared error (RMSE).