Showing papers by "Sheetal Kalyani published in 2022"

Statistics-based baseline-free approach for rapid inspection of delamination in composite structures using ultrasonic guided waves

Abstract: Delamination in composite structures is characterized by a resonant cavity wherein a fraction of an ultrasonic guided wave may be trapped. Based on this wave trapping phenomenon, we propose a baseline-free statistical approach for the identification and localization of delamination using sparse sampling and density-based spatial clustering of applications with noise (DBSCAN) technique. The proposed technique can be deployed for rapid inspection with minimal human intervention. The Performance of the proposed technique in terms of its ability to determine the precise location of such defects is quantified through the probability of detection measurements. The robustness of the proposed technique is tested through extensive simulations consisting of different random locations of defects on flat plate structures with different sizes and orientation as well as different values of signal to noise ratio of the simulated data. The simulation results are also validated using experimental data and the results are found to be in good agreement.

Max-Min Data Rate Optimization for RIS-aided Uplink Communications with Green Constraints

Abstract: Smart radio environments aided by reconfigurable intelligent reflecting surfaces (RIS) have attracted much research attention recently. We propose a joint optimization strategy for beamforming, RIS phases, and power allocation to maximize the minimum SINR of an uplink RIS-aided communication system. The users are subject to constraints on their transmit power. We derive a closed-form expression for the beam forming vectors and a geometric programming-based solution for power allocation. We also propose two solutions for optimizing the phase shifts at the RIS, one based on the matrix lifting method and one using an approximation for the minimum function. We also propose a heuristic algorithm for optimizing quantized phase shift values. The proposed algorithms are of practical interest for systems with constraints on the maximum allowable electromagnetic field exposure. For instance, considering 24 element RIS, 12 -antenna BS, and 6 users, numerical results show that the proposed algorithm achieves close to 300% gain in terms of minimum SINR compared to a scheme with random RIS phases. S. India. vector at the BS, transmit power of the users and the phase shifts at the RIS that maximize the minimum SINR subject to constraints on the transmit power of the users. We propose three solutions for the optimal phase shift design, two of which assume the RIS phase shift to be continuous and one assuming that the phase shifts are quantized. In a practical system with hardware limitations, one might not be able to realize any arbitrary phase shift value at the RIS and in such scenarios quantizing the optimal

Optimal phase shift design for fair allocation in RIS aided uplink network using statistical CSI

Abstract: Reconfigurable intelligent surface (RIS) can be crucial in next-generation communication systems. However, designing the RIS phases according to the instantaneous channel state information (CSI) can be challenging in practice due to the short coherent time of the channel. In this regard, we propose a novel algorithm based on the channel statistics of massive multiple input multiple output systems rather than the CSI. The beamforming at the base station (BS), power allocation of the users, and phase shifts at the RIS elements are optimized to maximize the minimum signal to interference and noise ratio (SINR), guaranteeing fair operation among various users. In particular, we design the RIS phases by leveraging the asymptotic deterministic equivalent of the minimum SINR that depends only on the channel statistics. This significantly reduces the computational complexity and the amount of controlling data between the BS and RIS for updating the phases. This setup is also useful for electromagnetic fields (EMF)-aware systems with constraints on the maximum user's exposure to EMF. The numerical results show that the proposed algorithms achieve more than 100% gain in terms of minimum SINR, compared to a system with random RIS phase shifts, with 40 RIS elements, 20 antennas at the BS and 10 users, respectively.

SINR Analysis of an IRS Assisted MU-MISO System

Abstract: In this work, we characterize the outage probability (OP) of an intelligent reflecting surface (IRS) assisted multi-user multiple-input-single-output (MU-MISO) communication system. Using a two-step approximation method, we approximate the signal-to-interference-plus-noise ratio (SINR) for any downlink user by a Log-Normal random variable. The impact of various system parameters is studied using the closed-form expression of OP. It is concluded that the position of IRS has a critical role, but an appropriate increase in the number of IRS elements would help to compensate for the loss in performance if the position of IRS is suboptimal.

