Reflection Onto Convex Sets algorithm to address the PAPR problem

In the last decades, many solutions have been proposed to cope with high Peak-to-Average Power Ratio (PAPR) of OFDM communication systems. We propose here to address the high PAPR of signals whose spectrum´s amplitude respects a given mask. A versatile framework based on Set Theoretic Estimation is presented and opens doors to new algorithms as the Reflection Onto Convex Sets algorithm. The latter addresses the PAPR problem with a convergence time significantly shorter than previously used algorithms. Relying on our framework, we give insights on how the algorithms achieves this performance.