Explore the vast range of titles available.

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.

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 E[sub.b]/N[sub.0] 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.

A cooperative spectrum-sensing problem for a cognitive radio (CR) system is investigated, where CR users collaborate to sense and track the primary users’ (PUs) activities in frequency-selective fading channels. To sense PUs activities, channel gain estimation is performed by CRs through space–time extended Kalman filtering (STEKF). The STEKF method captures the channel gain from any point in space to each CR at each frame for a specific range of frequencies. The proposed channel gain tracking enables CRs to detect the transmit power, location and the number of active subcarriers of each PU via a time spatial weighted non-negative Lasso (TSWNL) algorithm. The TSWNL exploits the sparsity of the PUs activities in a geographical area to track PUs activities in frequency-selective fading channels. Numerical results indicate that the proposed spectrum sensing based on STEKF significantly improves the performance of CRs in tracking of PUs activities.

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.

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.

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.

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 IoT applications. Supporting massive uplink (UP) 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. Also, channel estimation is challenging for sporadic and short-packet transmission due to the limited number of employed pilots. In this paper, a new UP 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 UP MA scheme removes the overheads associated with the device identifier as well as pilots related to channel estimation. An alternative mechanism for device identification is proposed, where a unique spreading code is dedicated to each IoT device. This unique code is simultaneously used for the spreading purpose and device identification. Two IoT device identification algorithms which employ sparse signal reconstruction methods are proposed to determine the active IoT devices prior to data detection. Specifically, the BIC model order selection method is employed to develop an IoT device identification algorithm for unknown and time-varying probability of device activity. Our proposed MA scheme benefits from a non-coherent multiuser detection algorithm based on machine learning to enable data detection without a priori knowledge on channel state information. The effectiveness of the proposed MA scheme for known and unknown probability of activity is supported by simulation results.

In this paper, a deep learning (DL)-based sphere decoding algorithm is proposed, where the radius of the decoding hypersphere is learned by a deep neural network (DNN). The performance achieved by the proposed algorithm is very close to the optimal maximum likelihood decoding (MLD) over a wide range of signal-to-noise ratios (SNRs), while the computational complexity, compared to existing sphere decoding variants, is significantly reduced. This improvement is attributed to DNN's ability of intelligently learning the radius of the hypersphere used in decoding. The expected complexity of the proposed DL-based algorithm is analytically derived and compared with existing ones. It is shown that the number of lattice points inside the decoding hypersphere drastically reduces in the DL-based algorithm in both the average and worst-case senses. The effectiveness of the proposed algorithm is shown through simulation for high-dimensional multiple-input multiple-output (MIMO) systems, using high-order modulations.

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 a 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 ofthe 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.

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 very 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. 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 algorithms in terms of lock-in probability.