SDSajad Daei

Sajad Daei

*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


Sajad Daei has a total of 21 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Measuring less, recovering more: Distribution-aware weighted ℓ1 analysis

    by Raziyeh Takbiri, Sajad Daei, Mikael Skoglund, Gabor Fodor

  • Exploiting Spatial and Temporal Correlations in Massive MIMO Systems Operating Over Non-Stationary Aging Channels

    by Sajad Daei, Gábor Fodor, Mikael Skoglund

    This work investigates a multi-user, multi-antenna uplink wireless system, in which multiple users transmit signals to a base station. Prior research has explored the potential for linear growth in spectral efficiency by employing multiple transmit and receive antennas. This gain depends heavily on the quality of channel state information and the number of uncorrelated antennas. However, spatial correlations, arising from closely-spaced antennas and channel aging effects, stemming from the difference between the channel state at pilot and data time instances, can substantially counteract these benefits, and degrade the transmission rate, especially in non-stationary environments. To address these challenges, this work introduces a real-time beamforming framework to compensate for the spatial correlation and channel aging effects. First, a channel estimation scheme leveraging temporal channel correlations and considering mobile device velocity and antenna spacing is developed. Subsequently, an expression approximating the average spectral efficiency, which depends on pilot spacing, pilot and data powers, and beamforming vectors, is obtained. By maximizing this expression, optimal parameters are identified. Numerical results demonstrate the effectiveness of the proposed approach compared to prior works. Interestingly, the optimal pilot spacing remains unaffected by large-scale channel parameters and the velocities of interfering users. The impact of interference components also diminishes with an increasing number of transmit antennas.

  • Timely and Painless Breakups: Off-the-Grid Blind Message Recovery and Users’ Demixing

    by Sajad Daei, Saeed Razavikia, Mikael Skoglund, Gabor Fodor, Carlo Fischione

    The Internet of Things interconnects billions of devices and forms a vast network where users sporadically transmit short messages through multi-path wireless channels. These channels are characterized by the superposition of a small number of scaled and delayed copies of Dirac spikes. At the receiver, the observed signal is a sum of these convolved signals, and the task is to find the amplitudes, continuous-indexed delays, and transmitted messages from a single signal. This task is inherently ill-posed without additional assumptions on the channel or messages. In this work, we assume the channel exhibits sparsity in the delay domain and that independent and identically distributed random linear encoding is applied to the messages at the devices. Leveraging these assumptions, we propose a semidefinite programming optimization capable of simultaneously recovering both messages and the delay parameters of the channels from only a single received signal. Our theoretical analysis establishes that the required number of samples at the receiver scales proportionally to the sum-product of sparsity and message length of all users, aligning with the degrees of freedom in the lifting-type optimization frameworks. Numerical experiments confirm the efficacy of the proposed method in accurately estimating closely-spaced delay parameters and recovering messages.


  • Toward Optimal Pilot Spacing and Power Control in Multi-Antenna Systems Operating Over Non-Stationary Rician Aging Channels

    by Sajad Daei, Gábor Fodor, Mikael Skoglund, Miklós Telek

    Several previous works have addressed the inherent trade-off between allocating resources in the power and time domains to pilot and data signals in multiple input multiple output systems over block-fading channels. In particular, when the channel changes rapidly in time, channel aging degrades the performance in terms of spectral efficiency without proper pilot spacing and power control. Despite recognizing non-stationary stochastic processes as more accurate models for time-varying wireless channels, the problem of pilot spacing and power control in multi-antenna systems operating over non-stationary channels is not addressed in the literature. In this paper, we address this gap by introducing a refined first-order autoregressive model that exploits the inherent temporal correlations over non-stationary Rician aging channels. We design a multi-frame structure for data transmission that better reflects the non-stationary fading environment than previously developed single-frame structures. Subsequently, to determine the optimal pilot spacing and power control within this multi-frame structure, we develop an optimization framework and an efficient algorithm based on maximizing a deterministic equivalent expression for the spectral efficiency, demonstrating its generality by encompassing previous channel aging results. Our numerical results indicate the efficacy of the proposed method in terms of spectral efficiency gains over the single frame structure.


  • Blind Goal-Oriented Massive Access for Future Wireless Networks

    by Sajad Daei, Marios Kountouris

    Emerging communication networks are envisioned to support massive wireless connectivity of heterogeneous devices with sporadic traffic and diverse requirements in terms of latency, reliability, and bandwidth. Providing multiple access to an increasing number of uncoordinated users and sharing the limited resources become essential in this context. In this work, we revisit the random access (RA) problem and exploit the continuous angular group sparsity feature of wireless channels to propose a novel RA strategy that provides low latency, high reliability, and massive access with limited bandwidth resources in an all-in-one package. To this end, we first design a reconstruction-free goal-oriented optimization problem, which only preserves the angular information required to identify the active devices. To solve this, we propose an alternating direction method of multipliers (ADMM) and derive closed-form expressions for each ADMM step. Then, we design a clustering algorithm that assigns the users in specific groups from which we can identify active stationary devices by their line of sight (LoS) angles. For mobile devices, we propose an alternating minimization algorithm to recover their data and their channel gains simultaneously, which allows us to identify active mobile users. Simulation results show significant performance gains in terms of active user detection and false alarm probabilities as compared to state-of-the-art RA schemes, even with limited number of preambles. Moreover, unlike prior work, the performance of the proposed blind goal-oriented massive access does not depend on the number of devices.


  • A Novel Demixing Algorithm for Joint Target Detection and Impulsive Noise Suppression

    by Mohammadreza Seidi, Saeed Razavikia, Sajad Daei, Joachim Oberhammer

    This work considers a collocated radar scenario where a probing signal is emitted toward the targets of interest and records the received echoes. Estimating the relative delay-Doppler shifts of the targets allows determining their relative locations and velocities. However, the received radar measurements are often affected by impulsive non-Gaussian noise which makes a few measurements partially corrupted. While demixing radar signal and impulsive noise is challenging in general by traditional subspace-based methods, atomic norm minimization (ANM) has been recently developed to perform this task in a much more efficient manner. Nonetheless, the ANM cannot identify close delay-Doppler pairs and also requires many measurements. Here, we propose a smoothed ℓ0 atomic optimization problem encouraging both the sparse features of the targets and the impulsive noise. We design a majorization-minimization algorithm that converges to the solution of the proposed non-convex problem using alternating direction method of multipliers (ADMM). Simulations results verify the superior accuracy of our proposed algorithm even for very close delay-Doppler pairs in comparison to ANM with around 40 dB improvement.


  • Multi-Weight Nuclear Norm Minimization for Low-Rank Matrix Recovery in Presence of Subspace Prior Information

    by Hamideh Sadat Fazael Ardakani, Sajad Daei, Farzan Haddadi

    Weighted nuclear norm minimization has been recently recognized as a technique for reconstruction of a low-rank matrix from compressively sampled measurements when some prior information about the column and row subspaces of the matrix is available. We derive the conditions and the associated recovery guarantees of weighted nuclear norm minimization when multiple weights are allowed. This setup could be used when one has access to prior subspaces forming multiple angles with the column and row subspaces of the ground-truth matrix. While existing works in this field use a single weight to penalize all the angles, we propose a multi-weight problem which is designed to penalize each angle independently using a distinct weight. Specifically, we prove that our proposed multi-weight problem is stable and robust under weaker conditions for the measurement operator than the analogous conditions for single-weight scenario and standard nuclear norm minimization. Moreover, it provides better reconstruction error than the state of the art methods. We illustrate our results with extensive numerical experiments that demonstrate the advantages of allowing multiple weights in the recovery procedure. Our work has beneficial implications for channel estimation in multiple-input multiple output (MIMO) wireless communications based on Frequency Division Duplexing (FDD). The existing methods for channel estimation in this application require a huge number of pilot (training) signals to estimate the downlink channel which greatly wastes the spectrum resources in massive MIMO systems. We provide a dynamic channel estimation scenario for FDD massive MIMO systems and show how our method could be applied to enhance the spectral efficiency.


  • Active User Detection and Channel Estimation for Spatial-Based Random Access in Crowded Massive MIMO Systems via Blind Super-Resolution

    by Abolghasem Afshar, Vahid Tabataba Vakili, Sajad Daei

    This work presents a novel framework for random access (RA) in crowded scenarios of massive multiple-input multiple-output (MIMO) systems. A huge portion of the system resources is dedicated as orthogonal pilots for accurate channel estimation which imposes a huge training overhead. This overhead can be highly mitigated by exploiting intrinsic angular domain sparsity of massive MIMO channels and the sporadic traffic of users, i.e., few number of users are active to send or receive data in each coherence interval. Besides, the continuous-valued angles of arrival (AoA) corresponding to each active user are alongside each other forming a specific cluster. To exploit these features in this work, we propose a blind clustering algorithm based on super-resolution techniques that not only detects the spatial features of the active users but also provides accurate channel estimation. Specifically, an off-grid atomic norm minimization is proposed to obtain the AoAs and then a clustering-based approach is employed to identify which AoAs correspond to which active users. After active user detection, an alternating-based optimization approach is performed to obtain the channels and transmitted data. Simulation results demonstrate the effectiveness of our approach in AoA detection as well as data recovery which indeed provides a high performance spatial-based RA in crowded massive MIMO systems.


  • Separating Radar Signals From Impulsive Noise Using Atomic Norm Minimization

    by Siavash Bayat, Sajad Daei

    We consider the problem of corrupted radar superresolution, a generalization of compressed radar super-resolution in which one aims to recover the continuous-valued delay-Doppler pairs of moving objects from a collection of corrupted and noisy measurements. The received signal in this type consists of contributions from objects, outlier and noise. While this problem is ill-posed in general, tractable recovery is possible when both the number of objects and corrupted measurements are limited. In this work, we propose an atomic norm optimization in order to find the delay-Doppler pairs and the outlier signal. The objective function of our optimization problem encourages both sparsity in the continuous delay-Doppler domain and the sparsity of perturbations in the outlier signal. We show that the associated problem can be solved via semidefinite programming (SDP). Moreover, we provide a reasonably fast and efficient algorithm for solving this SDP based on the alternating method of multipliers (ADMM). Simulations results verify the superior performance of our proposed problem and the high accuracy and low computational complexity of our algorithm.