MMMostafa Mohammadkarimi

Mostafa Mohammadkarimi

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

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


Mostafa Mohammadkarimi has a total of 13 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Low-Complexity Pilot-Independent Time Synchronization for Zero-Padding-Based IoT Devices

    by Koosha Pourtahmasi Roshandeh, Mostafa Mohammadkarimi, Masoud Ardakani

    Many Internet of Things (IoT) devices are small, battery-powered systems, requiring energy-efficient solutions to extend their operational life. To reduce communication energy consumption, we suggest zero-padding (ZP)-orthogonal frequency-division multiplexing (OFDM) as a more efficient alternative to its cyclic-prefix (CP)-OFDM counterpart. However, ZP-OFDM typically relies on pilot data for time synchronization, which can be prohibitively expensive for resource-constrained IoT devices. This paper introduces a low-complexity, pilot-independent time synchronization method for ZP-OFDM. Thus, the proposed approach eliminates the need for pilot data which further enhances the energy efficiency of ZP-based signaling for IoT applications. Simulation results demonstrate that the proposed estimators achieve a high lock-in probability even in low SNR with low computational complexity, enabling the practical deployment of zero-padding signaling in IoT systems. Although the proposed methods cannot be directly integrated to the existing IoT technologies such as Zigbee for physical implementation, they pave the way for practical implementations in future IoT technologies.

  • Cooperative Sense and Avoid for UAVs Using Secondary Radar

    by Mostafa Mohammadkarimi, Raj Thilak Rajan

    A cooperative Sense and Avoid (SAA) algorithm for safe navigation of small-sized UAVs within an airspace is proposed in this paper. The proposed method relies upon cooperation between the UAV and the surrounding transponder-equipped aviation obstacles. To do so, the aviation obstacles share their altitude and identification code with the UAV by using the Mode S operation of the Secondary Surveillance Radar (SSR) after interrogation. The proposed SAA algorithm benefits from the estimate of the aviation obstacle's elevation angle for ranging. This results in more accurate ranging compared to the round-trip time-based ranging, which is currently used in existing SAA systems. We also propose a low-complexity and accurate radial velocity estimator for the Mode S operation of the SSR which is employed in the proposed SAA system. Furthermore, by considering the Pulse-Position Modulation (PPM) of the transponder reply as a waveform of pulse radar with random pulse repetition intervals, the maximum unambiguous radial velocity is obtained. The proposed SAA is equipped with an intruder identification method that determines the risk level of the surrounding transponder-equipped aviation obstacles. Given the estimated parameters, the intruder identification method classifies the aviation obstacles into high- medium-, and low-risk intruders. The output of the classifier enables the UAV to plan its path or maneuver for safe navigation accordingly. The root mean square error (RMSE) of the proposed estimators are analytically derived, and the effectiveness of our SAA solution is confirmed through simulation experiments.


  • Open Access

    Joint Ranging and Phase Offset Estimation for Multiple Drones using ADS-B Signatures

    by Mostafa Mohammadkarimi, Geert Leus, Raj Thilak Rajan

    A new method for joint ranging and Phase Offset (PO) estimation of multiple drones/aircrafts is proposed in this paper. The proposed method employs the superimposed uncoordinated Automatic Dependent Surveillance Broadcast (ADS-B) packets broadcasted by drones/aircrafts for joint range and PO estimation. It jointly estimates range and PO prior to ADS-B packet decoding; thus, it can improve air safety when packet decoding is infeasible due to packet collision. Moreover, it enables coherent detection of ADS-B packets, which can result in more reliable multiple target tracking in aviation systems using cooperative sensors for detect and avoid (DAA). By minimizing the Kullback Leibler Divergence (KLD) statistical distance measure, we show that the received complex baseband signal coming from K uncoordinated drones corrupted by Additive White Gaussian Noise (AWGN) at a single antenna receiver can be approximated by an independent and identically distributed Gaussian Mixture (GM) with 2 power K mixture components in the two dimensional (2D) plane. While direct joint Maximum Likelihood Estimation (MLE) of range and PO from the derived GM Probability Density Function (PDF) leads to an intractable maximization, our proposed method employs the Expectation Maximization (EM) algorithm to estimate the modes of the 2D Gaussian mixture followed by a reordering estimation technique through combinatorial optimization to estimate range and PO. An extension to a multiple antenna receiver is also investigated in this paper. While the proposed estimator can estimate the range of multiple drones with a single receive antenna, a larger number of drones can be supported with higher accuracy by the use of multiple antennas at the receiver. The effectiveness of the proposed estimator is supported by simulation results. We show that the proposed estimator can jointly estimate the range of three drones accurately.

  • Open Access

    Efficient Massive Machine Type Communication (mMTC) via AMP

    by Mostafa Mohammadkarimi, Masoud Ardakani

    We propose efficient and low-complexity multiuser detection (MUD) algorithms for Gaussian multiple access channel (G-MAC) for short-packet transmission in massive machine type communications. To do so, we first formulate the G-MAC MUD problem as a sparse signal recovery problem and obtain the exact and approximate joint prior distribution of the sparse vector to be recovered. Then, we employ the Bayesian approximate message passing (AMP) algorithms with the optimal separable and non-separable minimum mean squared error (MMSE) denoisers for soft decoding of the sparse vector. The effectiveness of the proposed MUD algorithms for a large number of devices is supported by simulation results. For packets of 8 information bits, while the state-of-the-art AMP with soft-threshold denoising achieves 8/100 of the upper bound at Eb/N0 = 4 dB, the proposed algorithms reach 4/7 and 1/2 of the upper bound.

  • Joint Ranging and Phase Offset Estimation for Multiple Drones Using ADS-B Signatures

    by Mostafa Mohammadkarimi, Geert Leus, Raj Thilak Rajan

    A new method for joint ranging and Phase Offset (PO) estimation of multiple drones/aircrafts is proposed in this paper. The proposed method employs the superimposed uncoordinated Automatic Dependent Surveillance-Broadcast (ADS-B) packets broadcasted by drones/aircrafts for joint range and PO estimation. It jointly estimates range and PO prior to ADS-B packet decoding; thus, it can improve air safety when packet decoding is infeasible due to packet collision. Moreover, it enables coherent detection of ADS-B packets, which can result in more reliable multiple target tracking in aviation systems using cooperative sensors for detect and avoid (DAA). By minimizing the Kullback-Leibler Divergence (KLD) statistical distance measure, we show that the received complex baseband signal coming from K uncoordinated drones/aircrafts corrupted by Additive White Gaussian Noise (AWGN) at a single antenna receiver can be approximated by an independent and identically distributed (i.i.d.) Gaussian Mixture (GM) with $2^{K}$ mixture components in the two-dimensional (2D) plane. While direct joint Maximum Likelihood Estimation (MLE) of range and PO from the derived GM Probability Density Function (PDF) leads to an intractable maximization, our proposed method employs the Expectation-Maximization (EM) algorithm to estimate the modes of the 2D Gaussian mixture followed by a reordering estimation technique through combinatorial optimization to estimate range and PO. An extension to a multiple antenna receiver is also investigated in this paper. While the proposed estimator can estimate the range of multiple drones/aircrafts with a single receive antenna, a larger number of drones/aircrafts can be supported with higher accuracy by the use of multiple antennas at the receiver. The effectiveness of the proposed estimator is supported by simulation results. We show that the proposed estimator can jointly estimate the range of multiple drones/aircrafts accurately.


  • Open Access

    Joint Method of Moments (JMoM) and Successive Moment Cancellation (SMC) Multiuser Time Synchronization for ZP-OFDM-Based Waveforms Applicable to Joint Communication and Sensing

    by Koosha Pourtahmasi Roshandeh, Mostafa Mohammadkarimi, Masoud Ardakani

    It has been recently shown that zero padding (ZP)-orthogonal frequency-division multiplexing (OFDM) is a promising candidate for 6G wireless systems requiring joint communication and sensing. In this paper, we consider a multiuser uplink scenario where users are separated in power domain, i.e., non-orthogonal multiple access (NOMA), and use ZP-OFDM signals. The uplink transmission is grant-free and users are allowed to transmit asynchronously. In this setup, we address the problem of time synchronization by estimating the timing offset (TO) of all the users. We propose two non-data-aided (NDA) estimators, i.e., the joint method of moment (JMoM) and the successive moment cancellation (SMC), that employ the periodicity of the second order moment (SoM) of the received samples for TO estimation. Moreover, the coding assisted (CA) version of the proposed estimators, i.e., CA-JMoM and CA-SMC, are developed for the case of short observation samples. We also extend the proposed estimators to multiuser multiple-input multiple-output (MIMO) systems. The effectiveness of the proposed estimators is evaluated in terms of lock-in probability under various practical scenarios. Simulation results show that the JMoM estimator can reach the lock-in probability of one for the moderate range of Eb/N0 values. While existing NDA TO estimators in the literature either offer low lock-in probability, high computational complexity that prevents them from being employed in MIMO systems, or are designed for single-user scenarios, the proposed estimators in this paper address all of these issues.


  • Efficient Massive Machine Type Communication (mMTC) via AMP

    by Mostafa Mohammadkarimi, Masoud Ardakani

    We propose efficient and low-complexity multiuser detection (MUD) algorithms for Gaussian multiple access channel (G-MAC) for short-packet transmission in massive machine type communications. To do so, we first formulate the G-MAC MUD problem as a sparse signal recovery problem and obtain the exact and approximate joint prior distribution of the sparse vector to be recovered. Then, we employ the Bayesian approximate message passing (AMP) algorithms with the optimal separable and nonseparable minimum mean squared error (MMSE) denoisers for soft decoding of the sparse vector. The effectiveness of the proposed MUD algorithms for a large number of devices is supported by simulation results. For packets of 8 information bits, while the state-of-the-art AMP with soft-threshold denoising achieves 8/100 of the upper bound at Eb/N0 = 4 dB, the proposed algorithms reach 4/7 and 1/2 of the upper bound.


  • Massive Uncoordinated Multiple Access for Beyond 5G

    by Mostafa Mohammadkarimi, Octavia A. Dobre, Moe Z. Win

    Existing wireless communication systems have been mainly designed to provide substantial gain in terms of data rates. However, 5G and Beyond will depart from this scheme, with the objective not only to provide services with higher data rates. One of the main goals is to support massive machine-type communications (mMTC) in the Internet-of-Things (IoT) applications. Supporting massive uplink communications for devices with sporadic traffic pattern and short-packet size, as it is in many mMTC use cases, is a challenging task, particularly when the control signaling is not negligible in size compared to the payload. In addition, channel estimation becomes challenging for sporadic and short-packet transmission due to the limited number of employed pilots. In this paper, a new uplink multiple access (MA) scheme is proposed for mMTC, which can support a large number of uncoordinated IoT devices with short-packet and sporadic traffic. The proposed uplink MA scheme removes the overheads associated with the device identifier as well as pilots and preambles related to channel estimation. An alternative mechanism for device identification (DI) is employed, where a unique spreading code is dedicated to each IoT device as identifier. This unique code is simultaneously used for the spreading purpose and DI. Two IoT DI algorithms which employ sparse signal reconstruction methods are proposed to determine the active IoT devices prior to data detection. Specifically, the Bayesian information criterion model order selection method is employed to develop an IoT DI algorithm for unknown and time-varying activity rate. Our proposed MA scheme benefits from a new non-coherent nonlinear multiuser detection algorithm designed on the basis of unsupervised machine learning techniques to enable data detection without a priori knowledge on channel state information. For performance improvement, an extension to multiple receive antennas through hard decision combining is proposed. The effectiveness of the proposed MA scheme for known and unknown activity rate and high overloading factor is supported by simulation results.


  • Efficient Non-Line-of-Sight Identification in Localization Using a Bank of Neural Networks

    by Abbas Abolfathimomtaz, Mostafa Mohammadkarimi, Masoud Ardakani

    Non-line-of-sight (NLOS) error is one of the dominant sources of error in localization applications. Existing algorithms rely on solving a set of highly nonlinear equations to compensate for this error, which is intractable in practice. In this paper, we propose an efficient NLOS identification algorithm based on supervised machine learning. This approach enables us to improve localization accuracy by taking advantage of the NLOS measurements if the location of the reflector is known. Hence, our approach can be employed in combination with 5G intelligent reflecting surface systems to provide location-based wireless services. We also analytically derive the Cramer-Rao lower bound for the localization problem at hand. Finally, we investigate the performance of our proposed NLOS identification algorithm under different simulation setups.

  • Maximum Likelihood Time Synchronization for Zero-Padded OFDM

    by Koosha Pourtahmasi Roshandeh, Mostafa Mohammadkarimi, Masoud Ardakani

    Existing Orthogonal Frequency-Division Multiplexing (OFDM) variants based on cyclic prefix (CP) allow for efficient time synchronization, but suffer from lower power efficiency compared to zero-padded (ZP)-OFDM. Because of its power efficiency, ZP-OFDM is considered as an appealing solution for the emerging low-power wireless systems. However, in the absence of CP, time synchronization in ZP-OFDM is a challenging task. In this paper, the non-data-aided (NDA) maximum-likelihood (ML) time synchronization for ZP-OFDM is analytically derived. We show that the optimal NDA-ML synchronization algorithm offers a high lock-in probability and can be efficiently implemented using Monte Carlo sampling (MCS) technique in combination with golden-section search method in one dimension. To obtain the optimal NDA-ML time synchronization algorithm, we first derive a closed-form expression for the joint probability density function (PDF) of the received ZP-OFDM samples in frequency-selective fading channels. The derived expression is valid for doubly-selective fading channels with mobile users as well. The performance of the proposed synchronization algorithm is evaluated under various practical settings through simulation experiments. It is shown that the proposed optimal NDA-ML synchronization algorithm and its MCS implementation substantially outperforms existing NDA time synchronization algorithms in terms of lock-in probability and mean-squared error (MSE).