Instantaneous Channel Oblivious Phase Shift Design for an IRS-Assisted SIMO System with Quantized Phase Shift

Abstract: We design the phase shifts of an intelligent reflecting surface (IRS)-assisted single-input-multiple-output communication system to minimize the outage probability (OP) and to maximize the ergodic rate. Our phase shifts design uses only statistical channel state information since these depend only on the large-scale fading coefficients; the obtained phase shift design remains valid for a longer time frame. We further assume that one has access to only quantized phase values. The closed-form expressions for OP and ergodic rate are derived for the considered system. Next, two optimization problems are formulated to choose the phase shifts of IRS such that (i) OP is minimized and (ii) the ergodic rate is maximized. We used the multi-valued particle swarm optimization (MPSO) and particle swarm optimization (PSO) algorithms to solve the optimization problems. Numerical simulations are performed to study the impact of various parameters on the OP and ergodic rate. We also discuss signaling overhead between BS and IRS controller. It is shown that the overhead can be reduced up to 99 . 69% by using statistical CSI for phase shift design and 5 bits to represent the phase shifts without significantly compromising on the performance. the performance loss is negligible. We also discussed the impact of statistical CSI-based phase shift design and quantized phase shift on the reduction of overhead between BS and IRS controller. It was shown that the overhead could be reduced up to

Grafting Laplace and Gaussian distributions: A new noise mechanism for differential privacy

Abstract: The framework of differential privacy protects an individual's privacy while publishing query responses on congregated data. In this work, a new noise addition mechanism for differential privacy is introduced where the noise added is sampled from a hybrid density that resembles Laplace in the centre and Gaussian in the tail. With a sharper centre and light, sub-Gaussian tail, this density has the best characteristics of both distributions. We theoretically analyze the proposed mechanism, and we derive the necessary and sufficient condition in one dimension and a sufficient condition in high dimensions for the mechanism to guarantee (${\epsilon}$,${\delta}$)-differential privacy. Numerical simulations corroborate the efficacy of the proposed mechanism compared to other existing mechanisms in achieving a better trade-off between privacy and accuracy.

Unrolling SVT to Obtain Computationally Efficient SVT for N-Qubit Quantum State Tomography

Abstract: Quantum state tomography aims to estimate the state of a quantum mechanical system which is described by a trace one, Hermitian positive semidefinite complex matrix, given a set of measurements of the state. Existing works focus on estimating the density matrix that represents the state, using a compressive sensing approach, with fewer measurements than that required for a tomographically complete set, with the assumption that the true state has a low rank. One very popular method to estimate the state is the use of the Singular Value Thresholding (SVT) algorithm. In this work, we present a machine learning approach to estimate the quantum state of n-qubit systems by unrolling the iterations of SVT which we call Learned Quantum State Tomography (LQST). As merely unrolling SVT may not ensure that the output of the network meets the constraints required for a quantum state, we design and train a custom neural network whose architecture is inspired from the iterations of SVT with additional layers to meet the required constraints. We show that our proposed LQST with very few layers reconstructs the density matrix with much better fidelity than the SVT algorithm which takes many hundreds of iterations to converge. We also demonstrate the reconstruction of the quantum Bell state from an informationally incomplete set of noisy measurements.

A DRL Approach for RIS-Assisted Full-Duplex UL and DL Transmission: Beamforming, Phase Shift and Power Optimization

