Low Rank Tensor Completion via Adaptive ADMM

We consider a novel algorithm, for the completion of partially observed low-rank tensors, as a generalization of matrix completion. The proposed low-rank tensor completion (TC) method builds on the conventional nuclear norm (NN) minimization-based low-rank TC paradigm, by leveraging the alternating direction method of multipliers (ADMM) optimization framework. To that extend the original NN minimization problem is reformulated into multiple subproblems, which are then solved iteratively via closed-form proximal operators, making use of over-relaxation and an adaptive penalty parameter update scheme, to further speed up convergence and improve the overall performance of the method. Simulation results demonstrate the superior performance of the new method in terms of normalized mean square error (NMSE), compared to the conventional state-of-the-art (SotA) techniques, including NN minimization approaches, as well as a mixture of the latter with a matrix factorization approach, while its convergence can be significantly improved by initializing the algorithm with the solution of the SotA.

Regularized Approximate Message Passing for Overloaded Discrete Linear Inversion

We propose regularized approximate message passing (RAMP), a low-complexity algorithm for discrete signal detection in overloaded multiple-input multiple-output (MIMO) systems where the number of transmit antennas exceeds the number of receive antennas. While the state-of-the-art (SotA) iterative discrete least squares (IDLS) framework achieves near-optimal discrete-aware performance, its iterative matrix inversions impose a prohibitive $\mathcal{O}(M^3)$ complexity. RAMP resolves this by deriving an adaptive, state-dependent scalar denoiser that enforces arbitrary discrete constellation constraints within the approximate message passing (AMP) framework, reducing per-iteration complexity to $\mathcal{O}(NM)$. A robust variant is further proposed by incorporating an $\ell_2$-norm penalty, analogous to a linear minimum mean squared error (LMMSE) estimator, to enhance noise resilience. Simulation results under uncorrelated Rayleigh fading demonstrate that both proposed algorithms closely track their exact IDLS counterparts while avoiding the catastrophic failure of standard AMP in the overloaded regime, achieving steep bit error rate (BER) waterfall curves at a fraction of the computational cost.

1-bit Quantized Continuous Aperture Arrays

Continuous aperture arrays (CAPAs) have emerged as a promising physical-layer paradigm for sixth generation (6G) systems, offering spatial degrees of freedom beyond those of conventional discrete antenna arrays. This paper investigates the interaction between the CAPA receive architecture and low-cost 1-bit analog-to-digital converters (ADCs), which impose a severe nonlinear distortion penalty in conventional discrete systems. For Rayleigh fading, we derive a moment matching approximation (MMA)-based closed-form symbol error probability (SEP) approximation based on Gamma moment-matching of the spatial eigenvalue distribution, and show that CAPAs incur a diversity-order penalty governed by Jensen's inequality on the mode eigenvalues. For line-of-sight (LoS) propagation, we prove that CAPA achieves exactly the unquantized additive white Gaussian noise (AWGN) performance bound under perfect spatial and phase alignment, completely eliminating the 1-bit penalty that forces discrete systems to double their antenna count. Monte Carlo simulations under Rayleigh, Rician, and LoS conditions validate all analytical results.

Discrete Aware Tensor Completion via Convexized $\ell_0$-Norm Approximation

We consider a novel algorithm, for the completion of partially observed low-rank tensors, where each entry of the tensor can be chosen from a discrete finite alphabet set, such as in common image processing problems, where the entries represent the RGB values. The proposed low-rank tensor completion (TC) method builds on the conventional nuclear norm (NN) minimization-based low-rank TC paradigm, through the addition of a discrete-aware regularizer, which enforces discreteness in the objective of the problem, by an $\ell_0$-norm regularizer that is approximated by a continuous and differentiable function normalized via fractional programming (FP) under a proximal gradient (PG) framework, in order to solve the proposed problem. Simulation results demonstrate the superior performance of the new method both in terms of normalized mean square error (NMSE) and convergence, compared to the conventional state of-the-art (SotA) techniques, including NN minimization approaches, as well as a mixture of the latter with a matrix factorization approach.

