MNMahmoud Ferdosizade Naeiny

Mahmoud Ferdosizade Naeiny

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Mahmoud Ferdosizade Naeiny has a total of 14 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Multitarget direction of arrival trajectory estimation using BiLSTM and sequential allocation

    by Sahar Barzegari Banadkoki, Mahmoud Ferdosizadeh Naeiny

    The purpose of this study is multiple source direction of arrival (DoA) trajectory estimation using bidirectional long short‐term memory (BiLSTM) artificial neural network and sequential direction assignment. Conventional DoA tracking algorithms suffer from the necessity of accurate prior information and complex modeling. But in this article, the DoA trajectory estimation has been transformed into a mapping problem between a sequence of sample correlation matrices and a limited number of sampled directions from the corresponding trajectories. For this aim, several challenges must be resolved. One of these challenges is to define a hypothesis space of nonlinear and distinct trajectories, provided that they include most of the possible movement scenarios in the desired angular range. The second one is the lack of uniqueness between the sample correlation matrices and different permutations of DoAs. The last one is the assignment of the estimated DoAs to the corresponding trajectories. This article proposes polynomials for the path modeling of the moving sources. Then, directions and slopes of the paths at certain times are defined as the outputs of two separate BiLSTM networks. Finally, the directions and slopes of the paths are used for the sequential assignment of DoAs to the different trajectories. Simulation results indicate that the proposed method not only estimates the DoA trajectories of moving sources accurately, but also it significantly performs better than compressed sensing‐based and subspace‐based methods.

  • Sparse Recovery of Finite Alphabet Signals Using AMP and Its Application in DoA Estimation

    by Yasoub Eghbali, Mahmoud Ferdosizade Naeiny

    This study presents an approximate message passing (AMP)-based method for the reconstruction of sparse signals from multiple measurement vectors. Recently, Ziniel and Schniter have provided a general analysis of the AMP algorithm. They have assumed that the nonzero elements of the sparse signals have Gaussian distribution. This article extends their proposed method to the case that the nonzero elements of sparse vectors are chosen from a discrete finite alphabet. Therefore, the proposed algorithm is called approximate message passing with finite alphabet. Based on this assumption, the passing messages have been derived and the scheduling of the algorithm has been proposed using a three-step strategy. As an application, direction of arrival (DoA) estimation of digitally modulated signals is examined using simulations. The obtained results revealed that the proposed method would improve the DoA estimation accuracy compared to the conventional methods.


  • Blind detection for spatial modulation uplink multi‐user massive MIMO communications: A sparse Bayesian learning‐expectation maximization approach

    by Roya Khanzadeh, Mahmoud Ferdosizade Naeiny

    Massive spatial modulation (SM) multi‐input multi‐output (MIMO) system is a promising technique in uplink communications for future mobile communication, due to its power and spectral efficiencies. However, these systems, like other MIMO communications, face the challenge of channel estimation. Pilot‐based channel estimation methods result in data rate reduction as well as imposing additional complexity at the receiver side, which is intensified in time‐varying channels. Therefore, blind channel estimation is an alternative way to avoid pilot transmission. Considering a time‐varying channel and taking the advantages of machine learning techniques, blind channel estimation and data detection for SM uplink multi‐user massive MIMO communications is presented in this article. In this regard, a blind multi‐user detection based on the expectation‐maximization (EM) algorithm, called BMU‐EM, is presented first; however, this detector suffers from high computational complexity. In order to mitigate the complexity problem, a blind multi‐user detection based on sparse Bayesian learning and expectation‐maximization, called BMU‐SBEM, is proposed. Simulation results show that the BMU‐SBEM detector performs almost close to the optimum detector where the perfect channel information is available. Furthermore, the computational complexity of the BMU‐SBEM detector increases linearly with the number of users, making it suitable for massive communications in time‐varying channels.


  • Open Access

    A blind detection method for spatial modulation in MIMO communications

    by Roya Khanzadeh, Mahmoud Ferdosizade Naeiny

    Spatial modulation (SM) is one of the probable candidates to be utilised in the fifth generation of wireless networks due to its power and spectral efficiencies. Since only one active transmit antenna exists in spatial modulation, inter‐channel interferences are avoided and the number of radio frequency (RF) chains is reduced. However, channel estimation is a major challenge in spatial modulation communication systems. In this study, a novel blind signal and channel estimation method for spatial modulation‐based multi‐input multi‐output communications, based on the well‐known Expectation‐Maximisation algorithm, is presented. This blind detector requires only a few pilot symbols at the beginning of the transmission to resolve the inherent phase and permutation ambiguities. Simulation results demonstrate that the proposed detector performs very similar to the optimum detector with full channel state information and outperforms existing blind detectors.


  • Off‐grid DoA estimation method of wideband signals

    by Yasoub Eghbali, Mahmoud Ferdosizade Naeiny

    Summary: In this paper, an off‐grid direction of arrival (DoA) estimation method is proposed for wideband signals. This method is based on the sparse representation (SR) of the array covariance matrix. Similar to the time domain DoA estimation methods, the correlation function of the sources was assumed to be the same and known. A new measurement vector is obtained using the lower‐left triangular elements of the covariance matrix. The DoAs are estimated by quantizing the entire range of continuous angle space into discrete grid points. However, the exact DoAs may be located between two grid points; therefore, this estimation has errors. The accuracy of DoA estimation is improved by the minimization of the difference between the new measurement vector and its estimated values. Simulation results revealed that the proposed method can enhance the DoA estimation accuracy of wideband signals.


  • Open Access

    DFT‐based direction‐of‐arrival estimation using a nested minimum redundancy array

    by Yasoub Eghbali, Mahmoud Ferdosizade Naeiny

    Performance of the discrete Fourier transform (DFT)‐based direction‐of‐arrival (DoA) estimation method depends on the number of antennas. Increasing the number of antennas will improve the accuracy of DoA estimation. In this study, the authors propose a new DFT‐based DoA estimation method using a nested minimum redundancy array (NMRA). By vectorisation of the covariance matrix of the received signal of an NMRA with low number of antennas, a virtual uniform linear array with a large number of antennas can be obtained. An initial estimation of DoAs can be derived by applying the normalised centralised DFT matrix to the observations of virtual uniform linear array. By minimisation of the difference between the virtual linear array observations and their estimated values, the accuracy of DoA estimation will be improved. Simulation results show that the proposed method has better performance in comparison with the conventional ones.


  • Open Access

    Mobility-Aware Reconstruction Algorithm for Correlated Nonzero Neighborhood Structured Downlink Channel in Massive MIMO

    by Sanaz Rezvani Kenarsari, Mahmoud Ferdosizade Naeiny

    This paper investigates downlink (DL) channel estimation of frequency division duplex (FDD) massive multiple-input-multiple-output (MIMO) with a finite number of base station (BS) antennas. Based on the performance analysis of DL channel in FDD, it is demonstrated that the interference effect cannot be ignored in the finite region. Also, excessive training overhead is required in conventional channel estimation methods when the number of BS antennas goes large. Therefore, it is necessary to design an algorithm for alleviating the interference in addition to the reduction of pilot overhead. In this paper, a general model is presented to exploit certain sparsity structure of massive MIMO channel in beam domain, which is called nonzero-neighborhood (NZN) structure. Considering the smooth variation of channel paths during two consecutive estimation intervals, a compressed sensing-based algorithm is proposed to efficiently estimate and track NZN-structured DL channel. The convergence behavior and computational complexity of the proposed mobility-aware subspace pursuit (MA-SP) algorithm are analyzed based on restricted isometric property. It is demonstrated that the application of proposed MA-SP algorithm efficiently reduces the required pilot length in channel estimation. Interference analysis shows that inter-cell interference is considerably alleviated in the proposed channel estimation phase without any prior information about interference. Simulation results demonstrate the effectiveness of the proposed MA-SP technique compared with the previous methods.