Joint Transceiver Design Algorithms for Multiuser MISO Relay Systems with Energy Harvesting

In this paper, we investigate a multiuser relay system with simultaneous wireless information and power transfer. Assuming that both base station (BS) and relay station (RS) are equipped with multiple antennas, this work studies the joint transceiver design problem for the BS beamforming vectors, the RS amplify-and-forward transformation matrix and the power splitting (PS) ratios at the single-antenna receivers. Firstly, an iterative algorithm based on alternating optimization (AO) and with guaranteed convergence is proposed to successively optimize the transceiver coefficients. Secondly, a novel design scheme based on switched relaying (SR) is proposed that can significantly reduce the computational complexity and overhead of the AO based designs while maintaining a similar performance. In the proposed SR scheme, the RS is equipped with a codebook of permutation matrices. For each permutation matrix, a latent transceiver is designed which consists of BS beamforming vectors, optimally scaled RS permutation matrix and receiver PS ratios. For the given CSI, the optimal transceiver with the lowest total power consumption is selected for transmission. We propose a concave-convex procedure based and subgradient-type iterative algorithms for the non-robust and robust latent transceiver designs. Simulation results are presented to validate the effectiveness of all the proposed algorithms

Informed Non-convex Robust Principal Component Analysis with Features

We revisit the problem of robust principal component analysis with features acting as prior side information. To this aim, a novel, elegant, non-convex optimization approach is proposed to decompose a given observation matrix into a low-rank core and the corresponding sparse residual. Rigorous theoretical analysis of the proposed algorithm results in exact recovery guarantees with low computational complexity. Aptly designed synthetic experiments demonstrate that our method is the first to wholly harness the power of non-convexity over convexity in terms of both recoverability and speed. That is, the proposed non-convex approach is more accurate and faster compared to the best available algorithms for the problem under study. Two real-world applications, namely image classification and face denoising further exemplify the practical superiority of the proposed method

Rotated Spectral Principal Component Analysis (rsPCA) for Identifying Dynamical Modes of Variability in Climate Systems.

Spectral PCA (sPCA), in contrast to classical PCA, offers the advantage of identifying organized spatiotemporal patterns within specific frequency bands and extracting dynamical modes. However, the unavoidable trade-off between frequency resolution and robustness of the PCs leads to high sensitivity to noise and overfitting, which limits the interpretation of the sPCA results. We propose herein a simple nonparametric implementation of sPCA using the continuous analytic Morlet wavelet as a robust estimator of the cross-spectral matrices with good frequency resolution. To improve the interpretability of the results, especially when several modes of similar amplitude exist within the same frequency band, we propose a rotation of the complex-valued eigenvectors to optimize their spatial regularity (smoothness). The developed method, called rotated spectral PCA (rsPCA), is tested on synthetic data simulating propagating waves and shows impressive performance even with high levels of noise in the data. Applied to global historical geopotential height (GPH) and sea surface temperature (SST) daily time series, the method accurately captures patterns of atmospheric Rossby waves at high frequencies (3-60-day periods) in both GPH and SST and El Niño-Southern Oscillation (ENSO) at low frequencies (2-7-yr periodicity) in SST. At high frequencies the rsPCA successfully unmixes the identified waves, revealing spatially coherent patterns with robust propagation dynamics