Abstract: In this work, a two-stage deep reinforcement learning (DRL) approach is presented for a full-duplex (FD) transmission scenario that does not depend on the channel state information (CSI) knowledge to predict the phase-shifts of reconfigurable intelligent surface (RIS), beamformers at the base station (BS), and the transmit powers of BS and uplink users in order to maximize the weighted sum rate of uplink and downlink users. As the self-interference (SI) cancellation and beamformer design are coupled problems, the first stage uses a least squares method to partially cancel self-interference (SI) and initiate learning, while the second stage uses DRL to make predictions and achieve performance close to methods with perfect CSI knowledge. Further, to reduce the signaling from BS to the RISs, a DRL framework is proposed that predicts quantized RIS phase-shifts and beamformers using 32 times fewer bits than the continuous version. The quantized methods have reduced action space and therefore faster convergence; with sufficient training, the UL and DL rates for the quantized phase method are 8.14% and 2.45% better than the continuous phase method respectively. The RIS elements can be grouped to have similar phase-shifts to further reduce signaling, at the cost of reduced performance.

Introducing the Huber mechanism for differentially private low-rank matrix completion

Abstract: Performing low-rank matrix completion with sensitive user data calls for privacy-preserving approaches. In this work, we propose a novel noise addition mechanism for preserving differential privacy where the noise distribution is inspired by Huber loss, a well-known loss function in robust statistics. The proposed Huber mechanism is evaluated against existing differential privacy mechanisms while solving the matrix completion problem using the Alternating Least Squares approach. We also propose using the Iteratively Re-Weighted Least Squares algorithm to complete low-rank matrices and study the performance of different noise mechanisms in both synthetic and real datasets. We prove that the proposed mechanism achieves ǫ -differential privacy similar to the Laplace mechanism. Further-more, empirical results indicate that the Huber mechanism outperforms Laplacian and Gaussian in some cases and is comparable, otherwise.

A New Expression for the Product of Two $\kappa-\mu $ Shadowed Random Variables and its Application to Wireless Communication

Abstract: In this work, the product of two independent and non-identically distributed (i.n.i.d) κ − µ shadowed random variables is studied. We derive the series expression for the probability density function (PDF), cumulative distribution function (CDF), and moment generating function (MGF) of the product of two (i.n.i.d) κ − µ shadowed random variables. The derived formulation in this work is quite general as they incorporate most of the typically used fading channels. As an application example, outage probability (OP) has been derived for cascaded wireless systems and relay-assisted communications with a variable gain relay. Extensive Monte-Carlo simulations have also been carried out.

The robust way to stack and bag: the local Lipschitz way

Abstract: Recent research has established that the local Lipschitz constant of a neural network directly influences its adversarial robustness. We exploit this relationship to construct an ensemble of neural networks which not only improves the accuracy, but also provides increased adversarial robustness. The local Lipschitz constants for two different ensemble methods - bagging and stacking - are derived and the architectures best suited for ensuring adversarial robustness are deduced. The proposed ensemble architectures are tested on MNIST and CIFAR-10 datasets in the presence of white-box attacks, FGSM and PGD. The proposed architecture is found to be more robust than a) a single network and b) traditional ensemble methods.

Rotate the ReLU to implicitly sparsify deep networks

Abstract: In the era of Deep Neural Network based solutions for a variety of real-life tasks, having a compact and energy-efficient deployable model has become fairly important. Most of the existing deep architectures use Rectifier Linear Unit (ReLU) activation. In this paper, we propose a novel idea of rotating the ReLU activation to give one more degree of freedom to the architecture. We show that this activation wherein the rotation is learned via training results in the elimination of those parameters/filters in the network which are not important for the task. In other words, rotated ReLU seems to be doing implicit sparsification. The slopes of the rotated ReLU activations act as coarse feature extractors and unnecessary features can be eliminated before retraining. Our studies indicate that features always choose to pass through a lesser number of filters in architectures such as ResNet and its variants. Hence, by rotating the ReLU, the weights or the filters that are not necessary are automatically identified and can be dropped thus giving rise to significant savings in memory and computation. Furthermore, in some cases, we also notice that along with saving in memory and computation we also obtain improvement over the reported performance of the corresponding baseline work in the popular datasets such as MNIST, CIFAR-10, CIFAR-100, and SVHN.