MM

M. Mohammadkarimi

info

Please Note

10 records found

Journal article (2025) - 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 article 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 ZP 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. ...
Journal article (2024) - Mostafa Mohammadkarimi, Raj Thilak Rajan
A cooperative sense and avoid (SAA) algorithm for safe navigation of small-sized unmanned aerial vehicles (UAVs) within an airspace is proposed in this article. 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 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 of the proposed estimators are analytically derived, and the effectiveness of our SAA solution is confirmed through simulation experiments. ...
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 article. 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. ...
In this paper, we propose a new method for joint ranging and Phase Offset (PO) estimation of multiple transponder-equipped aviation vehicles (TEAVs), including Manned Aerial Vehicles (MAVs) and Unmanned Aerial Vehicles (UAVs). The proposed method employs the overlapping uncoordinated Automatic Dependent Surveillance-Broadcast (ADS-B) packets broadcasted by the TEAVs for joint range and PO estimation 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 sense and avoid. By minimizing the Kullback-Leibler Divergence (KLD), we show that the received complex baseband signal, coming from K uncoordinated TEAVs, which is 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 2K mixture components in the two-dimensional plane. The proposed estimator employs the Expectation-Maximization (EM) algorithm to estimate the modes of the 2D Gaussian mixture followed by a reordering estimation technique to jointly estimate range and PO. Simulation results show that the proposed joint estimator outperforms excising methods, such as the time segmentation method and the blind adaptive beamforming. ...
Conference paper (2023) - Koosha Pourtahmasi Roshandeh, Mostafa Mohammadkarimi, Masoud Ardakani
The zero padding (ZP) variants of orthogonal frequency-division multiplexing (OFDM) exhibit a lower bit error rate (BER) and higher energy efficiency compared to their cyclic prefix (CP) counterparts. However, the employment of ZP-OFDM demands strict time synchronization, which is challenging in the absence of pilots or CP. Moreover, time synchronization in OFDM systems is even more challenging when impulsive noise is present. It is well known that urban noise, which consists largely of impulsive noise generated by spark plugs used in internal combustion engines, switching and industrial activities, and discharge of high voltage distribution lines, has a strong influence on digital mobile communications. In this paper, we propose a new low-complexity approximate maximum likelihood (A-ML) timing offset (TO) estimator for ZP multiple-input multiple-output (MIMO)-OFDM in impulsive-noise environments. Performance comparison of the A-ML estimator with existing TO estimators demonstrates a superior performance in terms of lock-in probability with similar computational complexity. Also, compared to the optimal ML TO estimator, it offers a significantly lower computational complexity with negligible performance loss. The A-ML estimator can be employed for both frame and symbol synchronization. ...
Journal article (2023) - 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 (Formula presented.) 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. ...
Journal article (2023) - 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. ...
In this paper, we study path planning algorithms of resource constrained mobile agents in unknown cluttered environments, which include but are not limited to various terrestrial missions e.g., search and rescue missions by drones in jungles, and space missions e.g., navigation of rovers on the Moon. In particular, we focus our attention on artificial potential field (APF) based methods, in which the target is attractive while the obstacles are repulsive to the mobile agent. In this paper, we propose two major updates to the classical APF algorithm which significantly improve the performance of path planning using APF. First, we propose to improve an existing classical method that replaces the gradient descent optimization of the potential field cost function on a continuous domain with a combinatorial optimization on a set of predefined points (called bacteria points) around the agent's current location. Our proposition includes an adaptive hyperparameter that changes the value of the potential function associated to each bacteria point based on the current environmental measurements. Our proposed solution improves the navigation performance in terms of convergence to the target at the expense of minimal increase in computational complexity. Second, we propose an improved potential field cost function of the bacteria points by introducing a new branching cost function which further improves the navigation performance. The algorithms were tested on a set of Monte Carlo simulation trials where the environment changes for each trial. Our simulation results show 25% lower navigation time and around 300% higher success rate compared to the conventional potential field method, and we present future directions for research. ...
Journal article (2022) - 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. ...

A Joint Deep Learning and Genetic Algorithm Approach

Conference paper (2022) - Mostafa Mohammadkarimi, Mostafa Darabi, Behrouz Maham
Due to the limited number of radio frequency (RF) chains in millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) receivers using analog beamforming/hybrid beamforming, there is a restriction in scheduling the number of users in each transmission time interval. Therefore, fast and low-complexity user scheduling methods based on the instantaneous channel state information (CSI) are needed. In this paper, we propose novel user scheduling methods based on deep learning (DL) to reduce the size of the search space by using the learning capability of a deep neural network (DNN). We formulate the user scheduling combinatorial optimization problem as a regression problem followed by a user separation procedure through decision boundaries that are learned by a trained DNN. The decision boundaries are used to separate the users into two subsets. Then, one of the subsets is selected to be searched to find the users that maximize the sum-rate capacity. The proposed method can achieve a very low outage probability with a few number of searches. In order to achieve ergodic capacity with lower computation complexity, the proposed method is employed in combination with the genetic algorithm (GA) algorithm to take advantage of intelligent initial population selection. Our simulation results show that the proposed user scheduling methods can offer remarkably low complexity. ...