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


Ayed M. Alrashdi has a total of 27 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Advanced Tax Fraud Detection: A Soft-Voting Ensemble Based on GAN and Encoder Architecture

    by Masad A. Alrasheedi, Samia Ijaz, Ayed M. Alrashdi, Seung-Won Lee

    The world prevalence of the two types of authorized and fraudulent transactions makes it difficult to distinguish between the two operations. The small percentage of fraudulent transactions, in turn, gives rise to the class imbalance problem. Hence, an adequately robust fraud detection mechanism must exist for tax systems to avoid their collapse. It has become significantly difficult to obtain any dataset, specifically a tax return dataset, because of the rising importance of privacy in a society where people generally feel squeamish about sharing personal information. Because of this, we arrive at the decision to synthesize our dataset by employing publicly available data, as well as enhance them through Correlational Generative Adversarial Networks (CGANs) and the Synthetic Minority Oversampling Technique (SMOTE). The proposed method includes a preprocessing stage to denoise the data and identify anomalies, outliers, and dimensionality reduction. Then the data have undergone enhancement using the SMOTE and the proposed CGAN techniques. A unique encoder design has been proposed, which serves the purpose of exposing the hidden patterns among legitimate and fraudulent records. This research found anomalous deductions, income inconsistencies, recurrent transaction manipulations, and irregular filing practices that distinguish fraudulent from valid tax records. These patterns are identified by encoder-based feature extraction and synthetic data augmentation. Several machine learning classifiers, along with a voting ensemble technique, have been used both with and without data augmentation. Experimental results have shown that the proposed Soft-Voting technique outperformed the original without an ensemble method.


  • Open Access

    Generalized Penalized Constrained Regression: Sharp Guarantees in High Dimensions with Noisy Features

    by Ayed M. Alrashdi, Meshari Alazmi, Masad A. Alrasheedi

    The generalized penalized constrained regression (G-PCR) is a penalized model for high-dimensional linear inverse problems with structured features. This paper presents a sharp error performance analysis of the G-PCR in the over-parameterized high-dimensional setting. The analysis is carried out under the assumption of a noisy or erroneous Gaussian features matrix. To assess the performance of the G-PCR problem, the study employs multiple metrics such as prediction risk, cosine similarity, and the probabilities of misdetection and false alarm. These metrics offer valuable insights into the accuracy and reliability of the G-PCR model under different circumstances. Furthermore, the derived results are specialized and applied to well-known instances of G-PCR, including l1-norm penalized regression for sparse signal recovery and l2-norm (ridge) penalization. These specific instances are widely utilized in regression analysis for purposes such as feature selection and model regularization. To validate the obtained results, the paper provides numerical simulations conducted on both real-world and synthetic datasets. Using extensive simulations, we show the universality and robustness of the results of this work to the assumed Gaussian distribution of the features matrix. We empirically investigate the so-called double descent phenomenon and show how optimal selection of the hyper-parameters of the G-PCR can help mitigate this phenomenon. The derived expressions and insights from this study can be utilized to optimally select the hyper-parameters of the G-PCR. By leveraging these findings, one can make well-informed decisions regarding the configuration and fine-tuning of the G-PCR model, taking into consideration the specific problem at hand as well as the presence of noisy features in the high-dimensional setting.


  • Asymptotic Analysis of RLS-Based Digital Precoder With Limited PAPR in Massive MIMO

    by Xiuxiu Ma, Abla Kammoun, Ayed M. Alrashdi, Tarig Ballal, Mohamed-Slim Alouini, Tareq Y. Al-Naffouri

    This paper focuses on the performance analysis of a class of limited peak-to-average power ratio (PAPR) precoders for downlink multi-user massive multiple-input multiple-output (MIMO) systems. Contrary to conventional precoding approaches based on simple linear precoders such as maximum ratio transmission (MRT) and regularized zero-forcing (RZF), the precoders in this paper are obtained by solving a convex optimization problem. To be specific, these precoders are designed so that the power of each precoded symbol entry is restricted, and the PAPR at each antenna is tunable. By using the Convex Gaussian Min-max Theorem (CGMT), we analytically characterize the empirical distribution of the precoded vector and the joint empirical distribution between the distortion and the intended symbol vector. This allows us to study the performance of these precoders in terms of per-antenna power, per-user distortion power, signal-to-noise and distortion ratio (SINAD), and bit error probability. We show that for this class of precoders, there is an optimal transmit per-antenna power that maximizes the system performance in terms of SINAD and bit error probability.


  • Open Access

    Sharp Analysis of RLS-based Digital Precoder with Limited PAPR in Massive MIMO

    by Xiuxiu Ma, Abla Kammoun, Ayed M. Alrashdi, Tarig Ballal, Tareq Y. Al-Naffouri, Mohamed-Slim Alouini

    This paper focuses on the performance analysis of a class of limited peak-to-average power ratio (PAPR) precoders for downlink multi-user massive multiple-input multiple-output (MIMO) systems. Contrary to conventional precoding approaches based on simple linear precoders such as maximum ratio transmission (MRT) and regularized zero-forcing (RZF), the precoders in this paper are obtained by solving a convex optimization problem. To be specific, these precoders are designed so that the power of each precoded symbol entry is restricted, and the PAPR at each antenna is tunable. By using the Convex Gaussian Min-max Theorem (CGMT), we analytically characterize the empirical distribution of the precoded vector and the joint empirical distribution between the distortion and the intended symbol vector. This allows us to study the performance of these precoders in terms of per-antenna power, per-user distortion power, signal-to-noise and distortion ratio (SINAD), and bit error probability. We show that for this class of precoders, there is an optimal transmit per-antenna power that maximizes the system performance in terms of SINAD and bit error probability.

  • Open Access

    Asymptotic Performance of Box-RLS Decoders Under Imperfect CSI With Optimized Resource Allocation

    by Ayed M. Alrashdi, Abla Kammoun, Ali H. Muqaibel, Tareq Y. Al-Naffouri

    This paper considers the problem of symbol detection in massive multiple-input multiple-output (MIMO) wireless communication systems. We consider hard-thresholding preceded by two variants of the regularized least squares (RLS) decoder; namely the unconstrained RLS and the RLS with a box constraint, which is called Box-RLS. For all schemes, we focus on the evaluation of the mean squared error (MSE) and the symbol error probability (SEP) for M-ary pulse amplitude modulation (M-PAM) symbols transmitted over a massive MIMO system when the channel is estimated using linear minimum mean squared error (LMMSE) estimator. Under such circumstances, the channel estimation error is Gaussian which allows for the use of the convex Gaussian min-max theorem (CGMT) to derive asymptotic approximations for the MSE and SEP when the system dimensions and the coherence duration grow large with the same pace. The obtained expressions are then leveraged to derive the optimal power distribution between pilot and data under a total transmit energy constraint. In addition, we derive an asymptotic approximation of the goodput for all schemes which is then used to jointly optimize the number of training symbols and their associated power. Numerical results are presented to support the accuracy of the theoretical results.


  • Open Access

    Performance Analysis of Regularized Convex Relaxation for Complex-Valued Data Detection

    by Ayed M. Alrashdi, Houssem Sifaou

    In this work, we study complex-valued data detection performance in massive multiple-input multiple-output (MIMO) systems. We focus on the problem of recovering an $n$-dimensional signal whose entries are drawn from an arbitrary constellation $\mathcal{K} \subset \mathbb{C}$ from $m$ noisy linear measurements, with an independent and identically distributed (i.i.d.) complex Gaussian channel. Since the optimal maximum likelihood (ML) detector is computationally prohibitive for large dimensions, many convex relaxation heuristic methods have been proposed to solve the detection problem. In this paper, we consider a regularized version of this convex relaxation that we call the regularized convex relaxation (RCR) detector and sharply derive asymptotic expressions for its mean square error and symbol error probability. Monte-Carlo simulations are provided to validate the derived analytical results.

  • Open Access

    Performance Analysis of Regularized Convex Relaxation for Complex-Valued Data Detection

    by Ayed M. Alrashdi, Houssem Sifaou

    In this work, we study complex-valued data detection performance in massive multiple-input multiple-output (MIMO) systems. We focus on the problem of recovering an n-dimensional signal whose entries are drawn from an arbitrary constellation K⊂C from m noisy linear measurements, with an independent and identically distributed (i.i.d.) complex Gaussian channel. Since the optimal maximum likelihood (ML) detector is computationally prohibitive for large dimensions, many convex relaxation heuristic methods have been proposed to solve the detection problem. In this paper, we consider a regularized version of this convex relaxation that we call the regularized convex relaxation (RCR) detector and sharply derive asymptotic expressions for its mean square error and symbol error probability. Monte-Carlo simulations are provided to validate the derived analytical results.


  • Open Access

    Asymptotic characterisation of regularised zero‐forcing receiver for imperfect and correlated massive multiple‐input multiple‐output systems

    by Ayed M. Alrashdi

    In this work, the authors present an asymptotic high‐dimensional analysis of the regularised zero‐forcing receiver in terms of its mean‐squared error (MSE) and bit error rate (BER) when used for the recovery of binary phase‐shift keying (BPSK) modulated signals in a massive multiple‐input multiple‐output communication system. The asymptotic analysis is carried out when the system dimensions grow simultaneously large at a fixed ratio. The authors assume that the channel matrix is spatially correlated and not perfectly known. The authors use the linear minimum mean‐squared error (LMMSE) method to estimate the channel matrix. The asymptotic approximations of the MSE and BER enable us to solve various practical optimisation problems. Under MSE/BER minimisation, the authors derive (1) the optimal regularisation factor for RZF; (2) the optimal power allocation scheme. The numerical simulations match the derived asymptotic expressions, even when the problem dimensions are small.


  • Open Access

    Optimum GSSK Transmission in Massive MIMO Systems Using the Box-LASSO Decoder

    by Ayed M. Alrashdi, Abdullah E. Alrashdi, Amer Alghadhban, Mohamed A. H. Eleiwa

    We propose in this work to employ the Box-LASSO, a variation of the popular LASSO method, as a low-complexity decoder in a massive multiple-input multiple-output (MIMO) wireless communication system. The Box-LASSO is mainly useful for detecting simultaneously structured signals such as signals that are known to be sparse and bounded. One modulation technique that generates essentially sparse and bounded constellation points is the so-called generalized space-shift keying (GSSK) modulation. In this direction, we derive high dimensional sharp characterizations of various performance measures of the Box-LASSO such as the mean square error, probability of support recovery, and the element error rate, under independent and identically distributed (i.i.d.) Gaussian channels that are not perfectly known. In particular, the analytical characterizations can be used to demonstrate performance improvements of the Box-LASSO as compared to the widely used standard LASSO. Then, we can use these measures to optimally tune the involved hyper-parameters of Box-LASSO such as the regularization parameter. In addition, we derive optimum power allocation and training duration schemes in a training-based massive MIMO system. Monte Carlo simulations are used to validate these premises and to show the sharpness of the derived analytical results.