This letter proposes a highly accurate algorithm to estimate the signal-to-noise ratio (SNR) for a linear system from a single realization of the received signal. We assume that the linear system has a Gaussian matrix with one sided left correlation. The unknown entries of the signal and the noise are assumed to be independent and identically distributed with zero mean and can be drawn from any distribution. We use the ridge regression function of this linear model in company with tools and techniques adapted from random matrix theory to achieve, in closed form, accurate estimation of the SNR without prior statistical knowledge on the signal or the noise. Simulation results show that the proposed method is very accurate.
31 October 2022 in IEEE Transactions on Signal Processing
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.
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.
In this paper, we derive an analytical expression for the bit error rate (BER) of binary phase shift keying (BPSK) symbols transmitted over a multiple-input multiple-output (MIMO) system under channel estimation errors. In this wireless communications system, the receiver uses the linear minimum mean squared error (LMMSE) estimator to estimate the channel matrix. The error in this estimation affects the following estimation that is used to recover the transmitted symbols. It is shown that the channel estimation error is Gaussian and hence the convex Gaussian min-max theorem (CGMT) can be applied to analyze the error of the signal estimation stage and finally obtain an expression for the BER. We use the BER expression to obtain the optimal pilot power allocation under a total transmit energy constraint. Numerical results show close matching between theory and simulations.
In this paper, we consider the problem of recovering a binary phase shift keying (BPSK) modulated signal in a massive multiple-input-multiple-output (MIMO) system. The recovery process is done using the box-relaxation method, in which the discrete set $\{\pm 1\}^{n}$ is relaxed to the convex set $[-1,\ +1]^{n}$ and solved by a convex optimization program followed by hard thresholding. We assume that the system has a Gaussian channel matrix with one sided left correlation. The entries of the noise vector are assumed to be independent and identically distributed (iid $\rangle$ zero-mean Gaussian. In this work, we precisely characterize the mean squared error (MSE) and the bit error rate (BER) of the box-relaxation decoder in the asymptotic regime where both dimensions grow simultaneously large at a fixed ratio. Numerical simulations validate the theoretical expressions derived in this paper.