Blinding the Wiretapper: RIS-Enabled User Occultation in the ISAC Era

An undesirable consequence of the foreseeable proliferation of sophisticated integrated sensing and communications (ISAC) technologies is the enabling of spoofing, by malicious agents, of situational information (such as proximity, direction or location) of legitimate users of wireless systems. In order to mitigate this threat, we present a novel ISAC scheme that, aided by a reconfigurable intelligent surface (RIS), enables the occultation of the positions of user equipment (UE) from wiretappers, while maintaining both sensing and desired communication performance between the UEs and a legitimate base station (BS). To that end, we first formulate an RIS phase-shift optimization problem that jointly maximizes the sum-rate performance of the UEs (communication objective), while minimizing the projection of the wiretapper's effective channel onto the legitimate channel (hiding objective), thereby disrupting the attempts by a wiretapper of localizing the UEs. Then, in order to efficiently solve the resulting non-convex joint optimization problem, a novel manifold optimization algorithm is derived, whose effectiveness is validated by numerical results, which demonstrate that the proposed approach preserves legitimate ISAC performance while significantly degrading the wiretapper's sensing capability.

Quantum Manifold Optimization: A Design Framework for Future Communications Systems

Inspired by recent developments in various areas of science relevant to quantum computing, we introduce quantum manifold optimization (QMO) as a promising framework for solving constrained optimization problems in next-generation wireless communication systems. We begin by showing how classical wireless design problems - such as pilot design in cell-free (CF)-massive MIMO (mMIMO), beamformer optimization in gigantic multiple input multiple output (MIMO), and reconfigurable intelligent surface (RIS) phase tuning - naturally reside on structured manifolds like the Stiefel, Grassmannian, and oblique manifolds, with the latter novelly formulated in this work. Then, we demonstrate how these problems can be reformulated as trace-based quantum expectation values over variationally-encoded quantum states. While theoretical in scope, the work lays a foundation for a new class of quantum optimization algorithms with broad application to the design of future beyond-sixth-generation (B6G) systems.

Tone Reservation-Based PAPR Reduction Using Manifold Optimization for OFDM-ISAC Systems

We consider the peak-to-average power ratio (PAPR) reduction challenge of orthogonal frequency division multiplexing (OFDM) systems utilizing tone reservation (TR) under a sensing-enabling constraint, such that the signals placed in the reserved tones (RTs) can be exploited for Integrated Sensing and Communication (ISAC). To that end, the problem is first cast as an unconstrained manifold optimization problem, and then solved via an iterative projected gradient descent algorithm assisted by an approximation of the infinity norm. Simulation results show that the proposed method, while maintaining a level of PAPR reduction similar to state of the art (SotA), not only has lower computational complexity but also outperforms the alternatives in terms of sensing performance.

Optimized Tone Reservation for Opportunistic OFDM Communications and Sensing

We consider the problem of peak-to-average power ratio (PAPR) reduction in orthogonal frequency division multiplexing (OFDM) systems via optimized sparsification of tone reservation (TR). In particular, we propose a novel TR optimization method in which the minimum number of effectively used peak-reserved tones (PRTs) required to satisfy a prescribed PAPR level is found, leaving the remaining PRTs free to be opportunistically utilized by other functionalities, such as joint communication and sensing (JCAS), index modulation (IM), cognitive radio (CR) and others. The proposed method relies on an l0 norm regularization approach to penalize the number of PRTs, leading to a problem convexized via fractional programming (FP), whose solution is shown to ensure that the prescribed PAPR is achieved with high probability with a smaller number of PRTs than state of the art (SotA) methods. The contribution can be seen as a mechanism to enable the opportunistic integration of adjacent functionalities into existing OFDM-based systems.