Arian Eamaz

Arian Eamaz

Auto-generated profile, based on publicly available information

Arian Eamaz

Department of Electrical and Computer Engineering, University of Illinois Chicago, Chicago, IL, USA

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 October 2022 in IEEE Transactions on Signal Processing
Verified
Journal Article
Open access
AEArian Eamaz
Arian Eamaz
FYFarhang Yeganegi
Farhang Yeganegi
MSMojtaba Soltanalian
Mojtaba Soltanalian
The recovery of the input signal covariance values from its one-bit sampled counterpart has been deemed a challenging task in the literature. To deal with its difficulties, some assumptions are typically made to find a relation between the input covariance matrix and the autocorrelation values of the one-bit sampled data. This includes the arcsine law and the recently proposed modified arcsine law which unleashes a promising performance in covariance recovery by taking advantage of time-varying sampling thresholds. However, the modified arcsine law also assumes input signals are stationary, which is typically a simplifying assumption for real-world applications. In fact, in many signal processing applications, the input signals are readily known to be non-stationary with a non-Toeplitz covariance matrix. In this paper, we propose an approach to extending the arcsine law to the case where one-bit ADCs apply time-varying thresholds while dealing with input signals that originate from a non-stationary process. In particular, the recovery methods are shown to accurately recover the time-varying variance and autocorrelation values. Furthermore, we extend the formulation of the Bussgang law to the case where non-stationary input signals are considered.

25 January 2024 in IEEE Transactions on Signal Processing
Verified
Journal Article
Open access
AEArian Eamaz
Arian Eamaz
KMKumar Vijay Mishra
Kumar Vijay Mishra
FYFarhang Yeganegi
Farhang Yeganegi
MSMojtaba Soltanalian
Mojtaba Soltanalian
Recent results in one-bit sampling provide a framework for a relatively low-cost, low-power sampling, at a high rate by employing time-varying sampling threshold sequences. Another recent development in sampling theory is unlimited sampling, which is a high-resolution technique that relies on modulo ADCs to yield an unlimited dynamic range. In this paper, we leverage the appealing attributes of the two aforementioned techniques to propose a novel un limited o ne-bit (UNO) sampling approach. In this framework, the information on the distance between the input signal value and the threshold is stored and utilized to accurately reconstruct the one-bit sampled signal. We then utilize this information to accurately reconstruct the signal from its one-bit samples via the randomized Kaczmarz algorithm (RKA). In the presence of noise, we employ the recent plug-and-play (PnP) priors technique with alternating direction method of multipliers (ADMM) to exploit integration of state-of- the-art regularizers in the reconstruction process. Numerical experiments with RKA and PnP-ADMM-based reconstruction illustrate the effectiveness of our proposed UNO, including its superior performance compared to the one-bit ΣΔ sampling.

24 November 2022 in IEEE Signal Processing Letters
Verified
Journal Article
Open access
ZEZahra Esmaeilbeig
Zahra Esmaeilbeig
KMKumar Vijay Mishra
Kumar Vijay Mishra
AEArian Eamaz
Arian Eamaz
MSMojtaba Soltanalian
Mojtaba Soltanalian
Intelligent reflecting surface (IRS) is a rapidly emerging paradigm to enable non-line-of-sight (NLoS) wireless transmission. In this paper, we focus on IRS-aided radar estimation performance of a moving hidden or NLoS target. Unlike prior works that employ a single IRS, we investigate this problem using multiple IRS platforms and assess the estimation performance by deriving the associated Cramér-Rao lower bound (CRLB). We then design Doppler-aware IRS phase shifts by minimizing the scalar A-optimality measure of the joint parameter CRLB matrix. The resulting optimization problem is non-convex, and is thus tackled via an alternating optimization framework. Numerical results demonstrate that the deployment of multiple IRS platforms with our proposed optimized phase shifts leads to a higher estimation accuracy compared to non-IRS and single-IRS alternatives.

21 September 2022 in IEEE Transactions on Signal Processing
Verified
Journal Article
Open access
AEArian Eamaz
Arian Eamaz
FYFarhang Yeganegi
Farhang Yeganegi
MSMojtaba Soltanalian
Mojtaba Soltanalian
The classical problem of phase retrieval has found a wide array of applications in optics, imaging and signal processing. In this paper, we consider the phase retrieval problem in a one-bit setting, where the signals are sampled using one-bit analog-to-digital converters (ADCs). A significant advantage of deploying one-bit ADCs in signal processing systems is their superior sampling rates as compared to their high-resolution counterparts. This leads to an enormous amount of one-bit samples gathered at the output of the ADC in a short period of time. We demonstrate that this advantage pays extraordinary dividends when it comes to convex phase retrieval formulations—namely that the often encountered matrix semi-definiteness constraints as well as rank constraints (that are computationally prohibitive to enforce), become redundant for phase retrieval in the face of a growing sample size. Several numerical results are presented to illustrate the effectiveness of the proposed methodologies.

24 December 2022 in Signal Processing
Verified
Journal Article
Closed access
AEArian Eamaz
Arian Eamaz
FYFarhang Yeganegi
Farhang Yeganegi
MSMojtaba Soltanalian
Mojtaba Soltanalian

3 July 2024 in IEEE Transactions on Information Theory
Verified
Journal Article
Open access
AEArian Eamaz
Arian Eamaz
FYFarhang Yeganegi
Farhang Yeganegi
DNDeanna Needell
Deanna Needell
MSMojtaba Soltanalian
Mojtaba Soltanalian
One-bit quantization with time-varying sampling thresholds (also known as random dithering) has recently found significant utilization potential in statistical signal processing applications due to its relatively low power consumption and low implementation cost. In addition to such advantages, an attractive feature of one-bit analog-to-digital converters (ADCs) is their superior sampling rates as compared to their conventional multi-bit counterparts. This characteristic endows one-bit signal processing frameworks with what one may refer to as sample abundance. We show that sample abundance plays a pivotal role in many signal recovery and optimization problems that are formulated as (possibly non-convex) quadratic programs with linear feasibility constraints. Of particular interest to our work are low-rank matrix recovery and compressed sensing applications that take advantage of one-bit quantization. We demonstrate that the sample abundance paradigm allows for the transformation of such problems to merely linear feasibility problems by forming large-scale overdetermined linear systems—thus removing the need for handling costly optimization constraints and objectives. To make the proposed computational cost savings achievable, we offer enhanced randomized Kaczmarz algorithms to solve these highly overdetermined feasibility problems and provide theoretical guarantees in terms of their convergence, sample size requirements, and overall performance. Several numerical results are presented to illustrate the effectiveness of the proposed methodologies.